Back to marketplace

7. Big Data - Hadoop Ecosystem

No description yet. This curated deck is ready for daily study.

Total cards: 24•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (24)

#1
Front (Question)

DataNode function

Back (Answer)

Store data

#2
Front (Question)

NameNode function

Back (Answer)

• Store metadata 2. Know what DataNode each block is located

#3
Front (Question)

Qual era o volume de dados no mundo em 2013

Back (Answer)

4.4 x 10^21

#4
Front (Question)

Qual é o problema dos discos para processar grande volume de dados?

Back (Answer)

A velocidade de leitura de um disco de 1TB é de no máximo 100 MB/s

#5
Front (Question)

O que é Hive?

Back (Answer)

SQL que roda com dados no HDFS

#6
Front (Question)

What is Spark?

Back (Answer)

Processamento interativo na memória

#7
Front (Question)

Solr

Back (Answer)

Search de dados no HDFS

#8
Front (Question)

Qual é o primeiro passo do cientista de dados?

Back (Answer)

Definir bem a questão, o que busca responder com os dados.

#9
Front (Question)

Fases do MapReduce

Back (Answer)

• Map - filtra o que precisa 2. Reduce - junta os dados em um resumo

#10
Front (Question)

MapReduce Jobs (components)

Back (Answer)

Input Data + MapReduce Program + Config Info

#11
Front (Question)

O que são distributed filesystems?

Back (Answer)

Filesystems that manage the storage across a network of machines are called distributed filesystems.

#12
Front (Question)

Quais são os componentes em mente no desenho do HDFS?

Back (Answer)

• Very large files • Streaming data access • Commodity hardware

#13
Front (Question)

Em quais situações o HDFS não se encaixa bem?

Back (Answer)

• Low-latency data access 2. Lots of small files 3. Multiple writers, arbitrary file modifications

#14
Front (Question)

Qual é o tamanho padrão do “block” do HDFS?

Back (Answer)

128 MB

#15
Front (Question)

Para quantos servidores tipicamente é replicado um “block” de dados?

Back (Answer)

Três servidores

#16
Front (Question)

Quais são as medidas de proteção do NameNode?

Back (Answer)

• Realizar backup dos arquivos de Metadata do NameNode. • Rodar um “secondary NameNode”. • Instalar no modelo “Active/Standby” disponível a partir da versão 2.

#17
Front (Question)

Quais são as etapas de inicialização do NameNode?

Back (Answer)

(i) loaded its namespace image into memory (ii) replayed its edit log, and (iii) received enough block reports from the datanodes to leave safe mode.

#18
Front (Question)

Quanto tempo leva para o NameNode inicializar em um cluster grande?

Back (Answer)

On large clusters with many files and blocks, the time it takes for a namenode to start from cold can be 30 minutes or more.

#19
Front (Question)

Quem é o responsável por gerenciar o processo de failover entre o NameNode ativo e passivo?

Back (Answer)

Failover controller. The transition from the active namenode to the standby is managed by a new entity in the system called the failover controller. There are various failover controllers, but the default implementation uses ZooKeeper to ensure that only one namenode is active. Each namenode runs a lightweight failover controller process whose job it is to monitor its namenode for failures (using a simple heartbeating mechanism) and trigger a failover should a namenode fail.

#20
Front (Question)

Qual propriedade define a quantidade de DataNodes que um “block” é replicado?

Back (Answer)

dfs.replication = x

#21
Front (Question)

Qual o comando para conseguir ajuda dos comandos do HDFS?

Back (Answer)

hadoop fs -help

#22
Front (Question)

Qual a propriedade para habilitar a segurança do HDFS?

Back (Answer)

dfs.permissions.enabled

#23
Front (Question)

Como funciona o processo de abertura de um arquivo no HDFS?

Back (Answer)

The client opens the file it wishes to read by calling open() on the FileSystem object, which for HDFS is an instance of DistributedFileSystem (step 1 in Figure 3-2). DistributedFileSystem calls the namenode, using remote procedure calls (RPCs), to determine the locations of the first few blocks in the file (step 2). For each block, the namenode returns the addresses of the datanodes that have a copy of that block. Furthermore, the datanodes are sorted according to their proximity to the client (according to the topology of the cluster’s network; see Network Topology and Hadoop). If the client is itself a datanode (in the case of a MapReduce task, for instance), the client will read from the local datanode if that datanode hosts a copy of the block (see also Figure 2-2 and Short-circuit local reads).

#24
Front (Question)

What does it mean for two nodes in a local network to be “close” to each other?

Back (Answer)

Hadoop takes a simple approach in which the network is represented as a tree and the distance between two nodes is the sum of their distances to their closest common ancestor. Levels in the tree are not predefined, but it is common to have levels that correspond to the data center, the rack, and the node that a process is running on.