ACM SIGMOD Seattle, USA, 2023
sigmod pods logo

SIGMOD Program

PODS Program

Calls For Submissions



SIGMOD 2023: Accepted Research Papers

    The current list only includes papers accepted in Cycles A and B. Papers accepted in Cycle C will be published shortly.

  • Sequence-Based Target Coin Prediction for Cryptocurrency Pump-and-Dump
    Sihao Hu (National University of Singapore)*; Zhen Zhang (National University of Singapore); Shengliang Lu (National University of Singapore); Bingsheng He (National University of Singapore); Zhao Li (Zhejiang University)
  • LadderFilter: Filtering Infrequent Items with Small Memory and Time Overhead
    Yuanpeng Li (Peking University)*; Feiyu Wang (Peking University); Xiang Yu (Peking University); Yilong Yang (Xidian University); Kaicheng Yang (Peking University); Tong Yang (Peking University); Zhuo Ma (Xidian University); Bin Cui (Peking University); Steve Uhlig (QMUL)
  • Time2State: An Unsupervised Framework for Inferring the Latent States in Time Series Data
    ChengYu Wang (NUDT)*; Kui Wu (University of Victoria); Tongqing Zhou (NUDT); Zhiping Cai (NUDT)
  • Incremental Tabular Learning on Heterogeneous Feature Space
    Hanmo Liu (Hong Kong University of Science and Technology (Guang Zhou))*; Shimin Di (The Hong Kong University of Science and Technology); Lei Chen (Hong Kong University of Science and Technology)
  • GitTables: A Large-Scale Corpus of Relational Tables
    Madelon Hulsebos (University of Amsterdam)*; Paul Groth (University of Amsterdam); Cagatay Demiralp (Sigma Computing)
  • Raster Intervals: An Approximation Technique for Polygon Intersection Joins
    Thanasis Georgiadis (University of Ioannina); Nikos Mamoulis (University of Ioannina)*
  • Runtime Variation in Big Data Analytics
    Yiwen Zhu (Microsoft)*; Rathijit Sen (Microsoft); Robert Horton (Microsoft Corporation); John M Agosta (Microsoft)
  • Efficient and Effective Cardinality Estimation for Skyline Family
    Xiaoye Miao (Zhejiang University)*; Yangyang Wu (Zhejiang University); peng jiazhen (Zhejiang University); Yunjun Gao (Zhejiang University); Jianwei Yin (Zhejiang University)
  • FlexMoE: Scaling Large-scale Sparse Pre-trained Model Training via Dynamic Device Placement
    Xiaonan Nie (Peking University)*; Xupeng Miao (Carnegie Mellon University); Zilong Wang (Microsoft); Zichao Yang (Carnegie Mellon University); Jilong Xue (Microsoft Research); Lingxiao Ma (Microsoft Research); Gang Cao (BAAI); Bin Cui (Peking University)
  • Efficient and Portable Einstein Summation in SQL
    Mark Blacher (Friedrich Schiller University Jena)*; Joachim Giesen (Friedrich Schiller University Jena); Julien Klaus (Friedrich Schiller University Jena); Christoph Staudt (Friedrich Schiller University Jena); Sören Laue (TU Kaiserslautern); Viktor Leis (Technische Universität München)
  • Spatio-Temporal Denoising Graph Autoencoders with Data Augmentation for Photovoltaic Data Imputation
    Yangxin Fan (Case Western Reserve University)*; Xuanji Yu (Case Western Reserve University); Raymond Wieser (Case Western Reserve University); David Meakin (SunPower Corporation); Avishai Shaton (SolarEdge Technologies); Jean-Nicolas Jaubert (CSI Solar Co.Ltd.); Robert Flottemesch (Brookfield Renewable U.S.); Michael Howell (C2 Energy Capital); Jennifer Braid (Sandia National Labs); Laura Bruckman (Case Western Reserve University); Roger H French (Case Western Reserve University); Yinghui Wu (Case Western Reserve University)
  • FEC: Efficient Deep Recommendation Model Training with Flexible Embedding Communication
    Kaihao Ma ( The Chinese University of Hong Kong); Xiao Yan (Southern University of Science and Technology)*; Zhenkun Cai (The Chinese University of Hong Kong); Yuzhen Huang (Meta); Yidi Wu (Meta Platforms, Inc); James Cheng (CUHK)
  • SSIN: Self-Supervised Learning for Rainfall Spatial Interpolation
    Jia Li (Hong Kong University of Science and Technology)*; Yanyan Shen (Shanghai Jiao Tong University); Lei Chen (Hong Kong University of Science and Technology); Charles Wang Wai Ng (Hong Kong University of Science and Technology )
  • Near-Duplicate Sequence Search at Scale for Neural Language Model Memorization Evaluation
    Zhencan Peng (Rutgers University); Zhizhi Wang (Rutgers University); Dong Deng (Rutgers Universituy - New Brunswick)*
  • AWARE: Workload-aware, Redundancy-exploiting Linear Algebra
    Sebastian Baunsgaard (Graz University of Technology)*; Matthias Boehm (Technische Universität Berlin)
  • Unsupervised Hashing with Semantic Concept Mining
    Rong-Cheng Tu (Beijing Institute of Technology)*; Xian-Ling Mao (Beijing Institute of Technology); Qinghong Lin (Shenzhen University); chengfei cai (Zhejiang University); Weize Qin (Institute of Computing Technology, Chinese Academy of Sciences); Wei Wei (Huazhong University of Science and Technology); Hongfa Wang (Chinese Academy of Sciences); Heyan Huang (Beijing Institute of Technology)
  • CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression
    Zheng Chen (Renmin University of China); Feng Zhang (Renmin University of China)*; JiaWei Guan (Renmin University of China); Jidong Zhai (Tsinghua University); Xipeng Shen (North Carolina State University); Huanchen Zhang (Tsinghua University); Wentong Shu (Renmin University of China); Xiaoyong Du (Renmin University of China)
  • A New Sparse Data Clustering Method Based on Frequent Items
    Qiang Huang (National University of Singapore)*; Pingyi Luo (NUS); Anthony Tung (NUS)
  • Virtual-Memory Assisted Buffer Management
    Viktor Leis (Technische Universität München)*; Adnan Alhomssi (Friedrich-Alexander-Universität Erlangen-Nürnberg); Tobias Ziegler (TU Darmstadt); Yannick Loeck (Technische Universität Hamburg); Christian Dietrich (Hamburg University of Technology)
  • iFlipper: Label Flipping for Individual Fairness
    Hantian Zhang (Georgia Tech); KIHYUN TAE (KAIST); Jaeyoung Park (KAIST); Xu Chu (GATECH); Steven E Whang (KAIST)*
  • SANTOS: Relationship-based Semantic Table Union Search
    Aamod Khatiwada (Northeastern University)*; Grace Fan (Northeastern University); Roee Shraga (Northeastern University); Zixuan Chen (Northeastern University); Wolfgang Gatterbauer (Northeastern University); Renée J. Miller (Northeastern University); Mirek Riedewald (Northeastern University)
  • Effectiveness Perspectives and a Deep Relevance Model for Spatial Keyword Queries
    Shang Liu (Nanyang Technological University)*; Gao Cong (Nanyang Technological Univesity); Kaiyu Feng (Beijing Institute of Technology); Wanli Gu (MEITUAN); Fuzheng Zhang (Meituan-Dianping Group)
  • Circinus: Fast Redundancy-Reduced Subgraph Matching
    Tatiana Jin (CUHK); Boyang Li (CUHK); Yichao Li (CUHK); qihui zhou (CUHK); Qianli Ma (CUHK); Yunjian Zhao (CUHK); Hongzhi Chen (CUHK); James Cheng (CUHK)*
  • Composite Object Normal Forms
    Zhuoxing Zhang (Southwest University); Wu Chen ( College of Computer ＆ Information Science, Southwest University); Sebastian Link (University of Auckland)*
  • EAR-Oracle: On Efficient Indexing for Distance Queries between Arbitrary Points on Terrain Surface
    Bo Huang (Southern University of Science and Technology); Victor Junqiu Wei (Hong Kong Polytechnic University)*; Raymond Chi-Wing Wong (Hong Kong University of Science and Technology); Bo Tang (Southern University of Science and Technology)
  • Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction
    Rongjian Yang (Fudan University); Zhijie Zhang (Fudan University); Weiguo Zheng (Fudan University)*; Jeffrey Xu Yu (Chinese University of Hong Kong)
  • Efficient Estimation of Pairwise Effective Resistance
    Renchi Yang (Hong Kong Baptist University)*; Jing Tang (The Hong Kong University of Science and Technology)
  • One-shot garbage collection for in-memory OLTP through temporality-aware version storage
    Aunn Raza (EPFL)*; Periklis Chrysogelos (EPFL); Angelos Christos Anadiotis (Oracle); Anastasia Ailamaki (EPFL)
  • AutoOD: Automatic Outlier Detection
    Lei Cao (MIT)*; Yizhou Yan (Worcester Polytechnic Institute); Yu Wang (University of Science and Technology of China); Samuel Madden (MIT); Elke A Rundensteiner (WPI)
  • A Neural Approach to Spatio-Temporal Data Release with User-Level Differential Privacy
    Ritesh Ahuja (University of Southern California); Sepanta Zeighami (University of Southern California); Gabriel Ghinita (Hamad Bin Khalifa University)*; Cyrus Shahabi (Computer Science Department. University of Southern California)
  • Most Expected Winner: An Interpretation of Winners over Uncertain Voter Preferences
    Haoyue Ping (New York University)*; Julia Stoyanovich (New York University)
  • Grouping Time Series for Efficient Columnar Storage
    Chenguang Fang (Tsinghua University); Shaoxu Song (Tsinghua University)*; Haoquan Guan (Tsinghua University); Xiangdong Huang (Tsinghua University); Chen Wang (" Tsinghua University, China"); Jianmin Wang ("Tsinghua University, China")
  • How To Optimize My Blockchain? A Multi-Level Recommendation Approach
    Jeeta Ann Chacko (Technical University of Munich)*; Ruben Mayer (Technical University of Munich); Hans-Arno Jacobsen (University of Toronto)
  • Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme
    Guanhao Hou (The Chinese University of Hong Kong); Qintian Guo (The Chinese University of Hong Kong ); Fangyuan ZHANG (The Chinese University of Hong Kong); Sibo Wang (The Chinese University of Hong Kong)*; Zhewei Wei (Renmin University of China)
  • Transaction Scheduling: From Conflicts to Runtime Conflicts
    Yang Cao (University of Edinburgh)*; Wenfei Fan (Univ. of Edinburgh ); Weijie Ou (Shenzhen Institute of Computing Sciences); Rui Xie (Shenzhen Institute of Computing Sciences); Wenyue Zhao (University of Edinburgh)
  • ClipSim: A GPU-friendly Parallel Framework for Single-Source SimRank with Accuracy Guarantee
    Tianhao Wu (Tsinghua University); Ji Cheng (HKUST); Chaorui Zhang (Huawei)*; Jianfeng Hou (Theory Lab HK, Huawei Tech. Investment Co., Limited); gengjian chen (wuhan university); Zhongyi Huang (Tsinghua University); Weixi Zhang (Huawei); Wei Han (Huawei); Bo Bai (Theory Lab, 2012 Labs, Huawei Technologies, Co. Ltd)
  • Speeding Up End-to-end Query Execution via Learning-based Progressive Cardinality Estimation
    Fang Wang (The Hong Kong Polytechnic University)*; Xiao Yan (Southern University of Science and Technology); Man Lung Yiu (Hong Kong Polytechnic University); Shuai LI (The Hong Kong Polytechnic University); Zunyao Mao (Southern University of Science and Technology); Bo Tang (Southern University of Science and Technology)
  • Distributed GPU Joins on Fast RDMA-capable Networks
    Lasse Thostrup (TU Darmstadt)*; Gloria Doci (Snowflake); Nils Boeschen (TU Darmstadt); Manisha Luthra (TU Darmstadt); Carsten Binnig (TU Darmstadt)
  • dbET: Execution Time Distribution-based Plan Selection
    Yifan Li (York University)*; Xiaohui Yu (York University); Nick Koudas (University of Toronto); Shu Lin (Huawei); Chong Chen (Huawei); Calvin Sun (Huawei)
  • Ground Truth Inference for Weakly Supervised Entity Matching
    Renzhi Wu (Georgia Institute of Technology)*; Alexander E Bendeck (Georgia Institute of Technology); Xu Chu (GATECH); Yeye He (Microsoft Research)
  • Detect, Distill and Update: Learned DB Systems Facing Out of Distribution Data
    Meghdad Kurmanji (University of Warwick)*; Peter Triantafillou (University of Warwick)
  • I/O-Efficient Butterfly Counting at Scale
    Zhibin Wang (NJU)*; Longbin Lai (Alibaba Group); Yixue Liu (Nanjing University); Bing Shui (Nanjing university); Chen Tian (NJU); Sheng Zhong (Nanjing University)
  • LiteHST: A Tree Embedding based Method for Similarity Search
    Yuxiang Zeng (Hong Kong University of Science and Technology)*; Yongxin Tong (Beihang University); Lei Chen (Hong Kong University of Science and Technology)
  • Optimizing Tensor Programs on Flexible Storage
    Maximilian Schleich (RelationalAI)*; Amir Shaikhha (University of Edinburgh); Dan Suciu (University of Washington)
  • LinCQA: Faster Consistent Query Answering with Linear Time Guarantees
    Zhiwei Fan (University of Wisconsin-Madison); Paraschos Koutris (University of Wisconsin-Madison); Xiating Ouyang (University of Wisconsin-Madison)*; Jef Wijsen (University of Mons)
  • Probabilistic Reasoning at Scale: Trigger Graphs to the Rescue
    Efthymia Tsamoura (Samsung AI Research); Jaehun Lee (Samsung); Jacopo Urbani (Vrije Universiteit Amsterdam)*
  • Foreign Keys Open the Door for Faster Incremental View Maintenance
    Christoforos Svingos (National and Kapodistrian University of Athens)*; Andre Hernich (Amazon Web Services); Hinnerk Gildhoff (Amazon); Yannis Papakonstantinou (Databricks & University of California, San Diego ); Yannis Ioannidis (University of Athens)
  • FactorJoin: A New Cardinality Estimation Framework for Join Queries
    Ziniu Wu (Massachusetts Institute of Technology)*; Parimarjan Negi (MIT); Mohammad Alizadeh (MIT CSAIL); Tim Kraska (MIT); Samuel Madden (MIT)
  • FlexER: Flexible Entity Resolution for Multiple Intents
    Bar Genossar (Technion -- Israel Institute of Technology)*; Avigdor Gal (Technion -- Israel Institute of Technology); Roee Shraga (Northeastern University)
  • MRV: Enforcing Numeric Invariants in Parallel Updates to Hotspots with Randomized Splitting
    Nuno F Faria (INESCTEC & U. Minho)*; José Pereira (U. Minho & INESCTEC)
  • Polaris: Enabling Transaction Priority in Optimistic Concurrency Control
    Chenhao Ye (University of Wisconsin-Madison); Wuh-Chwen Hwang (University of Wisconsin-Madison); Keren Chen (University of Wisconsin-Madison); Xiangyao Yu (University of Wisconsin-Madison)*
  • An Efficient Algorithm for Distance-based Structural Graph Clustering
    Kaixin Liu (Tsinghua University); Sibo Wang (The Chinese University of Hong Kong)*; Yong Zhang (" Tsinghua University, China"); Chunxiao Xing (Tsinghua University)
  • SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy
    Alexander Conway (VMware Research)*; Martin Farach-Colton (Rutgers University); Rob Johnson (VMware Research)
  • IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity
    Prashant Pandey (University of Utah)*; Michael A Bender (Stony Brook); Alexander Conway (VMware Research); Martin Farach-Colton (Rutgers University); William H Kuszmaul (MIT); Guido Tagliavini (Rutgers University); Rob Johnson (VMware Research)
  • Efficient Sampling Approaches to Shapley Value Approximation
    Jiayao Zhang (Zhejiang University); Qiheng Sun (Zhejiang University); Jinfei Liu (Zhejiang University)*; Li Xiong (Emory University); Jian Pei (Simon Fraser University); Kui Ren (Zhejiang University)
  • Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach
    Kaiqiang Yu (Nanyang Technological University)*; Cheng Long (Nanyang Technological University)
  • TED: Towards Discovering Top-𝑘 Edge-Diversified Patterns in a Graph Database
    Kai Huang (HKUST)*; Haibo Hu (Hong Kong Polytechnic University); Qingqing Ye (Hong Kong Polytechnic University); Kai Tian (Tencent); Bolong Zheng (Huazhong University of Science and Technology); Xiaofang Zhou (Hong Kong University of Sci and Tech)
  • Caerus: A Caching-based Framework for Scalable Temporal Graph Neural Networks
    Yiming Li (Hong Kong University of Science and Technology)*; Yanyan Shen (Shanghai Jiao Tong University); Lei Chen (Hong Kong University of Science and Technology); Mingxuan Yuan (Huawei)
  • SafeBound: A Practical System for Generating Cardinality Bounds
    Kyle B Deeds (University of Washington)*; Magdalena Balazinska (UW); Dan Suciu (University of Washington)
  • Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases
    Yun PENG (Guangzhou University)*; Byron Choi (Hong Kong Baptist University); Tsz Nam (Edison) Chan (Hong Kong Baptist University); Jianye Yang (Guangzhou University); Jianliang Xu (Hong Kong Baptist University)
  • Detecting Logic Bugs of Join Optimizations in DBMS
    Xiu Tang (Zhejiang University); Sai Wu (Zhejiang Univ)*; Dongxiang Zhang (Zhejiang University); Feifei Li (Alibaba Group); Gang Chen (Zhejiang University)
  • TowerSensing: Linearly Compressing Sketches with Flexibility
    Zirui Liu (Peking University)*; Yixin Zhang (Peking University); Yifan Zhu (Peking university); Ruwen Zhang (Peking University); Tong Yang (Peking University); kun xie (Hunan University); Sha Wang (National University of Defense Technology); Tao Li (National University of Defense Technology); Bin Cui (Peking University)
  • A Universal Question-Answering Platform for Knowledge Graphs
    Reham Omar (Concordia University )*; Ishika Dhall (Concordia University ); Panos Kalnis (King Abdullah University of Science and Technology); Essam Mansour (Concordia University)
  • Fast Density-Based Clustering: Geometric Approach
    Xiaogang Huang (Southwestern University of Finance and Economics); Tiefeng Ma (Southwestern University of Finance and Economics)*
  • MorphStream: Adaptive Scheduling for Scalable Transactional Stream Processing on Multicores
    Yancan Mao (National University of Singapore); Jianjun Zhao (huazhong university of science and technology); Haikun Liu (Huazhong University of Science and Technology); Shuhao Zhang (Singapore University of Technology and Design)*; Volker Markl (Technische Universität Berlin)
  • An Effective and Differentially Private Protocol for Secure Distributed Cardinality Estimation
    Pinghui Wang (Xi'an Jiaotong University)*; Chengjin Yang (Xi'an Jiaotong University); Dongdong Xie (Xi'an Jiaotong University); Junzhou Zhao (Xi'an Jiaotong University); Hui Li (Xidian University); Jing Tao (Xi'an Jiaotong University); Xiaohong Guan (Xi'an Jiaotong University)
  • Towards Generating Hop-constrained s-t Simple Path Graphs
    Yuzheng Cai (Fudan University); Siyuan Liu (Fudan University); Weiguo Zheng (Fudan University)*; Xuemin Lin (University of New South Wales)
  • GeoGauss: Strongly Consistent Coordinator-Free OLTP for Geo-Replicated SQL Database
    Weixing Zhou (Northeastern University); Qi Peng (Northeastern University); Zijie Zhang (Huawei); Yanfeng Zhang (Northeastern University)*; Yang Ren (Huawei); Sihao Li (Huawei Tech. Co Ltd); Guo Fu (Northeastern University); yulong cui (northeastern university); Qiang Li (华为技术有限公司); Wu Caiyi (NEU); Shangjun Han (Northeastern University); Shengyi Wang (Northeastern University); Guoliang Li (Tsinghua University); Ge Yu (Northeast University)
  • The RLR-Tree: A Reinforcement Learning Based R-Tree for Spatial Data
    Tu Gu (Nanyang Technological University)*; Kaiyu Feng (Beijing Institute of Technology); Gao Cong (Nanyang Technological Univesity); Cheng Long (Nanyang Technological University); ZHENG WANG (Nanyang Technological University); Sheng Wang (Alibaba Group)
  • Robust and Transferable Log-based Anomaly Detection
    Peng Jia (Xi'an Jiaotong University)*; Yiyuan Xiong (NUS); Shaofeng Cai (National University of Singapore); Beng Chin Ooi (NUS); Pinghui Wang (Xi'an Jiaotong University)
  • Matching Roles from Temporal Data
    Leon Bornemann (Hasso Plattner Institute)*; Tobias Bleifuß (Hasso Plattner Institute); Dmitri V. Kalashnikov (AT&T Labs Research); Fatemeh Nargesian (University of Rochester); Felix Naumann (Hasso Plattner Institute, University of Potsdam); Divesh Srivastava (AT&T Chief Data Office)
  • Toward Efficient Homomorphic Encryption for Outsourced Databases through Parallel Caching
    Olamide Timothy Tawose (University of Nevada, Reno); Jun Dai (California State University, Sacramento); Lei Yang (University of Nevada, Reno); DONGFANG ZHAO (University of Nevada, Reno)*
  • Efficient Resistance Distance Computation: the Power of Landmark-based Approaches
    Meihao Liao (Beijing Institute of Technology); Ronghua Li (Beijing Institute of Technology)*; Qiangqiang Dai (Beijing Institute of Technology); Hongyang Chen (Zhejiang Lab); Hongchao Qin (Beijing Institute of Technology); Guoren Wang (Beijing Institute of Technology)
  • Scaling Up k-Clique Densest Subgraph Detection
    Yizhang He (The University of New South Wales); Kai Wang (Shanghai Jiao Tong University)*; Wenjie Zhang (University of New South Wales); Xuemin Lin (University of New South Wales); Ying Zhang (University of Technology Sydney)
  • Discovering Top-k Rules using Subjective and Objective Criteria
    Wenfei Fan (Univ. of Edinburgh ); Ziyan Han (Beihang University); Yaoshu Wang (Shenzhen Institute of Computing Sciences, Shenzhen University)*; Min Xie (Shenzhen Institute of Computing Sciences )
  • FINEX: A Fast Index for Exact & Flexible Density-Based Clustering
    Konstantin Emil Thiel (University of Salzburg)*; Daniel Kocher (University of Salzburg); Nikolaus Augsten (University of Salzburg); Thomas Hütter (University of Salzburg); Willi Mann (Celonis SE); Daniel Schmitt (University of Salzburg)
  • DBPA: A Benchmark for Transactional Database Performance Anomalies
    Shiyue Huang (Peking University)*; Ziwei Wang (Peking University); Xinyi Zhang (Peking University); Yaofeng Tu (ZTE Corporation); zhongliang Li (ZTE); Bin Cui (Peking University)
  • Efficiently Computing Join Orders with Heuristic Search
    Immanuel L Haffner (Saarland University, Saarland Informatics Campus)*; Jens Dittrich (Saarland University, Saarland Informatics Campus)
  • T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph
    Lyuheng Yuan (University of Alabama at Birmingham); Da Yan (University of Alabama at Birmingham)*; wenwen qu (East China Norm University); Saugat Adhikari (The University of Alabama at Birmingham); Jalal Khalil (The University of Alabama at Birmingham); Cheng Long (Nanyang Technological University); Xiaoling Wang (East China Normal University)
  • Discovering Similarity Inclusion Dependencies
    Youri Kaminsky (Hasso Plattner Institute)*; Eduardo H. M. Pena (UTFPR); Felix Naumann (Hasso Plattner Institute, University of Potsdam)
  • Effective and Efficient PageRank-based Positioning for Graph Visualization
    Shiqi Zhang (National University of Singapore); Renchi Yang (Hong Kong Baptist University); Xiaokui Xiao (National University of Singapore)*; Xiao Yan (Southern University of Science and Technology); Bo Tang (Southern University of Science and Technology)
  • Maximal Defective Clique Enumeration
    Qiangqiang Dai (Beijing Institute of Technology); Ronghua Li (Beijing Institute of Technology)*; Meihao Liao (Beijing Institute of Technology); Guoren Wang (Beijing Institute of Technology)
  • Efficient Biclique Counting in Large Bipartite Graphs
    Xiaowei Ye (Beijing Institute of Technology); Ronghua Li (Beijing Institute of Technology)*; Qiangqiang Dai (Beijing Institute of Technology); Hongchao Qin (Beijing Institute of Technology); Guoren Wang (Beijing Institute of Technology)
  • Double-Anonymous Sketch: Achieving Fairness for Finding Global Top-K Frequent Items
    Yikai Zhao (Peking University)*; Wenchen Han (Peking University); Zheng Zhong (Peking University); Yinda Zhang (Peking University); Tong Yang (Peking University); Bin Cui (Peking University)
  • Managing Conflicting Interests of Stakeholders in Influencer Marketing
    Shixun Huang (RMIT); Junhao Gan (University of Melbourne); Zhifeng Bao (RMIT University)*; Wenqing Lin (Tencent)
  • JoinSketch: A Sketch Algorithm for Accurate and Unbiased Inner-Product Estimation
    Feiyu Wang (Peking University)*; Qizhi Chen (Peking University); Yuanpeng Li (Peking University); Tong Yang (Peking University); Yaofeng Tu (ZTE Corporation); Lian Yu (Peking University); Bin Cui (Peking University)
  • Regularized Pairwise Relationship based Analytics for Structured Data
    Zhaojing Luo (National University of Singapore); Shaofeng Cai (National University of Singapore); Yatong Wang (University of Electronic Science and Technology of China); Beng Chin Ooi (NUS)*
  • Together is Better: Heavy Hitters Latency Quantile Estimation
    Rana Shahout (Technion)*; Roy Friedman (Technion); Ran Ben Basat (UCL)
  • Unicorn: A Unified Multi-tasking Model for Supporting Matching Tasks in Data Integration
    Jianhong Tu (Renmin University of China); Ju Fan (Renmin University of China)*; Nan Tang (Qatar Computing Research Institute, HBKU); Peng Wang (Renmin University of China); Guoliang Li (Tsinghua University); Xiaoyong Du (Renmin University of China); Jia Xiaofeng (Beijing Big Data Centre); Song Gao (Beijing Big Data Centre)
  • Time Series Data Validity
    Yunxiang Su (Tsinghua University); Gong Yikun (Tsinghua); Shaoxu Song (Tsinghua University)*
  • Making It Tractable to Catch Duplicates and Conflicts in Graphs
    Wenfei Fan (Univ. of Edinburgh ); Wenzhi Fu (University of Edinburgh); Ruochun Jin (National University of Defense Technology); Muyang Liu (University of Edinburgh); Ping Lu (Beihang Univ.); Chao Tian (Chinese Academy of Sciences)*
  • ST4ML: Machine Learning Oriented Spatio-Temporal Data Processing at Scale
    Kaiqi Liu (Nanyang Technological University)*; Panrong Tong (Alibaba Group); Mo Li (Nanyang Technological University); Yue Wu (Damo Academy, Alibaba Group); Jianqiang Huang (Alibaba Group)
  • Learned Data-aware Image Representations of Line Charts for Similarity Search
    Yuyu Luo (Tsinghua University); Yihui Zhou (Tsinghua University); Nan Tang (Qatar Computing Research Institute, HBKU); Guoliang Li (Tsinghua University)*; Chengliang Chai (Tsinghua Univerisity); Leixian Shen (Tsinghua University)
  • RLS Side Channels: Investigating Leakage of Row-Level Security Protected Data Through Query Execution Time
    Chen Dar (Tel Aviv University); Moshik Hershcovitch (Tel Aviv University & IBM Research); Adam Morrison (Tel Aviv University)*
  • LightRW: FPGA Accelerated Graph Dynamic Random Walks
    Hongshi Tan (National University of Singapore)*; Xinyu Chen (National University of Singapore); Yao Chen (Advanced Digital Sciences Center); Bingsheng He (National University of Singapore); Weng-Fai Wong (National University of Singapore)
  • HybridPipe: Combining Human-generated and Machine-generated Pipelines for Data Preparation
    Sibei Chen (Renmin University of China); Nan Tang (Qatar Computing Research Institute, HBKU); Ju Fan (Renmin University of China)*; Xuemi Yan (Renmin University of China); Chengliang Chai (Beijing Institute of Technology); Guoliang Li (Tsinghua University); Xiaoyong Du (Renmin University of China)
  • Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware
    Manuel Schönberger (Technical University of Applied Sciences Regensburg)*; Stefanie Scherzinger (University of Passau); Wolfgang Mauerer (Technical University of Applied Sciences Regensburg / Siemens AG)
  • Mining Geospatial Relationships from Text
    Pasquale Balsebre (Nanyang Technological University)*; Dezhong Yao (Huazhong University of Science and Technology); Gao Cong (Nanyang Technological Univesity); Weiming Huang (Nanyang Technological University); Zhen Hai (DAMO Academy, Alibaba Group)
  • Grep: A Graph Learning Based Database Partitioning System
    Xuanhe Zhou (Tsinghua); Guoliang Li (Tsinghua University)*; Jianhua Feng (Tsinghua); luyang liu (Huawei); Guo Wei (Huawei)
  • BALANCE: Bayesian Linear Attribution for Root Cause Localization
    Chaoyu Chen (Ant Group); Hang Yu (Ant Group); Zhichao Lei (Ant Group); Jianguo Li (Ant Group)*; Shaokang Ren (Ant Group); Tingkai Zhang (Ant Group); Silin Hu (Ant Group); Jianchao Wang (Ant Group); Wenhui Shi (OceanBase)
  • Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs
    Xinyu Du (Chinese University of Hong Kong); Xingyi Zhang (The Chinese University of Hong Kong); Sibo Wang (The Chinese University of Hong Kong)*; Zengfeng Huang (Fudan University)
  • Joint Neural Architecture and Hyperparameter Search for Correlated Time Series Forecasting
    Xinle Wu (Aalborg Universigy); Dalin Zhang (Aalborg University); Miao Zhang (Aalborg University); Chenjuan Guo (Aalborg University); Bin Yang (Aalborg University)*; Christian S Jensen (Aalborg University)
  • When Private Blockchain Meets Deterministic Database
    Ziliang Lai (Chinese University of Hong Kong)*; Chris Liu (Chinese University of Hong Kong); Eric Lo (Chinese University of Hong Kong)
  • Hierarchical Residual Encoding for Multiresolution Compression
    Bruno Barbarioli (The University of Chicago)*; Gabriel Mersy (University of Chicago); Stavros Sintos (University of Illinois Chicago); Sanjay Krishnan (U Chicago)
  • NeuroSketch: Fast and Approximate Evaluation of Range Aggregate Queries with Neural Networks
    Sepanta Zeighami (University of Southern California)*; Cyrus Shahabi (Computer Science Department. University of Southern California); Vatsal Sharan (University of Southern California)
  • INEv: In-Network Evaluation for Event Stream Processing
    Samira Akili (HU Berlin )*; Matthias Weidlich (Humboldt-Universität zu Berlin); Steven Purtzel (Humboldt-Universität zu Berlin)
  • Graph Learning for Interaction Analysis in Smart Home Rule Data
    Guangjing Wang (Michigan State University)*; Nikolay Ivanov (Michigan State University); Qi Wang (uiuc); ThanhVu Nguyen (George Mason University); Qiben Yan (Michigan State University)
  • dsJSON: A Distributed SQL JSON Processor
    Majid Saeedan (University of California, Riverside)*; Ahmed Eldawy (University of California, Riverside); Zhijia Zhao (University of California, Riverside)
  • When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories
    Ke Wang (Yale University)*; Guanqun Yang (New York University); Yiwei Li (Tsinghua University); Huanchen Zhang (Tsinghua University); Mingyu Gao (Tsinghua University)
  • Pontus: Finding Waves in Data Streams
    Zhengxin Zhang (Tsinghua University)*; Qing Li (Peng Cheng Laboratory); Guanglin Duan (Tsinghua); Dan Zhao (peng cheng laboratory ); Jingyu Xiao (Tsinghua University); Guorui Xie (Tsinghua University); Yong Jiang (Tsinghua University)
  • FEAST: A Communication-efficient Federated Feature Selection Framework for Relational Data
    Rui Fu (Beijing Institute of Technology); Yuncheng Wu (National University of Singapore); Quanqing Xu (OceanBase); Meihui Zhang (Beijing Institute of Technology)*
  • Pea Hash: A Performant Extendible Adaptive Hashing Index
    Zhuoxuan Liu (University of Chinese Academy of Sciences)*; Shimin Chen (Chinese Academy of Sciences)
  • Kepler: Robust Learning for Parametric Query Optimization
    Lyric Doshi (Google); Vincent Zhuang (Google)*; Gaurav Jain (Google); Ryan C Marcus (MIT); Haoyu Huang (Google); Deniz Altınbüken (Google); Eugene Brevdo (Google); Campbell Fraser (Google)
  • Dumpy: A Compact and Adaptive Index for Large Data Series Collections
    Zeyu Wang (Fudan University)*; Qitong Wang (Université Paris Cité ); Peng Wang (" Fudan University, China"); Themis Palpanas (Université Paris Cité); Wei Wang (" Fudan University, China")

Credits
Follow our progress: TwitterFacebook