License
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.9.5.89
URN: urn:nbn:de:0030-drops-113822
URL: http://drops.dagstuhl.de/opus/volltexte/2019/11382/
Go back to Dagstuhl Reports


Boros, Endre ; Kimelfeld, Benny ; Pichler, Reinhard ; Schweikardt, Nicole
Weitere Beteiligte (Hrsg. etc.): Endre Boros and Benny Kimelfeld and Reinhard Pichler and Nicole Schweikardt

Enumeration in Data Management (Dagstuhl Seminar 19211)

pdf-format:
dagrep_v009_i005_p089_19211.pdf (4 MB)


Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 19211 "Enumeration in Data Management". The goal of the seminar was to bring together researchers from various fields of computer science, including the Databases, Computational Logic, and Algorithms communities, and establish the means of collaboration towards considerable progress on the topic. Specifically, we aimed at understanding the recent developments, identifying the important open problems, and initiating collaborative efforts towards solutions thereof. In addition, we aimed to build and disseminate a toolkit for data-centric enumeration problems, including algorithmic techniques, proof techniques, and important indicator problems. Towards the objectives, the seminar included tutorials on the topic, invited talks, presentations of open problems, working groups on the open problems, discussions on platforms to compile the community knowledge, and the construction of various skeletons of such compilations.

BibTeX - Entry

@Article{boros_et_al:DR:2019:11382,
  author =	{Endre Boros and Benny Kimelfeld and Reinhard Pichler and Nicole Schweikardt},
  title =	{{Enumeration in Data Management (Dagstuhl Seminar 19211)}},
  pages =	{89--109},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2019},
  volume =	{9},
  number =	{5},
  editor =	{Endre Boros and Benny Kimelfeld and Reinhard Pichler and Nicole Schweikardt},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11382},
  URN =		{urn:nbn:de:0030-drops-113822},
  doi =		{10.4230/DagRep.9.5.89},
  annote =	{Keywords: constant delay, databases, dynamic complexity, enumeration, polynomial delay, query evaluation}
}

Keywords: constant delay, databases, dynamic complexity, enumeration, polynomial delay, query evaluation
Seminar: Dagstuhl Reports, Volume 9, Issue 5
Issue Date: 2019
Date of publication: 28.10.2019


DROPS-Home | Imprint | Privacy Published by LZI