List of accepted papers for ICDT


(in no particular order)

Hugh Darwen, C.J. Date and Ronald Fagin. A Normal Form for Preventing Redundant Tuples in Relational Databases

Rada Chirkova. Equivalence and Minimization of Conjunctive Queries under Combined Semantics

André Hernich. Computing Universal Models Under Linear Tgds

Christian Konrad and Frederic Magniez. Validating XML documents in the Streaming Model with external memory

Balder Ten Cate, Gaelle Fontaine and Phokion Kolaitis. On the Data Complexity of Consistent Query Answering

Sebastian Siebertz and Erich Grädel. Dynamic Definability

Tom Ameloot and Jan Van Den Bussche. Deciding eventual consistency for a simple class of relational transducer networks

Egor Kostylev and Peter Buneman. Combining Dependent Annotations for Relational Algebra

Serge Abiteboul, Pierre Bourhis and Victor Vianu. Highly Expressive Query Languages for Unordered Data Trees

Abhay Jha and Dan Suciu. On the Tractability of Query Compilation and Bounded Treewidth

Leonid Libkin and Domagoj Vrgoc. Regular Path Queries on Graphs with Data

Amelie Gheerbrant, Leonid Libkin and Tony Tan. On the Complexity of Query Answering over Incomplete XML Documents

Timos Antonopoulos, Dag Hovland, Wim Martens and Frank Neven. Deciding Twig-Definability of Node Selecting Tree Automata

Foto N. Afrati, Paraschos Koutris, Dan Suciu and Jeffrey D. Ullman. Parallel Skyline Queries

Serge Abiteboul, Yael Amsterdamer, Daniel Deutch,Tova Milo and Pierre Senellart. Finding Optimal Probabilistic Generators for XML Collections

Balder Ten Cate, Victor Dalmau and Phokion Kolaitis. Learning Schema Mappings

Dan Olteanu and Jakub Zavodny. Factorised Representations of Query Results: Size Bounds and Readability

Gabriele Puppis, Cristian Riveros and Slawek Staworko. Bounded reparability for regular tree languages

Slawek Staworko and Piotr Wieczorek. Learning Twig and Path Queries

Graham Cormode, Magda Procopiuc, Divesh Srivastava and Thanh Tran. Differentially Private Summaries for Sparse Data

Daniel Zinn, Todd Green and Bertram Ludaescher. Win-Move is Coordination-Free

Gösta Grahne and Adrian Onet. Representation systems for data exchange .

Layout based on YAML