Online approximative SPARQL query processing for COUNT-DISTINCT queries with web preemption

Semantic web

article

Julien Aimonier-Davat¹  Hala Skaf-Molli¹  Pascal Molli¹  Arnaud Grall¹  Thomas Minier¹ 

[1] LS2N, University of Nantes

关键词: Semantic web;    SPARQL;    aggregate queries;    web preemption;    public SPARQL endpoints;   

DOI  :  10.3233/SW-222842

来源: IOS Press

【 摘 要 】

Getting complete results when processing aggregate queries on public SPARQL endpoints is challenging, mainly due to the application of quotas. Although Web preemption supports processing of 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 count-distinct aggregate queries can be approximated with low data transfer by extending the partial aggregation operator with HyperLogLog++ sketches. Experimental results demonstrate that the proposed approach outperforms existing approaches by orders of magnitude in terms of the amount of data transferred.

【 授权许可】

Unknown