Invited papers

• 
  Dan Suciu: Tractability in probabilistic databases. 1-2
• 
  Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy, Julia Stoyanovich, Val Tannen, Yi Chen: On provenance and privacy. 3-10

Invited tutorial

• 
  Kathleen Fisher, David Walker: The PADS project: an overview. 11-17

XML

• 
  Claire David, Leonid Libkin, Tony Tan: Efficient reasoning about data trees via integer linear programming. 18-29
• 
  Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven: Generating, sampling and counting subclasses of regular tree languages. 30-41
• 
  Iovka Boneva, Anne-Cécile Caron, Benoît Groz, Yves Roos, Sophie Tison, Slawek Staworko: View update translation for XML. 42-53

Workflows

• 
  Daniel Deutch: Querying probabilistic business processes for sub-flows. 54-65
• 
  Elio Damaggio, Alin Deutsch, Victor Vianu: Artifact systems with data dependencies and arithmetic. 66-77
• 
  Serge Abiteboul, Pierre Bourhis, Victor Vianu: Comparing workflow specification languages: a matter of views. 78-89

Data exchange

• 
  Reinhard Pichler, Emanuel Sallinger, Vadim Savenkov: Relaxed notions of schema mapping equivalence revisited. 90-101
• 
  Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak: Solutions in XML data exchange. 102-113
• 
  Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi: Simplifying schema mappings. 114-125

XML and semi-structured data

• 
  Serge Abiteboul, Balder ten Cate, Yannis Katsis: On the equivalence of distributed systems with queries and communication. 126-137
• 
  Matthias Niewerth, Thomas Schwentick: Two-variable logic and key constraints on data words. 138-149
• 
  James Cheney: Satisfiability algorithms for conjunctive queries over trees. 150-161

Probabilistic databases

• 
  Abhay Kumar Jha, Dan Suciu: Knowledge compilation meets database theory: compiling queries to decision diagrams. 162-173
• 
  Robert Fink, Dan Olteanu: On the optimal approximation of queries using tractable propositional languages. 174-185
• 
  Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips: (Approximate) uncertain skylines. 186-196

Query languages

• 
  George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren, Yuqing Wu: Relative expressive power of navigational querying on graphs. 197-207
• 
  Huy Vu, Michael Benedikt: Complexity of higher-order queries. 208-219
• 
  Daniel Pasaila: Conjunctive queries determinacy and rewriting. 220-231

Query evaluation and cleaning

• 
  Sudeepa Roy, Vittorio Perduca, Val Tannen: Faster query answering in probabilistic databases using read-once functions. 232-243
• 
  Reinhard Pichler, Sebastian Skritek: The complexity of evaluating tuple generating dependencies. 244-255
• 
  Sagi Ben-Moshe, Yaron Kanza, Eldar Fischer, Arie Matsliah, Mani Fischer, Carl Staelin: Detecting and exploiting near-sortedness for efficient relational query evaluation. 256-267
• 
  Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. Lakshmanan: Data cleaning and query answering with matching dependencies and matching functions. 268-279

last updated on Sat May 18 05:03:06 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page