On the complexity of database queries
Journal of Computer and System Sciences
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
Grad and classes with bounded expansion I. Decompositions
European Journal of Combinatorics
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
Linear delay enumeration and monadic second-order logic
Discrete Applied Mathematics
Enumeration of the monomials of a polynomial and related complexity classes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Efficient enumeration for conjunctive queries over x-underbar structures
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Deciding First-Order Properties for Sparse Graphs
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
European Journal of Combinatorics
XPath evaluation in linear time
Journal of the ACM (JACM)
Enumerating all solutions of a boolean CSP by non-decreasing weight
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
MSO queries on tree decomposable structures are computable with linear delay
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On acyclic conjunctive queries and constant delay enumeration
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
A combinatorial theorem for trees applications to monadic logic and infinite structures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We survey recent results about enumerating with constant delay the answers to a query over a database. More precisely, we focus on the case when enumeration can be achieved with a preprocessing running in time linear in the size of the database, followed by an enumeration process outputting the answers one by one with constant time between any consecutive outputs. We survey classes of databases and classes of queries for which this is possible. We also mention related problems such as computing the number of answers or sampling the set of answers.