diff --git a/404.html b/404.html index c3f4c28..e0495e5 100644 --- a/404.html +++ b/404.html @@ -529,7 +529,7 @@
  • - + Overview of Big Data
    • @@ -541,7 +541,7 @@
  • - + Usage of Big Data techniques
    • @@ -565,7 +565,7 @@
  • - + Architecture of Hadoop
    • diff --git a/CONTRIBUTING/index.html b/CONTRIBUTING/index.html index 73b1d44..8968f68 100644 --- a/CONTRIBUTING/index.html +++ b/CONTRIBUTING/index.html @@ -529,7 +529,7 @@
  • - + Overview of Big Data
    • @@ -541,7 +541,7 @@
  • - + Usage of Big Data techniques
    • @@ -565,7 +565,7 @@
  • - + Architecture of Hadoop
    • diff --git a/big_data/evolution/index.html b/big_data/evolution/index.html index 01aea2c..3ef0e2d 100644 --- a/big_data/evolution/index.html +++ b/big_data/evolution/index.html @@ -538,7 +538,7 @@
  • - + Overview of Big Data
    • @@ -550,7 +550,7 @@
  • - + Usage of Big Data techniques
    • @@ -583,7 +583,7 @@
  • - + Architecture of Hadoop
    • @@ -823,6 +823,96 @@

    Evolution of Hadoop

    Evolution of hadoop

    +

    Architecture of Hadoop

    +
      +
    1. +

      HDFS

      +
        +
      1. The Hadoop Distributed File System (HDFS) is a distributed file system designed to run on commodity hardware. It has many similarities with existing distributed file systems. However, the differences from other distributed file systems are significant.
        2. +
      2. HDFS is highly fault-tolerant and is designed to be deployed on low-cost hardware. HDFS provides high throughput access to application data and is suitable for applications that have large data sets.
        3. +
      3. HDFS is part of the Apache Hadoop Core project.
        4. +
      +

      HDFS Architecture

      +
        +
      1. NameNode: is the arbitrator and central repository of file namespace in the cluster. The NameNode executes the operations such as opening, closing, and renaming files and directories.
        2. +
      2. DataNode: manages the storage attached to the node on which it runs. It is responsible for serving all the read and write requests. It performs operations on instructions on NameNode such as creation, deletion, and replications of blocks.
        3. +
      3. Client: Responsible for getting the required metadata from the namenode and then communicating with the datanodes for reads and writes.


        4. +
      +
      2. +
    2. +

      YARN

      +
        +
      1. YARN stands for “Yet Another Resource Negotiator“. It was introduced in Hadoop 2.0 to remove the bottleneck on Job Tracker which was present in Hadoop 1.0. YARN was described as a “Redesigned Resource Manager” at the time of its launching, but it has now evolved to be known as a large-scale distributed operating system used for Big Data processing.
        2. +
      2. The main components of YARN architecture include:
        3. +
      +

      YARN Architecture

      +
        +
      1. Client: It submits map-reduce(MR) jobs to the resource manager.
        2. +
      2. Resource Manager: It is the master daemon of YARN and is responsible for resource assignment and management among all the applications. Whenever it receives a processing request, it forwards it to the corresponding node manager and allocates resources for the completion of the request accordingly. It has two major components:
        3. +
      3. Scheduler: It performs scheduling based on the allocated application and available resources. It is a pure scheduler, which means that it does not perform other tasks such as monitoring or tracking and does not guarantee a restart if a task fails. The YARN scheduler supports plugins such as Capacity Scheduler and Fair Scheduler to partition the cluster resources.
        4. +
      4. Application manager: It is responsible for accepting the application and negotiating the first container from the resource manager. It also restarts the Application Manager container if a task fails.
        5. +
      5. Node Manager: It takes care of individual nodes on the Hadoop cluster and manages application and workflow and that particular node. Its primary job is to keep-up with the Node Manager. It monitors resource usage, performs log management and also kills a container based on directions from the resource manager. It is also responsible for creating the container process and starting it on the request of the Application master.
        6. +
      6. Application Master: An application is a single job submitted to a framework. The application manager is responsible for negotiating resources with the resource manager, tracking the status and monitoring progress of a single application. The application master requests the container from the node manager by sending a Container Launch Context(CLC) which includes everything an application needs to run. Once the application is started, it sends the health report to the resource manager from time-to-time.
        7. +
      7. Container: It is a collection of physical resources such as RAM, CPU cores and disk on a single node. The containers are invoked by Container Launch Context(CLC) which is a record that contains information such as environment variables, security tokens, dependencies etc.

        8. +
      +
      3. +
    +

    MapReduce framework

    +

    MapReduce Framework

    +
      +
    1. The term MapReduce represents two separate and distinct tasks Hadoop programs perform-Map Job and Reduce Job. Map jobs take data sets as input and process them to produce key value pairs. Reduce job takes the output of the Map job i.e. the key value pairs and aggregates them to produce desired results.
      2. +
    2. Hadoop MapReduce (Hadoop Map/Reduce) is a software framework for distributed processing of large data sets on computing clusters. Mapreduce helps to split the input data set into a number of parts and run a program on all data parts parallel at once.
      3. +
    3. Please find the below Word count example demonstrating the usage of MapReduce framework:
      4. +
    +

    Word Count Example +

    +

    Other tooling around hadoop

    +
      +
    1. Hive
        +
      1. Uses a language called HQL which is very SQL like. Gives non-programmers the ability to query and analyze data in Hadoop. Is basically an abstraction layer on top of map-reduce.
        2. +
      2. Ex. HQL query:
          +
        1. SELECT pet.name, comment FROM pet JOIN event ON (pet.name = event.name);
          2. +
        +
        3. +
      3. In mysql:
          +
        1. SELECT pet.name, comment FROM pet, event WHERE pet.name = event.name;
          2. +
        +
        4. +
      +
      2. +
    2. +

      Pig

      +
        +
      1. Uses a scripting language called Pig Latin, which is more workflow driven. Don't need to be an expert Java programmer but need a few coding skills. Is also an abstraction layer on top of map-reduce.
        2. +
      2. Here is a quick question for you: +What is the output of running the pig queries in the right column against the data present in the left column in the below image?
        3. +
      +

      Pig Example

      +

      Output: +mysql +7,Komal,Nayak,24,9848022334,trivendram +8,Bharathi,Nambiayar,24,9848022333,Chennai +5,Trupthi,Mohanthy,23,9848022336,Bhuwaneshwar +6,Archana,Mishra,23,9848022335,Chennai +3. Spark +1. Spark provides primitives for in-memory cluster computing that allows user programs to load data into a cluster’s memory and query it repeatedly, making it well suited to machine learning algorithms. +4. Presto +1. Presto is a high performance, distributed SQL query engine for Big Data. +2. Its architecture allows users to query a variety of data sources such as Hadoop, AWS S3, Alluxio, MySQL, Cassandra, Kafka, and MongoDB. +3. Example presto query: + mysql + use studentDB; + show tables; + SELECT roll_no, name FROM studentDB.studentDetails where section=’A’ limit 5; +

      +
      3. +
    +

    Data Serialisation and storage

    +
      +
    1. In order to transport the data over the network or to store on some persistent storage, we use the process of translating data structures or objects state into binary or textual form. We call this process serialization..
      2. +
    2. Avro data is stored in a container file (a .avro file) and its schema (the .avsc file) is stored with the data file.
      3. +
    3. Apache Hive provides support to store a table as Avro and can also query data in this serialisation format.
      4. +
    @@ -841,7 +931,7 @@
    -
  • + Overview of Big Data
    • @@ -622,7 +622,7 @@
  • - + Usage of Big Data techniques
    • @@ -646,7 +646,7 @@
  • - + Architecture of Hadoop
    • @@ -946,23 +946,56 @@

    Course Content

    Table of Contents

      -
    1. Overview of Big Data
      2. -
    2. Usage of Big Data techniques
      3. +
    3. Overview of Big Data
      4. +
    4. Usage of Big Data techniques
    5. Evolution of Hadoop
      6. -
    6. Architecture of hadoop
        +
      1. Architecture of hadoop
        1. HDFS
        2. Yarn
        2. -
      2. MapReduce framework
        3. -
      3. Other tooling around hadoop
          +
        1. MapReduce framework
          2. +
        2. Other tooling around hadoop
          1. Hive
          2. Pig
          3. Spark
          4. Presto
          3. -
        3. Data Serialisation and storage
          4. +
        4. Data Serialisation and storage
          5. +
        +

        Overview of Big Data

        +
          +
        1. Big Data is a collection of large datasets that cannot be processed using traditional computing techniques. It is not a single technique or a tool, rather it has become a complete subject, which involves various tools, techniques and frameworks.
          2. +
        2. Big Data could consist of
            +
          1. Structured data
            2. +
          2. Unstructured data
            3. +
          3. Semi-structured data
            4. +
          +
          3. +
        3. Characteristics of Big Data:
            +
          1. Volume
            2. +
          2. Variety
            3. +
          3. Velocity
            4. +
          4. Variability
            5. +
          +
          4. +
        4. Examples of Big Data generation include stock exchanges, social media sites, jet engines, etc.
          5. +
        +

        Usage of Big Data Techniques

        +
          +
        1. Take the example of the traffic lights problem.
            +
          1. There are more than 300,000 traffic lights in the US as of 2018.
            2. +
          2. Let us assume that we placed a device on each of them to collect metrics and send it to a central metrics collection system.
            3. +
          3. If each of the IOT devices sends 10 events per minute, we have 300000x10x60x24 = 432x10^7 events per day.
            4. +
          4. How would you go about processing that and telling me how many of the signals were “green” at 10:45 am on a particular day?
            5. +
          +
          2. +
        2. Consider the next example on Unified Payments Interface (UPI) transactions:
            +
          1. We had about 1.15 billion UPI transactions in the month of October, 2019 in India.
            2. +
          2. If we try to extrapolate this data to about a year and try to find out some common payments that were happening through a particular UPI ID, how do you suggest we go about that?
            3. +
          +
        @@ -997,13 +1030,13 @@ -
      4. + Overview of Big Data
        5. @@ -550,7 +550,7 @@
      5. - + Usage of Big Data techniques
        6. @@ -574,7 +574,7 @@
      6. - + Architecture of Hadoop
        7. @@ -916,7 +916,7 @@
    diff --git a/big_data/overview/index.html b/databases_nosql/further_reading/index.html similarity index 85% rename from big_data/overview/index.html rename to databases_nosql/further_reading/index.html index b59c217..abc30f2 100644 --- a/big_data/overview/index.html +++ b/databases_nosql/further_reading/index.html @@ -14,7 +14,7 @@ - Overview of Big Data - SchoolOfSRE + Further reading: - SchoolOfSRE @@ -57,7 +57,7 @@
    - + Skip to content @@ -86,7 +86,7 @@ - Overview of Big Data + Further reading:
    @@ -480,12 +480,10 @@ - - -
  • +
  • - +
  • +
  • - +
  • - + Introduction
    • @@ -536,20 +532,11 @@ - - -
  • - - - - - - - +
  • + Overview of Big Data -
    • @@ -559,7 +546,7 @@
  • - + Usage of Big Data techniques
    • @@ -571,7 +558,7 @@
  • - + Evolution of Hadoop
    • @@ -583,7 +570,7 @@
  • - + Architecture of Hadoop
    • @@ -595,7 +582,7 @@
  • - + Tasks and conclusion
    • @@ -821,24 +808,19 @@ -

    Overview of Big Data

    -
      -
    1. Big Data is a collection of large datasets that cannot be processed using traditional computing techniques. It is not a single technique or a tool, rather it has become a complete subject, which involves various tools, techniques and frameworks.
      2. -
    2. Big Data could consist of
        -
      1. Structured data
        2. -
      2. Unstructured data
        3. -
      3. Semi-structured data
        4. -
      -
      3. -
    3. Characteristics of Big Data:
        -
      1. Volume
        2. -
      2. Variety
        3. -
      3. Velocity
        4. -
      4. Variability
        5. -
      -
      4. -
    4. Examples of Big Data generation include stock exchanges, social media sites, jet engines, etc.
      5. -
    +

    Further reading:

    +

    NoSQL:

    +

    https://hostingdata.co.uk/nosql-database/

    +

    https://www.mongodb.com/nosql-explained

    +

    https://www.mongodb.com/nosql-explained/nosql-vs-sql

    +

    Cap Theorem

    +

    http://www.julianbrowne.com/article/brewers-cap-theorem

    +

    Scalability

    +

    http://www.slideshare.net/jboner/scalability-availability-stability-patterns

    +

    Eventual Consistency

    +

    https://www.allthingsdistributed.com/2008/12/eventually_consistent.html

    +

    https://www.toptal.com/big-data/consistent-hashing

    +

    https://web.stanford.edu/class/cs244/papers/chord_TON_2003.pdf

    @@ -854,41 +836,6 @@