{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:22:26Z","timestamp":1756570946800},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,8]]},"abstract":"<jats:p>\n            Vast amounts of world knowledge is now accessible through Knowledge Graphs (KGs) in RDF format and can be queried using SPARQL. Yet, finding paths between nodes in such graphs is not part of the official SPARQL 1.1 standard; only the simpler functionality of checking reachability is supported, i.e., assessing whether two nodes are connected based on certain conditions formalized as property paths but without providing information on how they are actually connected. To close this gap of functionality, we present J\n            <jats:sc>edi<\/jats:sc>\n            , a system that extends a popular SPARQL engine, Jena, with the ability to compute paths connecting entities in a KG. J\n            <jats:sc>edi<\/jats:sc>\n            shows the\n            <jats:italic>k<\/jats:italic>\n            most relevant results to the user where relevance is assessed as a trade-off between path length and diversification of the intermediate nodes in the path. Furthermore, our solution is not limited to a single property path pattern but supports queries containing multiple property path patterns. While J\n            <jats:sc>edi<\/jats:sc>\n            supports arbitrary KGs, for demonstration purposes some predefined KGs, such as YAGO and DBLP, will be used.\n          <\/jats:p>","DOI":"10.14778\/3229863.3236245","type":"journal-article","created":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T12:12:28Z","timestamp":1536581548000},"page":"2002-2005","source":"Crossref","is-referenced-by-count":6,"title":["Discovering diversified paths in knowledge bases"],"prefix":"10.14778","volume":"11","author":[{"given":"Christian","family":"Aebeloe","sequence":"first","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriela","family":"Montoya","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinay","family":"Setty","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark and University of Stavanger, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katja","family":"Hose","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Top-K Diversification for Path Queries in Knowledge Graphs. In ISWC'18","author":"Aebeloe C.","year":"2018","unstructured":"C. Aebeloe , V. Setty , G. Montoya , and K. Hose . Top-K Diversification for Path Queries in Knowledge Graphs. In ISWC'18 , 2018 . C. Aebeloe, V. Setty, G. Montoya, and K. Hose. Top-K Diversification for Path Queries in Knowledge Graphs. In ISWC'18, 2018."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1785162.1785216"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291025"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137807"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.06.001"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18818-8_17"},{"key":"e_1_2_1_7_1","first-page":"341","volume-title":"Optimizing Aggregate SPARQL Queries Using Materialized RDF Views. In ISWC'16","author":"Ibragimov D.","year":"2016","unstructured":"D. Ibragimov , K. Hose , T. B. Pedersen , and E. Zim\u00e1nyi . Optimizing Aggregate SPARQL Queries Using Materialized RDF Views. In ISWC'16 , pages 341 -- 359 , 2016 . D. Ibragimov, K. Hose, T. B. Pedersen, and E. Zim\u00e1nyi. Optimizing Aggregate SPARQL Queries Using Materialized RDF Views. In ISWC'16, pages 341--359, 2016."},{"key":"e_1_2_1_8_1","volume-title":"CIDR'14","author":"Mahdisoltani F.","year":"2014","unstructured":"F. Mahdisoltani , J. Biega , and F. Suchanek . YAGO3: A knowledge base from multilingual wikipedias . In CIDR'14 , 2014 . F. Mahdisoltani, J. Biega, and F. Suchanek. YAGO3: A knowledge base from multilingual wikipedias. In CIDR'14, 2014."},{"key":"e_1_2_1_9_1","first-page":"471","volume-title":"The Odyssey Approach for Optimizing Federated SPARQL Queries. In ISWC'17","author":"Montoya G.","year":"2017","unstructured":"G. Montoya , H. Skaf-Molli , and K. Hose . The Odyssey Approach for Optimizing Federated SPARQL Queries. In ISWC'17 , pages 471 -- 489 , 2017 . G. Montoya, H. Skaf-Molli, and K. Hose. The Odyssey Approach for Optimizing Federated SPARQL Queries. In ISWC'17, pages 471--489, 2017."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132218.3132239"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872518.2890528"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3229863.3236245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:06:24Z","timestamp":1672221984000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3229863.3236245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":12,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["10.14778\/3229863.3236245"],"URL":"https:\/\/doi.org\/10.14778\/3229863.3236245","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}