Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Bindings-restricted triple pattern fragments
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering. Hasso Plattner Institute, University of Potsdam, Potsdam, Germany.
Informatics Department, Universidad Técnica Federico Santa María, Valparaíso, Chile.
2016 (English)In: On the Move to Meaningful Internet Systems: OTM 2016 Conferences, Springer Berlin/Heidelberg, 2016, Vol. 10033, p. 762-769Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2016. Vol. 10033, p. 762-769
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 10033
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:liu:diva-134276DOI: 10.1007/978-3-319-48472-3_48ISI: 000390177800048ISBN: 9783319484723 (print)OAI: oai:DiVA.org:liu-134276DiVA, id: diva2:1070854
Conference
Confederated International Conference On the Move to Meaningful Internet Systems, OTM 2016 held in conjunction with Conferences on CoopIS,Rhodes; Greece 24-28 oct 2016
Available from: 2017-02-02 Created: 2017-02-02 Last updated: 2018-01-13

Open Access in DiVA

fulltext(819 kB)31 downloads
File information
File name FULLTEXT01.pdfFile size 819 kBChecksum SHA-512
9ad93aa152b77dac509b3493006d7ecc20947ad16362fa137be8cd8bfd68826707b987f085a3caf49fb3d03fa84babc53df7cff38c1c36a2dc981b59d658f342
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Hartig, Olaf
By organisation
Database and information techniquesFaculty of Science & Engineering
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 31 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 44 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf