{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T19:31:06Z","timestamp":1769283066283,"version":"3.49.0"},"reference-count":26,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T00:00:00Z","timestamp":1653955200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SW"],"published-print":{"date-parts":[[2022,5,31]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3233\/sw-222842","type":"journal-article","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T11:17:20Z","timestamp":1653650240000},"page":"735-755","source":"Crossref","is-referenced-by-count":2,"title":["Online approximative SPARQL query processing for COUNT-DISTINCT queries with web preemption"],"prefix":"10.1177","volume":"13","author":[{"given":"Julien","family":"Aimonier-Davat","sequence":"first","affiliation":[{"name":"LS2N, University of Nantes, France"}]},{"given":"Hala","family":"Skaf-Molli","sequence":"additional","affiliation":[{"name":"LS2N, University of Nantes, France"}]},{"given":"Pascal","family":"Molli","sequence":"additional","affiliation":[{"name":"LS2N, University of Nantes, France"}]},{"given":"Arnaud","family":"Grall","sequence":"additional","affiliation":[{"name":"LS2N, University of Nantes, France"}]},{"given":"Thomas","family":"Minier","sequence":"additional","affiliation":[{"name":"LS2N, University of Nantes, France"}]}],"member":"179","reference":[{"key":"10.3233\/SW-222842_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33876-2_31"},{"key":"10.3233\/SW-222842_ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380177"},{"key":"10.3233\/SW-222842_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11915-1_25"},{"key":"10.3233\/SW-222842_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02184-8_2"},{"key":"10.3233\/SW-222842_ref5","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948225"},{"key":"10.3233\/SW-222842_ref6","doi-asserted-by":"publisher","DOI":"10.5555\/1450931"},{"key":"10.3233\/SW-222842_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-49461-2_14"},{"issue":"3","key":"10.3233\/SW-222842_ref8","doi-asserted-by":"publisher","first-page":"134","DOI":"10.4018\/IJSWIS.2016070105","article-title":"SPORTAL: Profiling the content of public SPARQL endpoints","volume":"12","author":"Hasnain","year":"2016","journal-title":"International Journal on Semantic Web and Information Systems (IJSWIS)"},{"key":"10.3233\/SW-222842_ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452456"},{"issue":"1","key":"10.3233\/SW-222842_ref10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/COMST.2014.2354398","article-title":"A survey of distributed data aggregation algorithms","volume":"17","author":"Jesus","year":"2014","journal-title":"IEEE Communications Surveys & Tutorials"},{"issue":"3","key":"10.3233\/SW-222842_ref11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3083898","article-title":"Query nesting, assignment, and aggregation in SPARQL 1.1","volume":"42","author":"Kaminski","year":"2017","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"4","key":"10.3233\/SW-222842_ref12","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s41019-018-0074-4","article-title":"Approximate query processing: What is new and where to go?","volume":"3","author":"Li","year":"2018","journal-title":"Data Science and Engineering"},{"key":"10.3233\/SW-222842_ref13","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.3545"},{"key":"10.3233\/SW-222842_ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313652"},{"issue":"3","key":"10.3233\/SW-222842_ref15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1567274.1567278","article-title":"Semantics and complexity of SPARQL","volume":"34","author":"P\u00e9rez","year":"2009","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"10.3233\/SW-222842_ref16","doi-asserted-by":"publisher","DOI":"10.14778\/2977797.2977806"},{"key":"10.3233\/SW-222842_ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1804669.1804675"},{"key":"10.3233\/SW-222842_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.104987"},{"key":"10.3233\/SW-222842_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30793-6_33"},{"key":"10.3233\/SW-222842_ref20","unstructured":"H.\u00a0Steve and S.\u00a0Andy, SPARQL 1.1 query language, in: Recommendation W3C, 2013."},{"key":"10.3233\/SW-222842_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00668-6_15"},{"key":"10.3233\/SW-222842_ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319897"},{"key":"10.3233\/SW-222842_ref23","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.websem.2016.03.003","article-title":"Triple pattern fragments: A low-cost knowledge graph interface for the web","volume":"37","author":"Verborgh","year":"2016","journal-title":"Journal of Web Semantics"},{"issue":"2","key":"10.3233\/SW-222842_ref24","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/78922.78925","article-title":"A linear-time probabilistic counting algorithm for database applications","volume":"15","author":"Whang","year":"1990","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"10.3233\/SW-222842_ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745870"},{"key":"10.3233\/SW-222842_ref26","unstructured":"W.P.\u00a0Yan and P.B.\u00a0Larson, Eager aggregation and lazy aggregation, Group 1 (1995), G2."}],"container-title":["Semantic Web"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SW-222842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T11:01:12Z","timestamp":1756206072000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SW-222842"}},"subtitle":[],"editor":[{"given":"Sabrina","family":"Kirrane","sequence":"additional","affiliation":[{"name":"Vienna University of Economics and Business, Austria"}]},{"given":"Axel-Cyrille","family":"Ngonga Ngomo","sequence":"additional","affiliation":[{"name":"Paderborn University, Germany"}]}],"short-title":[],"issued":{"date-parts":[[2022,5,31]]},"references-count":26,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/sw-222842","relation":{},"ISSN":["2210-4968","1570-0844"],"issn-type":[{"value":"2210-4968","type":"electronic"},{"value":"1570-0844","type":"print"}],"subject":[],"published":{"date-parts":[[2022,5,31]]}}}