Advanced search
1 file | 1.14 MB Add to list

Continuous client-side query evaluation over dynamic linked data

Ruben Taelman (UGent) , Ruben Verborgh (UGent) , Pieter Colpaert (UGent) and Erik Mannens (UGent)
Author
Organization
Abstract
Existing solutions to query dynamic Linked Data sources extend the SPARQL language, and require continuous server processing for each query. Traditional SPARQL endpoints already accept highly expressive queries, so extending these endpoints for time-sensitive queries increases the server cost even further. To make continuous querying over dynamic Linked Data more affordable, we extend the low-cost Triple Pattern Fragments (TPF) interface with support for time-sensitive queries. In this paper, we introduce the TPF Query Streamer that allows clients to evaluate SPARQL queries with continuously updating results. Our experiments indicate that this extension significantly lowers the server complexity, at the expense of an increase in the execution time per query. We prove that by moving the complexity of continuously evaluating queries over dynamic Linked Data to the clients and thus increasing bandwidth usage, the cost at the server side is significantly reduced. Our results show that this solution makes real-time querying more scalable for a large amount of concurrent clients when compared to the alternatives.
Keywords
Linked Data, Linked Data Fragments, SPARQL, Continuous querying, Real-time querying, STREAMS

Downloads

  • 2016 - Ruben Taelman et al. - Continuous Client-Side Query Evaluation over Dynamic Linked Data.pdf
    • full text (Accepted manuscript)
    • |
    • open access
    • |
    • PDF
    • |
    • 1.14 MB

Citation

Please use this url to cite or link to this publication:

MLA
Taelman, Ruben, et al. “Continuous Client-Side Query Evaluation over Dynamic Linked Data.” SEMANTIC WEB, ESWC 2016, edited by Harald Sack et al., vol. 9989, Springer, 2016, pp. 273–89, doi:10.1007/978-3-319-47602-5_44.
APA
Taelman, R., Verborgh, R., Colpaert, P., & Mannens, E. (2016). Continuous client-side query evaluation over dynamic linked data. In H. Sack, G. Rizzo, N. Steinmetz, D. Mladenić, S. Auer, & C. Lange (Eds.), SEMANTIC WEB, ESWC 2016 (Vol. 9989, pp. 273–289). https://doi.org/10.1007/978-3-319-47602-5_44
Chicago author-date
Taelman, Ruben, Ruben Verborgh, Pieter Colpaert, and Erik Mannens. 2016. “Continuous Client-Side Query Evaluation over Dynamic Linked Data.” In SEMANTIC WEB, ESWC 2016, edited by Harald Sack, Giuseppe Rizzo, Nadine Steinmetz, Dunja Mladenić, Sören Auer, and Christoph Lange, 9989:273–89. Cham: Springer. https://doi.org/10.1007/978-3-319-47602-5_44.
Chicago author-date (all authors)
Taelman, Ruben, Ruben Verborgh, Pieter Colpaert, and Erik Mannens. 2016. “Continuous Client-Side Query Evaluation over Dynamic Linked Data.” In SEMANTIC WEB, ESWC 2016, ed by. Harald Sack, Giuseppe Rizzo, Nadine Steinmetz, Dunja Mladenić, Sören Auer, and Christoph Lange, 9989:273–289. Cham: Springer. doi:10.1007/978-3-319-47602-5_44.
Vancouver
1.
Taelman R, Verborgh R, Colpaert P, Mannens E. Continuous client-side query evaluation over dynamic linked data. In: Sack H, Rizzo G, Steinmetz N, Mladenić D, Auer S, Lange C, editors. SEMANTIC WEB, ESWC 2016. Cham: Springer; 2016. p. 273–89.
IEEE
[1]
R. Taelman, R. Verborgh, P. Colpaert, and E. Mannens, “Continuous client-side query evaluation over dynamic linked data,” in SEMANTIC WEB, ESWC 2016, Heraklion, Greece, 2016, vol. 9989, pp. 273–289.
@inproceedings{8503522,
  abstract     = {{Existing solutions to query dynamic Linked Data sources extend the SPARQL language, and require continuous server processing for each query. Traditional SPARQL endpoints already accept highly expressive queries, so extending these endpoints for time-sensitive queries increases the server cost even further. To make continuous querying over dynamic Linked Data more affordable, we extend the low-cost Triple Pattern Fragments (TPF) interface with support for time-sensitive queries. In this paper, we introduce the TPF Query Streamer that allows clients to evaluate SPARQL queries with continuously updating results. Our experiments indicate that this extension significantly lowers the server complexity, at the expense of an increase in the execution time per query. We prove that by moving the complexity of continuously evaluating queries over dynamic Linked Data to the clients and thus increasing bandwidth usage, the cost at the server side is significantly reduced. Our results show that this solution makes real-time querying more scalable for a large amount of concurrent clients when compared to the alternatives.}},
  author       = {{Taelman, Ruben and Verborgh, Ruben and Colpaert, Pieter and Mannens, Erik}},
  booktitle    = {{SEMANTIC WEB, ESWC 2016}},
  editor       = {{Sack, Harald and Rizzo, Giuseppe and Steinmetz, Nadine and Mladenić, Dunja and Auer, Sören and Lange, Christoph}},
  isbn         = {{9783319476018}},
  issn         = {{0302-9743}},
  keywords     = {{Linked Data,Linked Data Fragments,SPARQL,Continuous querying,Real-time querying,STREAMS}},
  language     = {{eng}},
  location     = {{Heraklion, Greece}},
  pages        = {{273--289}},
  publisher    = {{Springer}},
  title        = {{Continuous client-side query evaluation over dynamic linked data}},
  url          = {{http://dx.doi.org/10.1007/978-3-319-47602-5_44}},
  volume       = {{9989}},
  year         = {{2016}},
}

Altmetric
View in Altmetric
Web of Science
Times cited: