Counting to k, or how SPARQL 1.1 could be efficiently enhanced with top k shortest path queries. Savenkov, V., Mehmood, Q., Umbrich, J., & Polleres, A. In *13th International Conference on Semantic Systems (SEMANTiCS)*, pages 97–103, Amsterdam, the Netherlands, September, 2017. ACM. Paper abstract bibtex While graph data on the Web and represented in RDF is growing, SPARQL, as the standard query language for RDF still remains largely unusable for the most typical graph query task: finding paths between selected nodes through the graph. Property Paths, as introduced in SPARQL1.1 turn out to be unfit for this task, as they can only be used for testing path existence and not even allow to count the number of paths between nodes. While such a feature has been shown to theoretically highly intractable, particularly in graphs with a high degree of cyclicity, practical use cases still demand a solution. A common restriction in fact is not to ask for all, but only the $k$-shortest paths between two nodes, in order to obtain at least the most important of potentially infeasibly many possible paths. In this paper, we extend SPARQL 1.1 property paths in a manner that allows to compute and return the $k$ shortest paths matching a property path expression between two nodes. We present an algorithm and implementation and demonstrate in our evaluation that a realtively straightforward solution works (in fact, more efficiently than other, tailored solutions in the literature) in practical use cases.

@inproceedings{save-etal-2017SEMANTiCS,
title = {Counting to k, or how {SPARQL 1.1} could be efficiently enhanced with top k shortest path queries},
author = {Vadim Savenkov and Qaiser Mehmood and J\"urgen Umbrich and Axel Polleres},
year = 2017,
abstract = {While graph data on the Web and represented in RDF is growing, SPARQL, as the standard query language for RDF still remains largely unusable for the most typical graph query task: finding paths between selected nodes through the graph. Property Paths, as introduced in SPARQL1.1 turn out to be unfit for this task, as they can only be used for testing path existence and not even allow to count the number of paths between nodes. While such a feature has been shown to theoretically highly intractable, particularly in graphs with a high degree of cyclicity, practical use cases still demand a solution. A common restriction in fact is not to ask for all, but only the $k$-shortest paths between two nodes, in order to obtain at least the most important of potentially infeasibly many possible paths. In this paper, we extend SPARQL 1.1 property paths in a manner that allows to compute and return the $k$ shortest paths matching a property path expression between two nodes. We present an algorithm and implementation and demonstrate in our evaluation that a realtively straightforward solution works (in fact, more efficiently than other, tailored solutions in the literature) in practical use cases.},
booktitle = {13th International Conference on Semantic Systems (SEMANTiCS)},
month = sep,
pages = {97--103},
url = {http://polleres.net/publications/save-etal-2017SEMANTICS.pdf},
day = {11--14},
publisher = {ACM},
address = {Amsterdam, the Netherlands},
}

Downloads: 0

{"_id":"9FpoCzWyJvxJQAgRk","bibbaseid":"savenkov-mehmood-umbrich-polleres-countingtokorhowsparql11couldbeefficientlyenhancedwithtopkshortestpathqueries-2017","downloads":0,"creationDate":"2017-07-14T05:27:08.241Z","title":"Counting to k, or how SPARQL 1.1 could be efficiently enhanced with top k shortest path queries","author_short":["Savenkov, V.","Mehmood, Q.","Umbrich, J.","Polleres, A."],"year":2017,"bibtype":"inproceedings","biburl":"www.polleres.net/mypublications.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Counting to k, or how SPARQL 1.1 could be efficiently enhanced with top k shortest path queries","author":[{"firstnames":["Vadim"],"propositions":[],"lastnames":["Savenkov"],"suffixes":[]},{"firstnames":["Qaiser"],"propositions":[],"lastnames":["Mehmood"],"suffixes":[]},{"firstnames":["Jürgen"],"propositions":[],"lastnames":["Umbrich"],"suffixes":[]},{"firstnames":["Axel"],"propositions":[],"lastnames":["Polleres"],"suffixes":[]}],"year":"2017","abstract":"While graph data on the Web and represented in RDF is growing, SPARQL, as the standard query language for RDF still remains largely unusable for the most typical graph query task: finding paths between selected nodes through the graph. Property Paths, as introduced in SPARQL1.1 turn out to be unfit for this task, as they can only be used for testing path existence and not even allow to count the number of paths between nodes. While such a feature has been shown to theoretically highly intractable, particularly in graphs with a high degree of cyclicity, practical use cases still demand a solution. A common restriction in fact is not to ask for all, but only the $k$-shortest paths between two nodes, in order to obtain at least the most important of potentially infeasibly many possible paths. In this paper, we extend SPARQL 1.1 property paths in a manner that allows to compute and return the $k$ shortest paths matching a property path expression between two nodes. We present an algorithm and implementation and demonstrate in our evaluation that a realtively straightforward solution works (in fact, more efficiently than other, tailored solutions in the literature) in practical use cases.","booktitle":"13th International Conference on Semantic Systems (SEMANTiCS)","month":"September","pages":"97–103","url":"http://polleres.net/publications/save-etal-2017SEMANTICS.pdf","day":"11–14","publisher":"ACM","address":"Amsterdam, the Netherlands","bibtex":"@inproceedings{save-etal-2017SEMANTiCS,\ntitle = {Counting to k, or how {SPARQL 1.1} could be efficiently enhanced with top k shortest path queries},\nauthor = {Vadim Savenkov and Qaiser Mehmood and J\\\"urgen Umbrich and Axel Polleres},\nyear = 2017,\nabstract = {While graph data on the Web and represented in RDF is growing, SPARQL, as the standard query language for RDF still remains largely unusable for the most typical graph query task: finding paths between selected nodes through the graph. Property Paths, as introduced in SPARQL1.1 turn out to be unfit for this task, as they can only be used for testing path existence and not even allow to count the number of paths between nodes. While such a feature has been shown to theoretically highly intractable, particularly in graphs with a high degree of cyclicity, practical use cases still demand a solution. A common restriction in fact is not to ask for all, but only the $k$-shortest paths between two nodes, in order to obtain at least the most important of potentially infeasibly many possible paths. In this paper, we extend SPARQL 1.1 property paths in a manner that allows to compute and return the $k$ shortest paths matching a property path expression between two nodes. We present an algorithm and implementation and demonstrate in our evaluation that a realtively straightforward solution works (in fact, more efficiently than other, tailored solutions in the literature) in practical use cases.},\nbooktitle = {13th International Conference on Semantic Systems (SEMANTiCS)},\nmonth = sep,\npages = {97--103},\nurl = {http://polleres.net/publications/save-etal-2017SEMANTICS.pdf},\nday = {11--14},\npublisher = {ACM},\naddress = {Amsterdam, the Netherlands},\n}\n\n","author_short":["Savenkov, V.","Mehmood, Q.","Umbrich, J.","Polleres, A."],"key":"save-etal-2017SEMANTiCS","id":"save-etal-2017SEMANTiCS","bibbaseid":"savenkov-mehmood-umbrich-polleres-countingtokorhowsparql11couldbeefficientlyenhancedwithtopkshortestpathqueries-2017","role":"author","urls":{"Paper":"http://polleres.net/publications/save-etal-2017SEMANTICS.pdf"},"metadata":{"authorlinks":{"polleres, a":"https://bibbase.org/show?bib=www.polleres.net%2Fmypublications.bib"}},"downloads":0,"html":""},"search_terms":["counting","sparql","efficiently","enhanced","top","shortest","path","queries","savenkov","mehmood","umbrich","polleres"],"keywords":[],"authorIDs":["FyLDFGg993nDS2Spf"],"dataSources":["cBfwyqsLFQQMc4Fss","gixxkiKt6rtWGoKSh","QfLT6siHZuHw9MqvK"]}