{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T15:00:19Z","timestamp":1761490819810,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"publisher","award":["SFI\/12\/RC\/2289"],"award-info":[{"award-number":["SFI\/12\/RC\/2289"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project HOBBIT, Germany","award":["688227"],"award-info":[{"award-number":["688227"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2930416","type":"journal-article","created":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T15:20:43Z","timestamp":1563808843000},"page":"101031-101045","source":"Crossref","is-referenced-by-count":6,"title":["QPPDs: Querying Property Paths Over Distributed RDF Datasets"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1380-1750","authenticated-orcid":false,"given":"Qaiser","family":"Mehmood","sequence":"first","affiliation":[]},{"given":"Muhammad","family":"Saleem","sequence":"additional","affiliation":[]},{"given":"Ratnesh","family":"Sahay","sequence":"additional","affiliation":[]},{"given":"Axel-Cyrille Ngonga","family":"Ngomo","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"D'Aquin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3233\/SW-140164"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3233\/SW-160237"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2013.2297101"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SKG.2005.100"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98539-8_3"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48472-3_53"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983877"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/2735471.2735475"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"ref13","article-title":"On finding the k shortest paths in RDF data","volume":"18","author":"filtz","year":"2016","journal-title":"Proc 5th Int Workshop Intell Explor Semantic Data (ISWC)"},{"key":"ref14","first-page":"50","article-title":"RDFPath: Path query processing on large RDF graphs with mapreduce","author":"przyjaciel-zablocki","year":"2011","journal-title":"Proc ESWC"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25007-6_1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46565-4_16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25106-1_28"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25073-6_2"},{"key":"ref19","first-page":"177","article-title":"Avalanche: Putting the spirit of the Web back into semantic Web querying","volume":"658","author":"basca","year":"2010","journal-title":"Proc Posters Demonstrations Track Collected Abstr (ISWC)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1186\/s13326-017-0112-6"},{"key":"ref4","first-page":"1","article-title":"Path query processing on very large RDF graphs","author":"gubichev","year":"2011","journal-title":"Proc WebDB"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1186\/s13326-017-0118-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242680"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/nrd3979"},{"article-title":"Efficient regular path query evaluation using path indexes","year":"2016","author":"fletcher","key":"ref29"},{"key":"ref5","first-page":"212","article-title":"Construct queries in sparql","author":"kostylev","year":"2015","journal-title":"Proc Int Conf Database Theory (ICDT)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"journal-title":"Principles of Distributed Database Systems","year":"2011","author":"\u00f6zsu","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72667-8_12"},{"key":"ref9","first-page":"95","article-title":"Spark: Cluster computing with working sets","author":"zaharia","year":"2010","journal-title":"Proc 2nd USENIX Conf Hot Topics Cloud Comput"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3132218.3132239"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68234-9_39"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41335-3_27"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41335-3_36"},{"key":"ref24","first-page":"13","article-title":"SPLENDID: SPARQL endpoint federation exploiting VOID descriptions","author":"g\u00f6rlitz","year":"2011","journal-title":"Proc 2nd Int Conf Consuming Linked Data"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21064-8_39"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25007-6_3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07443-6_13"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08768371.pdf?arnumber=8768371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:33:02Z","timestamp":1641987182000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8768371\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2930416","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}