LIPIcs.STACS.2014.13.pdf
- Filesize: 0.55 MB
- 15 pages
Document
A glimpse on constant delay enumeration (Invited Talk)
Author
-
Part of:
Volume:
31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2014-03-05
Cite AsGet BibTex
Luc Segoufin. A glimpse on constant delay enumeration (Invited Talk). In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 13-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/LIPIcs.STACS.2014.13
https://doi.org/10.4230/LIPIcs.STACS.2014.13
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.
Keywords
- Enumeration
- constant delay
- logic
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads