Threshold Queries

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.

[1]  Jan Hidders,et al.  Threshold Queries in Theory and in the Wild , 2021, Proc. VLDB Endow..

[2]  M. Arenas,et al.  When is approximate counting for conjunctive queries tractable? , 2020, STOC.

[3]  Nicole Schweikardt,et al.  Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width , 2020, MFCS.

[4]  Filip Murlak,et al.  On the semantics of Cypher's implicit group-by , 2019, DBPL.

[5]  Wim Martens,et al.  Navigating the Maze of Wikidata Query Logs , 2019, WWW.

[6]  Markus Krötzsch,et al.  Getting the Most Out of Wikidata: Semantic Technology Usage in Wikipedia's Knowledge Graph , 2018, SEMWEB.

[7]  P. Boncz,et al.  Query optimization through the looking glass, and what we found running the Join Order Benchmark , 2018, The VLDB Journal.

[8]  Feifei Li,et al.  Random Sampling over Joins Revisited , 2018, SIGMOD Conference.

[9]  Shaleen Deep,et al.  Compressed Representations of Conjunctive Query Results , 2017, PODS.

[10]  Dan Olteanu,et al.  Covers of Query Results , 2017, ICDT.

[11]  Wim Martens,et al.  An analytical study of large SPARQL query logs , 2017, The VLDB Journal.

[12]  Raabia Asif,et al.  Enhancing the Nobel Prize schema , 2017, 2017 International Conference on Communication, Computing and Digital Systems (C-CODE).

[13]  Jakub Závodný,et al.  Size Bounds for Factorised Representations of Query Results , 2015, TODS.

[14]  Reinhard Pichler,et al.  Tractable Counting of the Answers to Conjunctive Queries , 2013, AMW.

[15]  Arnaud Durand,et al.  Structural Tractability of Counting of Solutions to Conjunctive Queries , 2013, ICDT '13.

[16]  Denny Vrandecic,et al.  Wikidata: a new platform for collaborative data collection , 2012, WWW.

[17]  Neoklis Polyzotis,et al.  Robust and efficient algorithms for rank join evaluation , 2009, SIGMOD Conference.

[18]  Arnaud Durand,et al.  On Acyclic Conjunctive Queries and Constant Delay Enumeration , 2007, CSL.

[19]  Man Lung Yiu,et al.  Efficient top-k aggregation of ranked inputs , 2007, TODS.

[20]  Peter Jonsson,et al.  The complexity of counting homomorphisms seen from the other side , 2004, Theor. Comput. Sci..

[21]  Jörg Flum,et al.  The parameterized complexity of counting problems , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[22]  John R. Smith,et al.  Supporting Incremental Join Queries on Ranked Inputs , 2001, VLDB.

[23]  Thomas Schwentick,et al.  When is the evaluation of conjunctive queries tractable? , 2001, STOC '01.

[24]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[25]  Rajeev Motwani,et al.  On random sampling over joins , 1999, SIGMOD '99.

[26]  Michael J. Carey,et al.  On saying “Enough already!” in SQL , 1997, SIGMOD '97.

[27]  Michael D. Vose,et al.  A Linear Algorithm For Generating Random Numbers With a Given Distribution , 1991, IEEE Trans. Software Eng..

[28]  Irving L. Traiger,et al.  A history and evaluation of System R , 1981, CACM.

[29]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[30]  Alastair J. Walker,et al.  An Efficient Method for Generating Discrete Random Variables with General Distributions , 1977, TOMS.

[31]  Markus Krötzsch,et al.  Practical Linked Data Access via SPARQL: The Case of Wikidata , 2018, LDOW@WWW.

[32]  Francesco Kriegel.  What is Database Theory ? , 2016 .

[33]  Georg Gottlob,et al.  Treewidth and Hypertree Width , 2014, Tractability.

[34]  R. Varshney,et al.  Supporting top-k join queries in relational databases , 2011 .

[35]  Kim Shanley,et al.  TPC Releases Benchmark Results on 65 Systems , 1991, SIGMETRICS Perform. Evaluation Rev..