PODS accepted papers

PODS '17- Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

Full Citation in the ACM Digital Library


  • Jan Van den Bussche

Data Citation: A Computational Challenge

  • Susan B. Davidson
  • Peter Buneman
  • Daniel Deutch
  • Tova Milo
  • Gianmaria Silvello

SESSION: PODS Session 1: New Formal Frameworks

  • Paris Koutris

A Relational Framework for Classifier Engineering

  • Benny Kimelfeld
  • Christopher Ré

Querying Probabilistic Preferences in Databases

  • Batya Kenig
  • Benny Kimelfeld
  • Haoyue Ping
  • Julia Stoyanovich

SESSION: PODS Session 2: Algorithms, Data Structures, Benchmarking

  • Floris Geerts

Benchmarking the Chase

  • Michael Benedikt
  • George Konstantinidis
  • Giansalvatore Mecca
  • Boris Motik
  • Paolo Papotti
  • Donatello Santoro
  • Efthymia Tsamoura

Efficient and Provable Multi-Query Optimization

  • Tarun Kathuria
  • S. Sudarshan

Write-Optimized Skip Lists

  • Michael A. Bender
  • Martín Farach-Colton
  • Rob Johnson
  • Simon Mauras
  • Tyler Mayer
  • Cynthia A. Phillips
  • Helen Xu

Output-optimal Parallel Algorithms for Similarity Joins

  • Xiao Hu
  • Yufei Tao
  • Ke Yi

SESSION: Gems of PODS and Test-of-Time Award Session

  • Floris Geerts

2017 ACM PODS Alberto O. Mendelzon Test-of-Time Award

  • Leonid Libkin
  • Moshe Vardi

The Semiring Framework for Database Provenance

  • Todd J. Green
  • Val Tannen

Data Integration: After the Teenage Years

  • Behzad Golshan
  • Alon Halevy
  • George Mihaila
  • Wang-Chiew Tan

SESSION: PODS Session 3: Concurrency, JSON, Learning and Privacy

  • Stijn Vansummeren

How Fast can a Distributed Transaction Commit?

  • Rachid Guerraoui
  • Jingjing Wang

JSON: Data model, Query languages and Schema specification

  • Pierre Bourhis
  • Juan L. Reutter
  • Fernando Suárez
  • Domagoj Vrgoč

J-Logic: Logical Foundations for JSON Querying

  • Jan Hidders
  • Jan Paredaens
  • Jan Van den Bussche

Reverse Engineering SPJ-Queries from Examples

  • Yaacov Y. Weiss
  • Sara Cohen

Private Incremental Regression

  • Shiva Prasad Kasiviswanathan
  • Kobbi Nissim
  • Hongxia Jin


  • Benny Kimelfeld

Statistical Relational Learning: Unifying AI & DB Perspectives on Structured Probabilistic Models

  • Lise Getoor

SESSION: PODS Session 4: Best Paper Award, Ontologies and JSON

  • Andreas Pieris

Dichotomies in Ontology-Mediated Querying with the Guarded Fragment

  • André Hernich
  • Carsten Lutz
  • Fabio Papacchini
  • Frank Wolter

The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries

  • Meghyn Bienvenu
  • Stanislav Kikot
  • Roman Kontchakov
  • Vladimir V. Podolskii
  • Vladislav Ryzhikov
  • Michael Zakharyaschev

Conjunctive Queries on Probabilistic Graphs: Combined Complexity

  • Antoine Amarilli
  • Mikaël Monet
  • Pierre Senellart

Circuit Treewidth, Sentential Decision, and Query Compilation

  • Simone Bova
  • Stefan Szeider

SESSION: PODS Session 5: Enumeration Problems

  • Ke Yi

2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection

  • David Eppstein
  • Michael T. Goodrich
  • Michael Mitzenmacher
  • Manuel R. Torres

On Asymptotic Cost of Triangle Listing in Random Graphs

  • Di Xiao
  • Yi Cui
  • Daren B.H. Cline
  • Dmitri Loguinov

Efficiently Enumerating Minimal Triangulations

  • Nofar Carmeli
  • Batya Kenig
  • Benny Kimelfeld

Counting and Enumerating (Preferred) Database Repairs

  • Ester Livshits
  • Benny Kimelfeld

Answering Conjunctive Queries under Updates

  • Christoph Berkholz
  • Jens Keppeler
  • Nicole Schweikardt


  • Semih Salihoglu

Communication Cost in Parallel Query Evaluation: A Tutorial

  • Dan Suciu

SESSION: PODS Session 6: Best Student Paper Award, Streaming and Sketches

  • Yufei Tao

Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem

  • Sepehr Assadi

Streaming Algorithms for Measuring H-Impact

  • Priya Govindan
  • Morteza Monemizadeh
  • S. Muthukrishnan

Efficient Matrix Sketching over Distributed Data

  • Zengfeng Huang
  • Xuemin Lin
  • Wenjie Zhang
  • Ying Zhang

BPTree: An ℓ2 Heavy Hitters Algorithm Using Constant Memory

  • Vladimir Braverman
  • Stephen R. Chestnut
  • Nikita Ivkin
  • Jelani Nelson
  • Zhengyu Wang
  • David P. Woodruff

SESSION: PODS Session 7: Dependencies, Graphs and Query Evaluation

  • Angela Bonifati

Stable Model Semantics for Tuple-Generating Dependencies Revisited

  • Mario Alviano
  • Michael Morak
  • Andreas Pieris

Schema Mappings for Data Graphs

  • Nadime Francis
  • Leonid Libkin

Dependencies for Graphs

  • Wenfei Fan
  • Ping Lu

A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries

  • Bas Ketsman
  • Dan Suciu

What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?

  • Mahmoud Abo Khamis
  • Hung Q. Ngo
  • Dan Suciu