Skip to Main content Skip to Navigation
Theses

Web Preemption for Querying the Linked Open Data

Abstract : Following the Linked Open Data principles, data providers have published billions of RDF documents using public SPARQL query services. To ensure these services remain stable and responsive, they enforce quotas on server usage. Queries which exceed these quotas are interrupted and deliver partial results. Such interruption is not an issue if it is possible to resume queries execution afterward. Unfortunately, there is no preemption model for the Web that allows for suspending and resuming SPARQL queries. In this thesis, we propose to tackle the issue of building public SPARQL query servers that allow any data consumer to execute any SPARQL query with complete results. First, we propose a new query execution model called Web Preemption. It allows SPARQL queries to be suspended by the Web server after a fixed time quantum and resumed upon client request. Web preemption is tractable only if its cost in time is negligible compared to the time quantum. Thus, we propose SaGe: a SPARQL query engine that implements Web Preemption with minimal overhead. Experimental results demonstrate that SaGe outperforms existing SPARQL query processing approaches by several orders of magnitude in terms of the average total query execution time and the time for first results.
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-03103600
Contributor : Thomas Minier <>
Submitted on : Friday, January 8, 2021 - 11:25:16 AM
Last modification on : Tuesday, February 2, 2021 - 3:52:50 PM
Long-term archiving on: : Friday, April 9, 2021 - 6:44:15 PM

File

Thesis.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : tel-03103600, version 1

Citation

Thomas Minier. Web Preemption for Querying the Linked Open Data. Web. Université de Nantes - Faculté des Sciences et Techniques, 2020. English. ⟨tel-03103600⟩

Share

Metrics

Record views

92

Files downloads

193