PODS 2013 - Accepted Papers

Dear colleagues,

It is my pleasure to announce the list of accepted papers for the
32nd SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (PODS 2013)
June 24-26, 2013, New York, USA.

The PODS program will also feature a keynote by Diego Calvanese
of the Free University of Bozen-Bolzano, and two invited tutorials, one by
Piotr Indyk of MIT, and another one by Pablo Barcelo of Universidad de Chile.

Wenfei Fan
PODS 2013 PC Chair
http://www.sigmod.org/2013/

===========================================

Serge Abiteboul and Victor Vianu. Collaborative Data-Driven Workflows:
Think Global, Act Local

Azza Abouzied, Dana Angluin, Christos Papadimitriou, Joseph Hellerstein
and Avi Silberschatz. Learning and Verifying Quantified Boolean Queries by
Example

Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi
and Wuzhou Zhang. Nearest Neighbor Searching Under Uncertainty II

Tom Ameloot, Jan Van den Bussche and Emmanuel Waller. On the expressive
power of update primitives

Guillaume Bagan, Angela Bonifati and Benoit Groz. A Trichotomy for Regular
Simple Path Queries on Graphs

Pablo Barceló, Miguel Romero and Moshe Vardi. Semantic Acyclicity on Graph
Databases

Paul Beame, Paraschos Koutris and Dan Suciu. Counting Communication Steps
for Parallel Query Processing

Meghyn Bienvenu, Balder Ten Cate, Carsten Lutz and Frank Wolter.
Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and
MMSNP

Mikolaj Bojanczyk, Luc Segoufin and Szymon Toruńczyk. Verification of
database-driven systems via amalgamation

Hubie Chen and Moritz Mueller. The Fine Classification of Conjunctive
Queries and Parameterized Logarithmic Space Complexity

Ronald Fagin, Benny Kimelfeld, Frederick Reiss and Stijn Vansummeren.
Spanners: A Formal Framework for Information Extraction

Diego Figueira. On XPath with transitive axes and data tests

Amelie Gheerbrant, Leonid Libkin and Cristina Sirangelo. When is Naive
Evaluation Possible?

Georg Gottlob. Deciding Monotone Duality and Identifying Frequent Item
Sets in Quadratic Logspace

Babak Bagheri Hariri, Diego Calvanese, Giuseppe De Giacomo, Alin Deutsch
and Marco Montali. Verification of Relational Data-Centric Dynamic Systems
with External Services

André Hernich, Clemens Kupke, Thomas Lukasiewicz and Georg Gottlob.
Well-Founded Semantics for Extended Datalog and Ontological Reasoning

Wojciech Kazana and Luc Segoufin. Enumeration of first-order queries on
classes of structures with bounded expansion

Casper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis, Kostas
Tsichlas and Jeonghun Yoon. I/O-Efficient Planar Range Skyline and
Attrition Priority Queues

Benny Kimelfeld and Phokion Kolaitis. The Complexity of Mining Maximal
Frequent Subgraphs

Leonid Libkin, Juan L. Reutter and Domagoj Vrgoc. TriAL for RDF: Adapting
Graph Query Languages for RDF Data

Jerzy Marcinkowski and Tomasz Gogacz. On the BDD/FC Conjecture

Sebastian Rudolph and Markus Krötzsch. Flag & Check: Data Access with
Monadically Defined Queries

Jef Wijsen. Charting the Tractability Frontier of Certain Conjunctive
Query Answering

Limsoon Wong. A Dichotomy in the Intensional Expressive Power of Nested
Relational Calculi augmented with Aggregate Functions and a Powerset
Operator