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
Scheduling Refresh Queries for Keeping Results from a SPARQL Endpoint Up-to-Date
Hasso Plattner Institute, University of PotsdamPotsdamGermany.
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.
2016 (English)In: On the Move to Meaningful Internet Systems: OTM 2016 Conferences, 2016, Vol. 10033, p. 780-791Conference paper, Published paper (Refereed)
Abstract [en]

Many datasets change over time. As a consequence, long-running applications that cache and repeatedly use query results obtained from a SPARQL endpoint may resubmit the queries regularly to ensure up-to-dateness of the results. While this approach may be feasible if the number of such regular refresh queries is manageable, with an increasing number of applications adopting this approach, the SPARQL endpoint may become overloaded with such refresh queries. A more scalable approach would be to use a middle-ware component at which the applications register their queries and get notified with updated query results once the results have changed. Then, this middle-ware can schedule the repeated execution of the refresh queries without overloading the endpoint. In this paper, we study the problem of scheduling refresh queries for a large number of registered queries by assuming an overload-avoiding upper bound on the length of a regular time slot available for testing refresh queries. We investigate a variety of scheduling strategies and compare them experimentally in terms of time slots needed before they recognize changes and number of changes that they miss.

Place, publisher, year, edition, pages
2016. Vol. 10033, p. 780-791
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-134277DOI: 10.1007/978-3-319-48472-3_49ISI: 000390177800049ISBN: 9783319484723 (print)OAI: oai:DiVA.org:liu-134277DiVA, id: diva2:1070860
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
Note

Funding agencies: Funded by grants from the German Government, Federal Ministry of Education and Research for the project D-Werft (03WKCJ4D).

Available from: 2017-02-02 Created: 2017-02-02 Last updated: 2018-01-13

Open Access in DiVA

fulltext(287 kB)93 downloads
File information
File name FULLTEXT01.pdfFile size 287 kBChecksum SHA-512
a6bec6b98aaf676b4ff0ca494228b4eee50809d04cd1563393382631730a27b132b81ca97124c586a7dea4f99debd7d4fc97a22446ecc77fd3c8c83f31954a45
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: 93 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: 51 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