Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

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.
Fichier principal
Vignette du fichier
pods20-durand (1).pdf (962.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03639448 , version 1 (12-04-2022)

Identifiers

Cite

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. pp.331-346, ⟨10.1145/3375395.3389130⟩. ⟨hal-03639448⟩
6 View
42 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More