[DL] PODS 2015 - accepted papers, keynote, and tutorials

Marco Montali montali at inf.unibz.it
Sun Apr 19 22:58:14 CEST 2015


34th ACM SIGMOD-SIGACT-SIGAI Symposium on
PRINCIPLES OF DATABASE SYSTEMS (PODS 2015)

June 1-3, 2015, Melbourne, Victoria, Australia
http://www.sigmod2015.org


ACCEPTED PAPERS

Private Multiplicative Weights Beyond Linear Queries
Jonathan Ullman.

Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability
Georg Gottlob, Reinhard Pichler and Emanuel Sallinger.

External Memory Stream Sampling
Xiaocheng Hu, Miao Qiao and Yufei Tao.

Default Negation for Non-Guarded Existential Rules
Mario Alviano and Andreas Pieris.

Parallel-Correctness and Transferability for Conjunctive Queries
Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven and Thomas Schwentick.

Symmetric Weighted First-Order Model Counting
Paul Beame, Guy Van den Broeck, Eric Gribkoff and Dan Suciu.

Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search
Michael Kapralov.

Dichotomies in the Complexity of Preferred Repairs
Ronald Fagin, Benny Kimelfeld and Phokion Kolaitis.

Vertex and Hyperedge Connectivity in Dynamic Graph Streams
Sudipto Guha, Andrew McGregor and David Tench.

Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions?
M Praveen and B Srivathsan.

High-Level Why-Not Explanations using Ontologies
Balder Ten Cate, Cristina Civili, Evgeny Sherkhonov and Wang-Chiew Tan.

The (Almost) Complete Guide to Tree Pattern Containment
Wojciech Czerwiński, Wim Martens, Paweł Parys and Marcin Przybyłko.

Efficient Evaluation and Approximation of Well-designed Pattern Trees
Pablo Barceló, Reinhard Pichler and Sebastian Skritek.

Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration
Xiaocheng Hu, Miao Qiao and Yufei Tao.

The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
Paraschos Koutris and Jef Wijsen.

Recovering Exchanged Data
Gosta Grahne, Ali Moallemi and Adrian Onet.

Querying Big Data by Accessing Small Data
Wenfei Fan, Floris Geerts, Yang Cao, Ting Deng and Ping Lu

Fast and Near–Optimal Algorithms for Approximating Distributions by Histograms
Jayadev Acharya, Ilias Diakonikolas, Chinmay Hegde, Jerry Li and Ludwig Schmidt.

Chase Termination for Guarded Existential Rules
Marco Calautti, Georg Gottlob and Andreas Pieris.

BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema
Wim Martens, Frank Neven, Matthias Niewerth and Thomas Schwentick.

Skyline Queries with Noisy Comparisons
Benoit Groz and Tova Milo.

Joins via Geometric Resolutions: Worst-case and Beyond
Mahmoud Abo Khamis, Hung Ngo, Christopher Re and Atri Rudra.

On Top-k Range Reporting in 2D Space
Rahul Saladi and Yufei Tao.

Dynamic Data Structures for Document Collections and Graphs
Ian Munro, Yakov Nekrich and Jeff Vitter.

The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication
Dirk Van Gucht, Ryan Williams, David Woodruff and Qin Zhang.


KEYNOTE

Computational Thinking, Inferential Thinking and "Big Data"
Michael I. Jordan (University of California, Berkeley, USA).


INVITED TUTORIALS

LogiQL, a Declarative Language for Enterprise Applications
Todd J. Green (LogicBlox, USA).

Compact summaries over large datasets
Graham Cormode (University of Warwick, UK).




More information about the dl mailing list