{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T05:56:43Z","timestamp":1782367003289,"version":"3.54.5"},"reference-count":83,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T00:00:00Z","timestamp":1506384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Millennium Nucleus Center for Semantic Web Research","award":["NC120004"],"award-info":[{"award-number":["NC120004"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2018,9,30]]},"abstract":"<jats:p>\n            We survey foundational features underlying modern graph query languages. We first discuss two popular graph data models:\n            <jats:italic>edge-labelled graphs<\/jats:italic>\n            , where nodes are connected by directed, labelled edges, and\n            <jats:italic>property graphs<\/jats:italic>\n            , where nodes and edges can further have attributes. Next we discuss the two most fundamental graph querying functionalities:\n            <jats:italic>graph patterns<\/jats:italic>\n            and\n            <jats:italic>navigational expressions<\/jats:italic>\n            . We start with graph patterns, in which a graph-structured query is matched against the data. Thereafter, we discuss navigational expressions, in which patterns can be matched recursively against the graph to navigate paths of arbitrary length; we give an overview of what kinds of expressions have been proposed and how they can be combined with graph patterns. We also discuss several semantics under which queries using the previous features can be evaluated, what effects the selection of features and semantics has on complexity, and offer examples of such features in three modern languages that are used to query graphs: SPARQL, Cypher, and Gremlin. We conclude by discussing the importance of formalisation for graph query languages; a summary of what is known about SPARQL, Cypher, and Gremlin in terms of expressivity and complexity; and an outline of possible future directions for the area.\n          <\/jats:p>","DOI":"10.1145\/3104031","type":"journal-article","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T12:33:53Z","timestamp":1506515633000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":252,"title":["Foundations of Modern Query Languages for Graph Databases"],"prefix":"10.1145","volume":"50","author":[{"given":"Renzo","family":"Angles","sequence":"first","affiliation":[{"name":"Universidad de Talca 8 Center for Semantic Web Research, Chile"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcelo","family":"Arenas","sequence":"additional","affiliation":[{"name":"Pontificia Universidad Cat\u00f3lica de Chile 8 Center for Semantic Web Research, Santiago, Chile"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2293-2653","authenticated-orcid":false,"given":"Pablo","family":"Barcel\u00f3","sequence":"additional","affiliation":[{"name":"DCC, Universidad de Chile 8 Center for Semantic Web Research, Chile"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aidan","family":"Hogan","sequence":"additional","affiliation":[{"name":"DCC, Universidad de Chile 8 Center for Semantic Web Research, Chile"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan","family":"Reutter","sequence":"additional","affiliation":[{"name":"Pontificia Universidad Cat\u00f3lica de Chile 8 Center for Semantic Web Research, Santiago, Chile"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Domagoj","family":"Vrgo\u010d","sequence":"additional","affiliation":[{"name":"Pontificia Universidad Cat\u00f3lica de Chile 8 Center for Semantic Web Research, Santiago, Chile"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,9,26]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Foundations of Databases","author":"Abiteboul Serge","unstructured":"Serge Abiteboul , Richard Hull , and Victor Vianu . 1995. Foundations of Databases . Addison-Wesley . Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2009.02.002"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2012.31"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88564-1_8"},{"key":"e_1_2_2_6_1","volume-title":"Survey of graph database models. ACM Comp. Surv. 40, 1","author":"Angles Renzo","year":"2008","unstructured":"Renzo Angles and Claudio Guti\u00e9rrez . 2008. Survey of graph database models. ACM Comp. Surv. 40, 1 ( 2008 ). Renzo Angles and Claudio Guti\u00e9rrez. 2008. Survey of graph database models. ACM Comp. Surv. 40, 1 (2008)."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46523-4_2"},{"key":"e_1_2_2_8_1","volume-title":"TinkerPop3 Documentation v.3.2.5.","author":"TinkerPop Apache","year":"2017","unstructured":"Apache TinkerPop . 2017. TinkerPop3 Documentation v.3.2.5. Retrieved from http:\/\/tinkerpop.apache.org\/docs\/current\/reference\/ ( June 2017 ). Apache TinkerPop. 2017. TinkerPop3 Documentation v.3.2.5. Retrieved from http:\/\/tinkerpop.apache.org\/docs\/current\/reference\/ (June 2017)."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187922"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2467795"},{"key":"e_1_2_2_11_1","volume-title":"Proceedings of the Conference on Principles of Database Systems (PODS\u201913)","author":"Barcel\u00f3 Pablo","year":"2013","unstructured":"Pablo Barcel\u00f3 . 2013 . Querying graph databases . In Proceedings of the Conference on Principles of Database Systems (PODS\u201913) . 175--188. Pablo Barcel\u00f3. 2013. Querying graph databases. In Proceedings of the Conference on Principles of Database Systems (PODS\u201913). 175--188."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2389241.2389250"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559905"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603122"},{"key":"e_1_2_2_15_1","volume-title":"Proceedings of the Alberto Mendelzon Workshop (AMW\u201912)","author":"Barcel\u00f3 Pablo","unstructured":"Pablo Barcel\u00f3 , Jorge P\u00e9rez , and Juan L. Reutter . 2012b. Relative expressiveness of nested regular expressions . In Proceedings of the Alberto Mendelzon Workshop (AMW\u201912) . 180--195. Pablo Barcel\u00f3, Jorge P\u00e9rez, and Juan L. Reutter. 2012b. Relative expressiveness of nested regular expressions. In Proceedings of the Alberto Mendelzon Workshop (AMW\u201912). 180--195."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798337716"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2019470.2019472"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263675"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233368"},{"key":"e_1_2_2_20_1","volume-title":"Proceedings of the Conference on Vision Interface. 82--88","author":"Bunke Horst","year":"2000","unstructured":"Horst Bunke . 2000 . Graph matching: Theoretical foundations, algorithms, and applications . In Proceedings of the Conference on Vision Interface. 82--88 . Horst Bunke. 2000. Graph matching: Theoretical foundations, algorithms, and applications. In Proceedings of the Conference on Vision Interface. 82--88."},{"key":"e_1_2_2_21_1","volume-title":"Proceedings of the Conference on Knowledge Representation 8 Reasoning (KR\u201900)","author":"Calvanese Diego","unstructured":"Diego Calvanese , Giuseppe De Giacomo , Maurizio Lenzerini , and Moshe Y. Vardi . 2000. Containment of conjunctive regular path queries with inverse . In Proceedings of the Conference on Knowledge Representation 8 Reasoning (KR\u201900) . 176--185. Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. 2000. Containment of conjunctive regular path queries with inverse. In Proceedings of the Conference on Knowledge Representation 8 Reasoning (KR\u201900). 176--185."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1805"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/959060.959076"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00220-0"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497500"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298591"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38749"},{"key":"e_1_2_2_28_1","volume-title":"Proceedings of the Conference on Constraint Programming (CP\u201902)","author":"Dalmau V\u00edctor","unstructured":"V\u00edctor Dalmau , Phokion G. Kolaitis , and Moshe Y. Vardi . 2002. Constraint satisfaction, bounded treewidth, and finite-variable logics . In Proceedings of the Conference on Constraint Programming (CP\u201902) . 310--326. V\u00edctor Dalmau, Phokion G. Kolaitis, and Moshe Y. Vardi. 2002. Constraint satisfaction, bounded treewidth, and finite-variable logics. In Proceedings of the Conference on Constraint Programming (CP\u201902). 310--326."},{"key":"e_1_2_2_29_1","unstructured":"DataStax. 2015. \n      Titan\n      Documentation\n    .\n   Retrieved from http:\/\/s3.thinkaurelius.com\/docs\/titan\/1.0.0\/ (\n  2015\n  ).  DataStax. 2015. Titan Documentation. Retrieved from http:\/\/s3.thinkaurelius.com\/docs\/titan\/1.0.0\/ (2015)."},{"key":"e_1_2_2_30_1","first-page":"3","article-title":"Virtuoso, a Hybrid RDBMS\/graph column store","volume":"35","author":"Erling Orri","year":"2012","unstructured":"Orri Erling . 2012 . Virtuoso, a Hybrid RDBMS\/graph column store . IEEE Data Eng. Bull. 35 , 1 (2012), 3 -- 8 . Orri Erling. 2012. Virtuoso, a Hybrid RDBMS\/graph column store. IEEE Data Eng. Bull. 35, 1 (2012), 3--8.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2274576.2274578"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920986"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.39"},{"key":"e_1_2_2_34_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence.","author":"Fionda Valeria","year":"2015","unstructured":"Valeria Fionda , Giuseppe Pirr\u00f2 , and Mariano P Consens . 2015 . Extended property paths: Writing more SPARQL queries in a succinct way . In Proceedings of the AAAI Conference on Artificial Intelligence. Valeria Fionda, Giuseppe Pirr\u00f2, and Mariano P Consens. 2015. Extended property paths: Writing more SPARQL queries in a succinct way. In Proceedings of the AAAI Conference on Artificial Intelligence."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275503"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/244810.244812"},{"key":"e_1_2_2_37_1","volume-title":"Proceedings of the AAAI Fall Symposium. 43--53","author":"Gallagher Brian","year":"2006","unstructured":"Brian Gallagher . 2006 . Matching structure and semantics: A survey on graph-based pattern matching . In Proceedings of the AAAI Fall Symposium. 43--53 . Brian Gallagher. 2006. Matching structure and semantics: A survey on graph-based pattern matching. In Proceedings of the AAAI Fall Symposium. 43--53."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902309"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"key":"e_1_2_2_40_1","volume-title":"Proceedings of the Conference on Scalable Semantic Web Knowledge Base Systems (SWSS\u201909)","author":"Harris Steve","year":"2009","unstructured":"Steve Harris , Nicholas Lamb , and Nigel Shadbolt . 2009 . 4store: The design and implementation of a clustered RDF store . In Proceedings of the Conference on Scalable Semantic Web Knowledge Base Systems (SWSS\u201909) . 94--109. Steve Harris, Nicholas Lamb, and Nigel Shadbolt. 2009. 4store: The design and implementation of a clustered RDF store. In Proceedings of the Conference on Scalable Semantic Web Knowledge Base Systems (SWSS\u201909). 94--109."},{"key":"e_1_2_2_41_1","unstructured":"Steve\n      Harris\n     and \n      Andy\n      Seaborne\n    . 2013. \n      SPARQL\n       1.1 \n      Query Language\n    . W3\n      C\n      Recommendation\n   (\n  2013\n  ). Retrieved from http:\/\/www.w3.org\/TR\/sparql11-query\/.  Steve Harris and Andy Seaborne. 2013. SPARQL 1.1 Query Language. W3C Recommendation (2013). Retrieved from http:\/\/www.w3.org\/TR\/sparql11-query\/."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001"},{"key":"e_1_2_2_43_1","volume-title":"Proceedings of the Conference on Scalable Semantic Web Knowledge Base Systems (SWSS\u201915)","author":"Hern\u00e1ndez Daniel","year":"2015","unstructured":"Daniel Hern\u00e1ndez , Aidan Hogan , and Markus Kr\u00f6tzsch . 2015 . Reifying RDF: What works well with wikidata? In Proceedings of the Conference on Scalable Semantic Web Knowledge Base Systems (SWSS\u201915) . 32--47. Daniel Hern\u00e1ndez, Aidan Hogan, and Markus Kr\u00f6tzsch. 2015. Reifying RDF: What works well with wikidata? In Proceedings of the Conference on Scalable Semantic Web Knowledge Base Systems (SWSS\u201915). 32--47."},{"key":"e_1_2_2_44_1","volume-title":"Proceedings of the 2nd International Provenance and Annotation Workshop (IPAW\u201908)","author":"Holland David A.","unstructured":"David A. Holland , Uri Jacob Braun , Diana Maclean , Kiran-Kumar Muniswamy-Reddy , and Margo I . Seltzer.2008. Choosing a data model and query language for provenance . In Proceedings of the 2nd International Provenance and Annotation Workshop (IPAW\u201908) . David A. Holland, Uri Jacob Braun, Diana Maclean, Kiran-Kumar Muniswamy-Reddy, and Margo I. Seltzer.2008. Choosing a data model and query language for provenance. In Proceedings of the 2nd International Provenance and Annotation Workshop (IPAW\u201908)."},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151013"},{"key":"e_1_2_2_46_1","volume-title":"Ullman","author":"Hopcroft John E.","year":"2003","unstructured":"John E. Hopcroft , Rajeev Motwani , and Jeffrey D . Ullman . 2003 . Introduction to Automata Theory, Languages, and Computation\u2014International Edition (2nd ed). Addison-Wesley . John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. 2003. Introduction to Automata Theory, Languages, and Computation\u2014International Edition (2nd ed). Addison-Wesley."},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2014.7004261"},{"key":"e_1_2_2_48_1","unstructured":"Graham Klyne Jeremy J. Carroll and Brian McBride. 2014. RDF 1.1 Concepts and Abstract Syntax. W3C Recommendation (25 Feb. 2014). Retrieved from https:\/\/www.w3.org\/TR\/rdf11-concepts\/.  Graham Klyne Jeremy J. Carroll and Brian McBride. 2014. RDF 1.1 Concepts and Abstract Syntax. W3C Recommendation (25 Feb. 2014). Retrieved from https:\/\/www.w3.org\/TR\/rdf11-concepts\/."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25007-6_1"},{"key":"e_1_2_2_50_1","volume-title":"LDBC Task Force: Property Graphs Data Model.","author":"LDBC.","year":"2015","unstructured":"LDBC. 2015. LDBC Task Force: Property Graphs Data Model. Retrieved from http:\/\/www.ldbcouncil.org ( 2015 ). LDBC. 2015. LDBC Task Force: Property Graphs Data Model. Retrieved from http:\/\/www.ldbcouncil.org (2015)."},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2850413"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2274576.2274585"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-012-0284-8"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2494529"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_2_56_1","unstructured":"Akiyoshi Matono Toshiyuki Amagasa Masatoshi Yoshikawa and Shunsuke Uemura. 2003. An efficient pathway search using an indexing scheme for RDF. Genome Informat. Ser. (2003) 374--375.  Akiyoshi Matono Toshiyuki Amagasa Masatoshi Yoshikawa and Shunsuke Uemura. 2003. An efficient pathway search using an indexing scheme for RDF. Genome Informat. Ser. (2003) 374--375."},{"key":"e_1_2_2_57_1","volume-title":"Proceedings of the Conference on Very Large Data Bases (VLDB\u201989)","author":"Alberto","unstructured":"Alberto O. Mendelzon and Peter T. Wood. 1989. Finding regular simple paths in graph databases . In Proceedings of the Conference on Very Large Data Bases (VLDB\u201989) . 185--193. Alberto O. Mendelzon and Peter T. Wood. 1989. Finding regular simple paths in graph databases. In Proceedings of the Conference on Very Large Data Bases (VLDB\u201989). 185--193."},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/28.20.4021"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2791347.2791383"},{"key":"e_1_2_2_61_1","volume-title":"Property Paths","author":"Task Force","year":"2009","unstructured":"Task Force : Property Paths . 2009 . Use cases in Property Paths Task Force. Retrieved from http:\/\/www.w3.org\/2009\/sparql\/wiki\/TaskForce:PropertyPaths#Use_Cases. Task Force: Property Paths. 2009. Use cases in Property Paths Task Force. Retrieved from http:\/\/www.w3.org\/2009\/sparql\/wiki\/TaskForce:PropertyPaths#Use_Cases."},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1567274.1567278"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2010.01.002"},{"key":"e_1_2_2_64_1","volume-title":"SPARQL Query Language for RDF. W3C Recommendation","author":"Prud\u2019hommeaux Eric","year":"2008","unstructured":"Eric Prud\u2019hommeaux and Andy Seaborne . 2008. SPARQL Query Language for RDF. W3C Recommendation ( 2008 ). Retrieved from http:\/\/www.w3.org\/TR\/rdf-sparql-query\/. Eric Prud\u2019hommeaux and Andy Seaborne. 2008. SPARQL Query Language for RDF. W3C Recommendation (2008). Retrieved from http:\/\/www.w3.org\/TR\/rdf-sparql-query\/."},{"key":"e_1_2_2_65_1","volume-title":"Proceedings of the International Conference on Database Theory (ICDT\u201915)","author":"Reutter Juan L.","unstructured":"Juan L. Reutter , Miguel Romero , and Moshe Y. Vardi . 2015. Regular queries on graph databases . In Proceedings of the International Conference on Database Theory (ICDT\u201915) . 177--194. Juan L. Reutter, Miguel Romero, and Moshe Y. Vardi. 2015. Regular queries on graph databases. In Proceedings of the International Conference on Database Theory (ICDT\u201915). 177--194."},{"key":"e_1_2_2_66_1","volume-title":"Oracle of Bacon.","author":"Reynolds Patrick","year":"2015","unstructured":"Patrick Reynolds . 2015. Oracle of Bacon. Retrieved from http:\/\/www.oracleofbacon.org\/ ( 2015 ). Patrick Reynolds. 2015. Oracle of Bacon. Retrieved from http:\/\/www.oracleofbacon.org\/ (2015)."},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_7"},{"key":"e_1_2_2_68_1","volume-title":"Graph Databases","author":"Robinson Ian","unstructured":"Ian Robinson , Jim Webber , and Emil Eifrem . 2013. Graph Databases ( first ed.). O\u2019Reilly Media . Ian Robinson, Jim Webber, and Emil Eifrem. 2013. Graph Databases (first ed.). O\u2019Reilly Media."},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/1804669.1804675"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402736"},{"key":"e_1_2_2_71_1","volume-title":"Getting Started with OrientDB","author":"Tesoriero Claudio","unstructured":"Claudio Tesoriero . 2013. Getting Started with OrientDB . Packt Publishing Ltd . Claudio Tesoriero. 2013. Getting Started with OrientDB. Packt Publishing Ltd."},{"key":"e_1_2_2_72_1","unstructured":"The Neo4j Team. 2016. The Neo4j Manual v3.0. Retrieved from http:\/\/neo4j.com\/docs\/stable\/.  The Neo4j Team. 2016. The Neo4j Manual v3.0. Retrieved from http:\/\/neo4j.com\/docs\/stable\/."},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1201\/b16859-12"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/2960414.2960421"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"},{"key":"e_1_2_2_78_1","first-page":"33","article-title":"Supporting scalable, persistent semantic web applications","volume":"26","author":"Wilkinson Kevin","year":"2003","unstructured":"Kevin Wilkinson , Craig Sayers , Harumi A. Kuno , Dave Reynolds , and Luping Ding . 2003 . Supporting scalable, persistent semantic web applications . IEEE Data Eng. Bull. 26 , 4 (2003), 33 -- 39 . Kevin Wilkinson, Craig Sayers, Harumi A. Kuno, Dave Reynolds, and Luping Ding. 2003. Supporting scalable, persistent semantic web applications. IEEE Data Eng. Bull. 26, 4 (2003), 33--39.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/2206869.2206879"},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484427"},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911996.2912035"},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_6"},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687727"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3104031","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3104031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:37Z","timestamp":1750217437000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3104031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,26]]},"references-count":83,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9,30]]}},"alternative-id":["10.1145\/3104031"],"URL":"https:\/\/doi.org\/10.1145\/3104031","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,26]]},"assertion":[{"value":"2016-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-09-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}