Advanced search
1 file | 739.57 KB Add to list

Continuously self-updating query results over dynamic heterogeneous linked data

Ruben Taelman (UGent)
Author
Organization
Abstract
Our society is evolving towards massive data consumption from heterogeneous sources, which includes rapidly changing data like public transit delay information. Many applications that depend on dynamic data consumption require highly available server interfaces. Existing interfaces involve substantial costs to publish rapidly changing data with high availability, and are therefore only possible for organisations that can afford such an expensive infrastructure. In my doctoral research, I investigate how to publish and consume real-time and historical Linked Data on a large scale. To reduce server-side costs for making dynamic data publication affordable, I will examine different possibilities to divide query evaluation between servers and clients. This paper discusses the methods I aim to follow together with preliminary results and the steps required to use this solution. An initial prototype achieves significantly lower server processing cost per query, while maintaining reasonable query execution times and client costs. Given these promising results, I feel confident this research direction is a viable solution for offering low-cost dynamic Linked Data interfaces as opposed to the existing high-cost solutions.
Keywords
sparql, Continuous querying, Triple Pattern Fragments, Linked Data, WEB, STREAMS, SPARQL, Real-time querying

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 739.57 KB

Citation

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

MLA
Taelman, Ruben. “Continuously Self-updating Query Results over Dynamic Heterogeneous Linked Data.” Semantic Web : Latest Advances and New Domains. Vol. 9678. Cham, Switzerland: Springer, 2016. 863–872. Print.
APA
Taelman, R. (2016). Continuously self-updating query results over dynamic heterogeneous linked data. Semantic web : latest advances and new domains (Vol. 9678, pp. 863–872). Presented at the 13th European Semantic Web Conference (ESWC), Cham, Switzerland: Springer.
Chicago author-date
Taelman, Ruben. 2016. “Continuously Self-updating Query Results over Dynamic Heterogeneous Linked Data.” In Semantic Web : Latest Advances and New Domains, 9678:863–872. Cham, Switzerland: Springer.
Chicago author-date (all authors)
Taelman, Ruben. 2016. “Continuously Self-updating Query Results over Dynamic Heterogeneous Linked Data.” In Semantic Web : Latest Advances and New Domains, 9678:863–872. Cham, Switzerland: Springer.
Vancouver
1.
Taelman R. Continuously self-updating query results over dynamic heterogeneous linked data. Semantic web : latest advances and new domains. Cham, Switzerland: Springer; 2016. p. 863–72.
IEEE
[1]
R. Taelman, “Continuously self-updating query results over dynamic heterogeneous linked data,” in Semantic web : latest advances and new domains, Heraklion, Greece, 2016, vol. 9678, pp. 863–872.
@inproceedings{8048658,
  abstract     = {Our society is evolving towards massive data consumption from heterogeneous sources, which includes rapidly changing data like public transit delay information. Many applications that depend on dynamic data consumption require highly available server interfaces. Existing interfaces involve substantial costs to publish rapidly changing data with high availability, and are therefore only possible for organisations that can afford such an expensive infrastructure. In my doctoral research, I investigate how to publish and consume real-time and historical Linked Data on a large scale. To reduce server-side costs for making dynamic data publication affordable, I will examine different possibilities to divide query evaluation between servers and clients. This paper discusses the methods I aim to follow together with preliminary results and the steps required to use this solution. An initial prototype achieves significantly lower server processing cost per query, while maintaining reasonable query execution times and client costs. Given these promising results, I feel confident this research direction is a viable solution for offering low-cost dynamic Linked Data interfaces as opposed to the existing high-cost solutions.},
  author       = {Taelman, Ruben},
  booktitle    = {Semantic web : latest advances and new domains},
  isbn         = {9783319341286},
  issn         = {0302-9743},
  keywords     = {sparql,Continuous querying,Triple Pattern Fragments,Linked Data,WEB,STREAMS,SPARQL,Real-time querying},
  language     = {eng},
  location     = {Heraklion, Greece},
  pages        = {863--872},
  publisher    = {Springer},
  title        = {Continuously self-updating query results over dynamic heterogeneous linked data},
  url          = {http://dx.doi.org/10.1007/978-3-319-34129-3_55},
  volume       = {9678},
  year         = {2016},
}

Altmetric
View in Altmetric
Web of Science
Times cited: