Below please find the list of accepted papers from the second submission round of PODS 2018 (in no particular order):

• Nicole Schweikardt, Luc Segoufin and Alexandre Vigny. Enumeration for FO queries over nowhere dense graphs
• Pankaj K. Agarwal, Kyle Fox, Kamesh Munagala, Abhinandan Nath, Jiangwei Pan and Erin Taylor. Subtrajectory clustering : models and algorithms
• Miguel Romero. The tractability frontier of well-designed SPARQL queries
• Balder ten Cate, Phokion Kolaitis, Kun Qian and Wang-Chiew Tan. Active Learning of GAV Mappings
• Serge Abiteboul, Pierre Bourhis and Victor Vianu. Explanations and Transparency in Collaborative Workflows
• Martin Aumüller, Tobias Christiani, Rasmus Pagh and Francesco Silvestri. Distance-sensitive hashing
• Zhiyi Huang and Jinyan Liu. Optimal Differentially Private Algorithms for k-Means Clustering
• Jiecao Chen and Qin Zhang. Distinct Sampling on Streaming Data with Near-Duplicates
• Shaleen Deep and Paraschos Koutris. Compressed Representations of Conjunctive Query Results
• Ester Livshits, Benny Kimelfeld and Sudeepa Roy. Computing Optimal Repairs for Functional Dependencies
• Mark Bun, Jelani Nelson and Uri Stemmer. Heavy Hitters and the Structure of Local Privacy
• Paraschos Koutris and Jef Wijsen. Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms
• Leonid Libkin. Measuring Certainty of Query Answers
• Yufei Tao. Entity Matching with Active Monotone Classification
• Samuel Mccauley, Jesper W. Mikkelsen and Rasmus Pagh. Set Similarity Search for Skewed Data
• Rajesh Jayaram and David P. Woodruff. Data Streams with Bounded Deletions
• Fernando Florenzano, Cristian Riveros, Martín Ugarte, Stijn Vansummeren and Domagoj Vrgoc. Constant delay algorithms for regular document spanners
• Michael Mitzenmacher and Tom Morgan. Reconciling Graphs and Sets of Sets