Advertisement

Interactive Comparison of Triple Pattern Fragments Query Approaches

  • Joachim Van Herwegen
  • Ruben Verborgh
  • Erik Mannens
  • Rik Van de Walle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9341)

Abstract

In order to reduce the server-side cost of publishing queryable Linked Data, Triple Pattern Fragments (tpf) were introduced as a simple interface to rdf triples. They allow for sparql query execution at low server cost, by partially shifting the load from servers to clients. The previously proposed query execution algorithm provides a solution that is highly inefficient, often requiring an amount of http calls that is magnitudes larger than the optimal solution. We have proposed a new query execution algorithm with the aim to solve this problem. Our solution significantly improves on the current work by maintaining a complete overview of the query instead of just looking at local optima. In this paper, we describe a demo that allows a user to easily compare the results of both implementations. We show both query results and number of executed http calls, proving a clear picture of the difference between the two algorithms.

Keywords

Linked data sparql Query execution Query optimization Demo 

References

  1. 1.
    Buil-Aranda, C., Hogan, A., Umbrich, J., Vandenbussche, P.-Y.: SPARQL web-querying infrastructure: ready for action? In: Alani, H., et al. (eds.) ISWC 2013, Part II. LNCS, vol. 8219, pp. 277–293. Springer, Heidelberg (2013). http://link.springer.com/chapter/10.1007/978-3-642-41338-4_18CrossRefGoogle Scholar
  2. 2.
    Harris, S., Seaborne, A.: SPARQL 1.1 query language. Recommendation, World Wide Web Consortium, March 2013. http://www.w3.org/TR/sparql11-query/
  3. 3.
    Schmachtenberg, M., Bizer, C., Paulheim, H.: Adoption of the linked data best practices in different topical domains. In: Mika, P., et al. (eds.) ISWC 2014, Part I. LNCS, vol. 8796, pp. 245–260. Springer, Heidelberg (2014). http://dx.doi.org/10.1007/978-3-319-11964-9_16Google Scholar
  4. 4.
    Van Herwegen, J., Verborgh, R., Mannens, E., Van de Walle, R.: Query execution optimization for clients of triple pattern fragments. In: Gandon, F., Sabou, M., Sack, H., d’Amato, C., Cudré-Mauroux, P., Zimmermann, A. (eds.) ESWC 2015. LNCS, vol. 9088, pp. 302–318. Springer, Heidelberg (2015) CrossRefGoogle Scholar
  5. 5.
    Verborgh, R., Vander Sande, M., Colpaert, P., Coppens, S., Mannens, E., Van de Walle, R.: Web-scale querying through linked data fragments. In: Proceedings of the 7th Workshop on Linked Data on the Web, April 2014. http://events.linkeddata.org/ldow2014/papers/ldow2014_paper_04.pdf

Copyright information

© Springer International Publishing Switzerland 2015

Open Access This chapter is distributed under the terms of the Creative Commons Attribution Noncommercial License, which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

Authors and Affiliations

  • Joachim Van Herwegen
    • 1
  • Ruben Verborgh
    • 1
  • Erik Mannens
    • 1
  • Rik Van de Walle
    • 1
  1. 1.Multimedia Lab – Ghent University – iMindsLedeberg-GhentBelgium

Personalised recommendations