License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2014.13
URN: urn:nbn:de:0030-drops-45001
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2014/4500/
Go to the corresponding LIPIcs Volume Portal

Segoufin, Luc

A glimpse on constant delay enumeration (Invited Talk)

pdf-format:
58.pdf (0.6 MB)

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.

BibTeX - Entry

@InProceedings{segoufin:LIPIcs:2014:4500,
  author =	{Luc Segoufin},
  title =	{{A glimpse on constant delay enumeration (Invited Talk)}},
  booktitle =	{31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
  pages =	{13--27},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-65-1},
  ISSN =	{1868-8969},
  year =	{2014},
  volume =	{25},
  editor =	{Ernst W. Mayr and Natacha Portier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2014/4500},
  URN =		{urn:nbn:de:0030-drops-45001},
  doi =		{10.4230/LIPIcs.STACS.2014.13},
  annote =	{Keywords: Enumeration, constant delay, logic}
}

Keywords: Enumeration, constant delay, logic
Collection: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Issue Date: 2014
Date of publication: 05.03.2014

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI