@Proceedings{benedikt_et_al:LIPIcs.ICDT.2017,
title = {{LIPIcs, Volume 68, ICDT'17, Complete Volume}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017},
URN = {urn:nbn:de:0030-drops-70689},
doi = {10.4230/LIPIcs.ICDT.2017},
annote = {Keywords: Database Management, Normal Forms, Schema and Subschema, Query Languages, \lbrackSystems\rbrack Query Processing, Relational Databases, Distributed Databases}
}
@InProceedings{benedikt_et_al:LIPIcs.ICDT.2017.0,
author = {Benedikt, Michael and Orsi, Giorgio},
title = {{Front Matter, Table of Contents, Preface, Conference Organization, List of Authors}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {0:i--0:xii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.0},
URN = {urn:nbn:de:0030-drops-70446},
doi = {10.4230/LIPIcs.ICDT.2017.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization, List of Authors}
}
@InProceedings{feier_et_al:LIPIcs.ICDT.2017.1,
author = {Feier, Cristina and Kuusisto, Antti and Lutz, Carsten},
title = {{Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {1:1--1:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.1},
URN = {urn:nbn:de:0030-drops-70636},
doi = {10.4230/LIPIcs.ICDT.2017.1},
annote = {Keywords: FO-Rewritability, MDDLog, MMSNP, DL, ontology mediated queries}
}
@InProceedings{marx:LIPIcs.ICDT.2017.2,
author = {Marx, D\'{a}niel},
title = {{Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.2},
URN = {urn:nbn:de:0030-drops-70652},
doi = {10.4230/LIPIcs.ICDT.2017.2},
annote = {Keywords: Conjunctive queries, treewidth, complexity}
}
@InProceedings{milo:LIPIcs.ICDT.2017.3,
author = {Milo, Tova},
title = {{The Smart Crowd - Learning from the Ones Who Know}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.3},
URN = {urn:nbn:de:0030-drops-70643},
doi = {10.4230/LIPIcs.ICDT.2017.3},
annote = {Keywords: data management, crowdsourcing}
}
@InProceedings{afrati_et_al:LIPIcs.ICDT.2017.4,
author = {Afrati, Foto N. and Joglekar, Manas R. and Re, Christopher M. and Salihoglu, Semih and Ullman, Jeffrey D.},
title = {{GYM: A Multiround Distributed Join Algorithm}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {4:1--4:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.4},
URN = {urn:nbn:de:0030-drops-70462},
doi = {10.4230/LIPIcs.ICDT.2017.4},
annote = {Keywords: Joins, Yannakakis, Bulk Synchronous Processing, GHDs}
}
@InProceedings{amarilli_et_al:LIPIcs.ICDT.2017.5,
author = {Amarilli, Antoine and Amsterdamer, Yael and Milo, Tova and Senellart, Pierre},
title = {{Top-k Querying of Unknown Values under Order Constraints}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {5:1--5:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.5},
URN = {urn:nbn:de:0030-drops-70457},
doi = {10.4230/LIPIcs.ICDT.2017.5},
annote = {Keywords: uncertainty, partial order, unknown values, crowdsourcing, interpolation}
}
@InProceedings{amarilli_et_al:LIPIcs.ICDT.2017.6,
author = {Amarilli, Antoine and Bourhis, Pierre and Monet, Mika\"{e}l and Senellart, Pierre},
title = {{Combined Tractability of Query Evaluation via Tree Automata and Cycluits}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {6:1--6:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.6},
URN = {urn:nbn:de:0030-drops-70516},
doi = {10.4230/LIPIcs.ICDT.2017.6},
annote = {Keywords: query evaluation, tree automata, provenance, treewidth, circuits}
}
@InProceedings{barcelo_et_al:LIPIcs.ICDT.2017.7,
author = {Barcel\'{o}, Pablo and Romero, Miguel},
title = {{The Complexity of Reverse Engineering Problems for Conjunctive Queries}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {7:1--7:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.7},
URN = {urn:nbn:de:0030-drops-70525},
doi = {10.4230/LIPIcs.ICDT.2017.7},
annote = {Keywords: reverse engineering, conjunctive queries, query by example, definability, treewidth, complexity of pebble games}
}
@InProceedings{berkholz_et_al:LIPIcs.ICDT.2017.8,
author = {Berkholz, Christoph and Keppeler, Jens and Schweikardt, Nicole},
title = {{Answering FO+MOD Queries Under Updates on Bounded Degree Databases}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {8:1--8:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.8},
URN = {urn:nbn:de:0030-drops-70535},
doi = {10.4230/LIPIcs.ICDT.2017.8},
annote = {Keywords: dynamic databases, query enumeration, counting problem, first-order logic with modulo-counting quantifiers, Hanf locality}
}
@InProceedings{bova_et_al:LIPIcs.ICDT.2017.9,
author = {Bova, Simone and Chen, Hubie},
title = {{How Many Variables Are Needed to Express an Existential Positive Query?}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {9:1--9:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.9},
URN = {urn:nbn:de:0030-drops-70545},
doi = {10.4230/LIPIcs.ICDT.2017.9},
annote = {Keywords: existential positive queries, finite-variable logics, first-order logic, query optimization}
}
@InProceedings{burdick_et_al:LIPIcs.ICDT.2017.10,
author = {Burdick, Douglas and Fagin, Ronald and Kolaitis, Phokion G. and Popa, Lucian and Tan, Wang-Chiew},
title = {{Expressive Power of Entity-Linking Frameworks}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {10:1--10:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.10},
URN = {urn:nbn:de:0030-drops-70554},
doi = {10.4230/LIPIcs.ICDT.2017.10},
annote = {Keywords: entity linking, entity resolution, constraints, repairs, certain links}
}
@InProceedings{cao_et_al:LIPIcs.ICDT.2017.11,
author = {Cao, Wei and Li, Jian and Wang, Haitao and Wang, Kangning and Wang, Ruosong and Chi-Wing Wong, Raymond and Zhan, Wei},
title = {{k-Regret Minimizing Set: Efficient Algorithms and Hardness}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {11:1--11:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.11},
URN = {urn:nbn:de:0030-drops-70569},
doi = {10.4230/LIPIcs.ICDT.2017.11},
annote = {Keywords: multi-criteria decision-making, regret minimizing set, top-k query}
}
@InProceedings{deep_et_al:LIPIcs.ICDT.2017.12,
author = {Deep, Shaleen and Koutris, Paraschos},
title = {{The Design of Arbitrage-Free Data Pricing Schemes}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {12:1--12:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.12},
URN = {urn:nbn:de:0030-drops-70574},
doi = {10.4230/LIPIcs.ICDT.2017.12},
annote = {Keywords: data pricing, determinacy, arbitrage}
}
@InProceedings{freydenberger:LIPIcs.ICDT.2017.13,
author = {Freydenberger, Dominik D.},
title = {{A Logic for Document Spanners}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.13},
URN = {urn:nbn:de:0030-drops-70493},
doi = {10.4230/LIPIcs.ICDT.2017.13},
annote = {Keywords: information extraction, document spanners, word equations, regex, descriptional complexity}
}
@InProceedings{garofalakis_et_al:LIPIcs.ICDT.2017.14,
author = {Garofalakis, Minos and Samoladas, Vasilis},
title = {{Distributed Query Monitoring through Convex Analysis: Towards Composable Safe Zones}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {14:1--14:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.14},
URN = {urn:nbn:de:0030-drops-70665},
doi = {10.4230/LIPIcs.ICDT.2017.14},
annote = {Keywords: distributed data streams, geometric method}
}
@InProceedings{gogacz_et_al:LIPIcs.ICDT.2017.15,
author = {Gogacz, Tomasz and Torunczyk, Szymon},
title = {{Entropy Bounds for Conjunctive Queries with Functional Dependencies}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {15:1--15:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.15},
URN = {urn:nbn:de:0030-drops-70479},
doi = {10.4230/LIPIcs.ICDT.2017.15},
annote = {Keywords: database theory, conjunctive queries, size bounds, entropy, finite groups, entropy cone}
}
@InProceedings{itzhaky_et_al:LIPIcs.ICDT.2017.16,
author = {Itzhaky, Shachar and Kotek, Tomer and Rinetzky, Noam and Sagiv, Mooly and Tamir, Orr and Veith, Helmut and Zuleger, Florian},
title = {{On the Automated Verification of Web Applications with Embedded SQL}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {16:1--16:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.16},
URN = {urn:nbn:de:0030-drops-70509},
doi = {10.4230/LIPIcs.ICDT.2017.16},
annote = {Keywords: SQL; scripting language; web services; program verification; two-variable fragment of first order logic; decidability; reasoning}
}
@InProceedings{kimelfeld_et_al:LIPIcs.ICDT.2017.17,
author = {Kimelfeld, Benny and Livshits, Ester and Peterfreund, Liat},
title = {{Detecting Ambiguity in Prioritized Database Repairing}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {17:1--17:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.17},
URN = {urn:nbn:de:0030-drops-70489},
doi = {10.4230/LIPIcs.ICDT.2017.17},
annote = {Keywords: inconsistent databases, preferred repairs, data cleaning, functional dependencies, conflict hypergraph}
}
@InProceedings{lohrey_et_al:LIPIcs.ICDT.2017.18,
author = {Lohrey, Markus and Maneth, Sebastian and Reh, Carl Philipp},
title = {{Compression of Unordered XML Trees}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {18:1--18:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.18},
URN = {urn:nbn:de:0030-drops-70584},
doi = {10.4230/LIPIcs.ICDT.2017.18},
annote = {Keywords: tree compression, directed acyclic graphs, XML}
}
@InProceedings{schwentick_et_al:LIPIcs.ICDT.2017.19,
author = {Schwentick, Thomas and Vortmeier, Nils and Zeume, Thomas},
title = {{Dynamic Complexity under Definable Changes}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {19:1--19:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.19},
URN = {urn:nbn:de:0030-drops-70596},
doi = {10.4230/LIPIcs.ICDT.2017.19},
annote = {Keywords: dynamic descriptive complexity, SQL updates, dynamic programs}
}
@InProceedings{segoufin_et_al:LIPIcs.ICDT.2017.20,
author = {Segoufin, Luc and Vigny, Alexandre},
title = {{Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {20:1--20:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.20},
URN = {urn:nbn:de:0030-drops-70602},
doi = {10.4230/LIPIcs.ICDT.2017.20},
annote = {Keywords: enumeration, first-order queries, local bounded expansion.}
}
@InProceedings{sundarmurthy_et_al:LIPIcs.ICDT.2017.21,
author = {Sundarmurthy, Bruhathi and Koutris, Paraschos and Lang, Willis and Naughton, Jeffrey and Tannen, Val},
title = {{m-tables: Representing Missing Data}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {21:1--21:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.21},
URN = {urn:nbn:de:0030-drops-70618},
doi = {10.4230/LIPIcs.ICDT.2017.21},
annote = {Keywords: missing values, incomplete data, c tables, representation systems}
}
@InProceedings{mcgregor_et_al:LIPIcs.ICDT.2017.22,
author = {McGregor, Andrew and Vu, Hoa T.},
title = {{Better Streaming Algorithms for the Maximum Coverage Problem}},
booktitle = {20th International Conference on Database Theory (ICDT 2017)},
pages = {22:1--22:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-024-8},
ISSN = {1868-8969},
year = {2017},
volume = {68},
editor = {Benedikt, Michael and Orsi, Giorgio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.22},
URN = {urn:nbn:de:0030-drops-70620},
doi = {10.4230/LIPIcs.ICDT.2017.22},
annote = {Keywords: algorithms, data streams, approximation, maximum coverage}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing