@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}
}

{"_id":"igWQ6HtMhhFc3WWKt","authorIDs":[],"author_short":["Segoufin, L."],"bibbaseid":"segoufin-aglimpseonconstantdelayenumeration-2014","bibdata":{"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"],"author_short":["Segoufin, L."],"bibtex":"@inproceedings{ Segoufin2014,\n 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.},\n author = {Segoufin, Luc},\n booktitle = {STACS 2014: the 31st International Symposium on Theoretical Aspects of Computer Science},\n doi = {10.4230/LIPIcs.STACS.2014.13},\n file = {:Users/KunihiroWASA/Dropbox/paper/2014/Segoufin, A glimpse on constant delay enumeration, 2014.pdf:pdf},\n isbn = {9783939897651},\n issn = {18688969},\n keywords = {Enumeration,constant delay,logic},\n pages = {13--27},\n series = {Leibniz International Proceedings in Informatics (LIPIcs)},\n title = {{A glimpse on constant delay enumeration}},\n url = {http://drops.dagstuhl.de/opus/volltexte/2014/4500/},\n volume = {25},\n year = {2014}\n}","bibtype":"inproceedings","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","id":"Segoufin2014","isbn":"9783939897651","issn":"18688969","key":"Segoufin2014","keywords":"Enumeration,constant delay,logic","pages":"13--27","series":"Leibniz International Proceedings in Informatics (LIPIcs)","title":"A glimpse on constant delay enumeration","type":"inproceedings","url":"http://drops.dagstuhl.de/opus/volltexte/2014/4500/","volume":"25","year":"2014","bibbaseid":"segoufin-aglimpseonconstantdelayenumeration-2014","role":"author","urls":{"Paper":"http://drops.dagstuhl.de/opus/volltexte/2014/4500/"},"keyword":["Enumeration","constant delay","logic"],"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:44.593Z","downloads":0,"keywords":["enumeration","constant delay","logic"],"search_terms":["glimpse","constant","delay","enumeration","segoufin"],"title":"A glimpse on constant delay enumeration","year":2014,"dataSources":["YRMeqhMHoNu9HzJoC"]}