Advanced search
1 file | 1.13 MB Add to list

Querying datasets on the web with high availability

Author
Organization
Abstract
As the Web of Data is growing at an ever increasing speed, the lack of reliable query solutions for live public data becomes apparent. SPARQL implementations have matured and deliver impressive performance for public SPARQL endpoints, yet poor availability-especially under high loads-prevents their use in real-world applications. We propose to tackle this availability problem by defining triple pattern fragments, a specific kind of Linked Data Fragments that enable low-cost publication of queryable data by moving intelligence from the server to the client. This paper formalizes the Linked Data Fragments concept, introduces a client-side SPARQL query processing algorithm that uses a dynamic iterator pipeline, and verifies servers' availability under load. The results indicate that, at the cost of lower performance, query techniques with triple pattern fragments lead to high availability, thereby allowing for reliable applications on top of public, queryable Linked Data.
Keywords
Linked Data, Linked Data Fragments, querying, scalability, availability, sparql

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 1.13 MB

Citation

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

MLA
Verborgh, Ruben, et al. “Querying Datasets on the Web with High Availability.” Lecture Notes in Computer Science, vol. 8796, Springer, 2014, pp. 180–96.
APA
Verborgh, R., Hartig, O., De Meester, B., Haesendonck, G., De Vocht, L., Vander Sande, M., … Van de Walle, R. (2014). Querying datasets on the web with high availability. Lecture Notes in Computer Science, 8796, 180–196. Springer.
Chicago author-date
Verborgh, Ruben, Olaf Hartig, Ben De Meester, Gerald Haesendonck, Laurens De Vocht, Miel Vander Sande, Richard Cyganiak, Pieter Colpaert, Erik Mannens, and Rik Van de Walle. 2014. “Querying Datasets on the Web with High Availability.” In Lecture Notes in Computer Science, 8796:180–96. Springer.
Chicago author-date (all authors)
Verborgh, Ruben, Olaf Hartig, Ben De Meester, Gerald Haesendonck, Laurens De Vocht, Miel Vander Sande, Richard Cyganiak, Pieter Colpaert, Erik Mannens, and Rik Van de Walle. 2014. “Querying Datasets on the Web with High Availability.” In Lecture Notes in Computer Science, 8796:180–196. Springer.
Vancouver
1.
Verborgh R, Hartig O, De Meester B, Haesendonck G, De Vocht L, Vander Sande M, et al. Querying datasets on the web with high availability. In: Lecture Notes in Computer Science. Springer; 2014. p. 180–96.
IEEE
[1]
R. Verborgh et al., “Querying datasets on the web with high availability,” in Lecture Notes in Computer Science, Riva Del Garda, Italy, 2014, vol. 8796, pp. 180–196.
@inproceedings{5974339,
  abstract     = {{As the Web of Data is growing at an ever increasing speed, the lack of reliable query solutions for live public data becomes apparent. SPARQL implementations have matured and deliver impressive performance for public SPARQL endpoints, yet poor availability-especially under high loads-prevents their use in real-world applications. We propose to tackle this availability problem by defining triple pattern fragments, a specific kind of Linked Data Fragments that enable low-cost publication of queryable data by moving intelligence from the server to the client. This paper formalizes the Linked Data Fragments concept, introduces a client-side SPARQL query processing algorithm that uses a dynamic iterator pipeline, and verifies servers' availability under load. The results indicate that, at the cost of lower performance, query techniques with triple pattern fragments lead to high availability, thereby allowing for reliable applications on top of public, queryable Linked Data.}},
  author       = {{Verborgh, Ruben and Hartig, Olaf and De Meester, Ben and Haesendonck, Gerald and De Vocht, Laurens and Vander Sande, Miel and Cyganiak, Richard and Colpaert, Pieter and Mannens, Erik and Van de Walle, Rik}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{978-3-319-11964-9}},
  issn         = {{0302-9743}},
  keywords     = {{Linked Data,Linked Data Fragments,querying,scalability,availability,sparql}},
  language     = {{eng}},
  location     = {{Riva Del Garda, Italy}},
  pages        = {{180--196}},
  publisher    = {{Springer}},
  title        = {{Querying datasets on the web with high availability}},
  url          = {{http://linkeddatafragments.org/publications/iswc2014.pdf}},
  volume       = {{8796}},
  year         = {{2014}},
}

Web of Science
Times cited: