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

Author:

Besta Maciej1ORCID,Gerstenberger Robert1ORCID,Peter Emanuel1ORCID,Fischer Marc2ORCID,Podstawski Michał3ORCID,Barthels Claude1ORCID,Alonso Gustavo1ORCID,Hoefler Torsten1ORCID

Affiliation:

1. Department of Computer Science, ETH Zurich, Switzerland

2. PRODYNA (Schweiz) AG, Switzerland

3. Future Processing, Poland

Abstract

Numerous irregular graph datasets, for example social networks or web graphs, may contain even trillions of edges. Often, their structure changes over time and they 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 and irregularity of such datasets, 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., document stores, tuple stores, native graph database systems, or object-oriented systems), the associated graph models (e.g., Resource Description Framework 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 Atomicity, Consistency, Isolation, Durability). Fifty-one graph database systems are presented and compared, including Neo4j, OrientDB, and Virtuoso. We outline graph database queries and relationships with associated domains (NoSQL stores, graph streaming, and dynamic graph algorithms). Finally, we outline future research and engineering challenges related to graph databases.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science,Theoretical Computer Science

Reference213 articles.

1. Daniel J. Abadi et al. 2007. Scalable semantic web data management using vertical partitioning. In VLDB. 411–422.

2. Effective Partitioning and Multiple RDF Indexing for Database Triple Store

3. A scalable processing-in-memory accelerator for parallel graph processing

4. Amazon. Amazon Neptune. Retrieved from https://aws.amazon.com/neptune/.

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Exploiting Fusion Opportunities in Linear Algebraic Graph Query Engines;2023 IEEE High Performance Extreme Computing Conference (HPEC);2023-09-25

2. A Knowledge Graph Framework for Dementia Research Data;Applied Sciences;2023-09-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3