Threshold Queries in Theory and in the Wild - Archive ouverte HAL Access content directly
Journal Articles Proceedings of the VLDB Endowment (PVLDB) Year : 2022

Threshold Queries in Theory and in the Wild

Angela Bonifati
Jan Hidders
  • Function : Author
  • PersonId : 999575
Matthias Hofer
Filip Murlak
  • Function : Author
  • PersonId : 962357
Joshua Shinavier
  • Function : Author
Slawomir Staworko


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. In this paper, we present a deep theoretical analysis of threshold query evaluation and show that thresholds can be used to significantly improve the asymptotic bounds of state-of-the-art query evaluation algorithms. We also empirically show that threshold queries are significant in practice. In surprising contrast to conventional wisdom, we found important scenarios in real-world data sets in which users are interested in computing the results of queries up to a certain threshold, independent of a ranking function that orders the query results.
Fichier principal
Vignette du fichier
staworko-vldb22.pdf (639.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03516360 , version 1 (06-02-2022)



Angela Bonifati, Stefania Dumbrava, George Fletcher, Jan Hidders, Matthias Hofer, et al.. Threshold Queries in Theory and in the Wild. Proceedings of the VLDB Endowment (PVLDB), 2022, 15 (5), pp.1105-1118. ⟨10.14778/3510397.3510407⟩. ⟨hal-03516360⟩
122 View
105 Download



Gmail Facebook Twitter LinkedIn More