Demystifying Graph Databases: Analysis and Taxonomy of Data Organization, System Designs, and Graph Queries

Abstract

Graph processing has become an important part of multiple areas of computer science, such as machine learning, computational sciences, medical applications, social network analysis, and many others. Numerous graphs such as web or social networks may contain up to trillions of edges. Often, these graphs are also dynamic (their structure changes over time) and have domain-specific rich data associated with vertices and edges. Graph database systems such as Neo4j enable storing, processing, and analyzing such large, evolving, and rich datasets. Due to the sheer size of such datasets, combined with the irregular nature of graph processing, these systems face unique design challenges. To facilitate the understanding of this emerging domain, we present the first survey and taxonomy of graph database systems. We focus on identifying and analyzing fundamental categories of these systems (e.g., triple stores, tuple stores, native graph database systems, or object-oriented systems), the associated graph models (e.g., RDF or Labeled Property Graph), data organization techniques (e.g., storing graph data in indexing structures or dividing data into records), and different aspects of data distribution and query execution (e.g., support for sharding and ACID). 45 graph database systems are presented and compared, including Neo4j, OrientDB, or Virtuoso. We outline graph database queries and relationships with associated domains (NoSQL stores, graph streaming, and dynamic graph algorithms). Finally, we describe research and engineering challenges to outline the future of graph databases.

Towards Million-Server Network Simulations on Just a Laptop

“…An important direction of future work is also considering more realistic large-scale distributed workloads (e.g., using traces), such as different Remote Direct Memory Access based applications [12,15,32,56], deep learning training and inference [5,6], communication-intense linear algebra kernels [46], or irregular processing [16][17][18]58].…”

A logical framework with a graph meta-language

“…While graphs seen in algorithms and data structures courses are usually a simple pair of sets for vertices and edges (which are seen as (un-)ordered pairs of vertices), labeled property graphs let vertices and edges carry extra information that is useful in practice even if extraneous for most mathematical modeling. 3 We give here the abstract definition of the labeled property graph model following [3, §2.1], but [1, §2] gives similar definitions. [22, §4] gives a category theory-inspired definition similar in spirit to the one given here.…”

SeBS: A Serverless Benchmark Suite for Function-as-a-Service Computing

“…MST is used in many analytics and engineering problems, and represents graph optimization problems [30,54,82]. All three have been extensively research in a past decade [25,28,29,33,35,38,55,88].…”