Online approximative SPARQL query processing for COUNT-DISTINCT queries with Web Preemption - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Semantic Web – Interoperability, Usability, Applicability Année : 2022

Online approximative SPARQL query processing for COUNT-DISTINCT queries with Web Preemption

Résumé

Getting complete results when processing aggregate queries on public SPARQL endpoints is a challenge, mainly due to the application of quotas. Although Web preemption allows processing aggregate queries online, on preemptable SPARQL servers, data transfer is still very large when processing count-distinct aggregate queries. In this paper, it is shown that countdistinct aggregate queries can be approximated with low data transfer by extending the partial aggregation operator with Hyper-LogLog++ sketches. Experimental results demonstrate that the proposed approach outperforms existing approaches by orders of magnitude in terms of the amount of data transferred.
Fichier principal
Vignette du fichier
swj2842.pdf (607.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03563595 , version 1 (09-02-2022)

Identifiants

  • HAL Id : hal-03563595 , version 1

Citer

Julien Aimonier-Davat, Hala Skaf-Molli, Pascal Molli, Arnaud Grall, Thomas Minier. Online approximative SPARQL query processing for COUNT-DISTINCT queries with Web Preemption. Semantic Web – Interoperability, Usability, Applicability, 2022. ⟨hal-03563595⟩
69 Consultations
73 Téléchargements

Partager

Gmail Facebook X LinkedIn More