


default search action
34th PODS 2015: Melbourne, Victoria, Australia
- Tova Milo, Diego Calvanese:

Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, May 31 - June 4, 2015. ACM 2015, ISBN 978-1-4503-2757-2
Keynote Address
- Michael I. Jordan:

Computational Thinking, Inferential Thinking and "Big Data". 1
Repairs and Ontologies
- Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis:

Dichotomies in the Complexity of Preferred Repairs. 3-15 - Paraschos Koutris, Jef Wijsen

:
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints. 17-29 - Balder ten Cate, Cristina Civili, Evgeny Sherkhonov, Wang-Chiew Tan:

High-Level Why-Not Explanations using Ontologies. 31-43
Awards Session
- Foto N. Afrati, Frank Neven

, Dan Suciu
:
The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2015. 45 - Tom J. Ameloot, Gaetano Geck

, Bas Ketsman
, Frank Neven
, Thomas Schwentick:
Parallel-Correctness and Transferability for Conjunctive Queries. 47-58
Tutorial Session 1
- Todd J. Green:

LogiQL: A Declarative Language for Enterprise Applications. 59-64
Existential Rules and TGDs
- Georg Gottlob

, Reinhard Pichler, Emanuel Sallinger
:
Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability. 65-77 - Mario Alviano, Andreas Pieris:

Default Negation for Non-Guarded Existential Rules. 79-90 - Marco Calautti

, Georg Gottlob
, Andreas Pieris:
Chase Termination for Guarded Existential Rules. 91-103 - Gösta Grahne, Ali Moallemi, Adrian Onet:

Recovering Exchanged Data. 105-116
Tree Structured Data
- Wojciech Czerwinski

, Wim Martens, Pawel Parys
, Marcin Przybylko:
The (Almost) Complete Guide to Tree Pattern Containment. 117-130 - Pablo Barceló, Reinhard Pichler, Sebastian Skritek

:
Efficient Evaluation and Approximation of Well-designed Pattern Trees. 131-144 - Wim Martens, Frank Neven

, Matthias Niewerth, Thomas Schwentick:
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema. 145-156
Tutorial Session 2
- Graham Cormode

:
Compact Summaries over Large Datasets. 157-158 - M. Praveen, B. Srivathsan

:
Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? 159-172
Query Processing
- Wenfei Fan

, Floris Geerts
, Yang Cao, Ting Deng, Ping Lu:
Querying Big Data by Accessing Small Data. 173-184 - Benoît Groz, Tova Milo:

Skyline Queries with Noisy Comparisons. 185-198 - Dirk Van Gucht, Ryan Williams

, David P. Woodruff, Qin Zhang
:
The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication. 199-212 - Mahmoud Abo Khamis

, Hung Q. Ngo, Christopher Ré, Atri Rudra:
Joins via Geometric Resolutions: Worst-case and Beyond. 213-228
Streaming
- Xiaocheng Hu, Miao Qiao

, Yufei Tao
:
External Memory Stream Sampling. 229-239 - Sudipto Guha, Andrew McGregor, David Tench

:
Vertex and Hyperedge Connectivity in Dynamic Graph Streams. 241-247 - Jayadev Acharya

, Ilias Diakonikolas, Chinmay Hegde
, Jerry Zheng Li, Ludwig Schmidt:
Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms. 249-263
Algorithms and Data Structures
- Saladi Rahul, Yufei Tao

:
On Top-k Range Reporting in 2D Space. 265-275 - J. Ian Munro, Yakov Nekrich

, Jeffrey Scott Vitter
:
Dynamic Data Structures for Document Collections and Graphs. 277-289 - Xiaocheng Hu, Miao Qiao

, Yufei Tao
:
Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration. 291-301
Weights and Similarity
- Jonathan R. Ullman:

Private Multiplicative Weights Beyond Linear Queries. 303-312 - Paul Beame

, Guy Van den Broeck, Eric Gribkoff, Dan Suciu
:
Symmetric Weighted First-Order Model Counting. 313-328 - Michael Kapralov

:
Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search. 329-342
Erratum
- Piotr Indyk, Reut Levi, Ronitt Rubinfeld:

Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time. 343

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














