Conference Program: PODS Sessions
PODS Session 1 Monday 8:30-9:45 PODS Opening and Keynote:
Session Chair: Jan Paredaens (University of Antwerp)
Datalog Redux: Experience and Conjecture
Joe Hellerstein
PODS Session 2: Monday 10:15-11:45 Query Languages
Session Chair: Tova Milo (Tel Aviv University)
Expressive Languages for Path Queries over Graph-Structured Data
Pablo Barcela, Carlos Hurtado, Leonid Libkin and Peter Wood.
Transducing Markov Sequences
Benny Kimelfeld and Christopher Re.
Positive Higher-Order Queries
Michael Benedikt, Gabriele Puppis and Huy Vu.
PODS Session 3: Monday 13:15-14:30 Awards
Session Chair: Jianwen Su (Univ. of California, Santa Barbara)
The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2010:
Typechecking for XML Transformers
Tova Milo, Dan Suciu, and Victor Vianu
The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2010:
Integrity Constraints for XML
Wenfei Fan and Jerome Simeon
Best Paper Award:
An Optimal Algorithm for the Distinct Elements Problem
Daniel M. Kane, Jelani Nelson and David P. Woodruff.
Regular Paper:
Understanding Cardinality Estimation using Entropy Maximization
Christopher Re and Dan Suciu.
PODS Session 4: Monday 14:45-15:45 Tutorial 1
Session Chair: Marcelo Arenas (Pontifical Catholic Univ. of Chile)
From Information to Knowledge: Harvesting Entities and Relationships from Web Sources
Gerhard Weikum and Martin Theobald
PODS Session 5: Monday 16:15-18:15 Streams and Query Processing
Session Chair: Mikhail Atallah (Purdue University)
Optimal Sampling From Distributed Streams
Graham Cormode, Ke Yi, Qin Zhang and S. Muthukrishnan.
Incremental Query Evaluation Revisited
Christoph Koch.
Fast Manhattan Sketches in Data Streams
Jelani Nelson and David P. Woodruff.
Semantic Query Optimization in the Presence of Types
Michael Meier, Michael Schmidt, Fang Wei and Georg Lausen.
PODS Session 6: Tuesday 10:30-12:00 Privacy
Session Chair: Graham Cormode (AT&T Labs Research)
Optimizing Linear Counting Queries under Differential Privacy
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Miklau and Andrew McGregor.
Universally Optimal Privacy Mechanisms for Minimax Agents
Mangesh Gupte and Mukund Sundararajan.
Towards an Axiomatization of Statistical Privacy and Utility
Daniel Kifer and Bing-Rong Lin.
PODS Session 7: Tuesday 13:30-15:00 Tutorial 2 & Information Complexity & Missing Information
Session Chair: Jeffrey Naughton (Univ. of Wisconsin)
Tutorial 2: Information Complexity
T.S. Jayram
Regular Paper: Capturing Missing Tuples and Missing Values
Floris Geerts and Wenfei Fan.
PODS Session 8 & 9: Tuesday 15:30-17:30 Uncertainty in Databases
Session Chair: Benny Kimelfeld (IBM Almaden Research Center)
On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases
Jef Wijsen.
Certain Answers for XML Queries
Claire David, Leonid Libkin and Filip Murlak.
Computing Query Probability with Incidence Algebras
Nilesh Dalvi, Karl Schnaitter and Dan Suciu.
On Probabilistic Fixpoint and Markov Chain Query Languages
Daniel Deutch, Cristoph Koch and Tova Milo.
PODS Session 10: Wednesday 8:30-10:00 Schema mappings and design
Session Chair: Jan Van den Bussche (Hasselt University)
Foundations of Schema Metadata Management
Marcelo Arenas, Jorge Pérez, Juan L. Reutter and Cristian Riveros.
Schema Design for XML Repositories: Complexity and Tractability
Wim Martens, Matthias Niewerth and Thomas Schwentick.
Simplifying XML Schema: Single-Type Approximations of Regular Tree Languages
Wouter Gelade, Tomasz Idziaszek, Wim Martens and Frank Neven.
PODS Session 11 Wednesday 10:30-12:00 Query Learning
Session Chair: Dan Suciu (University of Washington)
Characterizing Schema Mappings via Data Examples
Bogdan Alexe, Phokion Kolaitis and Wang-Chiew Tan.
Understanding Queries in a Search Database System
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan and Shivakumar Vaithyanathan.
A Learning Algorithm for Top-Down XML Transformations
Aurelien Lemay, Sebastian Maneth and Joachim Niehren.
PODS Session 12 Wednesday 16:00-18:00 Constraints & Indexing
Session Chair: Jan Hidders (Delft Univ. of Technology)
Cache-Oblivious Hashing
Rasmus Pagh, Zhewei Wei, Ke Yi and Qin Zhang.
Performance Guarantees for B-trees with Different-Sized Keys
Michael A. Bender, Haodong Hu and Bradley C. Kuszmaul.
When data dependencies over SQL tables meet the Logics of Paradox and S-3
Sven Hartmann and Sebastian Link.
The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability
Gianluigi Greco and Francesco Scarcello.
