ACM SIGMOD City, Country, Year
sigmod pods logo

Calls For Submissions

PODS Program

SIGMOD Program





SIGMOD 2018: Accepted Research Papers

  • Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing
    Yang Zhou (Peking University); Tong Yang (Peking University); Jie Jiang (Peking University); Bin Cui (Peking University); Minlan Yu (Harvard University); Xiaoming Li (Peking University); Steve Uhlig (Queen Mary University of London)
  • FastQRE: Fast Query Reverse Engineering
    Dmitri V. Kalashnikov (AT&T Labs Research); Laks V.S. Lakshmanan (University of British Columbia); Divesh Srivastava (AT&T Labs Research)
  • Submodularity of Distributed Join Computation
    Rundong Li (Northeastern University); Mirek Riedewald (Northeastern University); Xinyan Deng (Northeastern University)
  • Fonduer: Knowledge Base Construction from Richly Formatted Data
    Sen Wu (Stanford University); Luke Hsiao (Stanford University); Xiao Cheng (Stanford University); Braden Hancock (Stanford University); Theodoros Rekatsinas (University of Wisconsin-Madison); Philip Levis (Stanford University); Christopher Ré (Stanford University)
  • Maverick: Discovering Exceptional Facts from Knowledge Graphs
    Gensheng Zhang (Google Inc.); Damian Jimenez (The University of Texas at Arlington); Chengkai Li (The University of Texas at Arlington)
  • Improving Join Reorderability with Compensation Operators
    TaiNing Wang (National University of Singapore); Chee-Yong Chan (National University of Singapore)
  • Subjective Knowledge Base Construction Powered By Crowdsourcing and Knowledge Base
    Hao Xin (HKUST); Rui Meng (BNU-HKBU United International College); Lei Chen (HKUST)
  • Adaptive Optimization of Very Large Join Queries
    Thomas Neumann (Technische Universität München); Bernhard Radke (Technische Universität München)
  • Pipelined Query Processing in Coprocessor Environments
    Henning Funke (TU Dortmund University); Sebastian Breß (DFKI GmbH); Stefan Noll (TU Dortmund University); Volker Markl (Technische Universität Berlin); Jens Teubner (TU Dortmund University)
  • Efficient Top-K Query Processing on Massively Parallel Hardware
    Anil Shanbhag (Massachusetts Institute of Technology ); Holger Pirk (Imperial College London); Samuel Madden (Massachusetts Institute of Technology )
  • Skyline Community Search in Multi-valued Networks
    Rong-Hua Li (Beijing Institute of Technology); Lu Qin (University of Technology); Fanghua Ye (Sun Yat-Sen University); Jeffrey Xu Yu (Chinese University of Hong Kong); Xiaokui Xiao (National University of Singapore); Nong Xiao (Sun Yat-Sen University); Zibin Zheng (Sun Yat-Sen University)
  • Persistent Bloom Filter: Membership Testing for the Entire History
    Yanqing Peng (University of Utah); Jinwei Guo (Each China Normal University); Feifei Li (University of Utah); Weining Qian (East China Normal University); Aoying Zhou (East China Normal University)
  • Efficient Selection of Geospatial Data on Maps for Interactive and Visualized Exploration
    Tao Guo (SCSE, Nanyang Technological University); Kaiyu Feng (SCSE, Nanyang Technological University); Gao Cong (SCSE, Nanyang Technological University); Zhifeng Bao (RMIT University)
  • Random Sampling over Joins Revisited
    Zhuoyue Zhao (University of Utah); Robert Christensen (University of Utah); Feifei Li (University of Utah); Xiao Hu (Hong Kong University of Science and Technology); Ke Yi (Hong Kong University of Science and Technology)
  • AHEAD: Adaptable Data Hardening for On-the-Fly Hardware Error Detection during Database Query Processing
    Till Kolditz (Technische Universität Dresden); DIrk Habich (Technische Universität Dresden); Wolfgang Lehner (Technische Universität Dresden); Matthias Werner (Technische Universität Dresden); Stefan T.J. de Bruijn (NubiloSoft)
  • When Query Authentication Meets Fine-Grained Access Control: A Zero-Knowledge Approach
    Cheng Xu (Hong Kong Baptist University); Jianliang Xu (Hong Kong Baptist University); Haibo Hu (Hong Kong Polytechnic University); Man Ho Au (Hong Kong Polytechnic University)
  • On the Calculation of Optimality Ranges for Relational Query Execution Plans
    Florian Wolf (TU Ilmenau); Norman May (SAP SE); Paul R. Willems (SAP SE); Kai-Uwe Sattler (TU Ilmenau)
  • DITA: Distributed In-Memory Trajectory Analytics
    Zeyuan Shang (Tsinghua University); Guoliang Li (Tsinghua University); Zhifeng Bao (RMIT University)
  • Matrix Profile X: VALMOD - Scalable Discovery of Variable-Length Motifs in Data Series
    Michele Linardi (University Paris Descartes); Yan Zhu (University of California Riverside); Themistoklis Palpanas (Paris Descartes University); Eamonn Keogh (University of California Riverside)
  • The Cascading Analysts Algorithm
    Matthias Ruhl (Accompani Inc.); Mukund Sundararajan (Google Research); Qiqi Yan (Google Research)
  • Navigating the Data Lake with Datamaran: Automatically Extracting Structure from Log Datasets
    Yihan Gao (University of Illinois at Urbana-Champaign); Silu Huang (University of Illinois at Urbana-Champaign); Aditya Parameswaran (University of Illinois at Urbana-Champaign)
  • AQP++: Connecting Approximate Query Processing With Aggregate Precomputation for Interactive Analytics
    Jinglin Peng (Simon Fraser University); Dongxiang Zhang (National University of Defense Technology & Simon Fraser University); Jiannan Wang (Simon Fraser University); Jian Pei (JD.com & Simon Fraser University)
  • Overlap Set Similarity Joins with Theoretical Guarantees
    Dong Deng (Massachusetts Institute of Technology); Yufei Tao (Chinese University of Hong Kong); Guoliang Li (Tsinghua University)
  • Online Processing Algorithms for Influence Maximization
    Jing Tang (Nanyang Technological University); Xueyan Tang (Nanyang Technological University); Xiaokui Xiao (National University of Singapore); Junsong Yuan (State University of New York at Buffalo)
  • A General and Efficient Querying Method for Learning to Hash
    Jinfeng Li (The Chinese University of Hong Kong); Xiao Yan (The Chinese University of Hong Kong); Jian Zhang (The Chinese University of Hong Kong); An Xu (The Chinese University of Hong Kong); James Cheng (The Chinese University of Hong Kong); Jie Liu (The Chinese University of Hong Kong); Kelvin Kai Wing Ng (The Chinese University of Hong Kong); Ti-chung Cheng (The Chinese University of Hong Kong)
  • Accelerating Machine Learning Inference with Probabilistic Predicates
    Yao Lu (Microsoft & University of Washington); Aakanksha Chowdhery (Microsoft & Princeton University); Srikanth Kandula (Microsoft); Surajit Chaudhuri (Microsoft)
  • Reactors: A Case for Predictable, Virtualized Actor Database Systems
    Vivek Shah (University of Copenhagen); Marcos Antonio Vaz Salles (University of Copenhagen)
  • Catching Numeric Inconsistencies in Graphs
    Wenfei Fan (University of Edinburgh & Beihang University); Xueli Liu (Harbin Institue of Technology); Ping Lu (Beihang University); Chao Tian (University of Edinburgh & Beihang University)
  • Practical and Secure Substring Search
    Florian Hahn (SAP SE); Nicolas Loza (SAP SE); Florian Kerschbaum (University of Waterloo)
  • Robust Entity Resolution using Random Graphs
    Sainyam Galhotra (University of Massachusetts, Amherst); Donatella Firmani (Roma Tre University); Barna Saha (University of Massachusetts, Amherst); Divesh Srivastava (AT&T Labs – Research)
  • Adaptive Energy-Control for In-Memory Database Systems
    Thomas Kissinger (TU Dresden); Dirk Habich (TU Dresden); Wolfgang Lehner (TU Dresden)
  • Big Data Linkage for Product Specification Pages
    Disheng Qiu (Università Roma Tre); Luciano Barbosa (Universidade Federal de Pernambuco); Valter Crescenzi (Università Roma Tre); Paolo Merialdo (Università Roma Tre); Divesh Srivastava (AT&T Labs - Research)
  • Incremental View Maintenance with Triple Lock Factorization Benefits
    Milos Nikolic (University of Oxford); Dan Olteanu (University of Oxford)
  • Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation
    Daniel Ting (Tableau Software)
  • Meta-Dataflows: Efficient Exploratory Dataflow Jobs
    Raul Castro Fernandez (Massachusetts Institute of Technology ); William Culhane (Imperial College London); Pijika Watcharapichat (Imperial College London); Matthias Weidlich (Humboldt-Universität zu Berlin); Victoria Lopez Morales (Imperial College London); Peter Pietzuch (Imperial College London)
  • Lightweight Cardinality Estimation in LSM-based Systems
    Ildar Absalyamov (University of California, Riverside); Michael J. Carey (University of California, Irvine); Vassilis J. Tsotras (University of California, Riverside)
  • A Rating-Ranking Method for Crowdsourced Top-k Computation
    Kaiyu Li (Tsinghua University); Xiaohang Zhang (Tsinghua University); Guoliang Li (Tsinghua University)
  • RP-DBSCAN: A Superfast Parallel DBSCAN Algorithm Based on Random Partitioning
    Hwanjun Song (Korea Advanced Institute of Science and Technology ); Jae-Gil Lee (Korea Advanced Institute of Science and Technology )
  • Synthesizing Type-Detection Logic for Rich Semantic Data Types using Open-source Code
    Cong Yan (University of Washington); Yeye He (Microsoft Research)
  • Auto-Detect: Data-Driven Error Detection in Tables
    Zhipeng Huang (University of Hong Kong); Yeye He (Microsoft Research)
  • Distributed Lock Management with RDMA: Decentralization without Starvation
    Dong Young Yoon (University of Michigan); Mosharaf Chowdhury (University of Michigan); Barzan Mozafari (University of Michigan)
  • Automatically Leveraging MapReduce Frameworks for Data-Intensive Applications
    Maaz Bin Safeer Ahmad (University of Washington); Alvin Cheung (Computer Science & Engineering)
  • DimBoost: Boosting Gradient Boosting Decision Tree to Higher Dimensions
    Jiawei Jiang (Peking University & Tencent Inc); Bin Cui (Peking University); Ce Zhang (ETH Zürich); Fangcheng Fu (Peking University)
  • How to Architect a Query Compiler, Revisited
    Ruby Y. Tahboub (Purdue University); Gregory M. Essertel (Purdue University); Tiark Rompf (Purdue University)
  • SketchML: Accelerating Distributed Machine Learning with Data Sketches
    Jiawei Jiang (Peking University & Tencent Inc. ); Fangcheng Fu (Peking University); Tong Yang (Peking University); Bin Cui (Peking University)
  • Building a Bw-Tree Takes More Than Just Buzz Words
    Ziqi Wang (Carnegie Mellon University); Andrew Pavlo (Carnegie Mellon University); Hyeontaek Lim (Carnegie Mellon University); Viktor Leis (Technische Universität München); Huanchen Zhang (Carnegie Mellon University); Michael Kaminsky (Intel Labs); Dave Andersen (Carnegie Mellon University)
  • HOT: A Height Optimized Trie Index for Main-Memory Database Systems
    Robert Binna (University of Innsbruck); Eva Zangerle (University of Innsbruck); Martin Pichl (University of Innsbruck); Günther Specht (University of Innsbruck); Viktor Leis (Technische Universität München)
  • Managing Non-Volatile Memory in Database Systems
    Alexander van Renen (Technische Universität München); Viktor Leis (Technische Universität München); Alfons Kemper (Technische Universität München); Thomas Neumann (Technische Universität München); Takushi Hashida (Fujitsu Laboratories); Kazuichi Oe (Fujitsu Laboratories); Yoshiyasu Doi (Fujitsu Laboratories); Lilian Harada (Fujitsu Laboratories); Mitsuru Sato (Fujitsu Laboratories)
  • FASTER: A Concurrent Key-Value Store with In-Place Updates
    Badrish Chandramouli (Microsoft Research); Guna Prasaad (University of Washington); Donald Kossmann (Microsoft Research); Justin Levandoski (Microsoft Research); James Hunter (Microsoft Research); Mike Barnett (Microsoft Research)
  • The Data Interaction Game
    Ben McCamish (Oregon State University); Vahid Ghadakchi (Oregon State University); Arash Termehchy (Oregon State University); Behrouz Touri (University of California San Diego); Liang Huang (Oregon State University)
  • A Comparative Study of Secondary Indexing Techniques in LSM-based NoSQL Databases
    Mohiuddin Abdul Qader (University of California Riverside); Shiwen Cheng (University of California Riverside); Vagelis Hristidis (University of California Riverside)
  • Workload-Aware CPU Performance Scaling for Transactional Database Systems
    Mustafa Korkmaz (University of Waterloo); Martin Karsten (University of Waterloo); Kenneth Salem (University of Waterloo); Semih Salihoglu (University of Waterloo)
  • BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks
    Yinglong Song (Nanyang Technological University & Fudan University); Huey Eng Chua (Nanyang Technological University); Sourav S. Bhowmick (Nanyang Technological University); Byron Choi (Hong Kong Baptist University); Shuigeng Zhou (Fudan University)
  • Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality
    Min Xie (Hong Kong University of Science and Technology); Raymond Chi-Wing Wong (Hong Kong University of Science and Technology); Jian Li (Tsinghua University); Cheng Long (Queen's University Belfast); Ashwin Lall (Denison University)
  • Finding Seeds and Relevant Tags Jointly: For Targeted Influence Maximization in Social Networks
    Xiangyu Ke (Nanyang Technological University); Arijit Khan (Nanyang Technological University); Gao Cong (Nanyang Technological University)
  • Accelerating Analytical Processing in MVCC using Fine-Granular High-Frequency Virtual Snapshotting
    Ankur Sharma (Saarland University); Felix Martin Schuhknecht (Saarland University); Jens Dittrich (Saarland University)
  • VerdictDB: Universalizing Approximate Query Processing
    Yongjoo Park (University of Michigan); Barzan Mozafari (University of Michigan); Joseph Sorenson (University of Michigan); Junhao Wang (University of Michigan)
  • Marginal Release Under Local Differential Privacy
    Graham Cormode (University Of Warwick); Tejas Kulkarni (University Of Warwick); Divesh Srivastava (AT&T Labs-Research)
  • Fine-grained Concept Linking using Neural Networks in Healthcare
    Jian Dai (National University of Singapore); Meihui Zhang (Beijing Institute of Technology); Gang Chen (Zhejiang University); Ju Fan (Renmin University of China); Kee Yuan Ngiam (National University Health System); Beng Chin Ooi (National University of Singapore)
  • Query-based Workload Forecasting for Self-Driving Database Management Systems
    Lin Ma (Carnegie Mellon University); Dana Van Aken (Carnegie Mellon University); Ahmed Hefny (Carnegie Mellon University); Gustavo Mezerhane (Carnegie Mellon University); Andrew Pavlo (Carnegie Mellon University); Geoffrey J. Gordon (Carnegie Mellon University)
  • The Case for Learned Index Structures
    Tim Kraska (Massachusetts Institute of Technology ); Alex Beutel (Google, Inc. ); Ed H. Chi (Google, Inc. ); Jeffrey Dean (Google, Inc. ); Neoklis Polyzotis (Google, Inc. )
  • Data Citation: Giving Credit Where Credit is Due
    Yinjun Wu (University of Pennsylvania); Abdussalam Alawini (University of Pennsylvania); Susan B. Davidson (University of Pennsylvania); Gianmaria Silvello (University of Padua)
  • An End-to-End Economic Method for Elastic Database Fragmentation, Replication, and Provisioning
    Ryan Marcus (Brandeis University); Olga Papaemmanouil (Brandeis University); Sofiya Semenova (Brandeis University); Solomon Garber (Brandeis University)
  • Column Sketches: A Scan Accelerator for Rapid and Robust Predicate Evaluation
    Brian Hentschel (Harvard University); Michael S. Kester (Harvard University); Stratos Idreos (Harvard University)
  • Top-k Sorting Under Partial Order Information
    Eyal Dushkin (Tel Aviv University); Tova Milo (Tel Aviv University)
  • The Data Calculator: Data Structure Design and Cost Synthesis from First Principles and Learned Cost Models
    Stratos Idreos (Harvard University); Kostas Zoumpatianos (Harvard University); Brian Hentschel (Harvard University); Michael S. Kester (Harvard University); Demi Guo (Harvard University)
  • Carousel: Low-Latency Transaction Processing for Globally-Distributed Data
    Xinan Yan (University of Waterloo); Linguan Yang (University of Waterloo); Hongbo Zhang (University of Waterloo); Xiayue Charles Lin (University of Waterloo); Bernard Wong (University of Waterloo); Kenneth Salem (University of Waterloo); Tim Brecht (University of Waterloo)
  • When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks
    Dian Ouyang (University of Technology Sydney); Lu Qin (University of Technology Sydney); Lijun Chang (University of Sydney); Xuemin Lin (University of New South Wales); Ying Zhang (University of Technology Sydney); Qing Zhu (Renmin University of China)
  • Bias in OLAP Queries: Detection, Explanation, and Removal
    Babak Salimi (University of Washington ); Johannes Gehrke (Microsoft ); Dan Suciu (University of Washington )
  • TurboGraph++: A Scalable and Fast Graph Analytics System
    Seongyun Ko (POSTECH); Wook-Shin Han (POSTECH)
  • Discovering Graph Functional Dependencies
    Wenfei Fan (University of Edinburgh & Beihang University); Chunming Hu (Beihang University); Xueli Liu (Harbin Institute of Technology); Ping Lu (Beihang University)
  • TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data
    Kyoungmin Kim (Pohang University of Science and Technology (POSTECH)); In Seo (Pohang University of Science and Technology (POSTECH)); Wook-Shin Han (Pohang University of Science and Technology (POSTECH)); Jeong-Hoon Lee (Pohang University of Science and Technology (POSTECH)); Sungpack Hong (Oracle Labs); Hassan Chafi (Oracle Labs); Hyungyu Shin (Pohang University of Science and Technology (POSTECH)); Geonhwa Jeong (Pohang University of Science and Technology (POSTECH))
  • Adaptive Asynchronous Parallelization of Graph Algorithms
    Wenfei Fan (University of Edinburgh & Beihang University); Ping Lu (Beihang University); Xiaojian Luo (7 Bridges Ltd.); Jingbo Xu (Beihang University & 7 Bridges Ltd.); Qiang Yin (Beihang University); Wenyuan Yu (Beihang University & 7 Bridges Ltd.); Ruiqi Xu (University of Edinburgh)
  • Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks
    Sibo Wang (University of Queensland); Yufei Tao (Chinese University of Hong Kong)
  • TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs
    Zhewei Wei (Renmin University of China); Xiaodong He (Renmin University of China); Xiaokui Xiao (National University of Singapore); Sibo Wang (University of Queensland); Shuo Shang (King Abdullah University of Science and Technology); Ji-Rong Wen (Renmin University of China)
  • Ektelo: A Framework for Defining Differentially-Private Computations
    Dan Zhang (University of Massachusetts Amherst); Ryan McKenna (University of Massachusetts Amherst); Ios Kotsogiannis (Duke University); Michael Hay (Colgate University); Ashwin Machanavajjhala (Duke University); Gerome Miklau (University of Massachusetts Amherst)
  • Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space
    Junhao Gan (University of Queensland); Yufei Tao (Chinese University of Hong Kong)
  • A Query Engine for Probabilistic Preferences
    Uzi Cohen (Technionn); Batya Kenig (Technion); Haoyue Ping (Drexel University ); Benny Kimelfeld (Technion); Julia Stoyanovich (Drexel University)
  • Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions
    Shuo Han (Peking University); Lei Zou (Peking University); Jeffrey Xu Yu (The Chinese University of Hong Kong)
  • Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search
    Yiqiu Wang (Rice University); Anshumali Shrivastava (Rice University); Jonathan Wang (Rice University); Junghee Ryu (Rice University)
  • Deep Learning for Entity Matching: A Design Space Exploration
    Sidharth Mudgal (University of Wisconsin-Madison); Han Li (University of Wisconsin-Madison); Theodoros Rekatsinas (University of Wisconsin-Madison); AnHai Doan (University of Wisconsin-Madison); Youngchoon Park (Johnson Controls); Ganesh Krishnan (@WalmartLabs); Rohit Deep (@WalmartLabs); Esteban Arcaute (Facebook); Vijay Raghavendra (@WalmartLabs)
  • Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging
    Niv Dayan (Harvard); Stratos Idreos (Harvard)
  • DPaxos: Managing Data Closer to Users for Low-Latency and Mobile Applications
    Faisal Nawab (University of California, Santa Cruz); Divyakant Agrawal (University of California, Santa Barbara); Amr El Abbadi (University of California, Santa Barbara)
  • Dynamic Pricing in Spatial Crowdsourcing: A Matching-Based Approach
    Yongxin Tong (Beihang University); Libin Wang (Beihang University); Zimu Zhou (ETH Zurich); Lei Chen (The Hong Kong University of Science and Technology); Bowen Du (Beihang University); Jieping Ye (Didi Chuxing Inc.)
  • Sketching Linear Classifiers over Data Streams
    Kai Sheng Tai (Stanford University); Vatsal Sharan (Stanford University); Peter Bailis (Stanford University); Gregory Valiant (Stanford University)
  • SuRF: Practical Range Query Filtering with Fast Succinct Tries
    Huanchen Zhang (Carnegie Mellon University); Hyeontaek Lim (Carnegie Mellon University); Viktor Leis (Technische Universität München); David G. Andersen (Carnegie Mellon University); Michael Kaminsky (Intel Labs); Kimberly Keeton (Hewlett Packard Labs); Andrew Pavlo (Carnegie Mellon University)
  • RushMon: Real-time Isolation Anomalies Monitoring
    Zechao Shang (The University of Chicago); Jeffrey Xu Yu (The Chinese University of Hong Kong); Aaron J. Elmore (The University of Chicago)
  • PlinyCompute: A Platform for High-Performance, Distributed, Data-Intensive Tool Development
    Jia Zou (Rice University); R. Matthew Barnett (Rice University); Tania Lorido-Botran (Rice University); Shangyu Luo (Rice University); Carlos Monroy (Rice University); Sourav Sikdar (Rice University); Kia Teymourian (Rice University); Binhang Yuan (Rice University); Chris Jermaine (Rice University)
  • MISTIQUE: A System to Store and Query Model Intermediates for Model Diagnosis
    Manasi Vartak (Massachusetts Institute of Technology); Joana M. F. da Trindade (Massachusetts Institute of Technology); Samuel Madden (Massachusetts Institute of Technology); Matei Zaharia (Stanford University)
  • ZigZag: Supporting Similarity Queries on Vector Space Models
    Wenhai Li (Wuhan University); Lingfeng Deng (Wuhan University); Yang Li (Wuhan University); Chen Li (UC Irvine)

Credits
Follow our progress: FacebookTwitter