nach oben

Erschienen in:

2016 | OriginalPaper | Buchkapitel

Bindings-Restricted Triple Pattern Fragments

verfasst von : Olaf Hartig, Carlos Buil-Aranda

Erschienen in: On the Move to Meaningful Internet Systems: OTM 2016 Conferences

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

The Triple Pattern Fragment (TPF) interface is a recent proposal for reducing server load in Web-based approaches to execute SPARQL queries over public RDF datasets. The price for less overloaded servers is a higher client-side load and a substantial increase in network load (in terms of both the number of HTTP requests and data transfer). In this paper, we propose a slightly extended interface that allows clients to attach intermediate results to triple pattern requests. The response to such a request is expected to contain triples from the underlying dataset that do not only match the given triple pattern (as in the case of TPF), but that are guaranteed to contribute in a join with the given intermediate result. Our hypothesis is that a distributed query execution using this extended interface can reduce the network load (in comparison to a pure TPF-based query execution) without reducing the overall throughput of the client-server system significantly. Our main contribution in this paper is twofold: we empirically verify the hypothesis and provide an extensive experimental comparison of our proposal and TPF.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel FuhSen: A Federated Hybrid Search Engine for Building a Knowledge Graph On-Demand (Short Paper)

Nächstes Kapitel Scheduling Refresh Queries for Keeping Results from a SPARQL Endpoint Up-to-Date (Short Paper)

http://olafhartig.de/brTPF-ODBASE2016.

https://jena.apache.org/documentation/serving_data/.

http://virtuoso.openlinksw.com/.

https://jena.apache.org/documentation/tdb/.

https://github.com/LinkedDataFragments/Server.Java.

http://dsg.uwaterloo.ca/watdiv/.

https://cs.uwaterloo.ca/~galuc/watdiv/stress-workloads.tar.gz.

We do not increase maxMpR beyond a value of 50 because the client prototype uses the HTTP method GET, which causes problems for our server if maxMpR > 50; that is, in preliminary tests with greater values we observed server responses with status code 414 (URI Too Long).

We also tried to conduct a comparison between TPF/brTPF and a Virtuoso-based SPARQL endpoint. Unfortunately, as detailed in [11, Appendix A], the Virtuoso server failed to correctly serve multiple concurrent clients in our experimental setup.

Although the #hits is higher for maxMpR \(=\) 15 than for maxMpR \(=\) 30 (cf. Sect. 7.1), the former achieves a smaller hit rate because it has a higher #req (cf. Sect. 5.3).

Acosta, M., Vidal, M.-E.: Networks of linked data eddies: an adaptive web query processing engine for RDF data. In: Marcelo, A., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 111–127. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25007-6_7 CrossRef

Aluç, G., Hartig, O., Özsu, M.T., Daudjee, K.: Diversified stress testing of RDF data management systems. In: Mika, P., et al. (eds.) ISWC 2014, Part I. LNCS, vol. 8796, pp. 197–212. Springer, Heidelberg (2014)

Bizer, C., Eckert, K., Meusel, R., Mühleisen, H., Schuhmacher, M., Völker, J.: Deployment of RDFa, microdata, and microformats on the web – a quantitative analysis. In: Alani, H., et al. (eds.) ISWC 2013. LNCS, vol. 8219, pp. 17–32. Springer, Heidelberg (2013). doi:10.1007/978-3-642-41338-4_2 CrossRef

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. LNCS, vol. 8219, pp. 277–293. Springer, Heidelberg (2013). doi:10.1007/978-3-642-41338-4_18 CrossRef

Cyganiak, R., Wood, D., Lanthaler, M.: RDF 1.1 concepts and abstract syntax. W3C Recommendation, February 2014

Feigenbaum, L., Williams, G.T.: SPARQL protocol for RDF. W3C Recommendation (2013)

Fernández, J.D., Martínez-Prieto, M.A., Gutiérrez, C., Polleres, A., Arias, M.: Binary RDF representation for publication and exchange (HDT). Web Semant. Sci. Serv. Agents World Wide Web 19, 22–41 (2013)CrossRef

Haas, L.M., Kossmann, D., Wimmers, E.L., Yang, J.: Optimizing queries across diverse data sources. In: Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB) (1997)

Harris, S., Seaborne, A.: SPARQL 1.1 query language. W3C Recommendation (2013)

10.

Hartig, O., Bizer, C., Freytag, J.-C.: Executing SPARQL queries over the web of linked data. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 293–309. Springer, Heidelberg (2009)CrossRef

11.

Hartig, O., Buil-Aranda, C.: brTPF: bindings-restricted triple pattern fragments (Extended Version). CoRR abs/1608.08148 (2016)

12.

Mika, P., Potter, T.: Metadata statistics for a large web corpus. In: Proceedings of the 5th Linked Data on the Web Workshop (LDOW) (2012)

13.

Montoya, G., Skaf-Molli, H., Molli, P., Vidal, M.-E.: Federated SPARQL queries processing with replicated fragments. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 36–51. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25007-6_3 CrossRef

14.

Pérez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. ACM Trans. Database Syst. 34(3), 16 (2009)CrossRef

15.

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. LNCS, vol. 8796, pp. 245–260. Springer, Heidelberg (2014). doi:10.1007/978-3-319-11964-9_16

16.

Herwegen, J., Vocht, L., Verborgh, R., Mannens, E., Walle, R.: Substring filtering for low-cost linked data interfaces. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 128–143. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25007-6_8 CrossRef

17.

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)CrossRef

18.

Sande, M., Verborgh, R., Herwegen, J., Mannens, E., Walle, R.: Opportunistic linked data querying through approximate membership metadata. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 92–110. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25007-6_6 CrossRef

19.

Verborgh, R., et al.: Querying datasets on the web with high availability. In: Mika, P., et al. (eds.) ISWC 2014. LNCS, vol. 8796, pp. 180–196. Springer, Heidelberg (2014). doi:10.1007/978-3-319-11964-9_12

20.

Verborgh, R., Vander Sande, M., Hartig, O., Van Herwegen, J., De Vocht, L., De Meester, B., Haesendonck, G., Colpaert, P.: Triple pattern fragments: a low-cost knowledge graph interface for the web. J. Web Semant. 37–38, 184–206 (2016)CrossRef

Titel: Bindings-Restricted Triple Pattern Fragments
verfasst von: Olaf Hartig
Carlos Buil-Aranda
Verlag: Springer International Publishing
Buch: On the Move to Meaningful Internet Systems: OTM 2016 Conferences
Print ISBN: 978-3-319-48471-6

Electronic ISBN: 978-3-319-48472-3

Copyright-Jahr: 2016
DOI: https://doi.org/10.1007/978-3-319-48472-3_48

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"