Discovering Diversified Paths in Knowledge Bases

Research output: Contribution to journalJournal articleResearchpeer-review

2 Citations (Scopus)
40 Downloads (Pure)

Abstract

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 JEDI, a system that extends a popular SPARQL engine, Jena, with the ability to compute paths connecting entities in a KG. JEDI shows the k 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 JEDI supports arbitrary KGs, for demonstration purposes some predefined KGs, such as YAGO and DBLP, will be used.
Original languageEnglish
JournalProceedings of the VLDB Endowment
Volume11
Issue number12
Pages (from-to)2002-2005
ISSN2150-8097
DOIs
Publication statusPublished - 2018

Fingerprint

Demonstrations
Engines

Cite this

@article{6deea95d5e2e42c983ec12856a0fa110,
title = "Discovering Diversified Paths in Knowledge Bases",
abstract = "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 JEDI, a system that extends a popular SPARQL engine, Jena, with the ability to compute paths connecting entities in a KG. JEDI shows the k 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 JEDI supports arbitrary KGs, for demonstration purposes some predefined KGs, such as YAGO and DBLP, will be used.",
author = "Christian Aebeloe and Gabriela Montoya and Setty, {Vinay Jayarama} and Katja Hose",
year = "2018",
doi = "10.14778/3229863.3236245",
language = "English",
volume = "11",
pages = "2002--2005",
journal = "Proceedings of the VLDB Endowment",
issn = "2150-8097",
publisher = "VLDB Endowment",
number = "12",

}

Discovering Diversified Paths in Knowledge Bases. / Aebeloe, Christian; Montoya, Gabriela; Setty, Vinay Jayarama; Hose, Katja.

In: Proceedings of the VLDB Endowment, Vol. 11, No. 12, 2018, p. 2002-2005.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - Discovering Diversified Paths in Knowledge Bases

AU - Aebeloe, Christian

AU - Montoya, Gabriela

AU - Setty, Vinay Jayarama

AU - Hose, Katja

PY - 2018

Y1 - 2018

N2 - 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 JEDI, a system that extends a popular SPARQL engine, Jena, with the ability to compute paths connecting entities in a KG. JEDI shows the k 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 JEDI supports arbitrary KGs, for demonstration purposes some predefined KGs, such as YAGO and DBLP, will be used.

AB - 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 JEDI, a system that extends a popular SPARQL engine, Jena, with the ability to compute paths connecting entities in a KG. JEDI shows the k 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 JEDI supports arbitrary KGs, for demonstration purposes some predefined KGs, such as YAGO and DBLP, will be used.

U2 - 10.14778/3229863.3236245

DO - 10.14778/3229863.3236245

M3 - Journal article

VL - 11

SP - 2002

EP - 2005

JO - Proceedings of the VLDB Endowment

JF - Proceedings of the VLDB Endowment

SN - 2150-8097

IS - 12

ER -