Skip to Main content Skip to Navigation
Conference papers

Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration

Abstract : This paper is devoted to a complexity study of various tasks related to query answering such as deciding if a Boolean query is true or not, counting the size of the answer set or enumerating the results. It is a survey of some of the many tools from complexity measures trough algorithmic methods to conditional lower bounds that have been designed in the domain over the last years.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03639448
Contributor : Arnaud Durand Connect in order to contact the contributor
Submitted on : Tuesday, April 12, 2022 - 11:10:23 PM
Last modification on : Friday, August 5, 2022 - 11:59:58 AM
Long-term archiving on: : Wednesday, July 13, 2022 - 7:53:23 PM

File

pods20-durand (1).pdf
Files produced by the author(s)

Identifiers

Citation

Arnaud Durand. Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration. 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Jun 2020, Portland, United States. ⟨10.1145/3375395.3389130⟩. ⟨hal-03639448⟩

Share

Metrics

Record views

5

Files downloads

13