SIGMOD 2019: Accepted Research Papers

  • Optimizing Declarative Graph Queries at Large Scale

    Qizhen Zhang (University of Pennsylvania); Akash Acharya (University of Pennsylvania); Hongzhi Chen (The Chinese University of Hong Kong); Simran Arora (University of Pennsylvania); Ang Chen (Rice University); Vincent Liu (University of Pennsylvania); Boon Loo (University of Pennsylvania)

  • JOSIE: Overlap Set Similarity Search for Finding Joinable Tables in Data Lakes

    Erkang Zhu (University of Toronto); Dong Deng (Inception Institute of Artificial Intelligence); Fatemeh Nargesian (University of Toronto); Renée Miller (Northeastern University)

  • Going Beyond Provenance: Explaining Query Answers with Pattern-based Counterbalances

    Zhengjie Miao (Duke University); Qitian Zeng (Illinois Institute of Technology); Boris Glavic (Illinois Institute of Technology); Sudeepa Roy (Duke University)

  • BriskStream: Scaling Data Stream Processing on Shared-Memory Multicore Architectures

    Shuhao Zhang (National University of Singapore); Jiong He (Advanced Digital Sciences Center); Amelie Zhou (Shenzhen University); Bingsheng He (National University of Singapore)

  • Strongly Truthful Interactive Regret Minimization

    Min Xie (Hong Kong University of Science and Technology); Raymond Chi-Wing Wong (Hong Kong University of Science and Technology); Ashwin Lall (Denison University)

  • Fast General Distributed Transactions with Opacity

    Alex Shamis (Microsoft Research); Matthew Renzelmann (Microsoft); Stanko Novakovic (VMware); Georgios Chatzopoulos (EPFL); Aleksandar Dragojević (Microsoft Research); Dushyanth Narayanan (Microsoft Research); Miguel Castro (Microsoft Research)

  • Tuple-oriented Compression for Large-scale Mini-batch Stochastic Gradient Descent

    Fengan Li (University of Wisconsin, Madison); Lingjiao Chen (University of Wisconsin, Madison); Yijing Zeng (University of Wisconsin, Madison); Arun Kumar (University of California, San Diego); Xi Wu (University of Wisconsin, Madison); Jeffrey Naughton (University of Wisconsin, Madison); Jignesh Patel (University of Wisconsin, Madison)

  • Border-Collie: A Wait-free, Read-optimal Algorithm for Database Logging on Multicore Hardware

    Jongbin Kim (Hanyang University); Hyeongwon Jang (Hanyang University); Seohui Son (Hanyang University); Hyuck Han (Dongduk Women's University); Sooyong Kang (Hanyang University); Hyungsoo Jung (Hanyang University)

  • CATAPULT: Data-driven Selection of Canned Patterns for Efficient Visual Graph Query Formulation

    Kai Huang (Fudan University); Huey Chua (Nanyang Technological University); Sourav Bhowmick (Nanyang Technological University); Byron Choi (Hong Kong Baptist University); Shuigeng Zhou (Fudan University)

  • DeepBase: Deep Inspection of Neural Networks

    Thibault Sellam (Columbia University); Kevin Lin (Columbia University); Ian Huang (Columbia University); Michelle Yang (University of California, Berkeley); Carl Vondrick (Columbia University); Eugene Wu (Columbia University)

  • Verifying Text Summaries of Relational Data Sets

    Saehan Jo (Cornell University); Immanuel Trummer (Cornell University); Weicheng Yu (Cornell University); Xuezhi Wang (Google Research); Cong Yu (Google Research); Daniel Liu (Cornell University); Niyati Mehta (Cornell University)

  • Efficiently Searching In-Memory Sorted Arrays: Revenge of the Interpolation Search?

    Peter Van Sandt (University of Wisconsin, Madison); Yannis Chronis (University of Wisconsin, Madison); Jignesh Patel (University of Wisconsin, Madison)

  • Experimental Analysis of Streaming Algorithms for Graph Partitioning

    Anil Pacaci (University of Waterloo); Tamer Özsu (University of Waterloo)

  • BlinkML: Efficient Maximum Likelihood Estimation with Probabilistic Guarantees

    Yongjoo Park (University of Michigan); Jingyi Qing (University of Michigan); Xiaoyang Shen (University of Michigan); Barzan Mozafari (University of Michigan)

  • Towards Model-based Pricing for Machine Learning in a Data Marketplace

    Lingjiao Chen (University of Wisconsin, Madison); Paraschos Koutris (University of Wisconsin, Madison); Arun Kumar (University of California, San Diego)

  • Designing Fair Ranking Schemes

    Abolfazl Asudeh (University of Michigan); H. V. Jagadish (University of Michigan); Julia Stoyanovich (New York University); Gautam Das (University of Texas at Arlington)

  • RRR: Rank-Regret Representative

    Abolfazl Asudeh (University of Michigan); Azade Nazi (Google AI); Nan Zhang (Pennsylvania State University); Gautam Das (University of Texas at Arlington); H. V. Jagadish (University of Michigan)

  • Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks

    Tobias Ziegler (TU Darmstadt); Sumukha Tumkur Vani (Brown University); Carsten Binnig (TU Darmstadt); Rodrigo Fonseca (Brown University); Tim Kraska (MIT)

  • Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs

    Yikai Zhang (Chinese University of Hong Kong); Jeffrey Yu (Chinese University of Hong Kong)

  • vChain: Enabling Verifiable Boolean Range Queries over Blockchain Databases

    Cheng Xu (Hong Kong Baptist University); Ce Zhang (Hong Kong Baptist University); Jianliang Xu (Hong Kong Baptist University)

  • Hypothetical Reasoning via Provenance Abstraction

    Daniel Deutch (Tel Aviv University); Yuval Moskovitch (Tel Aviv University); Noam Rinetzky (Tel Aviv University)

  • An End-to-End Automatic Cloud Database Tuning System Using Deep Reinforcement Learning

    Ji Zhang (Huazhong University of Science and Technology); Yu Liu (Huazhong University of Science and Technology); Ke Zhou (Huazhong University of Science and Technology); Guoliang Li (Tsinghua University); Zhili Xiao (Tencent Inc.); Bin Cheng (Tencent Inc.); Jiashu Xing (Tencent Inc.); Yangtao Wang (Huazhong University of Science and Technology); Tianheng Cheng (Huazhong University of Science and Technology); Li Liu (Huazhong University of Science and Technology); Minwei Ran (Huazhong University of Science and Technology); Zekang Li (Huazhong University of Science and Technology)

  • CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching

    Bibek Bhattarai (George Washington University); Hang Liu (University of Massachusetts Lowell); H. Howie Huang (George Washington University)

  • Exact Cardinality Query Optimization with Bounded Execution Cost

    Immanuel Trummer (Cornell University)

  • SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning

    Immanuel Trummer (Cornell University); Junxiong Wang (Cornell University); Deepak Maram (Cornell University); Samuel Moseley (Cornell University); Saehan Jo (Cornell University); Joseph Antonakakis (Cornell University)

  • A Holistic Approach for Query Evaluation andResult Vocalization in Voice-Based OLAP

    Immanuel Trummer (Cornell University); Yicheng Wang (Cornell University); Saketh Mahankali (Cornell University)

  • Concurrent Prefix Recovery: Performing CPR on a Database

    Guna Prasaad (University of Washington); Badrish Chandramouli (Microsoft Research); Donald Kossmann (Microsoft Research)

  • Ariadne: Online Provenance for Big Graph Analytics

    Vicky Papavasileiou (University of California, San Diego); Ken Yocum (Intuit,Inc. & University of California, San Diego); Alin Deutsch (University of California, San Diego)

  • APEx: Accuracy-Aware Differentially Private Data Exploration

    Chang Ge (University of Waterloo); Xi He (University of Waterloo); Ihab Ilyas (University of Waterloo); Ashwin Machanavajjhala (Duke University)

  • MNC: Structure-Exploiting Sparsity Estimation for Matrix Expressions

    Johanna Sommer (IBM Germany); Matthias Boehm (Graz University of Technology); Alexandre Evfimievski (IBM Almaden Research Center); Berthold Reinwald (IBM Almaden Research Center); Peter Haas (University of Massachusetts Amherst)

  • Uni-Detect: A Unified Approach to Automated Error Detection in Tables

    Pei Wang (Simon Fraser University); Yeye He (Microsoft Research)

  • Active Sparse Mobile Crowd Sensing Based on Matrix Completion

    Kun Xie (Hunan University); Xiaocan Li (Hunan University); Xin Wang (Stony Brook University); Gaogang Xie (Institute of Computing Technology & Chinese Academy of Sciences); Jigang Wen (Institute of Computing Technology & Chinese Academy of Sciences); Dafang Zhang (Hunan University)

  • Top-k Queries over Digital Traces

    Yifan Li (York University); Xiaohui Yu (York University); Nick Koudas (University of Toronto)

  • Autocompletion for Prefix-Abbreviated Input

    Sheng Hu (Nagoya University & Kyoto University); Chuan Xiao (Nagoya University & Osaka University); Jianbin Qin (Shenzhen University); Yoshiharu Ishikawa (Nagoya University); Qiang Ma (Kyoto University)

  • Cache-oblivious High-performance Similarity Join

    Martin Perdacher (University of Vienna); Claudia Plant (University of Vienna); Christian Böhm (Ludwig-Maximilians-Universität)

  • FITing-Tree: A Data-aware Index Structure

    Alex Galakatos (Brown University); Michael Markovitch (Brown University); Carsten Binnig (TU Darmstadt); Rodrigo Fonseca (Brown University); Tim Kraska (MIT)

  • Designing Succinct Secondary Indexing Mechanism by Exploiting Column Correlations

    Yingjun Wu (IBM Almaden Research Center); Jia Yu (Arizona State University); Yuanyuan Tian (IBM Almaden Research Center); Richard Sidle (IBM); Ronald Barber (IBM Almaden Research Center)

  • Event Trend Aggregation Under Rich Event Matching Semantics

    Olga Poppe (Microsoft Gray Systems Lab); Chuan Lei (IBM Almaden Research Center); Elke Rundensteiner (Worcester Polytechnic Institute); David Maier (Portland State University)

  • Democratizing Data Science through Interactive Curation of ML Pipelines

    Zeyuan Shang (MIT); Emanuel Zgraggen (MIT); Benedetto Buratti (Brown University); Ferdinand Kossmann (MIT); Philipp Eichmann (Brown University); Yeounoh Chung (Brown University); Carsten Binnig (TU Darmstadt); Eli Upfal (Brown University); Tim Kraska (MIT)

  • Visual Road: A Video Data Management Benchmark

    Brandon Haynes (University of Washington); Amrita Mazumdar (University of Washington); Magdalena Balazinska (University of Washington); Luis Ceze (University of Washington); Alvin Cheung (University of Washington)

  • Raha: A Configuration-Free Error Detection System

    Mohammad Mahdavi (TU Berlin); Ziawasch Abedjan (TU Berlin); Raul Castro Fernandez (MIT); Samuel Madden (MIT); Mourad Ouzzani (QCRI, HBKU); Michael Stonebraker (MIT); Nan Tang (QCRI, HBKU)

  • An Efficient Index for RDF Query Containment

    Theofilos Mailis (Athena Research Centre & University of Athens); Yannis Kotidis (Athens University of Economics and Business); Vaggelis Nikolopoulos (University of Athens); Evgeny Kharlamov (University of Oslo & Bosch Center for AI); Ian Horrocks (University of Oxford); Yannis Ioannidis (Athena Research Centre & University of Athens)

  • DistME: A Fast and Elastic Distributed Matrix Computation Engine using GPUs

    Donghyoung Han (Daegu Gyeongbuk Institute of Science & Technology (DGIST)); Yoon-Min Nam (Daegu Gyeongbuk Institute of Science & Technology (DGIST)); Jihye Lee (Daegu Gyeongbuk Institute of Science & Technology (DGIST)); Kyongseok Park (Korea Institute of Science and Technology Information (KISTI)); Hyunwoo Kim (Korea Institute of Science and Technology Information (KISTI)); Min-Soo Kim (Daegu Gyeongbuk Institute of Science & Technology (DGIST))

  • Explaining Wrong Queries Using Small Examples

    Zhengjie Miao (Duke University); Sudeepa Roy (Duke University); Jun Yang (Duke University)

  • Visual Segmentation for Information Extraction from Heterogeneous Visually Rich Documents

    Ritesh Sarkhel (Ohio State University); Arnab Nandi (Ohio State University)

  • Elasticutor: Rapid Elasticity for Realtime Stateful Stream Processing

    Li Wang (Yitu Technology); Tom Z. J. Fu (Advanced Digital Sciences Center); Richard T. B. Ma (National University of Singapore); Marianne Winslett (University of Illinois Urbana-Champaign); Zhenjie Zhang (Yitu Technology)

  • Real-Time Multi-Pattern Detection over Event Streams

    Ilya Kolchinsky (Technion); Assaf Schuster (Technion)

  • Hyperion: Building the Largest In-memory Search Tree

    Markus Mäsker (Johannes Gutenberg University Mainz); Tim Süß (University of Applied Science Fulda); Lars Nagel (Loughborough University); Lingfang Zeng (Huazhong University of Science and Technology); André Brinkmann (Johannes Gutenberg University Mainz)

  • AI Meets AI: Leveraging Query Executions to Improve Index Recommendations

    Bailu Ding (Microsoft Research); Sudipto Das (Microsoft Research); Ryan Marcus (Brandeis University); Wentao Wu (Microsoft Research); Surajit Chaudhuri (Microsoft Research); Vivek Narasayya (Microsoft Research)

  • GPU-based Graph Traversal on Compressed Graphs

    Mo Sha (National University of Singapore); Yuchen Li (Singapore Management University); Kian-Lee Tan (National University of Singapore)

  • Mining Precision Interfaces From Query Logs

    Qianrui Zhang (Tsinghua University); Haoci Zhang (Columbia University); Thibault Sellam (Columbia University); Eugene Wu (Columbia University)

  • DBEst: Revisiting Approximate Query Processing Engines with Machine Learning Models

    Qingzhi Ma (University of Warwick); Peter Triantafillou (University of Warwick)

  • PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs

    Zhewei Wei (Renmin University of China); Xiaodong He (4Paradigm Inc.); Xiaokui Xiao (National University of Singapore); Sibo Wang (The Chinese University of Hong Kong); Yu Liu (Peking University); Xiaoyong Du (Renmin University of China); Ji-Rong Wen (Renmin University of China)

  • Incremental and Approximate Inference for Faster Occlusion-based Deep CNN Explanations

    Supun Nakandala (University of California, San Diego); Arun Kumar (University of California, San Diego); Yannis Papakonstantinou (University of California, San Diego)

  • Fractal: A General-Purpose Graph Pattern Mining System

    Vinicius Dias (Universidade Federal de Minas Gerais); Carlos Teixeira (Universidade Federal de Minas Gerais); Dorgival Guedes (Universidade Federal de Minas Gerais); Wagner Meira (Universidade Federal de Minas Gerais); Srinivasan Parthasarathy (Ohio State University)

  • Anti-Freeze for Large and Complex Spreadsheets: Asynchronous Formula Computation

    Mangesh Bendre (University of Illinois Urbana-Champaign); Tana Wattanawaroon (University of Illinois Urbana-Champaign); Kelly Mack (University of Illinois Urbana-Champaign); Kevin Chang (University of Illinois Urbana-Champaign); Aditya Parameswaran (University of Illinois Urbana-Champaign)

  • RaSQL: Greater Power and Performance for Big Data Analytics with Recursive-aggregate-SQL on Spark

    Jiaqi Gu (University of California, Los Angeles); Yugo Watanabe (University of California, Los Angeles); William Mazza (University of Naples Federico II); Alexander Shkapsky (Workday, Inc.); Mohan Yang (Google); Ling Ding (University of California, Los Angeles); Carlo Zaniolo (University of California, Los Angeles)

  • Scaling Distance Labeling on Small-World Networks

    Wentao Li (University of Technology Sydney); Miao Qiao (University of Auckland); Lu Qin (University of Technology Sydney); Ying Zhang (University of Technology Sydney); Lijun Chang (University of Sydney); Xuemin Lin (University of New South Wales)

  • Enabling and Optimizing Non-linear Feature Interactions in Factorized Linear Algebra

    Side Li (University of California, San Diego); Lingjiao Chen (University of Wisconsin, Madison); Arun Kumar (University of California, San Diego)

  • Maximizing Welfare in Social Networks under A Utility Driven Influence Diffusion model

    Prithu Banerjee (University of British Columbia); Wei Chen (Microsoft Research); Laks Lakshmanan (University of British Columbia)

  • Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together

    Myoungji Han (Seoul National University); Hyunjoon Kim (Seoul National University); Geonmo Gu (Seoul National University); Kunsoo Park (Seoul National University); Wook-Shin Han (Pohang University of Science and Technology (POSTECH))

  • Efficient Approximation Algorithms for Adaptive Seed Minimization

    Jing Tang (National University of Singapore); Keke Huang (Nanyang Technological University); Xiaokui Xiao (National University of Singapore); Laks Lakshmanan (University of British Columbia); Xueyan Tang (Nanyang Technological University); Aixin Sun (Nanyang Technological University); Andrew Lim (National University of Singapore)

  • Efficiently Answering Regular Simple Path Queries on Large Labeled Networks

    Sarisht Wadhwa (IIT Delhi); Anagh Prasad (IIT Delhi); Sayan Ranu (IIT Delhi); Amitabha Bagchi (IIT Delhi); Srikanta Bedathur (IIT Delhi)

  • Iterative Query Processing based on Unified Optimization Techniques

    Kisung Park (Kyung Hee University); Hojin Seo (Kyung Hee University); Mostofa Rasel (Kyung Hee University); Young-Koo Lee (Kyung Hee University); Chanho Jeong (SAP Labs Korea); Sung Yeol Lee (SAP Labs Korea); Chungmin Lee (SAP Labs Korea); Dong-Hun Lee (SAP Labs Korea)

  • Blurring the Lines between Blockchains and Database Systems: the Case of Hyperledger Fabric

    Ankur Sharma (Saarland University); Felix Schuhknecht (Saarland University); Divya Agrawal (Saarland University); Jens Dittrich (Saarland University)

  • AStream: Ad-hoc Shared Stream Processing

    Jeyhun Karimov (DFKI GmbH); Tilmann Rabl (DFKI GmbH & TU Berlin); Volker Markl (DFKI GmbH & TU Berlin)

  • Interactive Graph Search

    Yufei Tao (Chinese University of Hong Kong); Yuanbing Li (Tsinghua University); Guoliang Li (Tsinghua University)

  • Efficient Estimation of Heat Kernel PageRank for Local Clustering

    Renchi Yang (Nanyang Technological University); Xiaokui Xiao (National University of Singapore); Zhewei Wei (Renmin University of China); Sourav Bhowmick (Nanyang Technological University); Jun Zhao (Nanyang Technological University); Rong-Hua Li (Beijing Institute of Technology)

  • Uncertainty Annotated Databases - A Lightweight Approach for Approximating Certain Answers

    Su Feng (Illinois Institute of Technology); Aaron Huber (University at Buffalo); Boris Glavic (Illinois Institute of Technology); Oliver Kennedy (University at Buffalo)

  • HoloDetect: Few-Shot Learning for Error Detection

    Alireza Heidari (University of Waterloo); Joshua McGrath (University of Wisconsin, Madison); Ihab Ilyas (University of Waterloo); Theodoros Rekatsinas (University of Wisconsin, Madison)

  • Towards Scaling Blockchain Systems via Sharding

    Hung Dang (National University of Singapore); Tien Tuan Anh Dinh (National University of Singapore); Dumitrel Loghin (National University of Singapore); Ee-Chien Chang (National University of Singapore); Qian Lin (National University of Singapore); Beng Chin Ooi (National University of Singapore)

  • A Layered Aggregate Engine for Analytics Workloads

    Maximilian Schleich (University of Oxford); Dan Olteanu (University of Oxford); Mahmoud Abo Khamis (RelationalAI); Hung Ngo (RelationalAI); XuanLong Nguyen (University of Michigan)

  • Answering Why-questions by Exemplars in Attributed Graphs

    Mohammad Hossein Namaki (Washington State University); Qi Song (Washington State University); Yinghui Wu (Washington State University); Shengqi Yang (WeWork Technology)

  • Answering Multi-Dimensional Analytical Queries under Local Differential Privacy

    Tianhao Wang (Purdue University); Bolin Ding (Alibaba Group); Jingren Zhou (Alibaba Group); Cheng Hong (Alibaba Group); Zhicong Huang (Alibaba Group); Ninghui Li (Purdue University); Somesh Jha (University of Wisconsin, Madison)

  • A Scalable Index for Top-k Subtree Similarity Queries

    Daniel Kocher (University of Salzburg); Nikolaus Augsten (University of Salzburg)

  • Distance-generalized Core Decomposition

    Francesco Bonchi (ISI Foundation & Eurecat); Arijit Khan (Nanyang Technological University); Lorenzo Severini (ISI Foundation)

  • Dissecting the Performance of Strongly-Consistent Replication Protocols

    Ailidani Ailijiang (Microsoft); Aleksey Charapko (University at Buffalo, SUNY); Murat Demirbas (University at Buffalo, SUNY)

  • Pessimistic Cardinality Estimation

    Walter Cai (University of Washington); Magdalena Balazinska (University of Washington); Dan Suciu (University of Washington)

  • Towards Scalable Hybrid Stores: Constraint-Based Rewriting to the Rescue

    Rana Alotaibi (University of California, San Diego); Damian Bursztyn (Thales); Alin Deutsch (University of California, San Diego); Ioana Manolescu (Inria & Ecole polytechnique); Stamatis Zampetakis (Orchestra Networks)

  • FishStore: Faster Ingestion with Subset Hashing

    Dong Xie (University of Utah); Badrish Chandramouli (Microsoft Research); Yinan Li (Microsoft Research); Donald Kossmann (Microsoft Research)

  • Approximate Distinct Counts for Billions of Datasets

    Daniel Ting (Tableau Software)

  • Speculative Distributed CSV Data Parsing for Big Data Analytics

    Chang Ge (University of Waterloo); Yinan Li (Microsoft Research); Eric Eilebrecht (Microsoft Research); Badrish Chandramouli (Microsoft Research); Donald Kossmann (Microsoft Research)

  • Progressive Deep Web Crawling Through Keyword Queries For Data Enrichment

    Pei Wang (Simon Fraser University); Ryan Shea (Simon Fraser University); Jiannan Wang (Simon Fraser University); Eugene Wu (Columbia University)

  • Anytime Approximation in Probabilistic Databases via Scaled Dissociations

    Maarten Van den Heuvel (University of Antwerp); Peter Ivanov (Northeastern University); Wolfgang Gatterbauer (Northeastern University); Floris Geerts (University of Antwerp); Martin Theobald (University of Luxembourg)

  • Interventional Fairness : Causal Database Repair for Algorithmic Fairness

    Babak Salimi (University of Washington); Luke Rodriguez (University of Washington); Bill Howe (University of Washington); Dan Suciu (University of Washington)

  • MIFO: A Query-Semantic Aware Resource Allocation Policy

    Prajakta Kalmegh (Duke University); Shivnath Babu (Unravel Data Systems)

  • The Log-Structured Merge-Bush & the Wacky Continuum

    Niv Dayan (Harvard University); Stratos Idreos (Harvard University)

  • iQCAR: inter-Query Contention Analyzer for Data Analytics Frameworks

    Prajakta Kalmegh (Duke University); Shivnath Babu (Unravel Data Systems); Sudeepa Roy (Duke University)