List of accepted papers
Manuel Bodirsky and Jens K. Mueller. The Complexity of Rooted Phylogeny problems
Diego Figueira. Forward-XPath and extended register automata on data-trees
Serge Abiteboul, T.-H. Hubert Chan, Evgeny Kharlamov, Werner Nutt and Pierre Senellart. Aggregate Queries for Discrete and Continuous Probabilistic XML
Ronald Fagin, Benny Kimelfeld and Phokion Kolaitis. Probabilistic Data Exchange
Sara Cohen and Benny Kimelfeld. Querying Parse Trees of Stochastic Context-Free Grammars
Sara Cohen and Yaacov Y. Weiss. Bag Equivalence of XPath Queries
Ragnar Normann and Lene T. Řstby. A Theoretical Study of 'Snapshot Isolation'
Gösta Grahne and Adrian Onet. Data Correspondence, Exchange, and Repair
André Hernich. Answering Non-Monotonic Queries in Relational Data Exchange
Marcelo Arenas, Ronald Fagin and Alan Nash. Composition with Target Constraints
Bruno Marnette and Floris Geerts. Static Analysis of Schema-Mappings Ensuring Oblivious Termination
Anish Das Sarma, Aditya Parameswaran, Hector Garcia-Molina and Jennifer Widom. Synthesizing View Definitions from Data
Michael Schmidt, Michael Meier and Georg Lausen. Foundations of SPARQL Query Optimization
Lingyu Wang, Lei Zhang and Wenming Liu. K-Jump Strategy for Privacy Preserving Micro-Data Disclosure
Shunichi Amano, Claire David, Leonid Libkin and Filip Murlak. On the Tradeoff between Mapping and Querying Power in XML Data Exchange
Kaoru Katayama, Tatsuro Okawara and Yuka Itou. A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
Ting Deng, Wenfei Fan, Leonid Libkin and Yinghui Wu. On the Aggregation Problem for Synthesized Web Services
Ryan Wisnesky, Mauricio Hernandez and Lucian Popa. Mapping Polymorphism
Patricia Arocena, Ariel Fuxman and Renee Miller. Composing Local-As-View Mappings
Alexis Kaporis, Apostolos Papadopoulos, Spyros Sioutas, Kostas Tsichlas and Konstantinos Tsakalidis. Efficient Processing of 3-Sided Range Queries with Probabilistic Guarantees
