[Profile picture of Ruben Verborgh]

Ruben Verborgh

Using Triple Pattern Fragments To Enable Streaming of Top-k Shortest Paths via the Web

Laurens De Vocht, Ruben Verborgh, and Erik Mannens

Searching for relationships between Linked Data resources is typically interpreted as a pathfinding problem: looking for chains of intermediary nodes (hops) forming the connection or bridge between these resources in a single dataset or across multiple datasets. Linked Open Data, linked datasets available via the web, introduce challenges for pathfinding algorithms. In many cases centralizing all needed linked data in a certain (specialized) repository or index to be able to run the algorithm is not possible or at least not desired. To address this, we propose an approach to top-k shortest pathfinding, which optimally translates a pathfinding query into sequences of triple pattern fragment requests. Triple Pattern Fragments were recently introduced as a solution to address the availability of data on the Web and the scalability of linked data client applications, preventing data processing bottlenecks on the server. The results are streamed to the client, thus allowing clients to asynchronous processing of the top-k shortest paths. We explain how this approach behaves using a training dataset with 10 million triples and show the trade-offs to a SPARQL approach where all the data is gathered in a single triple store on a single machine.

BibTeX other citation formats

Published in 2016 in Proceedings of the 13th Extended Semantic Web Conference: Challenges.

Keywords:

Read this article online

Cite this article in your work

Cite this article easily using its BibTeX entry: 

@inproceedings{devocht_eswc_challenge_2016,
  author = {De Vocht, Laurens and Verborgh, Ruben and Mannens, Erik},
  title = {Using {Triple Pattern Fragments} To Enable Streaming of Top-k Shortest Paths via the {Web}},
  booktitle = {Proceedings of the 13th Extended Semantic Web Conference: Challenges},
  editor = {Sack, Harald and Dietze, Stefan and Tordai, Anna and Lange, Christoph},
  series = {Communications in Computer and Information Science},
  volume = 641,
  year = 2016,
  month = jun,
  pages = {228--240},
  isbn = {978-3-319-46565-4},
  doi = {10.1007/978-3-319-46565-4_18},
}

Alternatively, pick a reference of your choice below:

ACM
Laurens De Vocht, Ruben Verborgh, and Erik Mannens. 2016. Using Triple Pattern Fragments To Enable Streaming of Top-k Shortest Paths via the Web. In Proceedings of the 13th Extended Semantic Web Conference: Challenges (Communications in Computer and Information Science), 228–240.
APA
De Vocht, L., Verborgh, R., & Mannens, E. (2016). Using Triple Pattern Fragments To Enable Streaming of Top-k Shortest Paths via the Web. In H. Sack, S. Dietze, A. Tordai, & C. Lange (Eds.), Proceedings of the 13th Extended Semantic Web Conference: Challenges (Vol. 641, pp. 228–240).
IEEE
L. De Vocht, R. Verborgh, and E. Mannens, “Using Triple Pattern Fragments To Enable Streaming of Top-k Shortest Paths via the Web,” in Proceedings of the 13th Extended Semantic Web Conference: Challenges, 2016, vol. 641, pp. 228–240.
LNCS
De Vocht, L., Verborgh, R., Mannens, E.: Using Triple Pattern Fragments To Enable Streaming of Top-k Shortest Paths via the Web. In: Sack, H., Dietze, S., Tordai, A., and Lange, C. (eds.) Proceedings of the 13th Extended Semantic Web Conference: Challenges. pp. 228–240 (2016).
MLA
De Vocht, Laurens, et al. “Using Triple Pattern Fragments To Enable Streaming of Top-k Shortest Paths via the Web.” Proceedings of the 13th Extended Semantic Web Conference: Challenges, edited by Harald Sack et al., vol. 641, 2016, pp. 228–40.

Discuss this article