Graph Technology - In plain English

By


Graph processing systems have become a prominent buzzword in computation world in recent years. Is this just a passing trend which is here today and would vanish tomorrow?

There is no harm in being skeptical. But with knowledge graphs recognized as a top emerging technology trend by industry expert Gartner, it's evident that graph technology is here to stay. So let's dive in and discover what makes graph technology special and why it's gaining momentum. 

What industry experts are saying about Graph Technology:

Knowledge graphs has been recognized by Gartner among the top 5 emerging technology trends, alongside IOT & Blockchain, that will blur the lines between humans and machines. I have included a snippet from Gartner's press release below. You can also find Gartner's official full press release here .

Snippet from Gartner's Newsroom Press Release 


An important note before we proceed further. If you do a simple google search about graphs, you would get all the bar and line graphs. But this is not what we'll be talking about here. When I say graph, please do not imagine this: 
Function Rules based on Graphs ( Read ) | Algebra | CK-12 Foundation


Instead you have to imagine this:


Why Graph systems are gaining popularity:

The world has witnessed an exponential growth in data volume in recent years. According to Forbes, we have generated more data in recent years than in the entire history of humanity. While Big Data analytics systems have helped process large volume, velocity and variety of data, the challenge remains when dealing with vast amount of interconnected data This is where graph systems steps in and offers a unique solution. 

The evolution of Graph Technology:

The history of graph theory dates back to 1736. But much like machine learning, which was invented in the 1950s and gained more popularity in recent years, graph technology has started gaining its share of recognition. Two key factors have contributed to this rise of both these technologies: the advancement in computational power of modern hardware and the emergence of distributed processing paradigms. These advancements have opened the door to solving complex problems that were previously unimaginable.

Why is there a need of Graph Processing Systems: 

What is that we cannot easily achieve with our current options, and why do we need graph databases? 
To answer this, let's consider a social network of friends like Facebook as an example. Such a network of connected friends looks like this:

Well, the above graph appears to be really complex and dense. Let me simplify this a bit, for us to imagine the relationships. Here is a simplified version of this network of friends:

 Here each connection between two individuals represent a friendship relation. 
Suppose we want to know all friends of friends of a person named Akshay. A relational database, when modelled appropriately, can also easily fetch this info. 

But the problem would arise when we are interested in friends of friends of friends of Akshay and even deeper depth of friendship, say 10-20 levels deep. 
To achieve this, traditional data processing systems would require join operations, which are complex to write and also expensive to compute.

So what Graph System offer differently?

Graph systems distinguish themselves primarily in how they store data. Relationships are treated as first-class citizens in graph systems. 
They inherently preserve and store the relationships between connected entities of data. And it is one of the key benefits, which no existing system provides, be it RDBMS or other existing data processing solution. Well, not comparing a rose with a lily, as relational databases and other data processing engines have their own set of use cases, which they are the best candidates for.

 Question - So how would Graph database make it easy to fetch 10-20 levels deep friendship relation?

 Answer - If we model our social network in a Graph system, with people as vertices and their friendship relation as edges, this computation would boil down to a simple and quick graph traversal. 

Wondering how? 




Two key benefits here:
  1. Relationships are first class citizen in graph storage, meaning each friendship relation is already automatically stored as an edge in the graph. No additional joins or expensive operations are required to compute the relationships. And this is the key to fast performance of graph systems for connected data. 
  2. Graph traversal using specialized graph query languages, such as Gremlin and Cypher, is much simple and concise, compared to the complex queries or code needed in non-graph systems.


Use Cases of Graph technology:

Following are the 4 top business use cases of Graph systems: 

1. Fraud Detection - Detect any fraudulent entity in your system, by analyzing its connection with other suspicious physical or human entity in the same system. 

2. Master Data Management - Achieve a 360-degree view of customers, by identity resolution of a person across different departments of organization.

3. Social Network Analysis - Explore associations between individuals in a social network, even at deep levels of relationship.

4. Real-time Recommendation System - Maintain a knowledge graph of customer preferences and purchase history, to make accurate recommendations.
All these use cases leverage relationships to achieve the desired goal.

Graph Technology: OLTP vs. OLAP

Every information extracted from a graph, requires a traversal of its vertices and edges. And there are two kinds of traversals supported by Graph solutions: OLTP and OLAP.

OLTP(Online Transaction Processing): This type of traversal starts from a specific point, such as retrieving all friends of friends of John Doe. The starting point is known for analysis.  

OLAP(Online Analytical Processing): OLAP traversals are suitable for bulk analytical operations, where the starting point is not a specific individual. Instead, the entire graph is traversed to gain insights, as in the case of finding all the individuals with ten or more friends. 
Apache Spark, with GraphX and GraphFrames, handles OLAP graph processing really well. 
Popular Graph Databases:

 Following are some of the Graph databases widely adopted by organizations:

 1. DataStax Enterprise Graph
2. Neo4j
3. AnzoGraph DB
4. OrientDB
5. TigerGraph
6. Amazon Neptune
7. ArangoDB
8. Janus Graph


Graph Query Programming Languages:

Following are five key programming languages for querying graphs:

1. Gremlin - A graph programming language which is a part of Apache Tinkerpop graph computing framework.

2. Cypher query language - A declarative graph query language offering SQL like programmatic access to property graphs.  

3. GraphQL - Developed by Facebook, it's a data manipulation and query language for APIs.

4. SPARQL - A query language for RDF databases, to query data stored in RDF format. It was developed by World Wide Web Consortium.

5. AQL(Arango DB Query Language) - A SQL-like language used in Arango DB for querying both documents and graphs.


In conclusion, we've now laid the foundation to understand the world of Graph Databases, processing engines and the rich offerings of graph technology. With this knowledge in hand, we've also explored various graph solutions and query languages that are at your disposal. 



In my next publication, I will go a bit deeper into the concepts and would model a graph to address a popular usecase i.e. fraud detection. 

Stay tuned, and thank you for taking the time to read this article. 
Big Data, Cloud(AWS), Graph and Machine Learning professional.

Comments

New comments are not allowed.

Popular posts from this blog

UPSERT in Hive(3 Step Process)

By
Image
In this post we'll learn an efficient 3 step process, for performing UPSERT in hive on a large size table containing entire history. Just for the audience not aware of UPSERT - It is a combination of UPDATE and INSERT. If on a table containing history data, we receive new data which needs to be inserted as well as some data which is an UPDATE to the existing data, then we have to perform an UPSERT operation to achieve this. Prerequisite  – The table containing history being very large in size should be partitioned, which is also a best practice for efficient data storage, when storing large volume of data in any Big Data warehouse. Business scenario  – Lets take an example of click stream data of a website, as gathered from different browsers of visitors who visited the website. The site_view_hist table contains the clicks and page impressions counts from different browsers and the table is partitioned on hit_date(the date on which the visitor hitted or visited the websi...
Read more

Parquet tools utility

By
Image
It is a well known fact, that parquet format is a binary format. And for humans, reading binary data is not as easy as opening a text file and understanding its contents. But no worries, today we'll learn how to read a parquet file . If you would like to understand all the internal details of a parquet file , you can please refer my previous article here . In this article I have tried to explain all the inner storage details of Parquet and answered most of the questions around its usage, efficiency and performance.                                                                                Parquet tools - As we know parquet is a binary format, we need an interpreter to translate its contents so that we can understand them. And this is what parquet-tools  utility project does...
Read more

Hive - Merging small files into bigger files.

By
Image
Since Hadoop's inception, we have learnt that it is good for processing small number of large files, instead of large number of small files. Part of the reason pertaining to this behavior is, its MapReduce Paradigm which works on splits of input data.  In our day to day data processing, there can be various situations where our processes can produce large number of small files. Assume a process generated output data of 300 MB, but this data is distributed in approximately 3000 files of 99 KB each. Today we'll learn how to merge such large number of small files into bigger files. Before that let us quickly understand the problems, such large number of small files can cause. Problems posed by large number of small files -   1.   I f we store the data of this table in GZIP format(3000 files each of 99KB), then a downstream process running a hive query(MapReduce job) on this data, would spin up 3000 mappers to process individual splits for each file, as the GZIP format ...
Read more

Parquet File format - Storage details

By
Image
Columnar storage has revolutionized Big data processing, since its inception.  Its power can be realized from the fact that Google Big Query, Hbase, Amazon Redshift, Azure SQL Data Warehouse and many more, all utilize columnar storage. As you are here today reading this article, it is obvious that you are curious to learn how Columnar storage internally works. Well, just stay tuned for next few minutes, as  I'll explain all the details of the  most popular columnar file format called Parquet.  We'll learn the details  by  actually opening  a parquet file and by  going deep, at the level of how things work under the hood at disc level.  We'll also learn why Parquet would save cost, when it is used as underlying file format with A WS services such as Athena . When to use Parquet format  -  Just check this less than 30 seconds conversation, going on between a Data Engineer(male) and a  BI Analyst(female) . When to us...
Read more

Skew Join Optimization in Hive

By
Image
Skew is a very common issue which most of the data engineers come across.  What is Skew - When in our data we have very large number of records associated with one(or more) particular key, then this data is said to be skewed on that key.  We'll understand this with a very simple example. Think about world's population data table, where each record is of one person and the number of records equals to total world population. As we all know China and India, each accounts for around 17-18% of world's population, hence such population table is referred to as skewed on keys country=China and country=India. If you focus on the following pie chart of world's population distribution by country, then this would make exact sense. Problem statement  - Assume we have a table which tracks the online visits to different online websites. In this table amazon.com  being very popular,  has 1 Billion rows whereas other not very popular sites ( www.abc.com , w...
Read more

Apache Spark - Sort Merge Join

By
Image
Apache Spark is a well known open source cluster computation system, for large scale data processing. If you are into Big Data and Machine Learning, Apache Spark may not need any introduction. Its capabilities include In-memory processing, Distributed SQL Analytics, Real Time stream processing, Graph processing, Machine Learning,  support for several programming languages  and many more.  " What happens under the hood, when we execute a Spark application? ".    thinking????? This is a very common question, which crops up in every Apache Spark user's mind. If you have the same question, I 'll answer this using Spark SQL by executing one of the most common data processing operation i.e. "Join". Spark being a vast technology, it is nearly impossible to cover all of Spark's details in a single article. And we all learn something new, every time we use a technology to solve a new challenge.  However, the details I'll cover here, should be enough to give...
Read more

Apache Spark - Explicit Broadcasting Optimization

By
Image
Join operation is an indispensable part of majority of Big Data Projects. If you are using Apache Spark for your Big Data processing and using join operation, in this article I'll explain a strategy to optimize joins. The technique I'll explain is how to explicitly broadcast a table, in any Spark join operation and convert the join operation to Broadcast Hash Join. Why Broadcasting - W hen we perform a join operation in Spark SQL, b roadcasting proves very efficient in reducing data shuffling and hence serialization and deserialization of data over the network, which happens during a Sort Merge Join operation. If you haven't read my previous article on Spark's Broadcast Hash join, I highly recommend you to first go through that. This would provide you most of the deeper details of Spark's Broadcast hash Join. You can please find it here :- Broadcast Hash Join - By Akshay Agarwal Business use case  -  To explain this optimization, let's take the business...
Read more

Spark Optimization - Bucketing

By
Image
Complex data computation is a part of every Big Data Project.  Do you have a business scenario requiring complex join on data having billions or trillions of values?  If you are using Apache Spark, stay tuned for next few minutes, as this article will address this expensive join problem, using Spark's optimization technique called Bucketing. Before reading this article, I recommend you to once go through my previous articles on Spark's Sort Merge Join and Broadcast Hash Join . They will set up your foundation for understanding bucketing technique. It is recommended but is not mandatory, as you would still be able to grasp the core concept. When to use Bucketing ?    For any business problem, where we need to perform a join on tables with very high cardinality on join column( I repeat very high ) in say millions, billions or even trillions and also this join needs to happen multiple times. Lets understand bucketing using the data of a hypothetical service ...
Read more

Fraud Detection - Using Graph Database

By
Image
Graph DBs have become a buzzword in recent years.  In addition to social networks and recommendation systems, fraud detection is a field where the value of graph technology cannot be understated.  In this article we'll learn how Graph technology can be used to detect fraud.  If you are new to Graph technology, and haven't read my previous publication Graph technology in plain english , I highly recommend to read that once. It will help you to understand the fundamentals of Graph technology and serve as a catalyst for your learning process.  Fraud detection According to the research published by Crowe in July 2019, global fraud losses equate to shocking US$5.127 trillion each year . Fraudsters commit monetary frauds almost every day.  What if such fraud can be detected at an early stage, through prior experience of  some common fraud patterns  or known fraudsters.  We'll look at how Graph can be used to identify one such link and how tedious it...
Read more

Apache Spark - Broadcast Hash Join

By
Image
In this technical article, we'll discuss about one of Apache Spark's efficient join technique called Broadcast Hash Join. I will explain in detail how this operation is implemented internally in Spark at DAG(Directed Acyclic Graph) level and also different phases of DAG. We'll also uncover the details of division of spark application into jobs and stages.  Data  -  To explain this join concept, I'll take customer data of a hypothetical online service provider organization with international presence. Different customers across the world using its services holds accounts with this company. Moreover the customers uses different devices to access this company's website. Hence to fetch the details of different  customers(business_accounts) and the corresponding device used by them, we'll use two datasets: Business Accounts data   -  Data consisting of details of the customer's business account, created with this service providing organizatio...
Read more