
PODS 2018: Accepted Papers
-
In-Database Learning with Sparse TensorsMahmoud 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 UpdatesMatthias Niewerth (Bayreuth University); Luc Segoufin (INRIA and ENS Ulm)
-
General and Fractional Hypertree Decompositions: Hard and Easy CasesWolfgang Fischl (TU Wien); Georg Gottlob (University of Oxford); Reinhard Pichler (TU Wien)
-
Containment for Rule-Based Ontology-Mediated QueriesPablo Barcelo (University of Chile); Gerald Berger (TU Wien); Andreas Pieris (University of Edinburgh)
-
Distributed Statistical Estimation of Matrix Products with ApplicationsDavid 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 AnsweringMarco Calautti (University of Edinburgh); Leonid Libkin (University of Edinburgh); Andreas Pieris (University of Edinburgh)
-
Joining Extractions of Regular ExpressionsDominik D. Freydenberger (Loughborough University); Benny Kimelfeld (Technion ); Liat Peterfreund (Technion)
-
Document Spanners for Extracting Incomplete Information: Expressiveness and ComplexityFrancisco 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 DataSharareh 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 ConditionsMartin Grohe (RWTH Aachen University); Nicole Schweikardt (Humboldt-University Berlin)
-
Enumeration for FO Queries over Nowhere Dense GraphsNicole Schweikardt (Humboldt-Universität zu Berlin); Luc Segoufin (INRIA and ENS Ulm); Alexandre Vigny (Université Paris Diderot)
-
Subtrajectory Clustering: Models and AlgorithmsPankaj 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 QueriesMiguel Romero (University of Oxford)
-
Active Learning of GAV Schema MappingsBalder 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 WorkflowsSerge 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 HashingMartin 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 ClusteringZhiyi Huang (University of Hong Kong); Jinyan Liu (University of Hong Kong)
-
Distinct Sampling on Streaming Data with Near-DuplicatesJiecao Chen (Indiana University Bloomington); Qin Zhang (Indiana University Bloomington)
-
Compressed Representations of Conjunctive Query ResultsShaleen Deep (University of Wisconsin-Madison); Paraschos Koutris (University of Wisconsin-Madison)
-
Computing Optimal Repairs for Functional DependenciesEster Livshits (Technion); Benny Kimelfeld (Technion); Sudeepa Roy (Duke University)
-
Heavy Hitters and the Structure of Local PrivacyMark Bun (Princeton University); Jelani Nelson (Harvard University); Uri Stemmer (Weizmann Institute )
-
Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated AtomsParaschos Koutris (University of Wisconsin-Madison); Jef Wijsen (Université de Mons)
-
Certain Answers Meet Zero-One LawsLeonid Libkin (University of Edinburgh)
-
Entity Matching with Active Monotone ClassificationYufei Tao (Chinese University of Hong Kong )
-
Set Similarity Search for Skewed DataSamuel McCauley (BARC and IT U. Copenhagen); Jesper W. Mikkelsen (IT U. Copenhagen); Rasmus Pagh (BARC and IT U. Copenhagen)
-
Data Streams with Bounded DeletionsRajesh Jayaram (Carnegie Mellon University); David P. Woodruff (Carnegie Mellon University)
-
Constant Delay Algorithms for Regular Document SpannersFernando 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 SetsMichael Mitzenmacher (Harvard University); Tom Morgan (Harvard University)