Accepted Papers for SIGMOD
Round 2
- Online Detection of Anomalies in Temporal Knowledge Graphs with Interpretability
Jiasheng Zhang (University of Electronic Science and Technology of China); Rex Ying (Yale University); Jie Shao (University of Electronic Science and Technology of China)*
- Camel: Efficient Compression of Floating-Point Time Series
Yuanyuan Yao (Zhejiang University); Lu Chen (Zhejiang University)*; Ziquan Fang (Zhejiang University); Yunjun Gao (Zhejiang University); Christian S. Jensen (Aalborg University); Tianyi Li (Aalborg University)
- LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-level CSR
Song Yu (Northeastern University)*; Shufeng Gong (NorthEastern University); Qian Tao (Alibaba Group); Sijie Shen (Alibaba Group); Yanfeng Zhang (Northeastern University); Wenyuan Yu (Alibaba Group); Pengxi Liu (Northeastern University); Zhixin Zhang (Northeastern University); Hongfu Li (Northeastern University); Luo Xiaojian (Alibaba group); Ge Yu (Northeastern University); Jingren Zhou (Alibaba Group)
- Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search
Yuzheng Cai (Fudan University); Jiayang Shi (Fudan university); Yizhuo Chen (Fudan University); Weiguo Zheng (Fudan University)*
- Buffered Persistence in B+ Trees
Mingzhe Du (University of Rochester)*; Michael L Scott (University of Rochester)
- GOLAP: A GPU-in-Data-Path Architecture for High-Speed OLAP
Nils Boeschen (TU Darmstadt)*; Tobias Ziegler (TU Darmstadt); Carsten Binnig (TU Darmstadt)
- DPconv: Super-Polynomially Faster Join Ordering
Mihail Stoian (UTN)*; Andreas Kipf (UTN)
- iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
Yuexuan Xu (Nanyang Technological University); Jianyang Gao (Nanyang Technological University)*; Yutong Gou (Nanyang Technological University); Cheng Long (Nanyang Technological University); Christian S. Jensen (Aalborg University)
- Lossless Transformation of Knowledge Graphs to Property Graphs using Standardized Schemas
Kashif Rabbani (Aalborg University Denmark)*; Matteo Lissandrini (University of Verona); Angela Bonifati (Univ. of Lyon); Katja Hose (TU Wien)
- CtxPipe: Context-aware Data Preparation Pipeline Construction for Machine Learning
Haotian Gao (National University of Singapore); Shaofeng Cai (National University of Singapore); Anh Dinh (Deakin University); Zhiyong Huang (NUS School of Computing); Beng Chin Ooi (NUS)*
- Multivariate Time Series Cleaning under Speed Constraints
Aoqian Zhang (Beijing Institute of Technology)*; Zexue Wu (Beijing Institute of Technology); Yifeng Gong (Beijing Institute of Technology); Ye Yuan (Beijing Institute of Technology); Guoren Wang (Beijing Institute of Technology)
- Finding Logic Bugs in Spatial Database Engines via Affine Equivalent Inputs
Wenjing Deng (East China Normal University)*; Qiuyang Mang (The Chinese University of Hong Kong, Shenzhen); Chengyu Zhang (ETH Zurich); Manuel Rigger (National University of Singapore)
- A Universal Sketch for Estimating Heavy Hitters and Per-Element Frequency Moments in Data Streams with Bounded Deletions
Liang Zheng (Southeast University); Qingjun Xiao (Southeast University)*; Xuyuan CAI (Hong Kong Polytechnic University)
- Pasta: A Cost-Based Optimizer for Generating Pipelining Schedules for Dataflow DAGs
Xiaozhen Liu (University of California, Irvine)*; Yicong Huang (UC Irvine); Xinyuan Lin (University of California Irvine); Avinash Kumar (U C IRVINE); Sadeem Alsudais (King Saud University); Chen Li (UC Irvine)
- Towards a Converged Relational-Graph Optimization Framework
Yunkai Lou (Alibaba Group); Longbin Lai (Alibaba Group)*; Bingqing Lyu (Alibaba Group); Yufan Yang (Alibaba Group); XiaoLi Zhou (阿里巴巴); Wenyuan Yu (Alibaba Group); Ying Zhang (University of Technology Sydney); Jingren Zhou (Alibaba Group)
- Disclosure-compliant Query Answering
Rudi Poepsel-Lemaitre (Technische Universität Berlin)*; Kaustubh Beedkar (Indian Institute of Technology Delhi); Volker Markl (Technische Universität Berlin)
- Memento Filter: A Fast, Dynamic, and Robust Range Filter
Navid Eslami (University of Toronto)*; Niv Dayan (University of Toronto)
- GEIL: A Graph-Enhanced Interpretable Data Cleaning Framework with Large Language Models
Mengyi Yan (Beihang University); Yaoshu Wang (Shenzhen Institute of Computing Sciences, Shenzhen University)*; Yue Wang (Shenzhen Institute of Computing Sciences); Xiaoye Miao (Zhejiang University); Jianxin Li (Beihang University)
- Live Patching for Distributed In-Memory Key-Value Stores
Michael Fruth (University of Passau)*; Stefanie Scherzinger (University of Passau)
- Provenance-Enabled Explainable AI
Jiachi Zhang (Alibaba Group)*; Wenchao Zhou (Alibaba Group); Benjamin E Ujcich (Georgetown University)
- Constant-time Connectivity Querying in Dynamic Graphs
Lantian Xu (University of Technology Sydney); Dong Wen (University of New South Wales)*; Lu Qin (UTS); Ronghua Li (Beijing Institute of Technology); Ying Zhang (University of Technology Sydney); Xuemin Lin (Shanghai Jiaotong University)
- Vectorizing Distributed Graph Computations made Automated
Wenyue Zhao (University of Edinburgh); Yang Cao (University of Edinburgh)*; Peter Buneman (The University of Edinburgh); Jia Li (Edinburgh Research Center, Central Software Institute, Huawei); Nikos Ntarmos (Edinburgh Research Center, Central Software Institute, Huawei)
- High-Performance Query Processing with NVMe Arrays: Spilling without Killing Performance
Maximilian Kuschewski (Technische Universität München)*; Jana Giceva (TU Munich); Thomas Neumann (TUM); Viktor Leis (Technische Universität München)
- Personalized Truncation for Personalized Privacy
Dajun Sun (Hong Kong University of Science and Technology)*; Wei Dong (CMU); Yuan Qiu (Hong Kong Univ. of Science and Technology ); Ke Yi (Hong Kong Univ. of Science and Technology)
- Understanding and Reusing Test Suites Across Database Systems
Suyang Zhong (National University of Singapore); Manuel Rigger (National University of Singapore)*
- Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
Yizhang He (The University of New South Wales)*; Kai Wang (Shanghai Jiao Tong University); Wenjie Zhang (University of New South Wales); Xuemin Lin (Shanghai Jiaotong University); Ying Zhang (University of Technology Sydney)
- An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
XIAOJIA XU (Renmin University of China); Haoyu Liu (Renmin University of China); Xiaowei Lv (Renmin University of China); Yongcai Wang (Renmin University of China)*; Deying Li (School of information, Renmin University of China)
- SPID-Join: A Skew-resistant Processing-in-DIMM Join Algorithm Exploiting the Bank- and Rank-level Parallelisms of DIMMs
Suhyun Lee (Yonsei University); Chaemin Lim (Yonsei University); Jinwoo Choi (Yonsei University); heelim choi (Yonsei University); Chan Lee (Yonsei University); Yongjun Park (Yonsei university); Kwanghyun Park (Yonsei University); Hanjun Kim (Yonsei University); Youngsok Kim (Yonsei University)*
- Directional Queries: Making Top-k Queries More Effective in Discovering Relevant Results
Paolo Ciaccia (Università di Bologna); Davide Martinenghi (Politecnico di Milano)*
- Connectivity-Oriented Property Graph Partitioning for Distributed Graph Pattern Query Processing
Min Shi (Hunan University); Peng Peng (Hunan University)*; Xu Zhou (Hunan university); Jiayu Liu (Hunan University); Guoqing Xiao (Hunan University); Kenli Li (Hunan University)
Round 1
- On the Feasibility and Benefits of Extensive Evaluation
Yujie Hui (The Ohio State University)*; Miao Yu (The Ohio State University); Hao Qi (ucmerced); Yifan Gan (The Ohio State University); Tianxi Li (The Ohio State University); Yuke Li (University of California, Merced); Xueyuan Ren (The Ohio State University); Sixiang Ma (The Ohio State University); Xiaoyi Lu (UC Merced); Yang Wang (The Ohio State University)
- BT-Tree: A Reinforcement Learning Based Index for Big Trajectory Data
Tu Gu (Nanyang Technological University)*; Kaiyu Feng (Beijing Institute of Technology); Jingyi Yang (Nanyang Technological University); Gao Cong (Nanyang Technological Univesity); Cheng Long (Nanyang Technological University); Rui Zhang (ruizhang.info)
- GABoost: Graph Alignment Boosting via Local Optimum Escape
Wei Liu (Peking University)*; Wei Zhang (Peking University); Haiyan Zhao (Peking University); Zhi Jin (Key Lab of High Confidence Software Technologies (Peking University), Ministry o)
- Efficient and Accurate PageRank Approximation on Large Graphs
Siyue Wu (Shenzhen University); Dingming Wu (Shenzhen University)*; Junyi Quan (Shenzhen University); Tsz Nam Chan (Shenzhen University); Kezhong Lu (Shenzhen University)
- Near-Duplicate Sequence Alignment with One Permutation Hashing
Zhencan Peng (Rutgers University)*; Yuheng Zhang (Rutgers University ); Dong Deng (Rutgers University - New Brunswick)
- Efficient Approximation Algorithms for Minimum Cost Seed Selection with Probabilistic Coverage Guarantee
Chen Feng (The Hong Kong Polytechnic University); Xingguang Chen (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)*
- Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching
qihui zhou (CUHK)*; Peiqi Yin (The Chinese University of Hong Kong); Xiao Yan (Centre for Perceptual and Interactive Intelligence (CPII) ); Changji Li (CUHK); Guanxian Jiang (CUHK); James Cheng (CUHK)
- A Profit-Maximizing Data Marketplace with Differentially Private Federated Learning under Price Competition
Peng Sun (Hunan University)*; Liantao Wu (East China Normal University); Zhibo Wang (Zhejiang University); Jinfei Liu (Zhejiang University); Juan Luo (Hunan University); Wenqiang Jin (Hunan University)
- Pluto: Sample Selection for Robust Anomaly Detection on Polluted Log Data
Lei Ma (WPI)*; Lei Cao (University of Arizona); Peter M VanNostrand (WPI); Dennis M Hofmann (Worcester Polytechnic Institute); Yao Su (Worcester Polytechnic Institute); Elke A Rundensteiner (Worcester Polytechnic Institute)
- Adaptive Quotient Filters
Richard R Wen (University of Maryland); Hunter J Mccoy (University of Utah); David Tench (Lawrence Berkeley National Labs); Guido Tagliavini (Rutgers University); Michael A Bender (Stony Brook); Alex Conway (Cornell Tech); Martin Farach-Colton (Rutgers University); Rob Johnson (VMware Research); Prashant Pandey (University of Utah)*
- A Lovász-Simonovits Theorem for Hypergraphs with Application to Local Clustering
Raj Kamal (Indian Institute of Technology Delhi)*; Amitabha Bagchi (IIT Delhi)
- Optimizing LSM-trees via Active Learning
Weiping Yu ( Nanyang Technological University); Siqiang Luo (Nanyang Technological University)*; Zihao Yu (Nanyang Technological University); Gao Cong (Nanyang Technological Univesity)
- Theoretically and Practically Efficient Maximum Defective Clique Search
Qiangqiang Dai (Beijing Institute of Technology)*; Ronghua Li (Beijing Institute of Technology); Donghang Cui (Beijing Institute of Technology); Guoren Wang (Beijing Institute of Technology)
- Tao: Improving Resource Utilization while Guaranteeing SLO in Multi-tenant Relational Database-as-a-Service
Haotian Liu (Southern University of Science and Technology); Runzhong LI (Southern University of Science and Technology); Ziyang Zhang (Southern University of Science and Technology); Bo Tang (Southern University of Science and Technology)*
- Discovering Top-k Relevant and Diversified Rules
Wenfei Fan (Univ. of Edinburgh ); Ziyan Han (Beihang University); Min Xie (Shenzhen Institute of Computing Sciences )*; Guangyi Zhang (Shenzhen Technology University)
- Enabling Adaptive Sampling for Intra-Window Join: Simultaneously Optimizing Quantity and Quality
Xilin Tang (Renmin University of China)*; Feng Zhang (Renmin University of China); Shuhao Zhang (Nanyang Technological University); Yani Liu (Renmin University of China); Bingsheng He (National University of Singapore); Xiaoyong Du (Renmin University of China)
- SketchQL: Video Moment Querying with a Visual Query Interface
Renzhi Wu (Georgia Institute of Technology)*; Pramod Chunduri (Georgia Institute of Technology); Ali Payani (Cisco Systems Inc.); Xu Chu (GATECH); Joy Arulraj (Georgia Tech); Kexin Rong (Georgia Institute of Technology)
