ACM SIGMOD City, Country, Year
sigmod pods logo

PODS 2015: Accepted Papers

  • Jonathan Ullman. Private Multiplicative Weights Beyond Linear Queries
  • Georg Gottlob, Reinhard Pichler and Emanuel Sallinger. Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability
  • Xiaocheng Hu, Miao Qiao and Yufei Tao. External Memory Stream Sampling
  • Mario Alviano and Andreas Pieris. Default Negation for Non-Guarded Existential Rules
  • Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven and Thomas Schwentick. Parallel-Correctness and Transferability for Conjunctive Queries
  • Paul Beame, Guy Van den Broeck, Eric Gribkoff and Dan Suciu. Symmetric Weighted First-Order Model Counting
  • Michael Kapralov. Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search
  • Ronald Fagin, Benny Kimelfeld and Phokion Kolaitis. Dichotomies in the Complexity of Preferred Repairs
  • Sudipto Guha, Andrew McGregor and David Tench. Vertex and Hyperedge Connectivity in Dynamic Graph Streams
  • M Praveen and B Srivathsan. Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions?
  • Balder Ten Cate, Cristina Civili, Evgeny Sherkhonov and Wang-Chiew Tan. High-Level Why-Not Explanations using Ontologies
  • Wojciech Czerwiński, Wim Martens, Paweł Parys and Marcin Przybyłko. The (Almost) Complete Guide to Tree Pattern Containment
  • Pablo Barceló, Reinhard Pichler and Sebastian Skritek. Efficient Evaluation and Approximation of Well-designed Pattern Trees
  • Xiaocheng Hu, Miao Qiao and Yufei Tao. Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration
  • Paraschos Koutris and Jef Wijsen. The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
  • Gosta Grahne, Ali Moallemi and Adrian Onet. Recovering Exchanged Data
  • Wenfei Fan, Floris Geerts, Yang Cao, Ting Deng and Ping Lu Querying Big Data by Accessing Small Data
  • Jayadev Acharya, Ilias Diakonikolas, Chinmay Hegde, Jerry Li and Ludwig Schmidt. Fast and Near–Optimal Algorithms for Approximating Distributions by Histograms
  • Marco Calautti, Georg Gottlob and Andreas Pieris. Chase Termination for Guarded Existential Rules
  • Wim Martens, Frank Neven, Matthias Niewerth and Thomas Schwentick. BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema
  • Benoit Groz and Tova Milo. Skyline Queries with Noisy Comparisons
  • Mahmoud Abo Khamis, Hung Ngo, Christopher Re and Atri Rudra. Joins via Geometric Resolutions: Worst-case and Beyond
  • Rahul Saladi and Yufei Tao. On Top-k Range Reporting in 2D Space
  • Ian Munro, Yakov Nekrich and Jeff Vitter. Dynamic Data Structures for Document Collections and Graphs
  • Dirk Van Gucht, Ryan Williams, David Woodruff and Qin Zhang. The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication

Follow our progress: Facebook