{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:54:17Z","timestamp":1770749657146,"version":"3.50.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFB10044401"],"award-info":[{"award-number":["2018YFB10044401"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61732014"],"award-info":[{"award-number":["61732014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Municipal Science and Technology Project","award":["Z171100005117002"],"award-info":[{"award-number":["Z171100005117002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2019,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n<jats:p>Over decades, relational database management systems (RDBMSs) have been the first choice to manage data. Recently, due to the variety properties of big data, graph database management systems (GDBMSs) have emerged as an important complement to RDBMSs. As pointed out in the existing literature, both RDBMSs and GDBMSs are capable of managing graph data and relational data; however, the boundaries of them still remain unclear. For this reason, in this paper, we first extend a unified benchmark for RDBMSs and GDBMSs over the same datasets using the same query workload under the same metrics. We then conduct extensive experiments to evaluate them and make the following findings: (1) RDBMSs outperform GDMBSs by a substantial margin under the workloads which mainly consist of group by, sort, and aggregation operations, and their combinations; (2) GDMBSs show their superiority under the workloads that mainly consist of multi-table join, pattern match, path identification, and their combinations.<\/jats:p>","DOI":"10.1007\/s41019-019-00110-3","type":"journal-article","created":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T11:02:56Z","timestamp":1573470176000},"page":"309-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["Which Category Is Better: Benchmarking Relational and Graph Database Management Systems"],"prefix":"10.1007","volume":"4","author":[{"given":"Yijian","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Pengjie","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Tongtong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Xiaoyong","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"issue":"1","key":"110_CR1","doi-asserted-by":"publisher","first-page":"647","DOI":"10.14778\/1453856.1453927","volume":"1","author":"T Neumann","year":"2008","unstructured":"Neumann T, Weikum G (2008) RDF-3x: A risc-style engine for RDF. Proc VLDB Endow 1(1):647\u2013659. https:\/\/doi.org\/10.14778\/1453856.1453927","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"110_CR2","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.14778\/1453856.1453965","volume":"1","author":"C Weiss","year":"2008","unstructured":"Weiss C, Karras P, Bernstein A (2008) Hexastore: sextuple indexing for semantic web data management. Proc VLDB Endow 1(1):1008\u20131019. https:\/\/doi.org\/10.14778\/1453856.1453965","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"110_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s00778-008-0125-y","volume":"18","author":"DJ Abadi","year":"2009","unstructured":"Abadi DJ, Marcus A, Madden SR, Hollenbach K (2009) SW-store: a vertically partitioned DBMS for semantic web data management. VLDB J 18(2):385\u2013406. https:\/\/doi.org\/10.1007\/s00778-008-0125-y","journal-title":"VLDB J"},{"key":"110_CR4","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-88564-1_8","volume-title":"Lecture Notes in Computer Science","author":"Renzo Angles","year":"2008","unstructured":"Angles R, Gutierrez C (2008) The expressive power of SPARQL. In: Proceedings of the 7th international conference on the semantic web, ser. ISWC \u201908. Springer, Berlin, pp 114\u2013129 https:\/\/doi.org\/10.1007\/978-3-540-88564-1_8"},{"issue":"4","key":"110_CR5","doi-asserted-by":"publisher","first-page":"84:1","DOI":"10.1145\/3177850","volume":"51","author":"M Wylot","year":"2018","unstructured":"Wylot M, Hauswirth M, Cudr\u00e9-Mauroux P, Sakr S (2018) RDF data storage and query processing schemes: a survey. ACM Comput Survey 51(4):84:1\u201384:36. https:\/\/doi.org\/10.1145\/3177850","journal-title":"ACM Comput Survey"},{"key":"110_CR6","unstructured":"https:\/\/neo4j.com. Accessed 8 Nov 2019"},{"key":"110_CR7","unstructured":"https:\/\/www.arangodb.com. Accessed 8 Nov 2019"},{"issue":"4","key":"110_CR8","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00778-013-0337-7","volume":"23","author":"L Zou","year":"2014","unstructured":"Zou L, \u00d6zsu MT, Chen L, Shen X, Huang R, Zhao D (2014) gStore: a graph-based SPARQL query engine. VLDB J 23(4):565\u2013590. https:\/\/doi.org\/10.1007\/s00778-013-0337-7","journal-title":"VLDB J"},{"issue":"8","key":"110_CR9","doi-asserted-by":"publisher","first-page":"482","DOI":"10.14778\/2002974.2002976","volume":"4","author":"L Zou","year":"2011","unstructured":"Zou L, Mo J, Chen L, \u00d6zsu MT, Zhao D (2011) gStore: answering SPARQL queries via subgraph matching. Proc VLDB Endow 4(8):482\u2013493. https:\/\/doi.org\/10.14778\/2002974.2002976","journal-title":"Proc VLDB Endow"},{"key":"110_CR10","doi-asserted-by":"publisher","unstructured":"Zhao K, Yu JX (2017) All-in-one: graph processing in RDBMSS revisited. In: Proceedings of the 2017 ACM international conference on management of data, SIGMOD conference 2017, Chicago, IL, USA, 14\u201319 May 2017, pp 1165\u20131180. https:\/\/doi.org\/10.1145\/3035918.3035943","DOI":"10.1145\/3035918.3035943"},{"key":"110_CR11","unstructured":"Gao J, Jin R, Zhou J, Yu JX, Jiang X, Wang T (2012) Relational approach for shortest path discovery over large graphs, CoRR, arXiv:abs\/1201.0232. Available: http:\/\/arxiv.org\/abs\/1201.0232"},{"issue":"4","key":"110_CR12","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1109\/TKDE.2013.43","volume":"26","author":"J Gao","year":"2014","unstructured":"Gao J, Zhou J, Yu JX, Wang T (2014) Shortest path computing in relational DBMSS. IEEE Trans Knowl Data Eng 26(4):997\u20131011. https:\/\/doi.org\/10.1109\/TKDE.2013.43","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"110_CR13","doi-asserted-by":"publisher","unstructured":"De\u00a0Leo D, Boncz P (2017) Extending SQL for computing shortest paths. In: Proceedings of the 5th international workshop on graph data-management experiences & systems, ser. GRADES\u201917. ACM, New York, NY, USA, pp. 10:1\u201310:8. Available: https:\/\/doi.org\/10.1145\/3078447.3078457","DOI":"10.1145\/3078447.3078457"},{"key":"110_CR14","doi-asserted-by":"publisher","unstructured":"Qin L, Yu JX, Chang L, Tao Y (2009) Querying communities in relational databases. In: Proceedings of the 25th international conference on data engineering, ICDE 2009, 29 March 2009\u2013 2 April 2009, Shanghai, China, pp 724\u2013735 https:\/\/doi.org\/10.1109\/ICDE.2009.67","DOI":"10.1109\/ICDE.2009.67"},{"key":"110_CR15","unstructured":"TPC-H (2012). https:\/\/www.tpc.org\/tpc_documents_current_versions\/pdf\/tpc-h_v2.17.1.pdf. Accessed 8 Nov 2019"},{"issue":"13","key":"110_CR16","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.14778\/3007263.3007270","volume":"9","author":"A Iosup","year":"2016","unstructured":"Iosup A, Hegeman T, Ngai WL, Heldens S, Prat-P\u00e9rez A, Manhardto T, Chafio H, Capot\u0103 M, Sundaram N, Anderson M, T\u0103nase IG, Xia Y, Nai L, Boncz P (2016) LDBC graphalytics: a benchmark for large-scale graph analysis on parallel and distributed platforms. Proc VLDB Endow 9(13):1317\u20131328. https:\/\/doi.org\/10.14778\/3007263.3007270","journal-title":"Proc VLDB Endow"},{"key":"110_CR17","unstructured":"TPC-TPC-C (2010) https:\/\/www.tpc.org\/tpc_documents_current_versions\/pdf\/tpc-c_v5.11.0.pdf. Accessed 8 Nov 2019"},{"key":"110_CR18","unstructured":"TPC-TPC-DS (2015) https:\/\/www.tpc.org\/tpc_documents_current_versions\/pdf\/tpc-ds_v2.1.0.pdf. Accessed 8 Nov 2019"},{"key":"110_CR19","unstructured":"https:\/\/www.arangodb.com\/2018\/02\/nosql-performance-benchmark-2018-mongodb-post-gresql-orientdb-neo4j-arangodb. Accessed 8 Nov 2019"},{"key":"110_CR20","unstructured":"https:\/\/info.tigergraph.com\/benchmark. Accessed 8 Nov 2019"},{"key":"110_CR21","unstructured":"https:\/\/www.tigergraph.com. Accessed 8 Nov 2019"},{"key":"110_CR22","unstructured":"https:\/\/aws.amazon.com\/neptune. Accessed 8 Nov 2019"},{"key":"110_CR23","unstructured":"Janusgraph distributed graph database 2017. http:\/\/janusgraph.org. Accessed 8 Nov 2019"},{"issue":"1","key":"110_CR24","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/2206869.2206879","volume":"41","author":"PT Wood","year":"2012","unstructured":"Wood PT (2012) Query languages for graph databases. SIGMOD Record 41(1):50\u201360. https:\/\/doi.org\/10.1145\/2206869.2206879","journal-title":"SIGMOD Record"},{"key":"110_CR25","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. The MIT Press, Cambridge","edition":"3"},{"key":"110_CR26","doi-asserted-by":"publisher","unstructured":"Ordonez C (2005) Optimizing recursive queries in SQL. In: Proceedings of the 2005 ACM SIGMOD international conference on management of data, ser. SIGMOD \u201905. ACM, New York, NY, USA, pp 834\u2013839. https:\/\/doi.org\/10.1145\/1066157.1066260","DOI":"10.1145\/1066157.1066260"},{"key":"110_CR27","volume-title":"SQL:1999: understanding relational language components","author":"J Melton","year":"2001","unstructured":"Melton J, Simon A (2001) SQL:1999: understanding relational language components. Morgan Kaufmann Publishers Inc, San Francisco"},{"key":"110_CR28","unstructured":"Finkelstein IMSJ, Mattos N, Pirahesh H (1996) Expressing recursive queries in SQL, in ISO-IEC JTC1\/SC21 WG3 DBL MCI, pp. X3H2\u201396\u2013075"},{"key":"110_CR29","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76:036106","journal-title":"Phys Rev E"},{"key":"110_CR30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to information retrieval","author":"CD Manning","year":"2008","unstructured":"Manning CD, Raghavan P, Sch\u00fctze H (2008) Introduction to information retrieval. Cambridge University Press, New York"},{"key":"110_CR31","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-26784-5_2","volume-title":"Lecture Notes in Computer Science","author":"Alexander Krot","year":"2015","unstructured":"Krot A, Ostroumova\u00a0Prokhorenkova L (2015) Local clustering coefficient in generalized preferential attachment models. In: Proceedings of the 12th international workshop on algorithms and models for the web graph, vol 9479, ser. WAW 2015. Springer, Heidelberg, pp 15\u201328. https:\/\/doi.org\/10.1007\/978-3-319-26784-5_2"},{"key":"110_CR32","doi-asserted-by":"publisher","unstructured":"Chitnis L, Das\u00a0Sarma A, Machanavajjhala A, Rastogi V (2013) Finding connected components in map-reduce in logarithmic rounds. In: Proceedings of the 2013 IEEE international conference on data engineering (ICDE 2013), ser. ICDE \u201913. IEEE Computer Society, Washington, DC, USA, pp 50\u201361. https:\/\/doi.org\/10.1109\/ICDE.2013.6544813","DOI":"10.1109\/ICDE.2013.6544813"},{"key":"110_CR33","unstructured":"https:\/\/github.com\/hugegraph. Accessed 8 Nov 2019"},{"issue":"2","key":"110_CR34","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer D (1979) Ubiquitous b-tree. ACM Comput Surveys (CSUR) 11(2):121\u2013137","journal-title":"ACM Comput Surveys (CSUR)"},{"key":"110_CR35","unstructured":"Sankaranarayanan J, Samet H, Varshney A (2006) A fast k-neighborhood algorithm for large point-clouds. In: SPBG, pp. 75\u201384"},{"key":"110_CR36","volume-title":"HBase: the definitive guide: random access to your planet-size data","author":"L George","year":"2011","unstructured":"George L (2011) HBase: the definitive guide: random access to your planet-size data. O\u2019Reilly Media Inc, Sebastopol"},{"key":"110_CR37","unstructured":"Cassandra A (2014) Apache cassandra, p 13. Website https:\/\/planetcassandra.org\/what-is-apache-cassandra. Accessed 8 Nov 2019"},{"key":"110_CR38","doi-asserted-by":"crossref","unstructured":"Yang F, Dou K, Chen S, Hou M, Kang J-U, Cho S (2015) Optimizing NoSQL DB on flash: a case study of RocksDB. In: 2015 IEEE 12th international conference on ubiquitous intelligence and computing and 2015 IEEE 12th international conference on autonomic and trusted computing and 2015 IEEE 15th international conference on scalable computing and communications and its associated workshops (UIC-ATC-ScalCom). IEEE, pp 1062\u20131069","DOI":"10.1109\/UIC-ATC-ScalCom-CBDCom-IoP.2015.197"},{"key":"110_CR39","unstructured":"Hao F, Kodialam MS, Lakshman TV (2011) High accuracy bloom filter using partitioned hashing, US Patent 7,930,547"},{"key":"110_CR40","volume-title":"Getting started with LevelDB","author":"A Dent","year":"2013","unstructured":"Dent A (2013) Getting started with LevelDB. Packt Publishing Ltd, Birmingham"},{"key":"110_CR41","unstructured":"https:\/\/hugegraph.github.io\/hugegraph-doc\/performance\/hugegraph-benchmark-0.5.6.html. Accessed 8 Nov 2019"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-019-00110-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41019-019-00110-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-019-00110-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T01:09:27Z","timestamp":1604970567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41019-019-00110-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["110"],"URL":"https:\/\/doi.org\/10.1007\/s41019-019-00110-3","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,11]]},"assertion":[{"value":"16 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}