MongoDB : Games Data

Task 1: MongoDB : Game Data

1. Create a database named <> and a collection named <> and insert the above data.

2. What is Map-Reduce? Explain the working of map-reduce with an example

3. Write a reduce function that calculates the total score for each player with the publisher name and count the number of players in each team.

4. Count the number of players in Hays Wise.

5. Remove the player “Alpha” from Ape Escape.

6. Update player name “Jordan” to “Michael” and score to 300.

7. Show all the number of players with their publisher name.

8. Show total goals scored by each country name.

Task 2: Development of a graph database for a given dataset

Find “Task_2_PremierLeauge_2019.csv” file from the Moodle. The dataset contains
information about the English Premier League (EPL) matches. You are expected to
design and create a graph database to visualize the dataset and to answer the following

  1. Create a Data Model diagram for “Task_2_PremierLeauge_2019.csv” dataset.
  2. Create nodes and relationship according to the Data Model which you have created
    in question no 1.
  3. Show all the EPL team involved in the season.
  4. Count all the matches refereed by each referee.
  5. Who refereed the most matches?
  6. How many matches “Arsenal” won as the away team?
  7. Display all the matches that “Man United” lost.
  8. Display all matches that “Liverpool” won but were down in the first half.
    Find “Task 2 – Match Keywords.txt” file for the keywords used in the EPL matches.

Task 3:

“Column-oriented storage in a database system are more suitable for analytical
reporting than the row-oriented database.” Justify this statement with suitable


Task 1

Question 1

Insert into collection 1
Insert into collection 2
Insert into collection 3
Result in table
Result in JSON

Question 2

MapReduce is a programming framework that allows data to be distributed and processed parallelly on a large sets of data environment. MapReduce consists of two primary tasks, Map and Reduce.

But the overall process of MapReduce can be divided into 6 stages; Input, Input Splits, Mapping, Shuffling, Reducer and Final Output.

Map reduce chart

To further evaluate the stages of MapReduce with an example, the fig (6)’s breakdown as following:

Input: The initial stage of MapReduce is to gather inputs and store it into blocks of data as provided in one big cluster.

Input Splits: This stage splits every blocks of data and prepare for mapping.

Mapping: Mapping breaks down every unique set of data, in this case every unique set of words and group them together within the block.

Shuffling: Shuffling is responsible to group the similar data from all the other cluster of data and group them together.

Reducer: Reducer reduces the block sizes as unique data of the blocks is divided into key and value pair, key being the actual data and value being the frequency of similar data.

Final Output: Finally, the reduced blocks are clustered into one with each unique data with their frequency as final output of data.

Question 3

Map reduce function
Map reduce result

Question 4

Task 1 question 4 query and result

Question 5

Task 1 question 5 query and result

Question 6

Task 1 question 6 query and result

Question 7

Task 1 question 7 query and result

Question 8

Task 1 question 8 query and result

Task 2

Question 1

Arrow diagram of EPL

Question 2

Neo4j graph create query
Graph result

Question 3

Task 2 question 3 query
Task 2 question 3 result in text 1
Task 2 question 3 result in text 2

Question 4

Task 2 question 4 query
Task 2 question 4 result in table 1
Task 2 question 4 result in table 2
Task 2 question 4 result in table 3

Question 5

Task 2 question 5 query
Task 2 question 5 result in table

Question 6

Task 2 question 6 query and result

Question 7

Task 2 question 7 query and result

Question 8

Task 2 question 8 query and result

Task 3

“Column-oriented storage in a database system are more suitable for analytical reporting than the row-oriented database.”

Column oriented database stores data by systematically arranging data by column of field, maintaining all of the data integrated with a field adjacent to each other in memory of database. This arrangement of tables is an important factor in analytic query performance because of the drastic reduction of overall disk input and output requirements and ultimately reduces the amount of data needed to load from disk (What Is A Columnar Database? – AWS 2020).

For example, on how a normal table is stored in column-oriented database. Let’s take the following table as a sample.

Samsung S98991.2
Google Pixel 37991.5
Example table

Each column is divided into separate storage disk, in first storage only the values of “Item” is stored.

Storage 1
iPhoneSamsung S9Google Pixel 3
Column oriented data storage 1

On second storage only the values of price are stored.

Storage 2
Column oriented data storage 2

On third storage only the values of weight are stored.

Storage 3
Column oriented data storage 3

The difference in this storage pattern is what makes retrieval of column field for data analysis quick and effective. If analysis had to make for getting the sum of prices of items, the columnar database goes to the storage 2 where all prices are stored and retrieves the values out of it. This saves much processing time and memory because it does not have to go through all rows to get those values of prices.

Advantages of Column Oriented Databases

  • Fast at retrieving and comparing data of column values.
  • Quick aggregation on larger datasets.
  • Compresses data column wise reducing memory usage.

Disadvantages of Column Oriented Databases

  • Lacks efficiency for online transaction processing usage.
  • Can be comparatively show when queries involve only a few rows.


Kiran, R., 2020. Mapreduce Tutorial | Mapreduce Example In Apache Hadoop | Edureka. [online] Edureka. Available at: <> [Accessed 19 August 2020].What Is A Columnar Database? – AWS (2020) available from <> [19 August 2020]

Leave a Comment