Big Data, Data Mining and Data Analytics: Exam Notes
Notes on big data and its Vs, Hadoop and HDFS, data warehouses, OLTP and OLAP, data mining tasks and the four kinds of analytics, for competitive exams.
By GK24 Editorial Team· Published · 4 min read

Every card swipe, toll payment, train booking and mobile recharge leaves a record behind, and the volume of such records has grown far beyond what a single computer or an ordinary database can handle. Big data is the name given to data of that size and speed, data mining is the work of finding useful patterns hidden inside it, and data analytics is the wider craft of turning those patterns into decisions. Banking, SSC, Railway and State papers now carry two or three questions from this chapter, almost always on the defining words rather than on programming.
What makes data big: the Vs
The three Vs were named by Doug Laney in 2001 and are still the standard answer. Volume is the sheer quantity, measured in terabytes and petabytes rather than megabytes. Velocity is the speed at which the data arrives and must be processed, as in a payment gateway that clears thousands of transactions a second. Variety is the mixture of forms: structured rows in a table, semi-structured files such as XML and JSON, and unstructured text, images, audio and video. Two more Vs were added later and complete the usual list of five: Veracity, meaning how trustworthy and clean the data is, and Value, meaning whether anything useful can be got out of it at all.
| Unit | Equal to |
|---|---|
| Kilobyte (KB) | 1,024 bytes |
| Megabyte (MB) | 1,024 KB |
| Gigabyte (GB) | 1,024 MB |
| Terabyte (TB) | 1,024 GB |
| Petabyte (PB) | 1,024 TB |
| Exabyte (EB) | 1,024 PB |
| Zettabyte (ZB) | 1,024 EB |
| Yottabyte (YB) | 1,024 ZB |
Hadoop and the tools of big data
Apache Hadoop is the open source framework that made big data practical. It was built by Doug Cutting and Mike Cafarella, is written mainly in Java, and takes its name from a toy elephant. Its idea is simple: instead of one huge machine, use a cluster of ordinary ones, break a file into blocks, keep several copies of each block on different machines, and send the computation to the machine that already holds the data. Its three core parts are the Hadoop Distributed File System or HDFS, which stores the blocks, MapReduce, which processes them in a map stage followed by a reduce stage, and YARN, which allots resources in the cluster. In the current versions the default HDFS block size is 128 megabytes. Around this core sit Hive, which lets a user query with SQL-like statements, Pig with its own Pig Latin language, the HBase database, Sqoop and Flume for moving data in, and Zookeeper for coordination. Apache Spark, which keeps data in memory, is much faster than MapReduce for repeated passes. Where tables will not do, NoSQL databases are used: MongoDB stores documents, Cassandra stores wide columns, Redis stores key-value pairs and Neo4j stores graphs.
Data warehouse, data mart and data lake
A data warehouse is a central store built for analysis rather than for daily work. Bill Inmon's classic definition calls it subject-oriented, integrated, time-variant and non-volatile: it is organised around subjects such as sales, it merges data from many systems, it keeps history, and old records are not overwritten. Data reaches it through ETL, that is Extract, Transform and Load. A data mart is a small warehouse serving one department, while a data lake holds raw data in its original form until someone needs it. The day-to-day system that records transactions is called OLTP, On-Line Transaction Processing: many small reads and writes, answered at once, always current. The analytical system built on the warehouse is OLAP, On-Line Analytical Processing: fewer but much heavier queries over a data cube, which the user can roll up, drill down, slice and dice.
Data mining and the kinds of analytics
Data mining is one step, the pattern-finding step, in the larger process called Knowledge Discovery in Databases or KDD, which also includes selection, cleaning, transformation and interpretation. Its standard tasks are classification, which puts a record into a known class, clustering, which groups similar records without knowing the classes in advance, regression, which predicts a number, association rule mining, which finds items bought together and is the basis of market basket analysis, and outlier detection, which is how banks flag a suspicious transaction. The Apriori algorithm is the textbook method for association rules; k-means is the textbook method for clustering; decision trees, naive Bayes and k-nearest neighbour are used for classification. Analytics itself is graded into four levels: descriptive analytics says what happened, diagnostic analytics says why it happened, predictive analytics says what is likely to happen next, and prescriptive analytics says what should therefore be done. R, Python, SAS, Tableau and Power BI are the tools named most often in question papers.
Exam Point of View
Questions from this chapter are almost all definitional. Learn the three Vs and the five Vs, because a question asking which option is not a V of big data appears every year. Learn the expansions: HDFS, YARN, ETL, OLTP, OLAP, KDD, NoSQL. Keep clear which name goes with which job: HDFS stores, MapReduce processes, YARN allots, Hive gives a SQL-like query language, Pig uses Pig Latin, Spark works in memory. The pair OLTP and OLAP is a favourite, as is the pair data warehouse and data mining, where the warehouse stores and the mining searches. On the analytics side, remember that predictive answers what will happen and prescriptive answers what should be done. Storage units from kilobyte up to yottabyte are asked in order, and 1 PB equal to 1,024 TB is the single most common numerical question.
Important Facts
| Three Vs | Volume, Velocity, Variety; named by Doug Laney in 2001 |
|---|---|
| Five Vs | The three Vs plus Veracity and Value |
| Hadoop creators | Doug Cutting and Mike Cafarella; an Apache project written mainly in Java |
| Hadoop core | HDFS (storage), MapReduce (processing), YARN (resource management) |
| HDFS block size | 128 MB by default in current versions |
| SQL-like tool on Hadoop | Apache Hive; Pig uses the Pig Latin language |
| In-memory engine | Apache Spark, faster than MapReduce for repeated passes |
| Data warehouse definition | Subject-oriented, integrated, time-variant, non-volatile (Bill Inmon) |
| ETL | Extract, Transform, Load |
| OLTP and OLAP | Transaction processing against analytical processing over a data cube |
| KDD | Knowledge Discovery in Databases; data mining is its pattern-finding step |
| Association rule algorithm | Apriori, used for market basket analysis |
| Clustering algorithm | k-means, an unsupervised method |
| Four kinds of analytics | Descriptive, diagnostic, predictive, prescriptive |
| NoSQL examples | MongoDB (document), Cassandra (column), Redis (key-value), Neo4j (graph) |
| Storage ladder | KB, MB, GB, TB, PB, EB, ZB, YB, each 1,024 times the one before |
Practice MCQs on this topic
A central repository of information that can be analyzed to make more informed decisions is known as:
- A.Data mining
- B.Data storing
- C.Data sorting
- D.Data warehouse
Show answer
A data warehouse is exactly that, a central store into which data from many operational systems is extracted, cleaned and loaded so that it can be analysed for decision making.
Read the full explanation →Which of the following statement(s) is/are correct regarding On-Line Transaction Processing (OLTP)? I. Responses to the user inquiry are immediate. II. The associated cost is economical with efficient utilization of resources. III. The database is always up-to-date.
- A.Only II
- B.I and III
- C.I and II
- D.Only III
Show answer
On-Line Transaction Processing is the mode in which a bank counter, a railway booking window or a payment gateway works: each transaction is processed the moment it is entered, so the response to the user is immediate, and every committed transaction is written at once, so the database always reflects…
Read the full explanation →Which of the following is NOT one of the three Vs of big data?
- A.Volume
- B.Velocity
- C.Variety
- D.Virtualisation
Show answer
Virtualisation is the technique of running several logical machines on one physical machine and belongs to the chapter on cloud computing, not to the definition of big data.
Read the full explanation →In Hadoop, which component is responsible for storing data across the machines of a cluster?
- A.MapReduce
- B.HDFS
- C.YARN
- D.Hive
Show answer
It splits a large file into fixed-size blocks, 128 megabytes by default in current versions, scatters those blocks over the machines of the cluster and keeps more than one copy of each block so that the failure of a machine does not lose data.
Read the full explanation →Data mining is best described as which step of the knowledge discovery process?
- A.The collection of raw data from sensors
- B.The step that finds patterns in prepared data
- C.The backing up of a database
- D.The printing of a management report
Show answer
In the process called Knowledge Discovery in Databases, or KDD, the stages run from selection of the relevant data, through cleaning and preprocessing, to transformation, then data mining, and finally interpretation and evaluation of what was found.
Read the full explanation →Which algorithm is most closely associated with association rule mining and market basket analysis?
- A.Apriori
- B.k-means
- C.Dijkstra
- D.Quicksort
Show answer
The Apriori algorithm first finds the sets of items that appear together often enough to pass a support threshold, using the rule that any subset of a frequent set must itself be frequent, and then turns those frequent sets into rules measured by confidence.
Read the full explanation →One petabyte is equal to how many terabytes?
- A.64
- B.128
- C.1,024
- D.1,048,576
Show answer
Storage units climb in powers of two, each unit being 1,024 times the one below it, so 1,024 bytes make a kilobyte, 1,024 kilobytes a megabyte, 1,024 megabytes a gigabyte, 1,024 gigabytes a terabyte and 1,024 terabytes a petabyte.
Read the full explanation →Which kind of analytics answers the question of what is likely to happen in the future?
- A.Descriptive analytics
- B.Diagnostic analytics
- C.Predictive analytics
- D.Prescriptive analytics
Show answer
It uses historical data with statistical models and machine learning to estimate what will probably happen next, such as which loan accounts are likely to slip into default or how much electricity a city will draw next summer.
Read the full explanation →In the context of a data warehouse, ETL stands for:
- A.Encrypt, Transfer, Link
- B.Extract, Transform, Load
- C.Enter, Test, Launch
- D.Evaluate, Train, Learn
Show answer
ETL names the three steps through which data enters a warehouse: it is extracted from the operational systems that produced it, transformed so that formats, units, codes and duplicates are reconciled into one consistent shape, and then loaded into the warehouse tables.
Read the full explanation →Which of the following is an unsupervised data mining technique?
- A.Classification using a decision tree
- B.Clustering using k-means
- C.Linear regression
- D.Naive Bayes classification
Show answer
Clustering is unsupervised because the data carries no labels: the algorithm itself groups similar records, k-means doing so by placing k centres and moving them until each record sits with its nearest centre.
Read the full explanation →Which of the following is a NoSQL database?
- A.MongoDB
- B.Oracle
- C.MySQL
- D.Microsoft Access
Show answer
NoSQL databases drop the fixed table and row structure so that they can hold large and irregular data and spread it over many machines, and MongoDB is the best known document store, keeping records as documents in a format close to JSON.
Read the full explanation →Which tool of the Hadoop ecosystem allows a user to query data with SQL-like statements?
- A.Sqoop
- B.Hive
- C.Flume
- D.Zookeeper
Show answer
Apache Hive puts a table-like view over files stored in HDFS and lets an analyst write queries in HiveQL, a language close to SQL, which Hive then turns into jobs that run on the cluster, so that no Java programming is needed.
Read the full explanation →Frequently Asked Questions
What are the three Vs of big data?
Volume, Velocity and Variety. Volume is the quantity of data, velocity is the speed at which it arrives and must be handled, and variety is the mixture of structured, semi-structured and unstructured forms. Doug Laney described them in 2001, and later writers added Veracity and Value to make the familiar five Vs.
What is the difference between a data warehouse and data mining?
A data warehouse is a place, a central store of cleaned historical data organised for analysis. Data mining is an activity, the search for patterns such as groups, associations and anomalies inside stored data. The warehouse holds the data, the mining looks through it, and a question that asks for a central repository of information wants the warehouse.
What is the difference between OLTP and OLAP?
OLTP, On-Line Transaction Processing, runs the daily work: many small reads and writes, instant responses, and a database that is always up to date, as in a bank counter or a ticket window. OLAP, On-Line Analytical Processing, answers few but very heavy analytical queries over historical data arranged as a cube, which can be rolled up, drilled down, sliced and diced.
What are the main components of Hadoop?
Three: the Hadoop Distributed File System or HDFS, which splits a file into blocks and keeps replicas of each block on different machines; MapReduce, which processes the data in a map stage and then a reduce stage; and YARN, Yet Another Resource Negotiator, which allots processing resources in the cluster.
What is market basket analysis?
It is the use of association rule mining on sales records to find which items customers buy together, so that a shop can place them side by side or offer them as a bundle. The classic algorithm for it is Apriori, which first finds the sets of items that occur often enough and then turns those sets into rules.
What is the difference between predictive and prescriptive analytics?
Predictive analytics uses past data to say what is likely to happen next, for example which customers will probably default. Prescriptive analytics goes one step further and recommends the action to take, for example which of those customers to call first and what offer to make, usually with the help of optimisation.
Sources
- HDFS Architecture, Apache Hadoop Documentation — The Apache Software Foundation
- Computer Science (Class XI), Database Concepts — NCERT
- Informatics Practices (Class XII), Data Handling using Pandas — NCERT





