Issue 116 Issue 115 Issue 108 Issue 102 Issue 100 Issue 96 Issue 86 Issue 66 Issue 65 Issue 64 Issue 63 Issue 62 Issue 61 Issue 60 Issue 59 Issue 58 Issue 57 Issue 56 Issue 55 Issue 54 Issue 53 Issue 52 Issue 51 Issue 50 Issue 49 Issue 48 Issue 47 Issue 46 Issue 45 Issue 44 Issue 43 Issue 42 Issue 41 Issue 40 Issue 39 Issue 38 Issue 37 Issue 36 Issue 35 Issue 34 Issue 33 Issue 32 Issue 31 Issue 30 Issue 29 Issue 28 Issue 27 Issue 26 Issue 25 Issue 24 Issue 23 Issue 22 Issue 21 Issue 20 Issue 19 Issue 18 Issue 17 Issue 16 Issue 15 Issue 14 Issue 13 Issue 12 Issue 11 Issue 10 Issue 9 Issue 8 Issue 7 Issue 6 Issue 5 Issue 4 Issue 3 Issue 2 Issue 1

▼ BROWSE ISSUES ▼

Home ▸
Issue 12 ▸
Hadoop (II)

Issue 12

Hadoop (II)

Radu Vunvulea
Solution Architect
@iQuest

PROGRAMMING

In the previous number we’ve discovered what the secret of Hadoop is when it needs to store hundreds of TB. Based on a simple master-slave architecture, Hadoop is a system that can very easily store and manipulate a big amount of data. Hadoop contains two types of nodes for storing data. The NameNode is the node that plays the role of master. It knows the name and locations of each file that Hadoop stores.