Accepted Papers for SIGMOD
Round 3
- Agree to Disagree: Robust Anomaly Detection with Noisy Labels
Dennis M Hofmann (Worcester Polytechnic Institute)*; Peter M VanNostrand (WPI); Lei Ma (WPI); Huayi Zhang (WPI); Joshua C DeOliveira (Worcester Polytechnic Institute); Lei Cao (University of Arizona); Elke A Rundensteiner (Worcester Polytechnic Institute)
- FastPDB: Towards Bag-Probabilistic Queries at Interactive Speeds
Aaron Huber (SUNY Buffalo)*; Boris Glavic (University of Illinois Chicago); Oliver A Kennedy (University at Buffalo, SUNY); Atri Rudra (University at Buffalo); Zhuoyue Zhao (University at Buffalo)
- OBIR-tree: Secure and Efficient Oblivious Index for Spatial Keyword Queries
Zikai Ye (Xidian University)*; Xiangyu Wang (Xidian University); Zesen Liu (Xidian University); DAN ZHU (Northwestern Polytechnical University); Jianfeng Ma (Xidian University)
- Accelerating Core Decomposition in Billion-Scale Hypergraphs
Wenqian Zhang (The University of New South Wales); Zhengyi Yang (University of New South Wales)*; Dong Wen (University of New South Wales); Wentao Li (The Hong Kong University of Science and Technology (Guangzhou)); Wenjie Zhang (University of New South Wales); Xuemin Lin (Shanghai Jiaotong University)
- MAST: Towards Efficient Analytical Query Processing on Point Cloud Data
Jiangneng Li (Nanyang Technological University)*; Haitao Yuan (Nanyang Technological University); Gao Cong (Nanyang Technological Univesity); Han Mao Kiah (Nanyang Technological University); Shuhao Zhang (Huazhong University of Science and Technology)
- 𝜆-Tune: Harnessing Large Language Models for Automated Database System Tuning
Victor Giannakouris (Cornell University)*; Immanuel Trummer (Cornell University)
- Rapid Data Ingestion through DB-OS Co-design
Hyungsoo Jung (Seoul National University)*; Alan Fekete (University of Sydney); Minseok Yoon (Hanyang University); Kihwan Kim (Hanyang University); Kyungmin Lim (Hanyang University)
- U-DPAP: Utility-aware Efficient Range Counting on Privacy-preserving Spatial Data Federation
yahong chen (Central China Normal University)*; Xiaoyi Pang (Zhejiang University); Xiaoguang Li (Xidian University); Hanyi Wang (China Mobile (Suzhou) Software Technology Co., Ltd.); Ben Niu (Institute of Information Engineering, CAS, China); Shengnan Hu (Central China Normal University)
- Capsule: an Out-of-Core Training Mechanism for Colossal GNNs
Yongan Xiang (University of Science and Technology of China ); Zezhong Ding (University of Science and Technology of China); Rui Guo (University of Science and Technology of China); Shangyou Wang (University of Science and Technology of China); Xike Xie (University of Science and Technology of China)*; S. Kevin Zhou (USTC)
- Bursting Flow Query on Large Temporal Flow Networks
Lyu Xu (Hong Kong Baptist University)*; Jiaxin Jiang (National University of Singapore); Byron Choi (Hong Kong Baptist University); Jianliang Xu (Hong Kong Baptist University); Bingsheng He (National University of Singapore)
- Constant Optimization Driven Database System Testing
Chi Zhang (Nanjing University)*; Manuel Rigger (National University of Singapore)
- A Benchmark for Data Management in Microservices
Rodrigo Nunes Laigner (University of Copenhagen)*; Zhexiang Zhang (University of Copenhagen); Yijian Liu (University of Copenhagen); Leonardo Freitas Gomes (Amadeus); Yongluan Zhou (University of Copenhagen)
- Sequoia: An Accessible and Extensible Framework for Privacy-Preserving Machine Learning over Distributed Data
Kaiqiang Xu (HKUST)*; Di Chai (HKUST); Junxue ZHANG (Hong Kong University of Science and Technology); Fan Lai (UIUC); Kai Chen (HKUST)
- Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle Inequalities
Qian Xu (Renmin University of China); Juan Yang (Tsinghua University); Feng Zhang (Renmin University of China)*; Junda Pan (Renmin University of China); Kang Chen (Tsinghua University); Youren Shen (Beijing HaiZhi XingTu Technology Co., Ltd.); Amelie Chi Zhou (Hong Kong Baptist University); Xiaoyong Du (Renmin University of China)
- SNAILS: Schema Naming Assessments for Improved LLM-Based SQL Inference
Kyle R Luoma (University of California, San Diego)*; Arun Kumar (University of California, San Diego)
- Dialogue Benchmark Generation from Knowledge Graphs with Cost-Effective Retrieval-Augmented LLMs
Reham Omar (Concordia University)*; Omij Mangukiya (Concordia University); Essam Mansour (Concordia University)
- LCP: Enhancing Scientific Data Management with Lossy Compression for Particles
Longtao Zhang (Florida State University); Ruoyu Li (Florida State University); Congrong Ren (The Ohio State University); Sheng Di (Argonne National Laboratory, Lemont, IL); Jinyang Liu (University of California, Riverside); Jiajun Huang (UCR); Robert R Underwood (Argonne National Laboratory); Pascal Grosset (Los Alamos National Laboratory); Dingwen Tao (Indiana University); Xin Liang (University of Kentucky); Hanqi Guo (The Ohio State University); Franck Cappello (Argonne National Laboratory, Lemont, IL); Kai Zhao (Florida State University)*
- Disco: A Compact Index for LSM-trees
Wenshao Zhong (University of Illinois at Chicago and TikTok Inc.)*; Chen Chen (University of Illinois at Chicago); Xingbo Wu (Microsoft Research); Jakob Eriksson (UIC)
- Efficiently Processing Joins and Grouped Aggregations on GPUs
Bowen Wu (ETH Zurich)*; Dimitrios Koutsoukos (ETHZ); Gustavo Alonso (ETHZ)
- HyperMR: Efficient Hypergraph-enhanced Matrix Storage on Compute-in-Memory Architecture
Yifan Wu (Zhejiang University); Ke Chen (Zhejiang University); Gang Chen (Zhejiang University); Dawei Jiang (Zhejiang University); Huan Li (Zhejiang University); Lidan Shou (Zhejiang University)*
- InTime: Towards Performance Predictability In Byzantine Fault Tolerant Proof-of-Stake Consensus
Weijie Sun (The Hong Kong University of Science and Technology); Zihuan XU (Shenzhen Institute of Computing Sciences)*; Wangze Ni (Hong Kong University of Science and Technology); Lei Chen (Hong Kong University of Science and Technology)
- LeaFi: Data Series Indexes on Steroids with Learned Filters
Qitong Wang (Harvard University)*; Ioana Ileana (Université Paris Cité); Themis Palpanas (Université Paris Cité)
- PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL Queries Verification
Binbin Gu (UC Irvine)*; Faisal Nawab (University of California at Irvine); Juncheng Fang (University of California, Irvine)
- BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs
Jianxiong Ye (Harbin Institute of Technology); Zhaonian Zou (Harbin Institute of Technology)*; Dandan Liu (Harbin Institute of Technology); Bin Yang (Harbin Institute of Technology); Xudong Liu (Harbin Institute of Technology)
- Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
Muhammad Farhan (Australian National University)*; Henning Koehler (Massey University); Qing Wang (ANU)
- Cardinality Estimation of LIKE Predicate Queries using Deep Learning
Suyong Kwon (Seoul National University); Kyuseok Shim (Seoul National University)*; Woohwan Jung (Hanyang University)
- SHARQ: Explainability Framework for Association Rules on Relational Data
Hadar Ben Efraim (Bar-Ilan University); Susan B Davidson (University of Pennsylvania); Amit Somech (Bar-Ilan University)*
- Randomized Sketches for Quantile in LSM-tree based Store
Ziling Chen (Tsinghua University); Shaoxu Song (Tsinghua University)*
- Centrum: Escape from the Gaussian Process World! Enhancing Database Auto-tuning with Tree-Ensemble Bayesian Optimization
Yuanhao Lai (Huawei); Pengfei Zheng (Huawei)*; Chenpeng Ji (Huawei); Yan Li (Huawei); Songhan Zhang (The Chinese University of Hong Kong, Shenzhen); Rutao Zhang (Huawei); Zhengang Wang (Huawei); yunfei du (Huawei)
- Revisiting the Design of In-Memory Dynamic Graph Storage
Jixian Su (Shanghai Jiao Tong University); Chiyu Hao (Shanghai Jiao Tong University); Shixuan Sun (Shanghai Jiao Tong University)*; Hao Zhang (Huawei); Sen Gao (National University of Singapore); Jiaxin Jiang (National University of Singapore); Yao Chen (National University of Singapore); Chenyi Zhang (Huawei Technologies); Bingsheng He (National University of Singapore); Minyi Guo (Shanghai Jiaotong University)
- H-Rocks CPU-GPU accelerated RocksDB on Persistent Memory
Shweta Pandey (Indian Institute of Science )*; Arkaprava Basu (Indian Institute Of Science)
- Data-Centric Machine Learning Pipeline Orchestration
Maximilian Böther (ETH Zurich)*; Ties Robroek (IT University of Copenhagen); Viktor Gsteiger (ETH Zurich); Robin Holzinger (Technical University of Munich); Xianzhe Ma (ETH Zurich); Pinar Tozun (IT University of Copenhagen); Ana Klimovic (ETH Zurich)
- DiskGNN: Bridging I/O Efficiency and Model Accuracy for Out-of-Core GNN Training
Renjie Liu (Southern University of Science and Technology)*; Yichuan Wang (SJTU); Xiao Yan (Centre for Perceptual and Interactive Intelligence (CPII) ); Zhenkun Cai (Amazon); Minjie Wang (Amazon); Haitian Jiang (New York University); Bo Tang (Southern University of Science and Technology); Jinyang Li (New York University)
- Federated Heavy Hitter Analytics with Local Differential Privacy
Yuemin Zhang (The Hong Kong Polytechnic University); Qingqing Ye (Hong Kong Polytechnic University)*; Haibo Hu (Hong Kong Polytechnic University)
- DISCES: Systematic Discovery of Event Stream Queries
Rebecca Sattler (Humboldt Universität zu Berlin)*; Sarah Kleest-Meißner (Humboldt-Universität zu Berlin); Steven Lange (Humboldt University Berlin); Markus Schmid (Hu berlin); Nicole Schweikardt (HU Berlin); Matthias Weidlich (Humboldt-Universität zu Berlin)
- Pandora: An Efficient and Rapid Solution for Persistence-Based Tasks in High-Speed Data Streams
Weihe Li (University of Edinburgh)*
- Computing Approximate Graph Edit Distance via Optimal Transport
Qihao Cheng (Tsinghua University)*; Da Yan (Indiana University Bloomington); Tianhao Wu (Tsinghua University); Zhongyi Huang (Tsinghua University); Qin Zhang (Indiana University Bloomington)
- B-Trees Are Back: Engineering Fast and Pageable Node Layouts
Marcus Müller (Technische Universität München)*; Lawrence Benson (TU München); Viktor Leis (Technische Universität München)
- Largest Triangle Sampling for Visualizing Time Series in Database
Lei Rui (Tsinghua University); Xiangdong Huang (Tsinghua University); Shaoxu Song (Tsinghua University)*; Chen Wang (" Tsinghua University, China"); Jianmin Wang ("Tsinghua University, China"); zhao cao (Huawei Technologies Co., Ltd)
- ISSD: Indicator Selection for Time Series State Detection
ChengYu Wang (NUDT)*; Tongqing Zhou (National University of Defense Technology); Lin Chen (National University of Defense Technology); shan zhao ( Hefei University of Technology); Zhiping Cai (NUDT)
- RLER-TTE: An Efficient and Effective Framework for En Route Travel Time Estimation with Reinforcement Learning
Zhihan Zheng (Beijing University of Posts and Telecommunications)*; Haitao Yuan (Nanyang Technological University); Minxiao Chen (Beijing University of Posts and Telecommunications); Shangguang Wang (State Key Laboratory of Networking and Switching Technology)
- An Adaptive Benchmark for Modeling User Exploration of Large Datasets
Joanna Purich (University of Maryland, College Park)*; Anthony A Wise (University of Washington); Leilani Battle (University of Washington)
- Reliable Text-to-SQL with Adaptive Abstention
kaiwen chen (university of Toronto)*; Yueting Chen (Seattle University); Nick Koudas (University of Toronto); Xiaohui Yu (York University)
- Entity/Relationship Graphs
Philipp Skavantzos (The University of Auckland); Sebastian Link (University of Auckland)*
- Cohesiveness-aware Hierarchical Compressed Index for Community Search over Attributed Graphs
Yuxiang Wang (Hangzhou Dianzi University)*; Zhangyang Peng (Hangzhou Dianzi University); Xiangyu Ke (Zhejiang University); Xiaoliang Xu (Hangzhou Dianzi University); Tianxing Wu (Southeast University); Yuan Gao (Hangzhou Dianzi University)
- Minimum Spanning Tree Maintenance 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); Yang Lu (UTS); Xuemin Lin (Shanghai Jiaotong University)
- Data Chunk Compaction in Vectorized Execution
Yiming Qiao (Tsinghua University)*; Huanchen Zhang (Tsinghua University)
- Progressive entity resolution: a design space exploration
Jakub Maciejewski (National and Kapodistrian University of Athens); Konstantinos Nikoletos (National and Kapodistrian University of Athens); George Papadakis (University of Athens)*; Yannis Velegrakis (Utrecht University and University of Trento)
- Parallel kd-tree with Batch Updates
Ziyang Men (UC Riverside)*; Zheqi Shen (UC Riverside); Yan Gu (UC Riverside); Yihan Sun (University of California, Riverside)
- User-Centric Property Graph Repairs
Amedeo Pachera (Lyon 1 University)*; Angela Bonifati (Univ. of Lyon); Andrea Mauri (Université Claude Bernard Lyon 1)
- In-Database Time Series Clustering
Yunxiang Su (Tsinghua University); Kenny Ye Liang (Tsinghua University); Shaoxu Song (Tsinghua University)*
- Boosting OLTP Performance with Per-Page Logging on NVDIMM
Seongjae Moon (Sungkyunkwan University); Bohyun Lee (Technische Universität München); Jonghyeok Park (Korea University); Sang-Won Lee (Seoul National University)*
- Shapley Value Estimation based on Differential Matrix
Junyuan Pang (Zhejiang University); Jian Pei (Duke University); Haocheng Xia (University of Illinois Urbana-Champaign); Xiang Li (Zhejiang University); Jinfei Liu (Zhejiang University)*
- SecureXGB: A Secure and Efficient Multi-party Protocol for Vertical Federated XGBoost
Zongda Han (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications)*; Xiang Cheng (Beijing University of Posts and Telecommunications); Wenhong Zhao (Beijing University of Posts and Telecommunications); Jiaxin Fu (Beijing University of Posts and Telecommunications); Zhaofeng He (Beijing University of Posts and Telecommunications); Sen Su (Beijing University of Posts and Telecommunications)
- On Graph Representation for Attributed Hypergraph Clustering
Zijin Feng (The Chinese University of Hong Kong); Miao Qiao (The University of Auckland)*; Chengzhi Piao (Hong Kong Baptist University); Hong Cheng (Chinese University of Hong Kong)
- Nezha: An Efficient Distributed Graph Processing System on Heterogeneous Hardware
pengjie cui (Northeastern University); Haotian Liu (Southern University of Science and Technology); Dong Jiang (Northeastern University); Bo Tang (Southern University of Science and Technology)*; Ye Yuan ( Beijing Institute of Technology)
- Practical DB-OS Co-Design with Privileged Kernel Bypass
Xinjing Zhou (Massachusetts Institute of Technology)*; Viktor Leis (Technische Universität München); Jinming Hu (DolphinDB); Xiangyao Yu (University of Wisconsin-Madison); Michael Stonebraker (MIT)
- QURE: AI-Assisted and Automatically Verified UDF Inlining
Tarique Siddiqui (Microsoft Research)*; Arnd Christian König (Microsoft); Jiashen Cao (Georgia Tech); Cong Yan (Microsoft research); Shuvendu K Lahiri (Microsoft Research)
- A Rank-Based Approach to Recommender System's Top-K Queries with Uncertain Scores
Coral Scharf (Technion - Israel Institute of Technology)*; Carmel Domshlak (Technion - Israel Institute of Technology); Avigdor Gal (Technion -- Israel Institute of Technology); Haggai Roitman (IBM Research Haifa)
- VEGA: An Active-tuning Learned Index with Group-Wise Learning Granularity
Meng Li (Nanjing University)*; Huayi Chai (Nanjing University); Siqiang Luo (Nanyang Technological University); Haipeng Dai (Nanjing University); Rong Gu (Nanjing University); Jiaqi Zheng (Nanjing University); Guihai Chen (Nanjing University)
- AquaPipe: A Quality-Aware Pipeline for Knowledge Retrieval and Large Language Models
runjie yu (Huazhong University of Science and Technology); Weizhou Huang (Huazhong University of Science and Technology); shuhan bai (Huazhong University of Science and Technology); Jian Zhou (Huazhong University of Science and Technology)*; Fei Wu (Huazhong University of Science and Technology)
- TGraph: A Tensor-centric Graph Processing Framework
YongLiang Zhang (Wuhan University); Yuanyuan Zhu (Wuhan University)*; Hao Zhang (Huawei); Congli Gao (Huawei Technologies CO LTD); yuyang wang (Wuhan University); Guojing Li (Wuhan University); Tianyang Xu (Wuhan University); Ming Zhong (Wuhan University); Jiawei Jiang (Wuhan University); Tieyun Qian (Wuhan University); Chenyi Zhang (Huawei Technologies); Jeffrey Xu Yu (Chinese University of Hong Kong)
- Efficiently Counting Triangles in Large Temporal Graphs
Yuyang Xia (The Chinese University of Hong Kong, Shenzhen); Yixiang Fang (School of Data Science, The Chinese University of Hong Kong, Shenzhen)*; Wensheng Luo (School of Data Science, The Chinese University of Hong Kong, Shenzhen)
- Multi-Level Graph Representation Learning Through Predictive Community-based Partitioning
Bo-Young Lim (Seoul National University of Science and Technology); Jeong-Ha Park (Seoul National University of Science and Technology); Kisung Lee (Louisiana State University); Hyuk-Yoon Kwon (Seoul National University of Science and Technology)*
- Efficient Maximum s-Bundle Search via Local Vertex Connectivity
Yang Liu (Harbin Institute of Technology, Shenzhen); Hejiao Huang (Harbin Institute of Technology, Shenzhen); Kaiqiang Yu (Nanyang Technological University); Shengxin Liu (Harbin Institute of Technology, Shenzhen)*; Cheng Long (Nanyang Technological University)
- Automatic Database Configuration Debugging using Retrieval-Augmented Language Models
Sibei Chen (Renmin University of China); Ju Fan (Renmin University of China)*; Bin Wu (Alibaba Group); Nan Tang (HKUST (GZ)); Chao Deng (Renmin University of China); Pengyi PYW Wang (Renmin University of China); Ye Li (Alibaba); Jian Tan (Alibaba); Feifei Li (Alibaba Group); Jingren Zhou (Alibaba Group); Xiaoyong Du (Renmin University of China)
- A Local Search Approach to Efficient (k,p)-Core Maintenance
Chenghan Zhang (Wuhan University); Yuanyuan Zhu (Wuhan University)*; Lijun Chang (The University of Sydney)
- B$\circledS X$ : Subgraph Matching with Batch Backtracking Search
Yujie Lu (Fudan University); Zhijie Zhang (Fudan University); Weiguo Zheng (Fudan University)*
- DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph
Ziqi Yin (Nanyang Technological University)*; Jianyang Gao (Nanyang Technological University); Pasquale Balsebre (Nanyang Technological University); Gao Cong (Nanyang Technological Univesity); Cheng Long (Nanyang Technological University)
- Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs
Meihao Liao (Beijing Institute of Technology); Cheng Li (Beijing Institute of Technology); Ronghua Li (Beijing Institute of Technology)*; Guoren Wang (Beijing Institute of Technology)
- Schema-Based Query Optimisation for Graph Databases
Chandan Sharma (INRIA)*; Pierre Genevès (CNRS); Nils Gesbert (Grenoble INP); Nabil Layaïda (Inria)
- SymphonyQG: towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search
Yutong Gou (Nanyang Technological University); Jianyang Gao (Nanyang Technological University)*; Yuexuan Xu (Nanyang Technological University); Cheng Long (Nanyang Technological University)
- Density Decomposition of Bipartite Graphs
Yalong Zhang (Beijing Institute of Technology); Ronghua Li (Beijing Institute of Technology)*; Qi Zhang (Beijing Institute of Technology); Hongchao Qin (Beijing Institute of Technology); Lu Qin (UTS); Guoren Wang (Beijing Institute of Technology)
- An Elephant Under the Microscope: Analyzing the Interaction of Optimizer Components in PostgreSQL
Rico Bergmann (Technische Universität Dresden)*; Claudio Hartmann (Technische Universität Dresden); Dirk Habich (TU Dresden); Wolfgang Lehner (TU Dresden)
- MEMO: Fine-grained Tensor Management For Ultra-long Context LLM Training
Pinxue Zhao (Peking University)*; Hailin Zhang (Peking University); Fangcheng Fu (Peking University); Xiaonan Nie (Peking University); Qibin Liu (Tencent.com); FANG YANG (Tencent); yuanbo peng (tencent.com); Dian Jiao (Tencent); Shuaipeng Li (Tencent); Jinbao Xue (Tencent); Yangyu Tao (Tencent); Bin Cui (Peking University)
- SPAS: Continuous Release of Data Streams under w-Event Differential Privacy
Xiaochen Li (Zhejiang University)*; Tianyu Li (National University of Singapore); Yitian Cheng (Xi'an Jiaotong University); Chen Gong (University of Virginia); Kui Ren (Zhejiang University); Zhan Qin (Zhejiang University); Tianhao Wang (University of Virginia)
- Aster: Enhancing LSM-structures for Scalable Graph Database
Dingheng Mo (Nanyang Technological University); Junfeng Liu (Nanyang Technological University); FAN WANG (Nanyang Technological University); Siqiang Luo (Nanyang Technological University)*
- An experimental comparison of tree-data structures for connectivity queries on fully-dynamic undirected graphs
Qing Chen (University of Zürich)*; Michael H Böhlen (University of Zurich); Sven Helmer (University of Zurich)
- CRDV: Conflict-free Replicated Data Views
Nuno Faria (INESCTEC & U. Minho)*; José Pereira (U. Minho & INESCTEC)
- Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art
Ilias Azizi (Mohammed VI Polytechnic University)*; Karima Echihabi (Mohammed VI Polytechnic University); Themis Palpanas (Université Paris Cité)
- Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search
Jiuqi Wei (Institute of Computing Technology, Chinese Academy of Sciences)*; Xiaodong Lee (ICT); Zhenyu Liao (Huazhong University of Science and Technology); Themis Palpanas (Université Paris Cité); Botao Peng (Institute of Computing Technology, Chinese Academy of Sciences)
- Ultraverse: A System-Centric Framework for Efficient What-If Analysis for Database-Intensive Web Applications
Ronny Ko (Ohio State University and Osaka University)*; Chuan Xiao (Osaka University, Nagoya University); Makoto Onizuka (Osaka University); Zhiqiang Lin (The Ohio State University); Yihe Huang (Databricks)
- Deep Overlapping Community Search via Subspace Embedding
Qing Sima (University of New South Wales); Jianke Yu (University of Technology Sydney); Xiaoyang Wang (University of New South Wales)*; Wenjie Zhang (University of New South Wales); Ying Zhang (University of Technology Sydney); Xuemin Lin (Shanghai Jiaotong University)
- DataVinci: Learning Syntactic and Semantic String Repairs
Mukul Singh (Microsoft)*; José P Cambronero Sanchez (Microsoft); Sumit Gulwani (Microsoft Research); Vu Le (Microsoft); Carina Negreanu (Robin AI); Arjun Radhakrishna (Microsoft); Gust Verbruggen (Microsoft)
- Optimizing Block Skipping for High-Dimensional Data with Learned Adaptive Curve
Xu Chen (University of Electronic Science and Technology of China)*; Shuncheng Liu (University of Electronic Science and Technology of China); Tong Yuan (Huawei Technologies Co., Ltd.); tao ye (huawei); Kai Zeng (Huawei Technologies Co. Ltd.); Han Su (University of Electronic Science and Technology of China); Kai Zheng (University of Electronic Science and Technology of China)
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)
