{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:46:11Z","timestamp":1783035971340,"version":"3.54.6"},"reference-count":213,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T00:00:00Z","timestamp":1694736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2024,2,29]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/3604932","type":"journal-article","created":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T12:06:29Z","timestamp":1687781189000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":82,"title":["Demystifying Graph Databases: Analysis and Taxonomy of Data Organization, System Designs, and Graph Queries"],"prefix":"10.1145","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6550-7916","authenticated-orcid":false,"given":"Maciej","family":"Besta","sequence":"first","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3129-4689","authenticated-orcid":false,"given":"Robert","family":"Gerstenberger","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2914-1777","authenticated-orcid":false,"given":"Emanuel","family":"Peter","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6394-3490","authenticated-orcid":false,"given":"Marc","family":"Fischer","sequence":"additional","affiliation":[{"name":"PRODYNA (Schweiz) AG, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1222-6894","authenticated-orcid":false,"given":"Micha\u0142","family":"Podstawski","sequence":"additional","affiliation":[{"name":"Future Processing, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8518-8468","authenticated-orcid":false,"given":"Claude","family":"Barthels","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4396-6695","authenticated-orcid":false,"given":"Gustavo","family":"Alonso","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1333-9797","authenticated-orcid":false,"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,9,15]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"411","volume-title":"VLDB","author":"Abadi Daniel J.","year":"2007","unstructured":"Daniel J. Abadi et\u00a0al. 2007. Scalable semantic web data management using vertical partitioning. In VLDB. 411\u2013422."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.4186\/ej.2015.19.5.139"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750386"},{"key":"e_1_3_2_6_2","unstructured":"Amazon. Amazon Neptune. Retrieved from https:\/\/aws.amazon.com\/neptune\/."},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627697"},{"key":"e_1_3_2_8_2","first-page":"1421","volume-title":"ACM SIGMOD","author":"Angles Renzo","year":"2018","unstructured":"Renzo Angles, Marcelo Arenas, Pablo Barcelo, et\u00a0al. 2018. G-CORE: A core for future graph query languages. In ACM SIGMOD. 1421\u20131432."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3104031"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1322432.1322433"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96193-4_1"},{"key":"e_1_3_2_12_2","volume-title":"ACM GRADES-NDA","author":"Angles Renzo","year":"2022","unstructured":"Renzo Angles, Aidan Hogan, Ora Lassila, et\u00a0al. 2022. Multilayer graphs: A unified data model for graph databases. In ACM GRADES-NDA. Article 11, 6 pages."},{"key":"e_1_3_2_13_2","unstructured":"Apache. Apache Cassandra. Retrieved from https:\/\/cassandra.apache.org\/."},{"key":"e_1_3_2_14_2","unstructured":"Apache. Apache Giraph. Retrieved from https:\/\/giraph.apache.org\/."},{"key":"e_1_3_2_15_2","unstructured":"Apache. Apache Mormotta. Retrieved from http:\/\/marmotta.apache.org\/."},{"key":"e_1_3_2_16_2","unstructured":"Apache. Apache Solr. Retrieved from https:\/\/solr.apache.org\/."},{"key":"e_1_3_2_17_2","unstructured":"ArangoDB Inc.ArangoDB. Retrieved from https:\/\/www.arangodb.com\/docs\/stable\/data-models.html."},{"key":"e_1_3_2_18_2","unstructured":"ArangoDB Inc.ArangoDB: Index free adjacency or hybrid indexes for graph databases. Retrieved from https:\/\/www.arangodb.com\/2016\/04\/index-free-adjacency-hybrid-indexes-graph-databases\/."},{"key":"e_1_3_2_19_2","first-page":"1185","volume-title":"ACM SIGMOD","author":"Armstrong Timothy G.","year":"2013","unstructured":"Timothy G. Armstrong et\u00a0al. 2013. LinkBench: A database benchmark based on the Facebook social graph. In ACM SIGMOD. 1185\u20131196."},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88433-6.50020-4"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.5555\/152178"},{"key":"e_1_3_2_22_2","unstructured":"Aurelius. Titan data model. Retrieved from http:\/\/s3.thinkaurelius.com\/docs\/titan\/1.0.0\/data-model.html."},{"key":"e_1_3_2_23_2","unstructured":"AWS. 2022. Columnar storage developer guide. Retrieved from https:\/\/docs.aws.amazon.com\/redshift\/latest\/dg\/c_columnar_storage_disk_mem_mgmnt.html."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107637"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1021\/ci00047a033"},{"key":"e_1_3_2_26_2","volume-title":"CIDR","author":"Barahmand Sumita","year":"2013","unstructured":"Sumita Barahmand and Shahram Ghandeharizadeh. 2013. BG: A benchmark to evaluate interactive social networking actions. In CIDR."},{"issue":"10","key":"e_1_3_2_27_2","first-page":"2014","article-title":"Mariadb vs. MySQL","volume":"7","author":"Bartholomew Daniel","year":"2012","unstructured":"Daniel Bartholomew. 2012. Mariadb vs. MySQL. Dostopano 7, 10 (2012), 2014.","journal-title":"Dostopano"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-015-0472-6"},{"key":"e_1_3_2_29_2","article-title":"The GAP benchmark suite","author":"Beamer Scott","year":"2015","unstructured":"Scott Beamer, Krste Asanovi\u0107, and David Patterson. 2015. The GAP benchmark suite. arXiv:1508.03619. Retrieved from https:\/\/arxiv.org\/abs\/1508.03619.","journal-title":"arXiv:1508.03619"},{"key":"e_1_3_2_30_2","unstructured":"Maciej Besta Dimitri Stanojevic Johannes De Fine Licht Tal Ben-Nun and Torsten Hoefler. Graph processing on FPGAs: Taxonomy survey challenges. arXiv:1903.06697. Retrieved from https:\/\/arxiv.org\/abs\/1903.06697."},{"key":"e_1_3_2_31_2","unstructured":"Maciej Besta Marc Fischer Vasiliki Kalavri Michael Kapralov and Torsten Hoefler. 2019. Practice of streaming processing of dynamic graphs: Concepts models and systems. arXiv:1912.12740. Retrieved from https:\/\/arxiv.org\/abs\/1912.12740."},{"key":"e_1_3_2_32_2","volume-title":"ACM\/IEEE SC","author":"Besta Maciej","year":"2020","unstructured":"Maciej Besta et\u00a0al. 2020. High-performance parallel graph coloring with strong guarantees on work, depth, and quality. In ACM\/IEEE SC."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3035761"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.34"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476252"},{"key":"e_1_3_2_37_2","unstructured":"Bitnine Global Inc.AgensGraph. Retrieved from https:\/\/bitnine.net\/agensgraph\/."},{"key":"e_1_3_2_38_2","unstructured":"Blazegraph. BlazeGraph DB. Retrieved from https:\/\/www.blazegraph.com\/."},{"key":"e_1_3_2_39_2","volume-title":"Algorithms and Theory of Computation Handbook: Special Topics and Techniques","author":"Blelloch Guy E.","year":"2010","unstructured":"Guy E. Blelloch and Bruce M. Maggs. 2010. Parallel algorithms. In Algorithms and Theory of Computation Handbook: Special Topics and Techniques."},{"key":"e_1_3_2_40_2","unstructured":"Scott Boag Don Chamberlin Mary F Fern\u00e1ndez Daniela Florescu Jonathan Robie J\u00e9r\u00f4me Sim\u00e9on and Mugur Stefanescu. 2007. XQuery 1.0: An XML Query Language. World Wide Web Consortium."},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.2200\/S00873ED1V01Y201808DTM051"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_44_2","volume-title":"The JavaScript Object Notation (JSON) Data Interchange Format","author":"Bray Tim","year":"2014","unstructured":"Tim Bray. 2014. The JavaScript Object Notation (JSON) Data Interchange Format. RFC 7159."},{"key":"e_1_3_2_45_2","unstructured":"Tim Bray Jean Paoli C. Michael Sperberg-McQueen Eve Maler and Franois Yergeau. 2008. Extensible markup language (XML) 1.0. https:\/\/www.w3.org\/TR\/2008\/REC-xml-20081126\/."},{"key":"e_1_3_2_46_2","first-page":"54","volume-title":"ISWC","author":"Broekstra Jeen","year":"2002","unstructured":"Jeen Broekstra et\u00a0al. 2002. Sesame: A generic architecture for storing and querying RDF and RDF schema. In ISWC. 54\u201368."},{"key":"e_1_3_2_47_2","unstructured":"Callidus Software Inc.OrientDB. Retrieved from https:\/\/orientdb.com."},{"key":"e_1_3_2_48_2","unstructured":"Callidus Software Inc.OrientDB: Lightweight edges. Retrieved from https:\/\/orientdb.com\/docs\/3.0.x\/java\/Lightweight-Edges.html."},{"key":"e_1_3_2_49_2","unstructured":"Cambridge Semantics. AnzoGraph. Retrieved from https:\/\/www.cambridgesemantics.com\/product\/anzograph\/."},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/2764947.2764954"},{"key":"e_1_3_2_51_2","first-page":"228","volume-title":"IEEE ICDIM","author":"Castelltort Arnaud","year":"2013","unstructured":"Arnaud Castelltort et\u00a0al. 2013. Representing history in graph-oriented NoSQL databases: A versioning system. In IEEE ICDIM. 228\u2013234."},{"key":"e_1_3_2_52_2","unstructured":"Cayley. CayleyGraph. Retrieved from https:\/\/cayley.io\/ and https:\/\/github.com\/cayleygraph\/cayley."},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.5555\/1285358.1285359"},{"key":"e_1_3_2_54_2","first-page":"186","volume-title":"IEEE ICDE Workshops","author":"Ciglan Marek","year":"2012","unstructured":"Marek Ciglan, Alex Averbuch, et\u00a0al. 2012. Benchmarking traversal operations over graph databases. In IEEE ICDE Workshops. 186\u2013189."},{"key":"e_1_3_2_55_2","unstructured":"James Clark and Steve DeRose. 1999. XML Path Language (XPath) Version 1.0 . World Wide Web Consortium."},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-53-8.50009-1"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_3_2_58_2","unstructured":"Richard Cyganiak David Wood and Markus Lanthaler. 2014. RDF 1.1 Concepts and abstract syntax."},{"key":"e_1_3_2_59_2","unstructured":"DataStax Inc.DSE graph (DataStax). Retrieved from https:\/\/www.datastax.com\/."},{"key":"e_1_3_2_60_2","volume-title":"A Guide to the SQL Standard","author":"Date Chris J.","year":"1987","unstructured":"Chris J. Date and Hugh Darwen. 1987. A Guide to the SQL Standard. Vol. 3."},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/3158661"},{"key":"e_1_3_2_62_2","unstructured":"Dgraph Labs Inc.BadgerDB. Retrieved from https:\/\/dbdb.io\/db\/badgerdb."},{"key":"e_1_3_2_63_2","unstructured":"Dgraph Labs Inc.Dgraph. Retrieved from https:\/\/dgraph.io\/ and https:\/\/dgraph.io\/docs\/."},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356189"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_66_2","volume-title":"A Survey of Parallel Graph Processing Frameworks","author":"Doekemeijer Niels","year":"2014","unstructured":"Niels Doekemeijer and Ana Lucia Varbanescu. 2014. A Survey of Parallel Graph Processing Frameworks. Technical Report. Delft University of Technology."},{"key":"e_1_3_2_67_2","first-page":"37","volume-title":"WAIM","author":"Dominguez-Sal David","year":"2010","unstructured":"David Dominguez-Sal et\u00a0al. 2010. Survey of graph database performance on the HPC scalable graph analysis benchmark. In WAIM. 37\u201348."},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.14778\/2983200.2983202"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.5555\/555458"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1080\/19361610.2011.529413"},{"key":"e_1_3_2_71_2","first-page":"1","volume-title":"IEEE HPEC","author":"Ediger David","year":"2012","unstructured":"David Ediger, Rob McColl, Jason Riedy, and David A. Bader. 2012. STINGER: High performance data structure for streaming graphs. In IEEE HPEC. 1\u20135."},{"key":"e_1_3_2_72_2","first-page":"260","volume-title":"EMENA-ISTL","author":"Maazouz Hamid El","year":"2019","unstructured":"Hamid El Maazouz, Guido Wachsmuth, Martin Sevenich, et\u00a0al. 2019. A DSL-based framework for performance assessment. In EMENA-ISTL. 260\u2013270."},{"key":"e_1_3_2_73_2","unstructured":"Elastic. Elasticsearch. Retrieved from https:\/\/www.elastic.co\/elasticsearch\/."},{"key":"e_1_3_2_74_2","first-page":"882","volume-title":"Fundamentals of Database Systems, 6th Edition","author":"Elmasri Ramez","year":"2011","unstructured":"Ramez Elmasri et\u00a0al. 2011. Advantages of distributed databases. In Fundamentals of Database Systems, 6th Edition. Chapter 25.1.5, 882."},{"key":"e_1_3_2_75_2","first-page":"894","volume-title":"Fundamentals of Database Systems, 6th Edition","author":"Elmasri Ramez","year":"2011","unstructured":"Ramez Elmasri and Shamkant B. Navathe. 2011. Data fragmentation. In Fundamentals of Database Systems, 6th Edition. Chapter 25.4.1, 894\u2013897."},{"key":"e_1_3_2_76_2","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1145\/2723372.2742786","volume-title":"ACM SIGMOD","author":"Erling Orri","year":"2015","unstructured":"Orri Erling, Alex Averbuch, Josep Larriba-Pey, et\u00a0al. 2015. The LDBC social network benchmark: Interactive workload. In ACM SIGMOD. 619\u2013630."},{"key":"e_1_3_2_77_2","unstructured":"FactNexus. GraphBase. Retrieved from https:\/\/graphbase.ai\/."},{"key":"e_1_3_2_78_2","volume-title":"CIDR","author":"Fan Jing","year":"2015","unstructured":"Jing Fan, Adalbert Gerald Soosai Raj, and Jignesh M. Patel. 2015. The case against specialized graph analytics engines. In CIDR."},{"key":"e_1_3_2_79_2","unstructured":"Fauna. FaunaDB. Retrieved from https:\/\/fauna.com\/."},{"key":"e_1_3_2_80_2","volume-title":"CIDR","author":"Feng Xiyang","year":"2023","unstructured":"Xiyang Feng, Guodong Jin, Ziyi Chen, Chang Liu, and Semih Saliho\u011flu. 2023. K\u00d9ZU graph database management system. In CIDR."},{"key":"e_1_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2023.1"},{"key":"e_1_3_2_82_2","first-page":"1433","volume-title":"ACM SIGMOD","author":"Francis Nadime","year":"2018","unstructured":"Nadime Francis, Alastair Green, Paolo Guagliardo, et\u00a0al. 2018. Cypher: An evolving query language for property graphs. In ACM SIGMOD. 1433\u20131445."},{"key":"e_1_3_2_83_2","unstructured":"Franz Inc.AllegroGraph. Retrieved from https:\/\/allegrograph.com\/products\/allegrograph\/."},{"key":"e_1_3_2_84_2","volume-title":"A Survey on NoSQL Databases","author":"Gajendran Santhosh Kumar","year":"2012","unstructured":"Santhosh Kumar Gajendran. 2012. A Survey on NoSQL Databases. Technical Report. University of Illinois."},{"key":"e_1_3_2_85_2","first-page":"1021","volume-title":"Database Systems: The Complete Book, 1st Edition","author":"Garcia-Molina Hector","year":"2002","unstructured":"Hector Garcia-Molina, Jeffrey D. Ullman, et\u00a0al. 2002. Data replication. In Database Systems: The Complete Book, 1st Edition. Chapter 19.4.3, 1021."},{"key":"e_1_3_2_86_2","unstructured":"Ewout Gelling George Fletcher and Michael Schmidt. 2023. Bridging graph data models: RDF RDF-star and property graphs as directed acyclic graphs. Retrieved from https:\/\/arxiv.org\/abs\/2304.13097."},{"key":"e_1_3_2_87_2","volume-title":"ACM\/IEEE SC","author":"Georganas Evangelos","year":"2012","unstructured":"Evangelos Georganas et\u00a0al. 2012. Communication avoiding and overlapping for numerical linear algebra. In ACM\/IEEE SC."},{"key":"e_1_3_2_88_2","volume-title":"HBase: The Definitive Guide","author":"George Lars","year":"2011","unstructured":"Lars George. 2011. HBase: The Definitive Guide."},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/571902"},{"key":"e_1_3_2_90_2","doi-asserted-by":"publisher","DOI":"10.1145\/3200691.3178504"},{"key":"e_1_3_2_91_2","first-page":"36","volume-title":"IEEE IPDPS","author":"Gleinig Niels","year":"2022","unstructured":"Niels Gleinig, Maciej Besta, and Torsten Hoefler. 2022. I\/O-optimal cache-oblivious sparse matrix-sparse matrix multiplication. In IEEE IPDPS. 36\u201346."},{"key":"e_1_3_2_92_2","unstructured":"Google. Graphd. Retrieved from https:\/\/github.com\/google\/graphd."},{"key":"e_1_3_2_93_2","unstructured":"Graph Story Inc.Graph story. Retrieved from https:\/\/github.com\/graphstory."},{"key":"e_1_3_2_94_2","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352139"},{"key":"e_1_3_2_95_2","first-page":"520","volume-title":"EDBT","author":"Green Alastair","year":"2018","unstructured":"Alastair Green, Martin Junghanns, Max Kie\u00dfling, et\u00a0al. 2018. openCypher: New directions in property graph querying. In EDBT. 520\u2013523."},{"key":"e_1_3_2_96_2","volume-title":"HIPOD","author":"Guzenda L.","year":"2000","unstructured":"L. Guzenda. 2000. Objectivity\/DB \u2013 A high performance object database architecture. In HIPOD."},{"key":"e_1_3_2_97_2","first-page":"363","volume-title":"IEEE ICPCA","author":"Han Jing","year":"2011","unstructured":"Jing Han, E. Haihong, Guan Le, and Jian Du. 2011. Survey on NoSQL database. In IEEE ICPCA. 363\u2013366."},{"key":"e_1_3_2_98_2","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732980"},{"key":"e_1_3_2_99_2","volume-title":"ISWC\/ASWC","author":"Harth Andreas","year":"2007","unstructured":"Andreas Harth et\u00a0al. 2007. YARS2: A federated repository for querying graph structured data from the web. In ISWC\/ASWC."},{"key":"e_1_3_2_100_2","article-title":"Reconciliation of RDF* and property graphs","author":"Hartig Olaf","year":"2014","unstructured":"Olaf Hartig. 2014. Reconciliation of RDF* and property graphs. arXiv:1409.3288. Retrieved from https:\/\/arxiv.org\/abs\/1409.3288.","journal-title":"arXiv:1409.3288"},{"key":"e_1_3_2_101_2","volume-title":"ISWC (Poster)","author":"Hartig Olaf","year":"2017","unstructured":"Olaf Hartig. 2017. RDF* and SPARQL*: An alternative approach to annotate statements in RDF. In ISWC (Poster)."},{"key":"e_1_3_2_102_2","volume-title":"SEM4TRA-AMAR","author":"Hartig Olaf","year":"2019","unstructured":"Olaf Hartig. 2019. Foundations to query labeled property graphs using SPARQL*. In SEM4TRA-AMAR."},{"key":"e_1_3_2_103_2","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186014"},{"key":"e_1_3_2_104_2","volume-title":"A Graph Model for RDF","author":"Hayes Jonathan","year":"2004","unstructured":"Jonathan Hayes. 2004. A Graph Model for RDF. Diploma Thesis. Technische Universit\u00e4t Darmstadt, Universidad de Chile."},{"key":"e_1_3_2_105_2","doi-asserted-by":"publisher","DOI":"10.5555\/1076260"},{"key":"e_1_3_2_106_2","volume-title":"Modern Database Management","author":"Hoffer Jeffrey A.","year":"2011","unstructured":"Jeffrey A. Hoffer, Venkataraman Ramesh, and Heikki Topi. 2011. Modern Database Management."},{"key":"e_1_3_2_107_2","doi-asserted-by":"publisher","DOI":"10.1145\/2457317.2457351"},{"key":"e_1_3_2_108_2","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807620"},{"key":"e_1_3_2_109_2","unstructured":"InfiniBand Trade Association. 2015. InfiniBand: Architecture specification 1.3."},{"key":"e_1_3_2_110_2","unstructured":"InfoGrid. The InfoGrid graph database. Retrieved from http:\/\/infogrid.org."},{"key":"e_1_3_2_111_2","first-page":"25","volume-title":"WAIM","author":"Iordanov Borislav","year":"2010","unstructured":"Borislav Iordanov. 2010. HyperGraphDB: A generalized graph database. In WAIM. 25\u201336."},{"key":"e_1_3_2_112_2","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007270"},{"key":"e_1_3_2_113_2","unstructured":"Jes\u00fas Barrasa. 2017. RDF triple stores vs. labeled property graphs: What\u2019s the difference? Retrieved from https:\/\/neo4j.com\/blog\/rdf-triple-store-vs-labeled-property-graph-difference\/."},{"key":"e_1_3_2_114_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19766-6_2"},{"key":"e_1_3_2_115_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7363873"},{"key":"e_1_3_2_116_2","first-page":"708","volume-title":"IEEE SocialCom","author":"Jouili Salim","year":"2013","unstructured":"Salim Jouili and Valentin Vansteenberghe. 2013. An empirical comparison of graph databases. In IEEE SocialCom. 708\u2013715."},{"key":"e_1_3_2_117_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49340-4_14"},{"key":"e_1_3_2_118_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2762294"},{"key":"e_1_3_2_119_2","first-page":"785","volume-title":"IEEE ICCCA","author":"Kaliyar R. Kumar","year":"2015","unstructured":"R. Kumar Kaliyar. 2015. Graph databases: A survey. In IEEE ICCCA. 785\u2013790."},{"key":"e_1_3_2_120_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0283-9"},{"key":"e_1_3_2_121_2","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056445"},{"key":"e_1_3_2_122_2","doi-asserted-by":"publisher","DOI":"10.5555\/516674"},{"key":"e_1_3_2_123_2","first-page":"1","volume-title":"IEEE HPEC","author":"Kepner Jeremy","year":"2016","unstructured":"Jeremy Kepner, Peter Aaltonen, David Bader, Aydin Bulu\u00e7, Franz Franchetti, et\u00a0al. 2016. Mathematical foundations of the GraphBLAS. In IEEE HPEC. 1\u20139."},{"key":"e_1_3_2_124_2","first-page":"85","volume-title":"ISWC (Poster)","author":"Khadilkar Vaibhav","year":"2012","unstructured":"Vaibhav Khadilkar et\u00a0al. 2012. Jena-HBase: A distributed, scalable and efficient RDF triple store. In ISWC (Poster). 85\u201388."},{"key":"e_1_3_2_125_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.19"},{"key":"e_1_3_2_126_2","volume-title":"Analysis and Experimental Comparison of Graph Databases","author":"Kolomicenko Vojtech","year":"2013","unstructured":"Vojtech Kolomicenko. 2013. Analysis and Experimental Comparison of Graph Databases. Master\u2019s Thesis. Charles University in Prague."},{"key":"e_1_3_2_127_2","first-page":"26","volume-title":"ICAESAM","author":"Kumar Vijay","year":"2015","unstructured":"Vijay Kumar and Anjan Babu. 2015. Domain suitable graph database selection: A preliminary report. In ICAESAM. 26\u201329."},{"key":"e_1_3_2_128_2","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356181"},{"key":"e_1_3_2_129_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441590"},{"key":"e_1_3_2_130_2","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461796"},{"key":"e_1_3_2_131_2","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_132_2","unstructured":"LambdaZen LLC. Bitsy. Retrieved from https:\/\/github.com\/lambdazen\/bitsy and https:\/\/bitbucket.org\/lambdazen\/bitsy\/wiki\/Home."},{"key":"e_1_3_2_133_2","doi-asserted-by":"publisher","DOI":"10.3233\/SW-223273"},{"key":"e_1_3_2_134_2","volume-title":"An Evaluation Methodology and Experimental Comparison of Graph Databases","author":"Lissandrini Matteo","year":"2017","unstructured":"Matteo Lissandrini et\u00a0al. 2017. An Evaluation Methodology and Experimental Comparison of Graph Databases. Technical Report. University of Trento."},{"key":"e_1_3_2_135_2","doi-asserted-by":"publisher","DOI":"10.14778\/3297753.3297759"},{"key":"e_1_3_2_136_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_137_2","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_138_2","unstructured":"MariaDB. OQGRAPH. Retrieved from https:\/\/mariadb.com\/kb\/en\/oqgraph-storage-engine\/."},{"key":"e_1_3_2_139_2","unstructured":"MarkLogic Corporation. MarkLogic. Retrieved from https:\/\/www.marklogic.com."},{"key":"e_1_3_2_140_2","doi-asserted-by":"publisher","DOI":"10.1145\/2351476.2351489"},{"key":"e_1_3_2_141_2","first-page":"182","volume-title":"ADBIS","author":"Marton J\u00f3zsef","year":"2017","unstructured":"J\u00f3zsef Marton, G\u00e1bor Sz\u00e1rnyas, and D\u00e1niel Varr\u00f3. 2017. Formalising openCypher graph queries in relational algebra. In ADBIS. 182\u2013196."},{"key":"e_1_3_2_142_2","volume-title":"CUG","author":"Maschhoff Kristyn J.","year":"2017","unstructured":"Kristyn J. Maschhoff, Robert Vesse, et\u00a0al. 2017. Quantifying performance of CGE: A unified scalable pattern mining and search system. In CUG."},{"key":"e_1_3_2_143_2","doi-asserted-by":"publisher","DOI":"10.1145\/2567634.2567638"},{"key":"e_1_3_2_144_2","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_3_2_145_2","unstructured":"Memgraph Ltd.Memgraph. Retrieved from https:\/\/memgraph.com\/."},{"key":"e_1_3_2_146_2","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807283"},{"key":"e_1_3_2_147_2","doi-asserted-by":"publisher","DOI":"10.1145\/3461837.3464516"},{"key":"e_1_3_2_148_2","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_3_2_149_2","unstructured":"Microsoft. Azure Cosmos DB. Retrieved from https:\/\/azure.microsoft.com\/en-us\/products\/cosmos-db\/."},{"key":"e_1_3_2_150_2","unstructured":"Microsoft. Microsoft SQL server 2017. Retrieved from https:\/\/www.microsoft.com\/en-us\/sql-server\/sql-server-2017."},{"key":"e_1_3_2_151_2","volume-title":"PostgreSQL: Introduction and Concepts","author":"Momjian Bruce","year":"2001","unstructured":"Bruce Momjian. 2001. PostgreSQL: Introduction and Concepts. Vol. 192, (2001)."},{"key":"e_1_3_2_152_2","unstructured":"Thomas Mueller. 2005. H2 database engine. (2005). Retrieved from http:\/\/www.h2database.com."},{"key":"e_1_3_2_153_2","unstructured":"Networked Planet Limited. BrightstarDB. Retrieved from http:\/\/brightstardb.com\/."},{"key":"e_1_3_2_154_2","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920877"},{"key":"e_1_3_2_155_2","doi-asserted-by":"publisher","DOI":"10.1145\/3180143"},{"key":"e_1_3_2_156_2","unstructured":"Objectivity Inc.ThingSpan. Retrieved from https:\/\/www.objectivity.com\/products\/thingspan\/."},{"key":"e_1_3_2_157_2","volume-title":"USENIX ATC","author":"Olson Mike","year":"1999","unstructured":"Mike Olson, Keith Bostic, and Margo Seltzer. 1999. Berkeley DB. In USENIX ATC."},{"key":"e_1_3_2_158_2","unstructured":"Ontotext. GraphDB. Retrieved from https:\/\/www.ontotext.com\/products\/graphdb\/."},{"key":"e_1_3_2_159_2","unstructured":"OpenLink. Virtuoso. Retrieved from https:\/\/virtuoso.openlinksw.com\/."},{"key":"e_1_3_2_160_2","unstructured":"Oracle. Oracle Spatial and Graph. Retrieved from https:\/\/www.oracle.com\/database\/technologies\/spatialandgraph.html."},{"key":"e_1_3_2_161_2","first-page":"293","volume-title":"NSDI","author":"Ousterhout Kay","year":"2015","unstructured":"Kay Ousterhout et\u00a0al. 2015. Making sense of performance in data analytics frameworks. In NSDI. 293\u2013307."},{"key":"e_1_3_2_162_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-016-5554-y"},{"key":"e_1_3_2_163_2","doi-asserted-by":"publisher","DOI":"10.1145\/3078447.3078459"},{"key":"e_1_3_2_164_2","volume-title":"The PageRank Citation Ranking: Bringing Order to the Web","author":"Page Lawrence","year":"1999","unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, et\u00a0al. 1999. The PageRank Citation Ranking: Bringing Order to the Web. Technical Report. Stanford InfoLab."},{"issue":"2","key":"e_1_3_2_165_2","first-page":"1140","article-title":"A survey on graph database management techniques for huge unstructured data","volume":"8","author":"Patil N. S.","year":"2018","unstructured":"N. S. Patil, P Kiran, et\u00a0al. 2018. A survey on graph database management techniques for huge unstructured data. Int. J. Electr. Comput. Eng. 8, 2 (2018), 1140\u20131149.","journal-title":"Int. J. Electr. Comput. Eng."},{"key":"e_1_3_2_166_2","doi-asserted-by":"publisher","DOI":"10.1145\/1567274.1567278"},{"key":"e_1_3_2_167_2","unstructured":"Tomasz Pluskiewicz. 2022. RDF String. Retrieved from https:\/\/github.com\/tpluscode\/rdf-string."},{"key":"e_1_3_2_168_2","first-page":"58","volume-title":"CISIM","author":"Pokorn\u1ef3 Jaroslav","year":"2015","unstructured":"Jaroslav Pokorn\u1ef3. 2015. Graph databases: Their power and limitations. In CISIM. 58\u201369."},{"key":"e_1_3_2_169_2","unstructured":"Profium. Profium sense. Retrieved from https:\/\/www.profium.com\/en\/products\/graph-database\/."},{"key":"e_1_3_2_170_2","doi-asserted-by":"publisher","DOI":"10.1145\/2347673.2347677"},{"key":"e_1_3_2_171_2","unstructured":"Ashish Rana. 2019. Detailed Introduction: Redis Modules from Graphs to Machine Learning (Part 1). Retrieved from https:\/\/medium.com\/@ashishrana160796\/15ce9ff1949f."},{"key":"e_1_3_2_172_2","unstructured":"Redis Labs. Redis. Retrieved from https:\/\/redis.io\/."},{"key":"e_1_3_2_173_2","unstructured":"Redis Labs. RedisGraph. Retrieved from https:\/\/redis.io\/docs\/stack\/graph\/."},{"key":"e_1_3_2_174_2","volume-title":"CUG","author":"Rickett Christopher D.","year":"2018","unstructured":"Christopher D. Rickett, Utz-Uwe Haus, James Maltby, et\u00a0al. 2018. Loading and querying a trillion RDF triples with Cray Graph Engine on the Cray XC. In CUG."},{"key":"e_1_3_2_175_2","unstructured":"Robert Yokota. HGraphDB. Retrieved from https:\/\/github.com\/rayokota\/hgraphdb."},{"key":"e_1_3_2_176_2","first-page":"149","volume-title":"Graph Databases, 2nd Edition","author":"Robinson Ian","year":"2015","unstructured":"Ian Robinson, Jim Webber, and Emil Eifrem. 2015. Graph database internals. In Graph Databases, 2nd Edition. 149\u2013170."},{"key":"e_1_3_2_177_2","doi-asserted-by":"publisher","DOI":"10.1145\/2815072.2815073"},{"key":"e_1_3_2_178_2","unstructured":"Shahin Roozkhosh Denis Hoornaert Ju Hyoung Mun Tarikul Islam Papon Ahmed Sanaullah Ulrich Drepper Renato Mancuso and Manos Athanassoulis. 2021. Relational memory: Native in-memory accesses on rows and columns. arXiv:2109.14349. Retrieved from https:\/\/arxiv.org\/abs\/2109.14349."},{"key":"e_1_3_2_179_2","doi-asserted-by":"publisher","DOI":"10.1145\/3078447.3078454"},{"key":"e_1_3_2_180_2","first-page":"403","volume-title":"Datenbanksysteme f\u00fcr Business, Technologie und Web","author":"Rudolf Michael","year":"2013","unstructured":"Michael Rudolf et\u00a0al. 2013. The graph story of the SAP HANA database. In Datenbanksysteme f\u00fcr Business, Technologie und Web. 403\u2013420."},{"key":"e_1_3_2_181_2","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164139"},{"key":"e_1_3_2_182_2","unstructured":"SAP. SAP HANA. Retrieved from https:\/\/www.sap.com\/products\/technology-platform\/hana.html."},{"key":"e_1_3_2_183_2","first-page":"661","volume-title":"IEEE ICDE","author":"Sasaki Y.","year":"2022","unstructured":"Y. Sasaki, G. Fletcher, and O. Makoto. 2022. Language-aware indexing for conjunctive path queries. In IEEE ICDE. 661\u2013673."},{"key":"e_1_3_2_184_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_3_2_185_2","first-page":"505","volume-title":"ACM SIGMOD","author":"Shao Bin","year":"2013","unstructured":"Bin Shao, Haixun Wang, and Yatao Li. 2013. Trinity: A distributed graph engine on a memory cloud. In ACM SIGMOD. 505\u2013516."},{"key":"e_1_3_2_186_2","volume-title":"Cassandra Design Patterns","author":"Sharma Sanjay","year":"2014","unstructured":"Sanjay Sharma. 2014. Cassandra Design Patterns."},{"key":"e_1_3_2_187_2","doi-asserted-by":"publisher","DOI":"10.1145\/3128571"},{"key":"e_1_3_2_188_2","unstructured":"solid IT gmbh. System properties comparison: Neo4j vs. Redis. Retrieved from https:\/\/db-engines.com\/en\/system\/Neo4j%3BRedis."},{"key":"e_1_3_2_189_2","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612671"},{"key":"e_1_3_2_190_2","article-title":"Sparse tensor algebra as a parallel programming model","author":"Solomonik Edgar","year":"2015","unstructured":"Edgar Solomonik and Torsten Hoefler. 2015. Sparse tensor algebra as a parallel programming model. arXiv:1512.00066. Retrieved from https:\/\/arxiv.org\/abs\/1512.00066.","journal-title":"arXiv:1512.00066"},{"key":"e_1_3_2_191_2","unstructured":"Stardog Union. 2018. Stardog. Retrieved from https:\/\/www.stardog.com\/."},{"key":"e_1_3_2_192_2","doi-asserted-by":"publisher","DOI":"10.1145\/3078447.3078451"},{"key":"e_1_3_2_193_2","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723732"},{"key":"e_1_3_2_194_2","doi-asserted-by":"publisher","DOI":"10.1145\/3210259.3210268"},{"key":"e_1_3_2_195_2","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574270"},{"key":"e_1_3_2_196_2","unstructured":"Ruben Taelman. 2022. RDF String Turtle. Retrieved from https:\/\/github.com\/rubensworks\/rdf-string-ttl.js."},{"key":"e_1_3_2_197_2","volume-title":"CIDR","author":"Wolde Daniel ten","year":"2023","unstructured":"Daniel ten Wolde, Tavneet Singh, G\u00e1bor Sz\u00e1rnyas, and Peter Boncz. 2023. DuckPGQ: Efficient property graph queries in an analytical RDBMS. In CIDR."},{"key":"e_1_3_2_198_2","unstructured":"The Apache Software Foundation. 2021. Apache Jena TBD. Retrieved from https:\/\/jena.apache.org\/documentation\/tdb\/index.html."},{"key":"e_1_3_2_199_2","unstructured":"The Linux Foundation. 2018. JanusGraph. Retrieved from http:\/\/janusgraph.org\/."},{"key":"e_1_3_2_200_2","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3386138"},{"key":"e_1_3_2_201_2","unstructured":"TigerGraph. 2018. TigerGraph. Retrieved from https:\/\/www.tigergraph.com\/."},{"key":"e_1_3_2_202_2","volume-title":"ACM\/IEEE SC","author":"Tripathy Alok","year":"2020","unstructured":"Alok Tripathy, Katherine Yelick, and Ayd\u0131n Bulu\u00e7. 2020. Reducing communication in graph neural network training. In ACM\/IEEE SC."},{"key":"e_1_3_2_203_2","unstructured":"Twitter. 2010. FlockDB. Retrieved from https:\/\/github.com\/twitter-archive\/flockdb."},{"key":"e_1_3_2_204_2","doi-asserted-by":"publisher","DOI":"10.1145\/2675744.2675752"},{"key":"e_1_3_2_205_2","doi-asserted-by":"publisher","DOI":"10.1145\/2960414.2960421"},{"key":"e_1_3_2_206_2","unstructured":"VelocityDB Inc. 2019. VelocityDB. Retrieved from https:\/\/velocitydb.com\/."},{"key":"e_1_3_2_207_2","unstructured":"VelocityDB Inc. 2019. VelocityGraph. Retrieved from https:\/\/velocitydb.com\/QuickStartVelocityGraph."},{"key":"e_1_3_2_208_2","unstructured":"WhiteDB Team. 2013. WhiteDB. Retrieved from http:\/\/whitedb.org\/: https:\/\/github.com\/priitj\/whitedb."},{"key":"e_1_3_2_209_2","doi-asserted-by":"publisher","DOI":"10.1145\/3078447.3078456"},{"key":"e_1_3_2_210_2","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2912566"},{"key":"e_1_3_2_211_2","doi-asserted-by":"publisher","DOI":"10.14778\/2536349.2536352"},{"key":"e_1_3_2_212_2","first-page":"1165","volume-title":"ACM SIGMOD","author":"Zhao Kangfei","year":"2017","unstructured":"Kangfei Zhao and Jeffrey Xu Yu. 2017. All-in-one: Graph processing in RDBMSs revisited. In ACM SIGMOD. 1165\u20131180."},{"key":"e_1_3_2_213_2","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384351"},{"key":"e_1_3_2_214_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0337-7"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604932","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3604932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:37Z","timestamp":1750178797000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604932"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,15]]},"references-count":213,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2,29]]}},"alternative-id":["10.1145\/3604932"],"URL":"https:\/\/doi.org\/10.1145\/3604932","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,15]]},"assertion":[{"value":"2022-07-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-31","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-09-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}