Communication Dans Un Congrès Année : 2014

A glimpse on constant delay enumeration

Luc Segoufin

Résumé

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.

Fichier principal
Vignette du fichier
cdlin-stacs.pdf (193.72 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-01070893 , version 1 (07-10-2014)

Licence

Identifiants

Citer

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⟩
288 Consultations
440 Téléchargements

Altmetric

Partager

  • More