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
kirrane-et-al-2022-online-approximative-sparql-query-processing-for-count-distinct-queries-with-web-preemption.pdf (599.56 Ko) Télécharger le fichier
swj2842.pdf (607.62 Ko) Télécharger le fichier
Origine Publication financée par une institution
Licence
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

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

Licence

Identifiants

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, 13 (Issue 4), pp.735-755. ⟨10.3233/sw-222842⟩. ⟨hal-03563595⟩
253 Consultations
302 Téléchargements

Altmetric

Partager

  • More