EDBT/ICDT 2009 Joint Conference
Electronic Conference Proceedings
ICDT Research Papers (Alphabetically)
- A Compositional Framework for Complex Queries over Uncertain Data
Michaela Goetz and Christoph Koch - A Compositional Query Algebra for Second-Order Logic and Uncertain Databases
Christoph Koch - A Logical Account of Uncertain Databases based on Linear Logic
Sungwoo Park and Seung-won Hwang - Analysis of Sampling Techinques for Association Rule Mining
Venkatesan Chakaravarthy, Vinayaka Pandit, and Yogish Sabharwal - Automatic Construction of Simple Artifact-based Business Processes
Christian Fritz, Richard Hull, and Jianwen Su - Automatic Verification of Data-Centric Business Processes
Alin Deutsch, Richard Hull, Fabio Patrizi, and Victor Vianu - Consistent Query Answering under Primary Keys: A Characterization of Tractable Queries
Jef Wijsen - Containment of Conjunctive Queries on Annotated Relations
Todd Green - Efficient Asymmetric Inclusion Between Regular Expression Types
Dario Colazzo, Giorgio Ghelli, and Carlo Sartiani - Efficient Data Structures for Range-Aggregate Queries on Trees
Hao Yuan and Mikhail J. Atallah - Faster Join-Projects and Sparse Matrix Multiplications
Rasmus R. Amossen and Rasmus Pagh - How Big Must Complete XML Query Languages Be?
Clemens Ley and Michael Benedikt - Incremental XPath Evaluation
Henrik Björklund, Wouter Gelade, Marcel Marquardt, and Wim Martens - On Approximating Optimum Repairs for Functional Dependency Violations
Solmaz Kolahi and Laks V.S. Lakshmanan - Optimal Splitters for Database Partitioning with Size Bounds
Kenneth Ross and John Cieslewicz - Optimizing User Views for Workflows
Olivier Biton, Susan Davidson, Sanjeev Khanna, and Sudeepa Roy - Querying Data Sources That Export Infinite Sets of Views
Bogdan Cautis, Alin Deutsch, and Nicola Onose - Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries
Marcelo Arenas, Juan L. Reutter, and Pablo Barceló - Reconcilable Differences
Todd Green, Zachary Ives, and Val Tannen - Repair Checking in Inconsistent Databases: Algorithms and Complexity
Foto Afrati and Phokion Kolaitis - Structural Characterizations of Schema-Mapping Languages
Balder ten Cate and Phokion Kolaitis - The Average-Case Complexity of Counting Distinct Elements
David Woodruff - Tight results for clustering and summarizing data streams
Sudipto Guha - TOP-K Projection Queries for Probabilistic Business Processes
Daniel Deutch and Tova Milo - Towards a theory of search queries
George H. L. Fletcher, Jan Van den Bussche, Dirk Van Gucht, and Stijn Vansummeren