A glimpse on constant delay enumeration (Invited Talk)
Luc Segoufin · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2014
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.