ICDT 2011 ACCEPTED PAPERS
--------------------------------------------


4  Detecting and Exploiting Near-Sortedness for Efficient
 Relational Query Evaluation
 Sagi Ben-Moshe; Eldar Fischer; Mani Fischer; Yaron Kanza;
 Arie Matsliah; Carl Staelin

8  Relative Expressive Power of Navigational Querying on Graphs
 George Fletcher; Marc Gyssens; Dirk Leinders; Jan Van den Bussche;
 Dirk Van Gucht; Stijn Vansummeren; Yuqing Wu

11 Generating, sampling and counting subclasses of regular tree
 languages
 Wim Martens; Timos Antonopoulos; Floris Geerts; Frank Neven

13 Comparing Workflow Specification Languages:  A Matter of Views
 Serge Abiteboul; Pierre Bourhis; Victor Vianu

14 Relaxed Notions of Schema Mapping Equivalence Revisited
 Reinhard Pichler; Emanuel Sallinger; Vadim Savenkov

15 The Complexity of Evaluating Tuple Generating Dependencies
 Sebastian Skritek; Reinhard Pichler

16 Querying Probabilistic Business Processes for Sub-Flows
 Daniel Deutch

18 View update translation for XML
 Beno?t Groz; Iovka Boneva; Yves Roos; Sophie Tison; Anne-Cecile Caron;
 Slawek Staworko

19 On the Equivalence of Distributed Systems with Queries and
 Communication
 Serge Abiteboul; Balder ten Cate; Yannis Katsis

20 Complexity of Higher-Order Queries
 Huy Vu; Michael Benedikt

21 Efficient Reasoning about Data Trees via Integer Linear
 Programming
 Claire David; Leonid Libkin; Tony Tan 

30 Two-variable logic and Key Constraints on Data Words
 Thomas Schwentick; Matthias Niewerth

31 Artifact Systems with Data Dependencies and Arithmetic
 Constraints
 Elio Damaggio; Alin Deutsch; Victor Vianu

36 Solutions in XML Data Exchange
 Mikolaj Bojanczyk; Leszek Kolodziejczyk; Filip Murlak

40(Approximate) Uncertain Skylines
Peyman Afshani; Pankaj Agarwal; Lars Arge; Kasper Larsen; Jeff Phillips

41 On the Optimal Approximation of Queries using Tractable
 Propositional Theories
 Robert Fink; Dan Olteanu

45 Knowledge Compilation Meets Database Theory : Compiling Queries
 to Decision Diagrams
 Abhay Jha; Dan Suciu

46 Simplifying Schema Mappings
 Diego Calvanese; Giuseppe De Giacomo; Maurizio Lenzerini; Moshe Vardi

53 Conjunctive Queries Determinacy and Rewriting
 Daniel Pasaila

58 Data Cleaning and Query Answering with Matching Dependencies and
 Matching Functions
 Leopoldo Bertossi; Solmaz Kolahi; Laks Lakshmanan

64 Satisfiability algorithms for conjunctive queries over trees
 James Cheney

65 Faster Query Answering in Probabilistic Databases using Read-Once
 Functions
 Sudeepa Roy; Vittorio Perduca; Val Tannen