Accepted papers

SIGMOD 2017 Accepted Papers (First Round)

Mohammad Dashti, Sachin Basil John, Amir Shaikhha and Christoph KochTransaction Repair for Multi-Version Concurrency Control
Tao Guo, Xin Cao, Gao Cong, Jiaheng Lu and Xuemin Lin. Distributed Algorithms on Exact Personalized PageRank
Yu Chen and Ke Yi. Two-Level Sampling for Join Size Estimation
Bo Tang, Shi Han, Man Lung Yiu, Rui Ding and Dongmei Zhang. Extracting Top-K Insights from Multi-dimensional Data
Jose Picado, Arash Termehchy, Alan Fern and Parisa Ataei. Schema Independent Relational Learning
Akhil Arora, Sainyam Galhotra and Sayan Ranu. Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study
Xiaolan Wang, Eugene Wu and Alexandra Meliou.  QFix: Diagnosing errors through query histories
Chen Chen, Harshal Tushar Lehri, Lay Kuan Loh, Anupam Alur, Limin Jia, Boon Thau Loo and Wenchao Zhou.  Distributed Provenance Compression
Junfeng Zhou, Shijie Zhou, Jeffrey Xu Yu, Hao Wei, Ziyang Chen and Xian Tang. DAG Reduction: Fast Answering Reachability Queries
Peter Bailis, Edward Gan, Samuel Madden, Deepak Narayanan, Kexin Rong and Sahaana Suri. MacroBase: Prioritizing Attention in Fast Data
Xiang Lian and Dongchul Kim. Efficient Ad-Hoc Graph Inference and Matching in Biological Databases
Haoqiong Bian, Ying Yan, Wenbo Tao, Liang Chen, Yueguo Chen, Xiaoyong Du and Thomas Moscibroda. Wide Table Layout Optimization based on Column Ordering and Duplication
Vasilis Verroios, Hector Garcia-Molina and Yannis Papakonstantinou. Waldo: An Adaptive Human Interface for Crowd Entity Resolution
Abolfazl Asudeh, Azade Nazi, Nan Zhang and Gautam Das. Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative
Jiawei Jiang, Bin Cui, Ce Zhang and Lele Yu. Heterogeneity-aware Distributed Parameter Servers
Shoji Nishimura and Haruo Yokota. QUILTS: Multidimensional Data Partitioning Based on Query Aware, Skew Tolerant Space Filling Curves
Milos Nikolic, Badrish Chandramouli and Jonathan Goldstein. Enabling Signal Processing over Data Streams
Jinghan Meng and Yicheng Tu. Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs
Shangyu Luo, Zekai Gao, Luis Perez, and Chris Jermaine. The BUDS Language for Distributed Bayesian Machine Learning
Lianghong Xu, Andrew Pavlo, Sudipta Sengupta and Gregory Ganger. Online Deduplication for Databases
Lijun Chang, Wei Li and Wenjie Zhang. Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling
Samuel Haney, Ashwin Machanavajjhala, John Abowd, Matthew Graham, Mark Kutzbach and Lars Vilhuber. Utility Cost of Formal Privacy for Releasing National Employer-Employee Statistics
Romila Pradhan, Siarhei Bykau and Sunil Prabhakar. Staging User Feedback toward Rapid Conflict Resolution in Data Fusion
Wenfei Fan, Jingbo Xu, Yinghui Wu, Wenyuan Yu, Jiaxin Jiang, Zeyu Zheng, Bohan Zhang, Yang Cao and Chao Tian. Parallelizing Sequential Graph Computations
Kangfei Zhao and Jeffrey Xu Yu. All-in-One: Graph Processing in RDBMSs Revisited
Wenfei Fan, Chunming Hu and Chao Tian. Incremental Graph Computations: Doable and Undoable
Ios Kotsogiannis, Ashwin Machanavajjhala, Michael Hay and Gerome Miklau. Pythia: Data Dependent Differentially Private Algorithm Selection
Kaan Kara, Jana Giceva and Gustavo Alonso. FPGA Based Data Partitioning
Olga Poppe, Chuan Lei, Salah Ahmed and Elke Rundensteiner. Complete Event Trend Detection in High-Rate Event Streams
Caleb Horst, Ryo Kikuchi and Keita Xagawa. Cryptanalysis of Comparable Encryption in SIGMOD’16
Konstantinos Xirogiannopoulos and Amol Deshpande. Extracting and Analyzing Hidden Graphs from Relational Databases
Jinhong Jung, Namyong Park, Lee Sael and U Kang. BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart
Theodoros Rekatsinas, Manas Joglekar, Hector Garcia-Molina, Aditya Parameswaran and Christopher Re. SLiMFast: Guaranteed Results for Data Fusion and Source Reliability
Yuchen Li, Ju Fan, Dongxiang Zhang and Kian-Lee Tan. Discovering Your Selling Points: Personalized Social Influential Tag Exploration
Ngai Meng Kou, Yan Li, Hao Wang, Leong Hou U and Zhiguo Gong. Crowdsourced Top-k Queries by Confidence-Aware Pairwise Judgments
David Sidler, Zsolt Istvan, Muhsen Owaida and Gustavo Alonso. Accelerating Pattern Matching Queries in Hybrid CPU-FPGA Architectures
Lucien Valstar, George H. L. Fletcher and Yuichi Yoshida. Landmark indexing for scalable evaluation of label-constrained reachability queries
Zhiyi Wang and Shimin Chen. Exploiting Common Patterns for Tree-Structured Data
Kayhan Dursun, Carsten Binnig, Ugur Cetintemel and Tim Kraska. Revisiting Reuse in Main Memory Database Systems
Sergey Hardock, Ilia Petrov, Robert Gottstein and Alejandro Buchmann. From In-Place Updates to In-Place Appends: Revisiting Out-of-Place Updates on Flash
Darko Makreshanski, Jana Giceva, Claude Barthels and Gustavo Alonso. BatchDB: Efficient Isolated Execution of Hybrid OLTP+OLAP Workloads

Sanjib Das, Paul Suganthan G. C., AnHai Doan, Jeffrey F. Naughton, Ganesh Krishnan, Rohit Deep, Esteban Arcaute, Vijay Raghavendra and Youngchoon Park. Falcon: Scaling Up Hands-Off Crowdsourced Entity Matching to Build Cloud Services

Joshua Auerbach, Martin Hirzel, Louis Mandel, Avraham Shinnar and Jerome Simeon. Handling Environments in a Nested Relational Algebra with Combinators and an Implementation in a Verified Query Compiler
Kenneth S. Bøgh, Sean Chester, Darius Šidlauskas and Ira Assent. Template Skycube Algorithms for Heterogeneous Parallelism on Multicore and GPU Architectures
Prashant PandeyMichael A. Bender,  Rob Johnson, and Rob Patro. A General-Purpose Counting Filter: Making Every Bit Count

PODS 2017 Accepted Papers

Simone Bova and Stefan Szeider, Circuit Treewidth, Sentential Decision, and Query Compilation
Bas Ketsman and Dan Suciu, A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries
Christoph Berkholz, Jens Keppeler and Nicole Schweikardt, Answering Conjunctive Queries under Updates
Di Xiao, Yi Cui, Daren Cline and Dmitri Loguinov, On Asymptotic Cost of Triangle Listing in Random Graphs
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii, Vladislav Ryzhikov and Michael Zakharyaschev, The Complexity of Ontology-Based Data Access with OWL2QL and Bounded Treewidth Queries
Tarun Kathuria and S Sudarshan, Efficient and Provable Multi-Query Optimization
Mario Alviano, Michael Morak and Andreas Pieris, Stable Model Semantics for Tuple-Generating Dependencies Revisited
Shiva Kasiviswanathan, Kobbi Nissim and Hongxia Jin, Private Incremental Regression
Michael Benedikt, George Konstantinidis, Giansalvatore Mecca, Boris Motik, Paolo Papotti, Donatello Santoro and Efthymia Tsamoura, Benchmarking the chase
Benny Kimelfeld and Christopher Re, A Relational Framework for Classifier Engineering
Vladimir Braverman, Stephen Chestnut, Nikita Ivkin, Jelani Nelson, Zhengyu Wang and David Woodruff, BPTree: an L2 heavy hitters algorithm using constant memory
Rachid Guerraoui and Jingjing Wang, How Fast can a Distributed Transaction Commit?
Mahmoud Abo Khamis, Hung Ngo and Dan Suciu, What do Shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another?
Jan Hidders, Jan Paredaens and Jan Van den Bussche, J-Logic: Logical foundations for JSON querying
Ester Livshits and Benny Kimelfeld, Counting and Enumerating (Preferred) Database Repairs
André Hernich, Carsten Lutz, Fabio Papacchini and Frank Wolter, Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
Nofar Carmeli, Batya Kenig and Benny Kimelfeld, Efficiently Enumerating Minimal Triangulation
Xiao Hu, Yufei Tao and Ke Yi, Output-optimal Parallel Algorithms for Similarity Joins
Batya Kenig, Benny Kimelfeld, Haoyue Ping and Julia Stoyanovich, Querying Probabilistic Preferences in Databases
Yaacov Y. Weiss and Sara Cohen, Reverse Engineering SPJ-Queries from Examples
Nadime Francis and Leonid Libkin, Schema Mappings for Data Graphs
Wenfei Fan and Ping Lu, Dependencies for Graphs
David Eppstein, Michael Goodrich, Michael Mitzenmacher and Manuel Torres, 2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection
Sepehr Assadi, Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem
Michael Bender, Martin Farach-Colton, Rob Johnson, Simon Mauras, Tyler Mayer, Cynthia Phillips and Helen Xu, Write-Optimized Skip Lists
Priya Govindan, Morteza Monemizadeh and S Muthukrishnan, Streaming Algorithms for Measuring H-Impact
Zengfeng Huang, Xuemin Lin, Wenjie Zhang and Ying Zhang, Efficient Matrix Sketching over Distributed Data
Pierre Bourhis, Juan L. Reutter, Fernando Suarez and Domagoj Vrgoc, JSON: data model, query languages and schema specification
Antoine Amarilli, Mikael Monet and Pierre Senellart, Combined Tractability of Probabilistic Evaluation for Conjunctive Queries on Binary Signatures