13. ICDT 2010: Lausanne, Switzerland

Luc Segoufin (Ed.): Database Theory - ICDT 2010, 13th International Conference, Lausanne, Switzerland, March 23-25, 2010, Proceedings. ACM International Conference Proceeding Series ACM 2010, ISBN 978-1-60558-947-3

Invited papers

Amol Deshpande:
Increasing representational power and scaling reasoning in probabilistic databases. 1
Martin Grohe:
From polynomial time queries to graph structure theory. 2
Pierre Fraigniaud:
Provenance for database transformations. 3

Research sessions: optimization, indexing, and transactions

Michael Schmidt, Michael Meier, Georg Lausen:
Foundations of SPARQL query optimization. 4-33
Alexis C. Kaporis, Apostolos N. Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas:
Efficient processing of 3-sided range queries with probabilistic guarantees. 34-43
Ragnar Normann, Lene T. Østby:
A theoretical study of 'Snapshot Isolation'. 44-49

Research sessions: probabilistic databases

Serge Abiteboul, T.-H. Hubert Chan, Evgeny Kharlamov, Werner Nutt, Pierre Senellart:
Aggregate queries for discrete and continuous probabilistic XML. 50-61
Sara Cohen, Benny Kimelfeld:
Querying parse trees of stochastic context-free grammars. 62-75
Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis:
Probabilistic data exchange. 76-88

Research sessions: views, inclusion, and equivalence

Anish Das Sarma, Aditya G. Parameswaran, Hector Garcia-Molina, Jennifer Widom:
Synthesizing view definitions from data. 89-103
Wen Ming Liu, Lingyu Wang, Lei Zhang:
k-jump strategy for preserving privacy in micro-data disclosure. 104-115
Sara Cohen, Yaacov Y. Weiss:
Bag equivalence of XPath queries. 116-128

Research sessions: data exchange 1

Marcelo Arenas, Ronald Fagin, Alan Nash:
Composition with target constraints. 129-142
André Hernich:
Answering non-monotonic queries in relational data exchange. 143-154
Shun'ichi Amano, Claire David, Leonid Libkin, Filip Murlak:
On the tradeoff between mapping and querying power in XML data exchange. 155-164

Research sessions: logic and XPath

Manuel Bodirsky, Jens K. Mueller:
The complexity of rooted phylogeny problems. 165-173
Kaoru Katayama, Tatsuro Okawara, Yuka Ito:
A greedy algorithm for constructing a low-width generalized hypertree decomposition. 174-182

Research sessions: data exchange 2

Bruno Marnette, Floris Geerts:
Static analysis of schema-mappings ensuring oblivious termination. 183-195
Ryan Wisnesky, Mauricio A. Hernández, Lucian Popa:
Mapping polymorphism. 196-208
Patricia C. Arocena, Ariel Fuxman, Renée J. Miller:
Composing local-as-view mappings: closure and applications. 209-218

Research sessions: session 7

Gösta Grahne, Adrian Onet:
Data correspondence, exchange and repair. 219-230
Diego Figueira:
Forward-XPath and extended register automata on data-trees. 231-241
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu:
On the aggregation problem for synthesized web services. 242-251

Last update Fri May 25 08:18:31 2012 CET by the DBLP Team —

This material is Open Data

Data released under the ODC-BY 1.0 license — See also our legal information page