Bonifati, A. and Dumbrava, S. and Fletcher, G. and Hidders, Jan and Hofer, M. and Martens, W. and Murlak, F. and Shinavier, J. and Staworko, S. and Tomaszuk, D. (2023) Threshold Queries. SIGMOD Record 52 (1), pp. 64-73. ISSN 0163-5808.
|
Text
SIGMOD_Research_Highlight__Threshold_Queries.pdf - Author's Accepted Manuscript Available under License Creative Commons Attribution. Download (474kB) | Preview |
Abstract
Threshold queries are an important class of queries that only require computing or counting answers up to a specified threshold value. To the best of our knowledge, threshold queries have been largely disregarded in the research literature, which is surprising considering how common they are in practice. We explore how such queries appear in practice and present a method that can be used to significantly improve the asymptotic bounds of their state-of-the-art evaluation algorithms. Our experimental evaluation of these methods shows order-of-magnitude performance improvements.
Metadata
Item Type: | Article |
---|---|
School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
Research Centres and Institutes: | Birkbeck Knowledge Lab |
Depositing User: | Jan Hidders |
Date Deposited: | 09 May 2024 12:36 |
Last Modified: | 09 May 2024 15:29 |
URI: | https://eprints.bbk.ac.uk/id/eprint/53499 |
Statistics
Additional statistics are available via IRStats2.