A glimpse on constant delay enumeration. Segoufin, L. In STACS 2014: the 31st International Symposium on Theoretical Aspects of Computer Science, volume 25, of Leibniz International Proceedings in Informatics (LIPIcs), pages 13--27, 2014.
A glimpse on constant delay enumeration [link]Paper  doi  abstract   bibtex   
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.
@inproceedings{ Segoufin2014,
  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.},
  author = {Segoufin, Luc},
  booktitle = {STACS 2014: the 31st International Symposium on Theoretical Aspects of Computer Science},
  doi = {10.4230/LIPIcs.STACS.2014.13},
  file = {:Users/KunihiroWASA/Dropbox/paper/2014/Segoufin, A glimpse on constant delay enumeration, 2014.pdf:pdf},
  isbn = {9783939897651},
  issn = {18688969},
  keywords = {Enumeration,constant delay,logic},
  pages = {13--27},
  series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  title = {{A glimpse on constant delay enumeration}},
  url = {http://drops.dagstuhl.de/opus/volltexte/2014/4500/},
  volume = {25},
  year = {2014}
}

Downloads: 0