Abstract is missing.
- How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?Michael Benedikt. 1-15 [doi]
- General and Fractional Hypertree Decompositions: Hard and Easy CasesWolfgang Fischl, Georg Gottlob, Reinhard Pichler. 17-32 [doi]
- Reconciling Graphs and Sets of SetsMichael Mitzenmacher, Tom Morgan. 33-47 [doi]
- Entity Matching with Active Monotone ClassificationYufei Tao. 49-62 [doi]
- Set Similarity Search for Skewed DataSamuel McCauley, Jesper W. Mikkelsen, Rasmus Pagh. 63-74 [doi]
- Subtrajectory Clustering: Models and AlgorithmsPankaj K. Agarwal, Kyle Fox, Kamesh Munagala, Abhinandan Nath, Jiangwei Pan, Erin Taylor. 75-87 [doi]
- Distance-Sensitive HashingMartin Aumüller 0001, Tobias Christiani, Rasmus Pagh, Francesco Silvestri 0001. 89-104 [doi]
- 2018 ACM PODS Alberto O. Mendelzon Test-of-Time AwardMaurizio Lenzerini, Wim Martens, Nicole Schweikardt. 105 [doi]
- Reflections on Schema Mappings, Data Exchange, and Metadata ManagementPhokion G. Kolaitis. 107-109 [doi]
- Worst-Case Optimal Join Algorithms: Techniques, Results, and Open ProblemsHung Q. Ngo 0001. 111-124 [doi]
- Document Spanners for Extracting Incomplete Information: Expressiveness and ComplexityFrancisco Maturana, Cristian Riveros, Domagoj Vrgoc. 125-136 [doi]
- Joining Extractions of Regular ExpressionsDominik D. Freydenberger, Benny Kimelfeld, Liat Peterfreund. 137-149 [doi]
- Enumeration for FO Queries over Nowhere Dense GraphsNicole Schweikardt, Luc Segoufin, Alexandre Vigny. 151-163 [doi]
- Constant Delay Algorithms for Regular Document SpannersFernando Florenzano, Cristian Riveros, Martín Ugarte, Stijn Vansummeren, Domagoj Vrgoc. 165-177 [doi]
- Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic UpdatesMatthias Niewerth, Luc Segoufin. 179-191 [doi]
- Blockchains: Past, Present, and FutureArvind Narayanan. 193 [doi]
- Certain Answers Meet Zero-One LawsLeonid Libkin. 195-207 [doi]
- Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated AtomsParaschos Koutris, Jef Wijsen. 209-224 [doi]
- Computing Optimal Repairs for Functional DependenciesEster Livshits, Benny Kimelfeld, Sudeepa Roy. 225-237 [doi]
- An Operational Approach to Consistent Query AnsweringMarco Calautti, Leonid Libkin, Andreas Pieris. 239-251 [doi]
- First-Order Query Evaluation with Cardinality ConditionsMartin Grohe, Nicole Schweikardt. 253-266 [doi]
- Containment for Rule-Based Ontology-Mediated QueriesPablo Barceló, Gerald Berger, Andreas Pieris. 267-279 [doi]
- When Can We Answer Queries Using Result-Bounded Data Interfaces?Antoine Amarilli, Michael Benedikt. 281-293 [doi]
- The Tractability Frontier of Well-designed SPARQL QueriesMiguel Romero. 295-306 [doi]
- Compressed Representations of Conjunctive Query ResultsShaleen Deep, Paraschos Koutris. 307-322 [doi]
- In-memory Representations of Databases via Succinct Data Structures: Tutorial AbstractRajeev Raman. 323-324 [doi]
- In-Database Learning with Sparse TensorsMahmoud Abo Khamis, Hung Q. Ngo 0001, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich. 325-340 [doi]
- Data Streams with Bounded DeletionsRajesh Jayaram, David P. Woodruff. 341-354 [doi]
- Active Learning of GAV Schema MappingsBalder ten Cate, Phokion G. Kolaitis, Kun Qian 0002, Wang Chiew Tan. 355-368 [doi]
- Distinct Sampling on Streaming Data with Near-DuplicatesJiecao Chen, Qin Zhang 0001. 369-382 [doi]
- Distributed Statistical Estimation of Matrix Products with ApplicationsDavid P. Woodruff, Qin Zhang 0001. 383-394 [doi]
- Optimal Differentially Private Algorithms for k-Means ClusteringZhiyi Huang, Jinyan Liu. 395-408 [doi]
- Explanations and Transparency in Collaborative WorkflowsSerge Abiteboul, Pierre Bourhis, Victor Vianu. 409-424 [doi]
- Improvements on the k-center Problem for Uncertain DataSharareh Alipour, Amir Jafari. 425-433 [doi]
- Heavy Hitters and the Structure of Local PrivacyMark Bun, Jelani Nelson, Uri Stemmer. 435-447 [doi]