PODS 2019 - List of Accepted Papers

Submitted by Milos Nikolic on Wed, 03/13/2019 - 23:16

The list of accepted papers for PODS 2019:

  • Noam Ravid, Dori Medini and Benny Kimelfeld. Ranked Enumeration of Minimal Triangulations
  • Hubie Chen and Yuichi Yoshida. Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory
  • Pablo Barceló, Alexander Baumgartner, Victor Dalmau and Benny Kimelfeld. Regularizing Conjunctive Features for Classification
  • Martin Grohe and Peter Lindner. Probabilistic Databases with an Infinite Open-World Assumption
  • Hubie Chen. The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems
  • Wolfgang Fischl, Georg Gottlob, Davide Mario Longo and Reinhard Pichler. HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
  • Johannes Doleschal, Benny Kimelfeld, Wim Martens, Yoav Nahshon and Frank Neven. Split-Correctness in Information Extraction
  • David Baelde, Anthony Lick and Sylvain Schmitz. Decidable XPath Fragments in the Real World
  • Michael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman and Atri Rudra. Topology Dependent Bounds for (Some) FAQs
  • Sławek Staworko and Piotr Wieczorek. Containment of Shape Expression Schemas for RDF
  • Gerald Berger, Georg Gottlob, Andreas Pieris and Emanuel Sallinger. The Space-Efficient Core of Vadalog
  • George Konstantinidis and Fabio Mogavero. Attacking Diophantus: Solving a Special Case of Bag Containment
  • Michael Mitzenmacher and Tom Morgan. Robust Set Reconciliation via Locality Sensitive Hashing
  • Piotr Indyk and Ali Vakilian. Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model
  • Benny Kimelfeld, Phokion Kolaitis and Muhammad Tibi. Query Evaluation in Election Databases
  • Christoph Berkholz and Hubie Chen. Compiling Existential Positive Queries to Bounded-Variable Fragments
  • Mahmoud Abo Khamis, Ryan Curtin, Ben Moseley, Hung Ngo, Long Nguyen, Dan Olteanu and Maximilian Schleich. On Functional Aggregate Queries with Additive Inequalities
  • Sarvar Patel, Giuseppe Persiano and Kevin Yeo. What Storage Access Privacy is achievable with Small Overhead?
  • Rajesh Jayaram, Gokarna Sharma, Srikanta Tirthapura and David P. Woodruff. Weighted Reservoir Sampling from Distributed Streams
  • Sepehr Assadi, Nikolai Karpov and Qin Zhang. Distributed and Streaming Linear Programming in Low Dimensions
  • Xiao Hu and Ke Yi. Instance and Output Optimal Parallel Algorithms for Acyclic Joins
  • Dominik D. Freydenberger, Benny Kimelfeld, Markus Kröll and Liat Peterfreund. Complexity Bounds for Relational Algebra over Document Spanners
  • Nofar Carmeli and Markus Kröll. On the Enumeration Complexity of Unions of Conjunctive Queries
  • Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii and Morteza Zadimoghaddam. Better Sliding Windows Algorithms for Subadditive and Diversity Maximization
  • Antoine Amarilli, Pierre Bourhis, Stefan Mengel and Matthias Niewerth. Enumeration on Trees with Tractable Combined Complexity and Efficient Updates
  • Marco Calautti, Marco Console and Andreas Pieris. Counting Database Repairs under Primary Keys Revisited
  • Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram and Cristian Riveros. Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
  • Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig and Marco Montali. Reachability in Database-Driven Systems with Numerical Attributes under Recency Bounding
  • John Kallaugher, Andrew McGregor, Eric Price and Sofya Vorotnikova. The Complexity of Counting Cycles in the Adjacency List Streaming Model