[Profile picture of Ruben Verborgh]

Ruben Verborgh

Low-Cost Queryable Linked Data through Triple Pattern Fragments

Ruben Verborgh, Olaf Hartig, Ben De Meester, Gerald Haesendonck, Laurens De Vocht, Miel Vander Sande, Richard Cyganiak, Pieter Colpaert, Erik Mannens, and Rik Van de Walle

For publishers of Linked Open Data, providing queryable access to their dataset is costly. Those that offer a public SPARQL end-point often have to sacrifice high availability; others merely provide non-queryable means of access such as data dumps. We have developed a client-side query execution approach for which servers only need to provide a lightweight triple-pattern-based interface, enabling queryable access at low cost. This paper describes the implementation of a client that can evaluate SPARQL queries over such triple pattern fragments of a Linked Data dataset. Graph patterns of SPARQL queries can be solved efficiently by using metadata in server responses. The demonstration consists of SPARQL client for triple pattern fragments that can run as a standalone application, browser application, or library.

full text BibTeX other citation formats

Published in 2014 in Proceedings of the 13th International Semantic Web Conference: Posters and Demos.

Keywords:

Read this article online

Cite this article in your work

Cite this article easily using its BibTeX entry: 

@inproceedings{verborgh_iswc_demo_2014,
  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 = {Proceedings of the 13th International Semantic Web Conference: Posters and Demos},
  title = {Low-Cost Queryable {Linked Data} through {Triple Pattern Fragments}},
  year = 2014,
  month = oct,
  series = {CEUR Workshop Proceedings},
  volume = 1272,
  issn = {1613-0073},
  pages = {13--16},
  url = {http://ceur-ws.org/Vol-1272/paper_10.pdf},
}

Alternatively, pick a reference of your choice below:

ACM
Ruben Verborgh, 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. Low-Cost Queryable Linked Data through Triple Pattern Fragments. In Proceedings of the 13th International Semantic Web Conference: Posters and Demos (CEUR Workshop Proceedings), 13–16.
APA
Verborgh, R., Hartig, O., De Meester, B., Haesendonck, G., De Vocht, L., Vander Sande, M., Cyganiak, R., Colpaert, P., Mannens, E., & Van de Walle, R. (2014). Low-Cost Queryable Linked Data through Triple Pattern Fragments. Proceedings of the 13th International Semantic Web Conference: Posters and Demos, 1272, 13–16.
IEEE
R. Verborgh et al., “Low-Cost Queryable Linked Data through Triple Pattern Fragments,” in Proceedings of the 13th International Semantic Web Conference: Posters and Demos, 2014, vol. 1272, pp. 13–16.
LNCS
Verborgh, R., Hartig, O., De Meester, B., Haesendonck, G., De Vocht, L., Vander Sande, M., Cyganiak, R., Colpaert, P., Mannens, E., Van de Walle, R.: Low-Cost Queryable Linked Data through Triple Pattern Fragments. In: Proceedings of the 13th International Semantic Web Conference: Posters and Demos. pp. 13–16 (2014).
MLA
Verborgh, Ruben, et al. “Low-Cost Queryable Linked Data through Triple Pattern Fragments.” Proceedings of the 13th International Semantic Web Conference: Posters and Demos, vol. 1272, 2014, pp. 13–16.

Discuss this article