Proceedings of the 16th International Conference on Database Theory (ICDT), Genoa, Italy, 2013
Original publisher: ACM New York, ICPS - International Conference Proceedings Series, ISBN: 978-1-4503-1598-2, Electronic Edition
Front Matter
Invited lectures
Research Sessions
Award papers
Semi-structured data and XML
![[PDF]](../pdf.png "Download local copy")
![[DOI]](../url.png "Get via DOI")
Fast learning of restricted regular expressions and DTDs.
Dominik D. Freydenberger, Timo Kötzing
pp. 45-56
Which DTDs are streaming bounded repairable?
Pierre Bourhis, Gabriele Puppis, Cristian Riveros
pp. 57-68
Query processing and optimization
Structural tractability of counting of solutions to conjunctive queries.
Arnaud Durand, Stefan Mengel
pp. 81-92
Recursive queries on trees and data trees.
Serge Abiteboul, Pierre Bourhis, Anca Muscholl, Zhilin Wu
pp. 93-104
On optimum left-to-right strategies for active context-free games.
Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki
pp. 105-116
Graph databases
Walk logic as a framework for path query languages on graph databases.
Jelle Hellings, Bart Kuijpers, Jan Van den Bussche, Xiaowang Zhang
pp. 117-128
Definability problems for graph query languages.
Timos Antonopoulos, Frank Neven, Frédéric Servais
pp. 141-152
Provenance and annotations
Algebraic structures for capturing the provenance of SPARQL queries.
Floris Geerts, Grigoris Karvounarakis, Vassilis Christophides, Irini Fundulaki
pp. 153-164
A propagation model for provenance views of public/private workflows.
Susan B. Davidson, Tova Milo, Sudeepa Roy
pp. 165-176
Data exchange and query answering
Schema mappings and data exchange for graph databases.
Pablo Barceló, Jorge Pérez, Juan L. Reutter
pp. 189-200
Containment of pattern-based queries over data trees.
Claire David, Amélie Gheerbrant, Leonid Libkin, Wim Martens
pp. 201-212
Access patterns and integrity constraints revisited.
Vince Bárány, Michael Benedikt, Pierre Bourhis
pp. 213-224
Ranking query answers
Using the crowd for top-k and group-by queries.
Susan B. Davidson, Sanjeev Khanna, Tova Milo, Sudeepa Roy
pp. 225-236
Extracting minimum-weight tree patterns from a schema with neighborhood constraints.
Benny Kimelfeld, Yehoshua Sagiv
pp. 249-260
Privacy
On optimal differentially private mechanisms for count-range queries.
Chen Zeng, Jin-Yi Cai, Pinyan Lu, Jeffrey F. Naughton
pp. 261-271
Optimal error of query sets under the differentially-private matrix mechanism.
Chao Li, Gerome Miklau
pp. 272-283
Private decayed predicate sums on streams.
Jean Bolot, Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov, Nina Taft
pp. 284-295
The full-text material linked from this page is (c) ACM New York. The 'get via DOI'
() link loads the full-text from the ACM Digital Library. We provide local copies that can be loaded from here (via the 'get local copy' () link) with kind permission from ACM.
) link loads the full-text from the ACM Digital Library. We provide local copies that can be loaded from here (via the 'get local copy' () link) with kind permission from ACM.