{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:02:12Z","timestamp":1775815332496,"version":"3.50.1"},"reference-count":51,"publisher":"SAGE Publications","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SW"],"published-print":{"date-parts":[[2019,10,28]]},"DOI":"10.3233\/sw-190365","type":"journal-article","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T12:16:54Z","timestamp":1571833014000},"page":"1127-1168","source":"Crossref","is-referenced-by-count":8,"title":["Querying knowledge graphs with extended property paths"],"prefix":"10.1177","volume":"10","author":[{"given":"Valeria","family":"Fionda","sequence":"first","affiliation":[{"name":"DeMaCS, University of Calabria, Rende, CS, Italy. E-mail:\u00a0fionda@mat.unical.it"}]},{"given":"Giuseppe","family":"Pirr\u00f2","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Sapienza University of Rome, Rome, Italy. E-mail:\u00a0pirro@di.uniroma1.it"}]},{"given":"Mariano P.","family":"Consens","sequence":"additional","affiliation":[{"name":"MIE, University of Toronto, Toronto, Canada. E-mail:\u00a0consens@cs.toronto.edu"}]}],"member":"179","reference":[{"key":"10.3233\/SW-190365_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25007-6_7"},{"issue":"2","key":"10.3233\/SW-190365_ref2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","article-title":"The transitive reduction of a directed graph","volume":"1","author":"Aho","year":"1972","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10.3233\/SW-190365_ref3","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1108\/IJWIS-05-2013-0013","article-title":"Constrained regular expressions for answering RDF-path queries modulo RDFS","volume":"10","author":"Alkhateeb","year":"2014","journal-title":"International Journal of Web Information Systems"},{"key":"10.3233\/SW-190365_ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190654"},{"issue":"1","key":"10.3233\/SW-190365_ref5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1322432.1322433","article-title":"Survey of Graph Database Models","volume":"40","author":"Angles","year":"2008","journal-title":"ACM Computing Surveys"},{"key":"10.3233\/SW-190365_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46523-4_2"},{"key":"10.3233\/SW-190365_ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187922"},{"key":"10.3233\/SW-190365_ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594555"},{"key":"10.3233\/SW-190365_ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465216"},{"issue":"4","key":"10.3233\/SW-190365_ref10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/2389241.2389250","article-title":"Expressive Languages for Path Queries over Graph-Structured Data","volume":"37","author":"Barcel\u00f3","year":"2012","journal-title":"ACM Transactions on Database Systems"},{"key":"10.3233\/SW-190365_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11964-9_37"},{"issue":"3","key":"10.3233\/SW-190365_ref13","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.websem.2009.07.002","article-title":"DBpedia \u2013 a crystallization point for the web of data","volume":"7","author":"Bizer","year":"2009","journal-title":"Web Semantics: science, services and agents on the world wide web"},{"issue":"3","key":"10.3233\/SW-190365_ref14","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1352582.1352590","article-title":"Conjunctive Query Containment and Answering under Description Logic Constraints","volume":"9","author":"Calvanese","year":"2008","journal-title":"ACM Transactions on Computational Logic"},{"key":"10.3233\/SW-190365_ref15","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298591"},{"key":"10.3233\/SW-190365_ref18","doi-asserted-by":"crossref","unstructured":"V.\u00a0Fionda and G.\u00a0Pirr\u00f2, Querying Graphs with Preferences, in: 22nd ACM International Conference on Information and Knowledge Management, CIKM\u201913, San Francisco, CA, USA, October 27\u2013November 1, 2013, Q.\u00a0He, A.\u00a0Iyengar, W.\u00a0Nejdl, J.\u00a0Pei and R.\u00a0Rastogi, eds, ACM, 2013, pp.\u00a0929\u2013938.","DOI":"10.1145\/2505515.2505758"},{"key":"10.3233\/SW-190365_ref19","doi-asserted-by":"crossref","unstructured":"V.\u00a0Fionda, G.\u00a0Pirr\u00f2 and M.P.\u00a0Consens, Extended property paths: Writing more SPARQL queries in a succinct way, in: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, Texas, USA, January 25\u201330, 2015, B.\u00a0Bonet and S.\u00a0Koenig, eds, AAAI Press, 2015, pp.\u00a0102\u2013108.","DOI":"10.1609\/aaai.v29i1.9188"},{"issue":"1","key":"10.3233\/SW-190365_ref20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2697393","article-title":"NautiLOD: A formal language for the web of data graph","volume":"9","author":"Fionda","year":"2015","journal-title":"ACM Transactions on the Web"},{"key":"10.3233\/SW-190365_ref21","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ins.2014.11.031","article-title":"Relative expressive power of navigational querying on graphs","volume":"298","author":"Fletcher","year":"2015","journal-title":"Information Sciences"},{"key":"10.3233\/SW-190365_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41335-3_7"},{"key":"10.3233\/SW-190365_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23032-5_3"},{"key":"10.3233\/SW-190365_ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055573"},{"key":"10.3233\/SW-190365_ref27","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.websem.2016.10.001","article-title":"LDQL: A query language for the web of linked data","volume":"41","author":"Hartig","year":"2016","journal-title":"Journal of Web Semantics"},{"key":"10.3233\/SW-190365_ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186014"},{"key":"10.3233\/SW-190365_ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18818-8_5"},{"key":"10.3233\/SW-190365_ref30","doi-asserted-by":"publisher","DOI":"10.2200\/S00334ED1V01Y201102WBE001"},{"key":"10.3233\/SW-190365_ref31","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809985"},{"key":"10.3233\/SW-190365_ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11964-9_35"},{"key":"10.3233\/SW-190365_ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25007-6_1"},{"key":"10.3233\/SW-190365_ref34","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.websem.2016.04.002","article-title":"Special issue on knowledge graphs","volume":"37\u201338","author":"Kr\u00f6tzsch","year":"2016","journal-title":"Journal of Web Semantics"},{"key":"10.3233\/SW-190365_ref35","doi-asserted-by":"crossref","unstructured":"L.\u00a0Libkin, W.\u00a0Martens and D.\u00a0Vrgo\u010d, Querying graph databases with XPath, in: Joint 2013 EDBT\/ICDT Conferences, ICDT \u201913 Proceedings, Genoa, Italy, March 18\u201322, 2013, W.\u00a0Tan, G.\u00a0Guerrini, B.\u00a0Catania and A.\u00a0Gounaris, eds, ACM, 2013, pp.\u00a0129\u2013140.","DOI":"10.1145\/2448496.2448513"},{"issue":"2","key":"10.3233\/SW-190365_ref36","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2850413","article-title":"Querying graphs with data","volume":"63","author":"Libkin","year":"2016","journal-title":"Journal of the ACM"},{"key":"10.3233\/SW-190365_ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465226"},{"key":"10.3233\/SW-190365_ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213573"},{"key":"10.3233\/SW-190365_ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46523-4_6"},{"key":"10.3233\/SW-190365_ref40","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"issue":"3","key":"10.3233\/SW-190365_ref41","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.websem.2009.07.003","article-title":"Simple and efficient minimal RDFS","volume":"7","author":"Mu\u00f1oz","year":"2009","journal-title":"Journal of Web Semantics"},{"key":"10.3233\/SW-190365_ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1567274.1567278"},{"key":"10.3233\/SW-190365_ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2010.01.002"},{"key":"10.3233\/SW-190365_ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25953-1_5"},{"key":"10.3233\/SW-190365_ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25007-6_2"},{"key":"10.3233\/SW-190365_ref47","doi-asserted-by":"crossref","unstructured":"S.\u00a0Rudolph and M.\u00a0Kr\u00f6tzsch, Flag & check: Data access with monadically defined queries, in: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA, June 22\u201327, 2013, R.\u00a0Hull and W.\u00a0Fan, eds, ACM, 2013, pp.\u00a0151\u2013162.","DOI":"10.1145\/2463664.2465227"},{"key":"10.3233\/SW-190365_ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2362499.2362504"},{"key":"10.3233\/SW-190365_ref49","doi-asserted-by":"publisher","DOI":"10.1145\/1804669.1804675"},{"key":"10.3233\/SW-190365_ref50","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4457"},{"key":"10.3233\/SW-190365_ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"issue":"5","key":"10.3233\/SW-190365_ref52","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1093\/jigpal\/jzv028","article-title":"Relative expressive power of navigational querying on graphs using transitive closure","volume":"23","author":"Surinx","year":"2015","journal-title":"Logic Journal of the IGPL"},{"issue":"10","key":"10.3233\/SW-190365_ref53","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","article-title":"Wikidata: A free collaborative knowledgebase","volume":"57","author":"Vrande\u010di\u0107","year":"2014","journal-title":"Communications of the ACM"},{"issue":"1","key":"10.3233\/SW-190365_ref54","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/2206869.2206879","article-title":"Query Languages for Graph Databases","volume":"41","author":"Wood","year":"2012","journal-title":"SIGMOD Record"},{"key":"10.3233\/SW-190365_ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882944"},{"key":"10.3233\/SW-190365_ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15918-3_25"},{"issue":"11","key":"10.3233\/SW-190365_ref57","doi-asserted-by":"publisher","first-page":"2841","DOI":"10.1093\/comjnl\/bxu128","article-title":"On the power of SPARQL in expressing navigational queries","volume":"58","author":"Zhang","year":"2015","journal-title":"The Computer Journal"}],"container-title":["Semantic Web"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SW-190365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T11:00:48Z","timestamp":1756206048000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SW-190365"}},"subtitle":[],"editor":[{"given":"Mayank","family":"Kejriwal","sequence":"additional","affiliation":[{"name":"USC Information Sciences Institute, USA"}]},{"given":"Vanessa","family":"Lopez","sequence":"additional","affiliation":[{"name":"IBM Research, Ireland"}]},{"given":"Juan F.","family":"Sequeda","sequence":"additional","affiliation":[{"name":"Capsenta, USA"}]},{"given":"Mayank","family":"Kejriwal","sequence":"additional","affiliation":[]},{"given":"Vanessa","family":"Lopez","sequence":"additional","affiliation":[]},{"given":"Juan F.","family":"Sequeda","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,10,28]]},"references-count":51,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/sw-190365","relation":{},"ISSN":["2210-4968","1570-0844"],"issn-type":[{"value":"2210-4968","type":"electronic"},{"value":"1570-0844","type":"print"}],"subject":[],"published":{"date-parts":[[2019,10,28]]}}}