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