{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T02:00:40Z","timestamp":1781834440115,"version":"3.54.5"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T00:00:00Z","timestamp":1610496000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T00:00:00Z","timestamp":1610496000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Joint Funds of the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No.U19A2059"],"award-info":[{"award-number":["No.U19A2059"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key Research and Development Program of China","award":["No.2019YFB2101902"],"award-info":[{"award-number":["No.2019YFB2101902"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.61532015"],"award-info":[{"award-number":["No.61532015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.61672189"],"award-info":[{"award-number":["No.61672189"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10115-020-01536-2","type":"journal-article","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T06:17:39Z","timestamp":1610605059000},"page":"993-1027","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Distributed processing of regular path queries in RDF graphs"],"prefix":"10.1007","volume":"63","author":[{"given":"Xintong","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2000-6683","authenticated-orcid":false,"given":"Hong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhaonian","family":"Zou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,13]]},"reference":[{"key":"1536_CR1","unstructured":"Apache jena. http:\/\/jena.apache.org\/"},{"key":"1536_CR2","unstructured":"Barton. http:\/\/dslam.cs.umd.edu\/data\/barton\/"},{"key":"1536_CR3","unstructured":"Dblp. https:\/\/dblp.uni-trier.de\/"},{"key":"1536_CR4","unstructured":"Dbpedia. https:\/\/wiki.dbpedia.org\/"},{"key":"1536_CR5","unstructured":"Lubm. http:\/\/swat.cse.lehigh.edu\/projects\/lubm\/"},{"key":"1536_CR6","unstructured":"Mpich. https:\/\/www.mpich.org\/"},{"key":"1536_CR7","unstructured":"Propery path. http:\/\/www.w3.org\/TR\/sparql11-property-paths\/"},{"key":"1536_CR8","unstructured":"Rdf. http:\/\/www.w3.org\/TR\/rdf-concepts\/"},{"key":"1536_CR9","unstructured":"Sparql. http:\/\/www.w3.org\/TR\/rdf-sparql-query\/"},{"key":"1536_CR10","unstructured":"Uniprot. http:\/\/jena.apache.org\/0"},{"key":"1536_CR11","unstructured":"Watdiv. dsg.uwaterloo.ca\/watdiv\/"},{"key":"1536_CR12","unstructured":"Yago2. http:\/\/jena.apache.org\/1"},{"key":"1536_CR13","doi-asserted-by":"publisher","unstructured":"Abul-Basher Z, Yakovets N, Godfrey P, Ghajar-Khosravi S, Chignell MH (2017) Tasweet: optimizing disjunctive regular path queries in graph databases. In: EDBT\/ICDT 2017 joint conference 20th international conference on extending database technology. https:\/\/doi.org\/10.5441\/002\/edbt.2017.47","DOI":"10.5441\/002\/edbt.2017.47"},{"key":"1536_CR14","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s00778-016-0420-y","volume":"25","author":"R Al-Harbi","year":"2016","unstructured":"Al-Harbi R, Abdelaziz I, Kalnis P, Mamoulis N, Ebrahim Y, Sahli M (2016) Accelerating sparql queries by exploiting hash-based locality and adaptive partitioning. VLDB J 25:355\u2013380. http:\/\/jena.apache.org\/2","journal-title":"VLDB J"},{"key":"1536_CR15","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/1007912.1007931","volume":"39","author":"K Andreev","year":"2004","unstructured":"Andreev K, R\u00e4cke H (2004) Balanced graph partitioning. Theory Comput Syst 39:929\u2013939. https:\/\/doi.org\/10.1145\/1007912.1007931","journal-title":"Theory Comput Syst"},{"key":"1536_CR16","unstructured":"Arias M, Fern\u00e1ndez JD, Mart\u00ednez-Prieto MA, Fuente P (2011) An empirical study of real-world sparql queries. arXiv:abs\/1103.5043"},{"key":"1536_CR17","doi-asserted-by":"publisher","unstructured":"Baier J, Daroch D, Reutter JL, Vrgo\u010d D (2017) Evaluating navigational RDF queries over the web. In: Proceedings of the 28th ACM conference on hypertext and social media-HT \u201917. ACM Press. https:\/\/doi.org\/10.1145\/3078714.3078731","DOI":"10.1145\/3078714.3078731"},{"key":"1536_CR18","volume-title":"An analytical study of large SPARQL query logs","author":"A Bonifati","year":"2019","unstructured":"Bonifati A, Martens W, Timm T (2019) An analytical study of large SPARQL query logs. Springer, Berlin"},{"key":"1536_CR19","doi-asserted-by":"publisher","unstructured":"Dey S, Cuevas-Vicentt\u00edn V, K\u00f6hler S, Gribkoff E, Wang M, Lud\u00e4scher B (2013) On implementing provenance-aware regular path queries with relational query engines. In: Proceedings of the joint EDBT\/ICDT 2013 workshops on\u2013EDBT \u201913. ACM Press. https:\/\/doi.org\/10.1145\/2457317.2457353","DOI":"10.1145\/2457317.2457353"},{"key":"1536_CR20","doi-asserted-by":"publisher","unstructured":"Erling O, Mikhailov I (2009) Virtuoso: RDF support in a native RDBMS. In: Semantic web information management, pp 501\u2013519. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-04329-1_21","DOI":"10.1007\/978-3-642-04329-1_21"},{"key":"1536_CR21","doi-asserted-by":"publisher","unstructured":"Even G, Naor JS, Rao S, Schieber B (1999) Fast approximate graph partitioning algorithms. Society for Industrial & Applied Mathematics (SIAM), pp. 2187\u20132214. https:\/\/doi.org\/10.1137\/s0097539796308217","DOI":"10.1137\/s0097539796308217"},{"key":"1536_CR22","doi-asserted-by":"publisher","unstructured":"Fan W, Li J, Ma S, Tang N, Wu Y (2011) Adding regular expressions to graph reachability and pattern queries. In: 2011 IEEE 27th International Conference on Data Engineering. IEEE. https:\/\/doi.org\/10.1109\/icde.2011.5767858","DOI":"10.1109\/icde.2011.5767858"},{"key":"1536_CR23","doi-asserted-by":"publisher","unstructured":"Fletcher GHL, Peters J, Poulovassilis A (2016) Efficient regular path query evaluation using path indexes. In: EDBT. https:\/\/doi.org\/10.5441\/002\/edbt.2016.67","DOI":"10.5441\/002\/edbt.2016.67"},{"key":"1536_CR24","doi-asserted-by":"publisher","unstructured":"Garey MR, Johnson DS (1990) Computers and intractability: a guide to the theory of NP-completeness. Freeman & Co., USA, W. H. https:\/\/doi.org\/10.5555\/574848","DOI":"10.5555\/574848"},{"key":"1536_CR25","doi-asserted-by":"publisher","unstructured":"Gubichev A, Bedathur SJ, Seufert S (2013) Sparqling kleene: fast property paths in rdf-3x. In: First international workshop on graph data management experiences and systems\u2013GRADES \u201913. ACM Press. https:\/\/doi.org\/10.1145\/2484425.2484443","DOI":"10.1145\/2484425.2484443"},{"key":"1536_CR26","doi-asserted-by":"publisher","unstructured":"Guo X, Gao H, Zou Z (2019) Leon: a distributed RDF engine for multi-query processing. In: Database systems for advanced applications, pp. 742\u2013759. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-030-18576-3_44","DOI":"10.1007\/978-3-030-18576-3_44"},{"key":"1536_CR27","doi-asserted-by":"publisher","unstructured":"Gurajada S, Seufert S, Miliaraki I, Theobald M (2014) Triad: a distributed shared-nothing rdf engine based on asynchronous message passing. In: SIGMOD conference. https:\/\/doi.org\/10.1145\/2588555:2610511","DOI":"10.1145\/2588555:2610511"},{"key":"1536_CR28","doi-asserted-by":"publisher","unstructured":"Hellmann S, Stadler C, Lehmann J, Auer S (2009) Dbpedia live extraction. In: OTM conferences. https:\/\/doi.org\/10.1007\/978-3-642-05151-7_33","DOI":"10.1007\/978-3-642-05151-7_33"},{"key":"1536_CR29","doi-asserted-by":"publisher","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. pp. 359\u2013392. https:\/\/doi.org\/10.1137\/s1064827595287997","DOI":"10.1137\/s1064827595287997"},{"key":"1536_CR30","doi-asserted-by":"publisher","unstructured":"Konstas I, Stathopoulos V, Jose JM (2009) On social networks and collaborative recommendation. In: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval\u2013SIGIR \u201909. ACM Press. https:\/\/doi.org\/10.1145\/1571941.1571977","DOI":"10.1145\/1571941.1571977"},{"key":"1536_CR31","doi-asserted-by":"publisher","unstructured":"Koschmieder A, Leser U (2012) Regular path queries on large graphs. In: Lecture notes in computer science, pp 177\u2013194. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-31235-9_12","DOI":"10.1007\/978-3-642-31235-9_12"},{"key":"1536_CR32","doi-asserted-by":"publisher","unstructured":"Losemann K, Martens W (2012) The complexity of evaluating path expressions in SPARQL. In: Proceedings of the 31st symposium on Principles of Database Systems\u2013PODS \u201912. ACM Press. https:\/\/doi.org\/10.1145\/2213556.2213573","DOI":"10.1145\/2213556.2213573"},{"key":"1536_CR33","doi-asserted-by":"publisher","unstructured":"Meimaris M, Papastefanatos G, Mamoulis N, Anagnostopoulos I (2017) Extended characteristic sets: graph indexing for SPARQL query optimization. In: 2017 IEEE 33rd international conference on data engineering (ICDE). IEEE. https:\/\/doi.org\/10.1109\/icde.2017.106","DOI":"10.1109\/icde.2017.106"},{"key":"1536_CR34","doi-asserted-by":"publisher","unstructured":"Mendelzon AO, Wood PT (1995) Finding regular simple paths in graph databases. Society for Industrial & Applied Mathematics (SIAM), pp 1235\u20131258 https:\/\/doi.org\/10.1137\/s009753979122370x","DOI":"10.1137\/s009753979122370x"},{"key":"1536_CR35","doi-asserted-by":"publisher","unstructured":"Neumann T, Moerkotte G (2011) Characteristic sets: accurate cardinality estimation for RDF queries with multiple joins. In: 2011 IEEE 27th international conference on data engineering ICDE. IEEE. https:\/\/doi.org\/10.1109\/icde.2011.5767868","DOI":"10.1109\/icde.2011.5767868"},{"key":"1536_CR36","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00778-009-0165-y","volume":"19","author":"T Neumann","year":"2009","unstructured":"Neumann T, Weikum G (2009) The rdf-3x engine for scalable management of rdf data. VLDB J 19:91\u2013113. http:\/\/jena.apache.org\/5","journal-title":"VLDB J"},{"issue":"2","key":"1536_CR37","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1089\/cmb.2006.13.133","volume":"13","author":"J Scott","year":"2006","unstructured":"Scott J, Ideker T, Karp RM, Sharan R (2006) Efficient algorithms for detecting signaling pathways in protein interaction networks. J Comput Biol 13(2):133\u2013144. http:\/\/jena.apache.org\/6","journal-title":"J Comput Biol"},{"key":"1536_CR38","first-page":"149","volume":"1330","author":"P Selmer","year":"2015","unstructured":"Selmer P, Poulovassilis A, Wood PT (2015) Implementing flexible operators for regular path queries. CEUR Workshop Proc 1330:149\u2013156","journal-title":"CEUR Workshop Proc"},{"key":"1536_CR39","doi-asserted-by":"publisher","unstructured":"Seufert S, Anand A, Bedathur S, Weikum G (2013) FERRARI: Flexible and efficient reachability range assignment for graph indexing. In: 2013 IEEE 29th international conference on data engineering (ICDE). IEEE. https:\/\/doi.org\/10.1109\/icde.2013.6544893","DOI":"10.1109\/icde.2013.6544893"},{"key":"1536_CR40","doi-asserted-by":"publisher","unstructured":"Tetzel F, Voigt H, Paradies M, Lehner W (2017) An analysis of the feasibility of graph compression techniques for indexing regular path queries. In: Proceedings of the fifth international workshop on graph data-management experiences & systems\u2013GRADES\u201917. ACM Press. https:\/\/doi.org\/10.1145\/3078447.3078458","DOI":"10.1145\/3078447.3078458"},{"issue":"6","key":"1536_CR41","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson K (1968) Programming techniques: Regular expression search algorithm. Commun ACM 11(6):419\u2013422. http:\/\/jena.apache.org\/7","journal-title":"Commun ACM"},{"key":"1536_CR42","doi-asserted-by":"publisher","unstructured":"Valstar LD, Fletcher GH, Yoshida Y (2017) Landmark indexing for evaluation of label-constrained reachability queries. In: Proceedings of the 2017 ACM international conference on management of data\u2013SIGMOD \u201917. ACM Press. https:\/\/doi.org\/10.1145\/3035918.3035955","DOI":"10.1145\/3035918.3035955"},{"key":"1536_CR43","doi-asserted-by":"publisher","unstructured":"Wadhwa S, Prasad A, Ranu S, Bagchi A, Bedathur S (2019) Efficiently answering regular simple path queries on large labeled networks. In: Proceedings of the 2019 international conference on management of data\u2014SIGMOD \u201919. ACM Press. https:\/\/doi.org\/10.1145\/3299869.3319882","DOI":"10.1145\/3299869.3319882"},{"key":"1536_CR44","unstructured":"Yakovets N, Godfrey P, Gryz J (2013) Evaluation of sparql property paths via recursive sql. AMW 1087"},{"key":"1536_CR45","doi-asserted-by":"publisher","unstructured":"Yakovets N, Godfrey P, Gryz J (2016) Query planning for evaluating SPARQL property paths. In: Proceedings of the 2016 international conference on management of data\u2013SIGMOD \u201916. ACM Press. https:\/\/doi.org\/10.1145\/2882903.2882944","DOI":"10.1145\/2882903.2882944"},{"key":"1536_CR46","doi-asserted-by":"publisher","unstructured":"Zou L, Xu K, Yu JX, Chen L, Xiao Y, Zhao D (2014) Efficient processing of label-constraint reachability queries in large graphs. Elsevier, Amsterdam, pp. 47\u201366. https:\/\/doi.org\/10.1016\/j.is.2013.10.003","DOI":"10.1016\/j.is.2013.10.003"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-020-01536-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-020-01536-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-020-01536-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,28]],"date-time":"2021-03-28T15:02:49Z","timestamp":1616943769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-020-01536-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,13]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["1536"],"URL":"https:\/\/doi.org\/10.1007\/s10115-020-01536-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,13]]},"assertion":[{"value":"1 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}