ACM SIGMOD City, Country, Year
sigmod pods logo

Calls For Submissions

PODS Program

SIGMOD Program





PODS 2018: Accepted Papers

  • In-Database Learning with Sparse Tensors
    Mahmoud Abo Khamis (RelationalAI, Inc); Hung Q. Ngo (RelationalAI, Inc); XuanLong Nguyen (University of Michigan); Dan Olteanu (University of Oxford); Maximilian Schleich (University of Oxford)
  • Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates
    Matthias Niewerth (Bayreuth University); Luc Segoufin (INRIA and ENS Ulm)
  • General and Fractional Hypertree Decompositions: Hard and Easy Cases
    Wolfgang Fischl (TU Wien); Georg Gottlob (University of Oxford); Reinhard Pichler (TU Wien)
  • Containment for Rule-Based Ontology-Mediated Queries
    Pablo Barcelo (University of Chile); Gerald Berger (TU Wien); Andreas Pieris (University of Edinburgh)
  • Distributed Statistical Estimation of Matrix Products with Applications
    David P. Woodruff (Carnegie Mellon University); Qin Zhang (Indiana University)
  • When Can We Answer Queries Using Result-Bounded Data Interfaces?
    Antoine Amarilli (Telecom ParistTech); Michael Benedikt (Oxford University)
  • An Operational Approach to Consistent Query Answering
    Marco Calautti (University of Edinburgh); Leonid Libkin (University of Edinburgh); Andreas Pieris (University of Edinburgh)
  • Joining Extractions of Regular Expressions
    Dominik D. Freydenberger (Loughborough University); Benny Kimelfeld (Technion ); Liat Peterfreund (Technion)
  • Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity
    Francisco Maturana (Carnegie Mellon University); Cristian Riveros (Pontificia Universidad Catolica de Chile); Domagoj Vrgoc (Pontificia Universidad Catolica de Chile)
  • Improvements on the k-center Problem for Uncertain Data
    Sharareh Alipour (Institute for Research in Fundamental Sciences); Amir Jafari (Sharif University of Technology and School of Mathematics & Institute for research in fundamental sciences)
  • First-Order Query Evaluation with Cardinality Conditions
    Martin Grohe (RWTH Aachen University); Nicole Schweikardt (Humboldt-University Berlin)
  • Enumeration for FO Queries over Nowhere Dense Graphs
    Nicole Schweikardt (Humboldt-Universität zu Berlin); Luc Segoufin (INRIA and ENS Ulm); Alexandre Vigny (Université Paris Diderot)
  • Subtrajectory Clustering: Models and Algorithms
    Pankaj K. Agarwal (Duke University); Kyle Fox (University of Texas at Dallas); Kamesh Munagala (Duke University); Abhinandan Nath (Duke University); Jiangwei Pan (Facebook); Erin Taylor (Duke University)
  • The Tractability Frontier of Well-designed SPARQL Queries
    Miguel Romero (University of Oxford)
  • Active Learning of GAV Schema Mappings
    Balder ten Cate (Google Inc.); Phokion G Kolaitis (University of California, Santa Cruz & IBM Research - Almaden); Kun Qian (IBM Research - Almaden); Wang-Chiew Tan (Recruit Institute of Technology, Inc)
  • Explanations and Transparency in Collaborative Workflows
    Serge Abiteboul (Inria-Paris & ENS Paris); Pierre Bourhis (CNRS & University Lille, Inria Lille); Victor Vianu (University of California, San Diego & INRIA Paris, ENS Paris)
  • Distance-Sensitive Hashing
    Martin Aumüller (BARC & IT University of Copenhagen); Tobias Christiani (BARC & IT University of Copenhagen); Rasmus Pagh (BARC & IT University of Copenhagen); Francesco Silvestri (University of Padova)
  • Optimal Differentially Private Algorithms for k-Means Clustering
    Zhiyi Huang (University of Hong Kong); Jinyan Liu (University of Hong Kong)
  • Distinct Sampling on Streaming Data with Near-Duplicates
    Jiecao Chen (Indiana University Bloomington); Qin Zhang (Indiana University Bloomington)
  • Compressed Representations of Conjunctive Query Results
    Shaleen Deep (University of Wisconsin-Madison); Paraschos Koutris (University of Wisconsin-Madison)
  • Computing Optimal Repairs for Functional Dependencies
    Ester Livshits (Technion); Benny Kimelfeld (Technion); Sudeepa Roy (Duke University)
  • Heavy Hitters and the Structure of Local Privacy
    Mark Bun (Princeton University); Jelani Nelson (Harvard University); Uri Stemmer (Weizmann Institute )
  • Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms
    Paraschos Koutris (University of Wisconsin-Madison); Jef Wijsen (Université de Mons)
  • Certain Answers Meet Zero-One Laws
    Leonid Libkin (University of Edinburgh)
  • Entity Matching with Active Monotone Classification
    Yufei Tao (Chinese University of Hong Kong )
  • Set Similarity Search for Skewed Data
    Samuel McCauley (BARC and IT U. Copenhagen); Jesper W. Mikkelsen (IT U. Copenhagen); Rasmus Pagh (BARC and IT U. Copenhagen)
  • Data Streams with Bounded Deletions
    Rajesh Jayaram (Carnegie Mellon University); David P. Woodruff (Carnegie Mellon University)
  • Constant Delay Algorithms for Regular Document Spanners
    Fernando Florenzano (Pontificia Universidad Católica de Chile); Cristian Riveros (Pontificia Universidad Católica de Chile); Martin Ugarte (Université Libre de Bruxelles); Stijn Vansummeren (Université Libre de Bruxelles); Domagoj Vrgoc (Pontificia Universidad Católica de Chile)
  • Reconciling Graphs and Sets of Sets
    Michael Mitzenmacher (Harvard University); Tom Morgan (Harvard University)

Credits
Follow our progress: FacebookTwitter