Skip to Main content Skip to Navigation
New interface
Conference papers

A glimpse on constant delay enumeration

Luc Segoufin 1 
1 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
Abstract : We survey some of the recent results about enumerating the answers to queries over a database. We focus on the case where the enumeration is performed with a constant delay between any two consecutive solutions, after a linear time preprocessing. This cannot be always achieved. It requires restricting either the class of queries or the class of databases. We describe here several scenarios when this is possible.
Document type :
Conference papers
Complete list of metadata
Contributor : Luc Segoufin Connect in order to contact the contributor
Submitted on : Tuesday, October 7, 2014 - 11:58:40 AM
Last modification on : Thursday, January 20, 2022 - 4:12:12 PM
Long-term archiving on: : Thursday, January 8, 2015 - 10:16:51 AM


Files produced by the author(s)



Luc Segoufin. A glimpse on constant delay enumeration. 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France, Mar 2014, Lyon, France. pp.13--27, ⟨10.4230/LIPIcs.STACS.2014.13⟩. ⟨hal-01070893⟩



Record views


Files downloads