Proceedings of the 14th International Conference on Database Theory (ICDT), Uppsala, Sweden, 2011

Original publisher: ACM New York, ICPS - International Conference Proceedings Series, ISBN: 978-1-4503-0529-7, Electronic Edition

Front Matter

Invited papers

[PDF] [DOI] On provenance and privacy.
Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy, Julia Stoyanovich, Val Tannen, Yi Chen   pp. 3-10

Invited tutorial

[PDF] [DOI] The PADS project: an overview.
Kathleen Fisher, David Walker   pp. 11-17

Research Sessions

XML
[PDF] [DOI] Efficient reasoning about data trees via integer linear programming.
Claire David, Leonid Libkin, Tony Tan   pp. 18-29
[PDF] [DOI] Generating, sampling and counting subclasses of regular tree languages.
Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven   pp. 30-41
[PDF] [DOI] View update translation for XML.
Iovka Boneva, Anne-Cécile Caron, Benoît Groz, Yves Roos, Sophie Tison, Slawek Staworko   pp. 42-53
Workflows
[PDF] [DOI] Artifact systems with data dependencies and arithmetic.
Elio Damaggio, Alin Deutsch, Victor Vianu   pp. 66-77
[PDF] [DOI] Comparing workflow specification languages: a matter of views.
Serge Abiteboul, Pierre Bourhis, Victor Vianu   pp. 78-89
Data exchange
[PDF] [DOI] Relaxed notions of schema mapping equivalence revisited.
Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov   pp. 90-101
[PDF] [DOI] Solutions in XML data exchange.
Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak   pp. 102-113
[PDF] [DOI] Simplifying schema mappings.
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi   pp. 114-125
XML and semi-structured data
[PDF] [DOI] On the equivalence of distributed systems with queries and communication.
Serge Abiteboul, Balder ten Cate, Yannis Katsis   pp. 126-137
[PDF] [DOI] Two-variable logic and key constraints on data words.
Matthias Niewerth, Thomas Schwentick   pp. 138-149
Probabilistic databases
[PDF] [DOI] (Approximate) uncertain skylines.
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips   pp. 186-196
Query languages
[PDF] [DOI] Relative expressive power of navigational querying on graphs.
George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu   pp. 197-207
[PDF] [DOI] Complexity of higher-order queries.
Huy Vu, Michael Benedikt   pp. 208-219
Query evaluation and cleaning
[PDF] [DOI] Faster query answering in probabilistic databases using read-once functions.
Sudeepa Roy, Vittorio Perduca, Val Tannen   pp. 232-243
[PDF] [DOI] The complexity of evaluating tuple generating dependencies.
Reinhard Pichler, Sebastian Skritek   pp. 244-255
[PDF] [DOI] Detecting and exploiting near-sortedness for efficient relational query evaluation.
Sagi Ben-Moshe, Yaron Kanza, Eldar Fischer, Arie Matsliah, Mani Fischer, Carl Staelin   pp. 256-267
[PDF] [DOI] Data cleaning and query answering with matching dependencies and matching functions.
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. Lakshmanan   pp. 268-279