AB
1
Paper TitleAuthors
2
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trend, Unbiasedness, and Interaction

Zhijie Zhang (Fudan University); Yujie Lu (Fudan University); Weiguo Zheng (Fudan University)*; Xuemin Lin (Shanghai Jiaotong University)
3
A Counting-based Approach for Efficient 𝑘-Clique Densest Subgraph Discovery

Yingli Zhou (The Chinese University of Hong Kong, Shenzhen)*; Qingshuo Guo (The Chinese University of Hong Kong, Shenzhen); Yixiang Fang (The Chinese University of Hong Kong, Shenzhen); Chenhao Ma (The Chinese University of Hong Kong, Shenzhen)
4
A Learned Cuckoo Filter for Approximate Membership Queries over Variable-sized Sliding Windows on Data Streams

Yao Tian (The Hong Kong University of Science and Technology)*; yan tingyun (GuangZhou University); Ruiyuan Zhang (The Hong Kong university of Science and Technology); Kai Huang ( Macau University of Science and Technology); Bolong Zheng (Huazhong University of Science and Technology); Xiaofang Zhou (The Hong Kong University of Science and Technology)
5
A Unified Approach for Resilience and Causal Responsibility with Integer Linear Programming (ILP) and LP Relaxations

Neha Makhija (Northeastern University)*; Wolfgang Gatterbauer (Northeastern University)
6
ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data

Liana Patel (Stanford University)*; Matei Zaharia (Berkeley and Databricks); Peter Kraft (DBOS, Inc.); Carlos Guestrin (Stanford University)
7
ADGNN: Towards Scalable GNN Training with Aggregation-Difference Aware Sampling

Zhen Song (Northeastern University)*; Yu Gu (Northeastern University); Tianyi Li (Aalborg University); Qing Sun (Northeastern University); Yanfeng Zhang (Northeastern University); Christian S. Jensen (Aalborg University); Ge Yu (Northeastern University)
8
AirIndex: Versatile Index Tuning Through Data and Storage

Supawit Chockchowwat (University of Illinois at Urbana-Champaign)*; Wenjie Liu (University of Illinois at Urbana-Champaign); Yongjoo Park (University of Illinois at Urbana-Champaign)
9
Akane: Perplexity-Guided Time Series Data Cleaning

Xiaoyu Han (Fudan University)*; Haoran Xiong (Fudan University); Zhenying He (Fudan University); Peng Wang (" Fudan University, China"); Chen Wang (" Tsinghua University, China"); X. Sean Wang (Fudan University)
10
ALP: Adaptive Lossless floating-Point Compression

Azim Afroozeh (CWI)*; Leonardo X Kuffo (CWI); Peter Boncz (Centrum Wiskunde & Informatica)
11
An LDP Compatible Sketch for Securely Approximating Set Intersection Cardinalities

Pinghui Wang (Xi'an Jiaotong University)*; Yitong Liu (Xi’an Jiaotong University); Zhicheng Li (Xi'an Jiaotong University); Rundong Li (Xi'an Jiaotong University)
12
Anchor: A Library for Building Secure Persistent Memory Systems

Dimitrios Stavrakakis (TU Munich & University of Edinburgh)*; Dimitra Giantsidi (University of Edinburgh); Maurice Bailleu (The University of Edinburgh); Philip Sändig (Technical University of Munich); Shady Issa (TUM); Pramod Bhatotia (TU Munich)
13
Approximate Sketches

Brian Tsan (UC Merced)*; Asoke Datta (University of California, Merced); Yesdaulet Izenov (University of California, Merced); Florin Rusu (UC Merced)
14
AS-Parser: Log Parsing Based on Adaptive Segmentation

Chen XiaoLei (Fudan University); Peng Wang (" Fudan University, China")*; Jia Chen (Fudan University); Wei Wang (" Fudan University, China")
15
ASM: Harmonizing Autoregressive model, Sampling, and Multi-dimensional Statistics Merging for Cardinality Estimation

Kyoungmin Kim (POSTECH); Sangoh Lee (POSTECH); Injung Kim (Handong Global University); Wook-Shin Han (POSTECH)*
16
Auto-Formula: Recommend Formulas in Spreadsheets using Learned Table Representations

Sibei Chen (Renmin University of China); Yeye He (Microsoft Research)*; Weiwei Cui (Microsoft Research Asia); Ju Fan (Renmin University of China); Song Ge (Microsoft Reseach Asia); Haidong Zhang (Microsoft Research Asia); Dongmei Zhang (Microsoft Research Asia); Surajit Chaudhuri (Microsoft)
17
Automated Data Visualization from Natural Language via Large Language Models: An Exploratory Study

Yang Wu (Huazhong University of Science and Technology)*; Yao Wan (Huazhong University of Science and Technology); Hongyu Zhang (University of Newcastle); Yulei Sui (UNSW Sydney); wucai wei (华中科技大学); Wei Zhao (huazhong university); Guandong Xu (University of Technology Sydney, Australia); Hai Jin (Huazhong University of Science and Technology)
18
Banzhaf Values for Facts in Query Answering

Omer Abramovich (Tel Aviv University); Daniel Deutch (Tel Aviv University)*; Nave Frost (eBay); Ahmet Kara (University of Zurich); Dan Olteanu (University of Zurich)
19
CaaS-LSM: Compaction-as-a-Service for LSM-based Key-Value Stores in Storage Disaggregated Infrastructure

Qiaolin Yu (Cornell University)*; Chang Guo (Arizona State University); Jay Zhuang (Independent Researcher); Viraj Thakkar (Arizona State University); Jianguo Wang (Purdue University); Zhichao Cao (Arizona State University)
20
Cabin: a Compressed Adaptive Binned Scan Index

Yiyuan Chen (University of Chinese Academy of Sciences); Shimin Chen (Chinese Academy of Sciences)*
21
Cackle: Analytical Workload Cost and Performance Stability With Elastic Pools

Matthew J Perron (MIT CSAIL)*; Michael Cafarella (MIT CSAIL); Raul Castro Fernandez (The University of Chicago); David DeWitt (MIT); Samuel Madden (MIT)
22
CAFE: Towards Compact, Adaptive, and Fast Embedding for Large-scale Recommendation Models

Hailin Zhang (Peking University)*; Zirui Liu (Peking University); Boxuan Chen (Peking University); Yikai Zhao (Peking University); Tong Zhao (Peking University); Tong Yang (Peking University); Bin Cui (Peking University)
23
Can Learned Indexes be Build Efficient? A Deep Dive into Sampling Trade-Offs

Minguk Choi (Dankook University); Seehwan Yoo (Dankook University); Jongmoo Choi (Dankook University)*
24
Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks

Tim Schwabe (Ruhr University Bochum)*; Maribel Acosta (Technische Universität München)
25
CAVE: Concurrency-Aware Graph Processing on SSDs

Tarikul Islam Papon (Boston University)*; Taishan Chen (Boston University); Shuo Zhang (Columbia University); Manos Athanassoulis (Boston University)
26
Certain Models for Statistical Learning

Cheng Zhen (Oregon State University)*; Arash Termehchy (Oregon State University); Nischal Aryal (Oregon State University); Amandeep Singh Chabada (Oregon State University)
27
ChainedFilter: Combining Membership Filters by Chain Rule

Haoyu Li (The University of Texas at Austin)*; Liuhui Wang (Peking University); Qizhi Chen (Peking University); Jianan Ji (Peking University); Yuhan Wu (Peking University); Yikai Zhao (Peking University); Tong Yang (Peking University); Aditya Akella (UT Austin)
28
ChainKV: A Semantics-Aware Key-Value Store for Ethereum System

Zehao Chen (Shandong University)*; Bingzhe Li (University of Texas at Dallas); Xiaojun Cai (Shandong University); Zhiping Jia (Shandong University); Lei Ju (Shandong University); Zili Shao (The Chinese University of Hong Kong); Zhaoyan Shen (Shandong University)
29
Closest Pairs Search Over Data Stream

Rui Zhu (Shenyang Aerospace University)*; Bin Wang (Northeastern University); Xiaochun Yang (Northeastern University); Baihua Zheng (Singapore Management University)
30
CodeS: Towards Building Open-source Language Models for Text-to-SQL

Haoyang Li (Renmin University of China)*; Jing Zhang (Renmin University of China); Hanbing Liu (Renmin University of China); Ju Fan (Renmin University of China); Xiaokang Zhang (Renmin University of China); jun zhu (BEIJING AI-FINANCE TECHNOLOGIES CO. LTD); Renjie Wei (BEIJING AI-FINANCE TECHNOLOGIES CO. LTD); Hongyan Pan (BEIJING AI-FINANCE TECHNOLOGIES CO. LTD); Cuiping Li (Renmin University of China); Hong Chen (" Renmin University, China")
31
Continual Observation of Joins under Differential Privacy

Wei Dong (CMU)*; Zijun CHEN (HKUST); Qiyao Luo (Hong Kong University of Science and Technology); Elaine Shi (CMU); Ke Yi (Hong Kong Univ. of Science and Technology)
32
Controllable Tabular Data Synthesis Using Diffusion Models

Tongyu Liu (Renmin University of China); Ju Fan (Renmin University of China)*; Nan Tang (HKUST (GZ)); Guoliang Li (Tsinghua University); Xiaoyong Du (Renmin University of China)
33
Convolution and Cross-Correlation of Count Sketches Enables Fast Cardinality Estimation of Multi-Join Queries

Mike Heddes (University of California, Irvine)*; Igor Nunes (University of California, Irvine); Tony Givargis (University of California, Irvine); Alex Nicolau (UC Irvine)
34
Correlation Joins over Time Series Data Streams Utilizing Complementary Dimension Reduction and Transformation

AmirReza Alizade Nikoo (University of Zürich)*; Sven Helmer (University of Zurich); Michael H Böhlen (University of Zurich)
35
Counterfactual Explanation at Will, with Zero Privacy Leakage

Shuai An (University of Edinburgh); Yang Cao (University of Edinburgh)*
36
Data Acquisition for Improving Model Confidence

Yifan Li (York University)*; Xiaohui Yu (York University); Nick Koudas (University of Toronto)
37
DecoPa: Query Decomposition for Parallel Complex Event Processing

Samira Akili (HU Berlin )*; Steven Purtzel (Humboldt-Universität zu Berlin); Matthias Weidlich (Humboldt-Universität zu Berlin)
38
Demystifying the QoS and QoE of Edge-hosted Video Streaming Applications in the Wild with SNESet (Data-intensive Applications (DIA) Special Track)

Yanan Li (State Key Laboratory of Networking and Switching Technology)*; Guangqing Deng (Alibaba Cloud); Changming Bai (Alibaba Cloud); Jingyu Yang (Alibaba Cloud); Gang Wang (Alibaba Cloud); Hao Zhang (Alibaba Cloud); Jin Bai (Alibaba Cloud); Haitao Yuan (Nanyang Technological University); Mengwei Xu (State Key Laboratory of Networking and Switching Technology); Shangguang Wang (State Key Laboratory of Networking and Switching Technology)
39
Determining Exact Quantiles with Randomized Summaries

Ziling Chen (Tsinghua University); Haoquan Guan (Tsinghua University); Shaoxu Song (Tsinghua University)*; Xiangdong Huang (Tsinghua University); Chen Wang (Timecho Limited); Jianmin Wang ("Tsinghua University, China")
40
Determining the Largest Overlap between Tables

Luca Zecchini (Università degli Studi di Modena e Reggio Emilia)*; Tobias Bleifuß (Hasso Plattner Institute); Giovanni Simonini (University of Modena and Reggio Emilia); Sonia Bergamaschi (Università di Modena e Reggio Emilia); Felix Naumann (Hasso Plattner Institute, University of Potsdam)
41
DGC: Training Dynamic Graphs with Spatio-Temporal Non-Uniformity using Graph Partitioning by Chunks

Fahao Chen (The University of Aizu); Peng Li (the University of Aizu)*; Celimuge Wu (The University of Electro-Communications)
42
Dias: Dynamic Rewriting of Pandas Code (Data Management for Data Science (DMDS) Special Track)

Stefanos Baziotis (University of Illinois at Urbana-Champaign)*; Daniel Kang (UIUC); Charith Mendis (University of Illinois at Urbana-Champaign)
43
Discovering Functional Dependencies through Hitting Set Enumeration

Tobias Bleifuß (Hasso Plattner Institute)*; Thorsten Papenbrock (Philipps University of Marburg); Thomas Bläsius (Karlsruhe Institute of Technology); Martin Schirneck (Hasso Plattner Institute); Felix Naumann (Hasso Plattner Institute, University of Potsdam)
44
DP-starJ: A Differential Private Scheme towards Analytical Star-Join Queries

Congcong Fu (Xidian University); Hui Li (Xidian University)*; Jian Lou (Zhejiang University); Huizhen Li (Xidian University); Jiangtao Cui (Xidian University)
45
DProvDB: Differentially Private Query Processing with Multi-Analyst Provenance

Shufan Zhang (University of Waterloo)*; Xi He (University of Waterloo)
46
DSC: Optimizing Dynamic Shape Machine Learning Workloads via Compiler Approach

Zhen Zheng (Alibaba Group)*; Zaifeng Pan (Renmin University of China); Dalin Wang (Renmin University of China); Kai Zhu (Alibaba Inc.); Wenyi Zhao (Alibaba Group.); tianyou guo (Alibaba Inc); Xiafei Qiu (Alibaba Group); minmin sun (Alibaba); Junjie Bai (Alibaba Group); Feng Zhang (Renmin University of China); Xiaoyong Du (Renmin University of China); Jidong Zhai (Tsinghua University); Wei Lin (Alibaba Group)
47
DTT: An Example-Driven Tabular Transformer for Joinability by Leveraging Large Language Models

Arash Dargahi Nobari (University of Alberta)*; Davood Rafiei (University of Alberta)
48
Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach

Qintian Guo (The Chinese University of Hong Kong ); Chen Feng (The Chinese University of Hong Kong); Fangyuan ZHANG (The Chinese University of Hong Kong); Sibo Wang (The Chinese University of Hong Kong)*
49
Efficient Algorithm for K-Multiple-Means

Yasuhiro Fujiwara (NTT Communication Science Laboratories)*; Atsutoshi Kumagai (NTT Computer and Data Science Laboratories); Yasutoshi Ida (NTT); Masahiro Nakano (NTT communication science laboratories); Makoto Nakatsuji (NTT); Akisato Kimura (NTT Corporation)
50
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach

Meihao Liao (Beijing Institute of Technology); Zhou Junjie (Beijing Institude of technology); Ronghua Li (Beijing Institute of Technology)*; Qiangqiang Dai (Beijing Institute of Technology); Hongyang Chen (Zhejiang Lab); Guoren Wang (Beijing Institute of Technology)
51
Efficient Approximation Framework for Attribute Recommendation

Xingguang Chen (The Chinese University of Hong Kong); Fangyuan ZHANG (The Chinese University of Hong Kong); Jinchao Huang (The Chinese University of Hong Kong); Sibo Wang (The Chinese University of Hong Kong)*
52
Efficient Approximation of Kemeny's Constant for Large Graphs

Haisong Xia (Fudan University)*; Zhongzhi Zhang (Fudan University)
53
Efficient Core Maintenance in Large Bipartite Graphs

Wensheng Luo (School of Data Science, The Chinese University of Hong Kong, Shenzhen)*; Qiaoyuan Yang (CUHK-Shenzhen); Yixiang Fang (The Chinese University of Hong Kong, Shenzhen); Xu Zhou (Hunan university)
54
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs

yuanyuan zeng (Chinese University of Hong Kong, Shenzhen)*; Yixiang Fang (The Chinese University of Hong Kong, Shenzhen); Chenhao Ma (The Chinese University of Hong Kong, Shenzhen); Xu Zhou (Hunan university); Kenli Li (Hunan University)
55
Efficient High-Quality Clustering for Large Bipartite Graphs

Renchi Yang (Hong Kong Baptist University)*; Jieming Shi (The Hong Kong Polytechnic University)
56
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy

Kaixin Wang (Nanyang Technological University); Kaiqiang Yu (Nanyang Technological University); Cheng Long (Nanyang Technological University)*
57
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee

Qiangqiang Dai (Beijing Institute of Technology); Ronghua Li (Beijing Institute of Technology)*; Donghang Cui (Beijing Institute of Technology); Meihao Liao (Beijing Institute of Technology); Yu-Xuan Qiu (Shenzhen University); Guoren Wang (Beijing Institute of Technology)
58
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity

Lijun Chang (The University of Sydney)*
59
Enriching Recommendation Models with Logic Conditions

Lihang Fan (Beihang University); Wenfei Fan (Univ. of Edinburgh ); Ping Lu (Beihang Univ.); Chao Tian (Beihang University)*; Qiang Yin (Shanghai Jiao Tong University)
60
Equitable Top-k Results for Long Tail Data

Md Mouinul Islam (New Jersey Institute of Technology ); Mahsa Asadi (New Jersey Institute of Technology); Senjuti Basu Roy (NJIT)*
61
F3KM: Federated, Fair, and Fast k-means

Shengkun Zhu (Wuhan University)*; Quanqing Xu (OceanBase); Jinshan ZENG (Jiangxi Normal University); Sheng Wang (Wuhan University); Yuan Sun (La Trobe University); Zhifeng Yang (OceanBase); Chuanhui Yang (OceanBase); Zhiyong Peng (" Wuhan University, China")
62
FACET: Robust Counterfactual Explanation Analytics

Peter M VanNostrand (WPI)*; Huayi Zhang (WPI); Dennis M Hofmann (Worcester Polytechnic Institute); Elke A Rundensteiner (Worcester Polytechnic Institute)
63
FairHash: A Fair and Memory/Time-efficient Hashmap

Nima Shahbazi (University of Illinois at Chicago)*; Stavros Sintos (University of Illinois Chicago); Abolfazl Asudeh (University of Illinois Chicago)
64
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach

Kaiqiang Yu (Nanyang Technological University)*; Cheng Long (Nanyang Technological University)
65
Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games

Xuan Luo (Simon Fraser University)*; Jian Pei (Simon Fraser University); Cheng Xu (Hong Kong Baptist University); Wenjie Zhang (University of New South Wales); Jianliang Xu (Hong Kong Baptist University)
66
Faster Algorithms for Fair Max-Min Diversification in R^d

Yash Kurkure (University of Illinois Chicago); Miles Shamo (University of Illinois at Chicago); Joseph Wiseman (UIC); Sainyam Galhotra (Cornell University); Stavros Sintos (University of Illinois Chicago)*
67
Fault Tolerance Placement for the Internet of Things

Anastasiia Kozar (TU Berlin)*; Bonaventura Del Monte (Observe Inc.); Steffen Zeuch (TU Berlin); Volker Markl (Technische Universität Berlin)
68
FeatureLTE: Learning to Estimate Feature Importance

Tianping Zhang (Tsinghua University); Zhaoyang Wang (Ant Group); Chen Qian (Ant Group); Jian Li (" Tsinghua University, China"); Yin Lou (Ant Group)*
69
FedCSS: Joint Client-and-Sample Selection for Hard Sample-Aware Noise-Robust Federated Learning

Anran Li (Nanyang Technological University)*; Yue Cao (Nanyang Technological University); Jiabao Guo (Wuhan University); Hongyi Peng (Nanyang Technological University ); Qing Guo (A*STAR); Han Yu (Nanyang Technological University (NTU))
70
FedKNN: Secure Federated k-Nearest Neighbor Search

Xinyi Zhang (Hong Kong Baptist University); Qichen Wang (Hong Kong Baptist University); Cheng Xu (Hong Kong Baptist University); Yun PENG (Guangzhou University); Jianliang Xu (Hong Kong Baptist University)*
71
FineMon: An Innovative Adaptive Network Telemetry Scheme for Fine-Grained, Multi-Metric Data Monitoring with Dynamic Frequency Adjustment and Enhanced Data Recovery

Haojie Ji (Hunan university)*; Kun Xie (hunan university); Jigang Wen (Hunan University of Science and Technology); Qingyi Zhang (Huawei Technologies); Gaogang Xie (Institute of Computing Technology, Chinese Academy of Sciences); Wei Liang (Hunan University of science and technology)
72
GE^2: A General and Efficient Graph Embedding Learning System

Chenguang Zheng (CUHK)*; Guanxian Jiang (CUHK); Xiao Yan (Southern University of Science and Technology); Peiqi Yin (The Chinese University of Hong Kong); qihui zhou (CUHK); James Cheng (CUHK)
73
Generation of Training Examples for Tabular Natural Language Inference

Jean-Flavien Bussotti (Eurecom); Enzo Veltri (Università della Basilicata); Donatello Santoro (Università della Basilicata); Paolo Papotti (EURECOM)*
74
GEqO: ML-Accelerated Semantic Equivalence Detection

Rana Alotaibi (Microsoft Gray Systems Lab); Brandon Haynes (Microsoft Gray Systems Lab)*; Yuanyuan Tian (Microsoft Gray Systems Lab); Anna Pavlenko (Microsoft Gray Systems Lab); Jyoti Leeka (Microsoft); Alekh Jindal (SmartApps)
75
Grafite: Taming Adversarial Queries with Optimal Range Filters

Marco Costa (University of Pisa); Paolo Ferragina (Università di Pisa); Giorgio Vinciguerra (Università di Pisa)*
76
Graph Summarization: Compactness Meets Efficiency

Deming Chu (University of New South Wales); Fan Zhang (Guangzhou University)*; Wenjie Zhang (University of New South Wales); Ying Zhang (University of Technology Sydney); Xuemin Lin (University of New South Wales)
77
GRF: A Global Range Filter for LSM-Trees with Shape Encoding

Hengrui Wang (Tsinghua University)*; Te Guo (Purdue University); Junzhao Yang (Tsinghua University); Huanchen Zhang (Tsinghua University)
78
gSWORD: GPU-accelerated Sampling for Subgraph Counting

chang ye (SMU)*; Yuchen Li (Singapore Management University); Shixuan Sun (Shanghai Jiao Tong University); Wentian Guo (Meta Inc.)
79
GTS: GPU-based Tree Index for Fast Similarity Search

Yifan Zhu (Zhejiang University); Ruiyao Ma (Zhejiang University); Baihua Zheng (Singapore Management University); Xiangyu Ke (Zhejiang University, China); Lu Chen (Zhejiang University); Yunjun Gao (Zhejiang University)*
80
HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs

Boyu Yang (Fudan University ); Weiguo Zheng (Fudan University)*; Xiang Lian (Kent State University); Yuzheng Cai (Fudan University); X. Sean Wang (Fudan University)
81
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks

Muhammad Farhan (Australian National University)*; Henning Koehler (Massey University); Robert Ohms (Australian National University); Qing Wang (ANU)
82
High Precision ≠ High Cost: Temporal Data Fusion for Multiple Low-Precision Sensors

jingyu zhu (Nankai university); Yu Sun (Nankai University)*; Shaoxu Song (Tsinghua University); Xiaojie Yuan (Nankai Univeristy)
83
High-performance Effective Scientific Error-bounded Lossy Compression with Auto-tuned Multi-component Interpolation

Jinyang Liu (University of California, Riverside); Sheng Di (Argonne National Laboratory, Lemont, IL)*; Kai Zhao (Florida State University); Xin Liang (University of Kentucky); Sian Jin (Indiana University); Zizhe Jian (University of California Riverside); Jiajun Huang (UCR); Shixun Wu (University of California Riverside); zizhong chen (UC Riverside); Franck Cappello (Argonne National Laboratory, Lemont, IL)
84
High-Ratio Compression for Machine-Generated Data

Jiujing Zhang (Guangzhou University); Zhitao Shen (Ant Group); Shiyu Yang (Guangzhou University)*; Lingkai Meng (Shanghai Jiao Tong University); Chuan Xiao (Osaka University, Nagoya University); wei jia (antgroup); Yue Li (Ant Group); Qinhui Sun (Ant Group); Wenjie Zhang (University of New South Wales); Xuemin Lin (Shanghai Jiaotong University)
85
Historical Embedding-Guided Efficient Large-Scale Federated Graph Learning

Anran Li (Nanyang Technological University)*; Yuanyuan Chen (Nanyang Technological University); Mingfei Cheng (Singapore Management University); Yihao Huang (Nanyang Technological University); Jian Zhang (Nanyang Technological University); Yueming Wu (Nanyang Technological University); Anh Tuan Luu (Nanyang Technological University); Han Yu (Nanyang Technological University (NTU))
86
Homomorphic Compression: Making Text Processing on Compression Unlimited

JiaWei Guan (Renmin University of China)*; Feng Zhang (Renmin University of China); Siqi Ma (University of New South Wales); kuangyu chen (renmin univers.); Yihua Hu (Renmin University of China); Yuxing Chen (Tencent); Anqun Pan (Tencent Inc., China); Xiaoyong Du (Renmin University of China)
87
HongTu: Scalable Full-Graph GNN Training on Multiple GPUs

Qiange Wang (National University of Singapore)*; Yao Chen (National University of Singapore); Weng-Fai Wong (National University of Singapore); Bingsheng He (National University of Singapore)
88
Hyper: A High-Performance and Memory-Efficient Learned Index Via Hybrid Construction

Shunkang Zhang (HKUST); Ji Qi (Institute of Software, Chinese Academy of Sciences); Xin YAO (Huawei Theory Lab); André Brinkmann (Johannes Gutenberg University Mainz)*
89
Implementation Strategies for Views over Property Graphs

Soonbo Han (University of Pennsylvania)*; Zack Ives (University of Pennsylvania)
90
In-Database Data Imputation

Massimo Perini (The University of Edinburgh); Milos Nikolic (University of Edinburgh)*
91
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework

Yukyoung Lee (POSTECH); Kyoungmin Kim (POSTECH); Wonseok Lee (POSTECH); Wook-Shin Han (POSTECH)*
92
Keep It Simple: Testing Databases via Differential Query Plans

Jinsheng Ba (National University of Singapore)*; Manuel Rigger (National University of Singapore)
93
Language-Model Based Informed Partition of Databases to Speed Up Pattern Mining

Carlos Bobed Lisbona (University of Zaragoza); Jordi Bernad (University of Zaragoza)*; Pierre Maillot (INRIA)
94
Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads

Dingheng Mo (Nanyang Technological University); Fanchao Chen (Fudan University); Siqiang Luo (Nanyang Technological University)*; Caihua Shan (microsoft)
95
Learning-based Property Estimation with Polynomials

Jiajun Li (Renmin University of China)*; Runlin Lei (Renmin University of China); Sibo Wang (The Chinese University of Hong Kong); Zhewei Wei (Renmin University of China); Bolin Ding ("Data Analytics and Intelligence Lab, Alibaba Group")
96
LeCo: Lightweight Compression via Learning Serial Correlations

Yihao Liu (Tsinghua University)*; Xinyu Zeng (Tsinghua University); Huanchen Zhang (Tsinghua University)
97
Lemo: A Cache-Enhanced Learned Optimizer for Concurrent Queries

Songsong Mo (Nanyang Technological University)*; Yile Chen (Nanyang Technological University); Hao Wang (Nanyang Technological University); Gao Cong (Nanyang Technological Univesity); Zhifeng Bao (RMIT University)
98
Lightweight Materialization for Fast Dashboards Over Joins

Zezhou Huang (Columbia University)*; Eugene Wu (Columbia University)
99
Limousine: Blending Learned and Classical Indexes to Self-Design Larger-than-Memory Cloud Storage Engines

Subarna Chatterjee (Harvard University, USA)*; Mark F Pekala (Harvard); Lev Kruglyak (Harvard University); Stratos Idreos (Harvard)
100
LIT: Lightning-fast In-memory Temporal Indexing

George Christodoulou (University of Ioannina); Panagiotis Bouros (Johannes Gutenberg University Mainz)*; Nikos Mamoulis (University of Ioannina)
101
Local Differentially Private Heavy Hitter Detection in Data Streams with Bounded Memory

Xiaochen Li (Zhejiang university)*; Weiran Liu (Alibaba Group); Jian Lou (Zhejiang University); Yuan Hong (University of Connecticut); Lei Zhang (Alibaba Group); Zhan Qin (Zhejiang University); Kui Ren (Zhejiang University)
102
Lorentz: Learned SKU Recommendation Using Metadata

Nicholas K Glaze (Microsoft); Irwin H McNeely (Microsoft); Yiwen Zhu (Microsoft)*; Matthew Gleeson (Microsoft); Helen Serr (Microsoft ); Rajeev S Bhopi (MICROSOFT ); Subru Krishnan (Microsoft)
103
Low-Latency Adaptive Distributed Stream Join System Based on a Flexible Join Model

Qihang Wang (Harbin Institute of Technology); Decheng Zuo (Harbin Institute of Technology); Zhan Zhang (Harbin Institute of Technology)*; Yanjun Shu (Harbin Institute of Technology); Xin Liu (Harbin Institute of Technology); Mingxuan He (Harbin Institute of Technology)
104
LPLM: A Neural Language Model for Cardinality Estimation of LIKE-Queries

Mehmet Aytimur (University of Konstanz)*; Silvan Reiner (University of Konstanz); Leonard Wörteler (Universität Konstanz); Theodoros Chondrogiannis (University of Konstanz); Michael Grossniklaus (University of Konstanz)
105
LST-Meter: Benchmarking Log-Structured Tables in the Cloud

Jesús Camacho-Rodríguez (Microsoft)*; Ashvin Agrawal (Microsoft - GSL); Anja Gruenheid (Microsoft); Ashit Gosalia (Microsoft); Cristian Petculescu (Microsoft); Josep Aguilar Saborit (Microsoft); Avrilia Floratou (Microsoft); Carlo Curino (Microsoft -- GSL); Raghu Ramakrishnan (Microsoft)
106
Machine Unlearning in Learned Databases: An Experimental Analysis

Meghdad Kurmanji (University of Warwick)*; Eleni Triantafillou (Google); Peter Triantafillou (University of Warwick)
107
Making In-Memory Learned Indexes Efficient on Disk

Jiaoyi Zhang (Tsinghua University)*; Kai Su (Tsinghua University); Huanchen Zhang (Tsinghua University)
108
Materialized View Selection & View-Based Query Planning for Regular Path Queries

Yue Pang (Peking University)*; Lei Zou (Peking University); Jeffrey Xu Yu (Chinese University of Hong Kong); Linglin Yang (Peking University)
109
Maximum k-Plex Computation: Theory and Practice

Lijun Chang (The University of Sydney)*; Kai Yao (The University of Sydney)
110
MCR-Tree: An Efficient Index for Multi-dimensional Core Search

Chengyang Luo (Zhejiang University); Yifan Zhu (Zhejiang University); Qing Liu (Zhejiang University); Yunjun Gao (Zhejiang University)*; Lu Chen (Zhejiang University); Jianliang Xu (Hong Kong Baptist University)
111
Memory-Efficient and Flexible Detection of Heavy Hitters in High-Speed Networks

He Huang (Soochow University); Jiakun Yu (Soochow University); Yang Du (Soochow University)*; Jia Liu (Nanjing University); Haipeng Dai (Nanjing University); Yu-E Sun (Soochow University)
112
MirrorKV: An Efficient Key-Value Store on Hybrid Cloud Storage with Balanced Performance of Compaction and Querying

Zhiqi Wang (The Chinese University of Hong Kong)*; Zili Shao (The Chinese University of Hong Kong)
113
Missing Data Imputation with Uncertainty-Driven Network

Jianwei Wang (University of New South Wales)*; Ying Zhang (University of Technology Sydney); Kai Wang (Shanghai Jiao Tong University); Xuemin Lin (Shanghai Jiaotong University); Wenjie Zhang (University of New South Wales)
114
Modeling Shifting Workloads for Learned Database Systems

Peizhi Wu (University of Pennsylvania)*; Zack Ives (University of Pennsylvania)
115
Modularity-based Hypergraph Clustering: Random Hypergraph Model, Hyperedge-cluster Relation, and Computation

Zijin Feng (The Chinese University of Hong Kong)*; Miao Qiao (The University of Auckland); Hong Cheng (Chinese University of Hong Kong)
116
MOST: Model-Based Compression with Outlier Storage for Time Series Data

Zehai Yang (Institute of Computing Technology, CAS & University of Chinese Academy of Sciences); Shimin Chen (Chinese Academy of Sciences)*
117
MWP: Multi-Window Parallel Evaluation of Regular Path Queries on Streaming Graphs

Siyuan Zhang (Fudan University)*; Zhenying He (Fudan University); Yinan Jing (Fudan University); Kai Zhang (Fudan University); X. Sean Wang (Fudan University)
118
Neural Attributed Community Search at Billion Scale

Jianwei Wang (University of New South Wales)*; Kai Wang (Shanghai Jiao Tong University); Xuemin Lin (University of New South Wales); Wenjie Zhang (University of New South Wales); Ying Zhang (University of Technology Sydney)
119
Nexus: Correlation Discovery over Collections of Spatio-Temporal Tabular Data

Yue Gong (The University of Chicago)*; Sainyam Galhotra (Cornell University); Raul Castro Fernandez (The University of Chicago)
120
NOC-NOC: Towards Performance-optimal Distributed Transactions

Si Liu (ETH Zurich)*; Luca Multazzu (ETH Zurich); Hengfeng Wei (Nanjing University); David A Basin (ETH Zurich)
121
NOCAP: Near-Optimal Correlation-Aware Partitioning Joins

Zichen Zhu (Boston University)*; Xiao Hu (University of Waterloo); Manos Athanassoulis (Boston University)
122
Object-oriented Unified Encrypted Memory Management for Heterogeneous Memory Architectures

Mo Sha (Alibaba Group)*; Yifan Cai (University of Pennsylvania); Sheng Wang (Alibaba Group); Linh Thi Xuan Phan (University of Pennsylvania); Feifei Li (Alibaba Group); Kian-Lee Tan (National University of Singapore)
123
On Efficient Large Sparse Matrix Chain Multiplication

Chunxu Lin (The Chinese University of Hong Kong,Shenzhen)*; Wensheng Luo (School of Data Science, The Chinese University of Hong Kong, Shenzhen); Yixiang Fang (The Chinese University of Hong Kong, Shenzhen); Chenhao Ma (The Chinese University of Hong Kong, Shenzhen); Xilin Liu (Huawei); YUCHI MA (HUAWEI CLOUD)
124
On Querying Historical Connectivity in Temporal Graphs

Jingyi Song (University of New South Wales); Dong Wen (University of New South Wales)*; Lantian Xu (University of Technology Sydney); Lu Qin (UTS); Wenjie Zhang (University of New South Wales); Xuemin Lin (Shanghai Jiaotong University)
125
One seed, two birds: A unified learned structure for exact and approximate counting.

Yingze Li (Harbin Institude of Technology); Hongzhi Wang (Harbin Institute of Technology)*; Xianglong Liu (Harbin Institute of Technology)
126
Optimizing Dataflow Systems for Scalable Interactive Visualization

Junran Yang (University of Washington)*; Hyekang Kevin Joo (Carnegie Mellon University); Sai Yerramreddy (University of Maryland); Dominik Moritz (Carnegie Mellon University); Leilani Battle (University of Washington)
127
Optimizing Disjunctive Queries with Tagged Execution

Albert Kim (MIT)*; Samuel Madden (MIT)
128
Optimizing Distributed Protocols with Query Rewrites

David CY Chu (UC Berkeley)*; Rithvik Panchapakesan (UC Berkeley); Shadaj Laddad (UC Berkeley); Lucky E Katahanas (Sutter Hill Ventures); Chris Liu (University of California, Berkeley); Kaushik Shivakumar (University of California); Natacha Crooks (UC Berkeley); Joseph M Hellerstein (UC Berkeley); Heidi Howard (Microsoft)
129
Optimizing Nested Recursive Queries

Amir Shaikhha (University of Edinburgh)*; Dan Suciu (University of Washington); Maximilian Schleich (RelationalAI); Hung Ngo (RelationalAI)
130
Optimizing Time Series eries with Versions

RUI KANG (Tsinghua University); Shaoxu Song (Tsinghua University)*
131
OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes

Ge Shi (Simon Fraser University)*; Ziyi Yan (Simon Fraser University); Tianzheng Wang (Simon Fraser University)
132
Origin-Destination Travel Time Oracle for Map-based Services

Yan Lin (Beijing Jiaotong University); Huaiyu Wan (Beijing Jiaotong University); Jilin Hu (Aalborg University)*; Shengnan Guo (Beijing Jiaotong University); Bin Yang (Aalborg University); Youfang Lin (Beijing Jiaotong University); Christian S. Jensen (Aalborg University)
133
OTClean: Data Cleaning for Conditional Independence Violations using Optimal Transport

Babak Salimi (University of California at San Diego)*; Mostafa Milani (The University of Western Ontario); Alireza Pirhadi (The University of Western Ontario); Alexander Cloninger (University of California San Diego); Mohammad Hossein Moslemi (University of Western Ontario)
134
PACE: Poisoning Attacks on Learned Cardinality Estimation

Jintao Zhang (Tsinghua University); Guoliang Li (Tsinghua University)*; Chao Zhang (Tsinghua University); Chengliang Chai (Beijing Institute of Technology)
135
Parallel Algorithms for Hierarchical Nucleus Decomposition

Jessica Shi (MIT); Laxman Dhulipala (University of Maryland, College Park); Julian Shun (MIT)*
136
PECJ: Stream Window Join on Disorder Data Streams with Proactive Error Compensation

Xianzhi Zeng (Singapore University of Technology and Design); Shuhao Zhang (Nanyang Technological University)*; Hongbin HB Zhong (4paradigm); Hao Zhang (4Paradigm Inc.); mian lu (4Paradigm Inc.); zhao zheng (4Paradigm Inc.); Yuqiang Chen (4th Paradigm)
137
PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware

Shuangyu Cai (Tsinghua University); Boyu Tian (Tsinghua University); Huanchen Zhang (Tsinghua University); Mingyu Gao (Tsinghua University)*
138
PLAQUE: Automated Predicate Learning at Query Time

Yiming Lin (University of California, Berkeley)*; Sharad Mehrotra (U.C. Irvine)
139
PLATON: Top-down R-tree Packing with Learned Partition Policy

Jingyi Yang (Nanyang Technological University)*; Gao Cong (Nanyang Technological Univesity)
140
Play like a Vertex: A Stackelberg Game Approach for Streaming Graph Partitioning

Zezhong Ding (University of Science and Technology of China)*; Yongan Xiang (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)
141
Practical Dynamic Extension for Sampling Indexes

Douglas B Rumbaugh (Penn State University)*; Dong Xie (Penn State University)
142
Predictive and Near-Optimal Sampling for View Materialization in Video Databases

Yanchao Xu (Zhejiang University); Dongxiang Zhang (Zhejiang University)*; Shuhao Zhang (Nanyang Technological University); Sai Wu (Zhejiang University); Zexu Feng (Zhejiang University); Gang Chen (Zhejiang University)
143
PreLog: A Pre-trained Model for Log Analytics

Van-Hoang Le (The University of Newcastle)*; Hongyu Zhang (University of Newcastle)
144
PreVision: An Out-of-Core Matrix Computation System with Optimal Buffer Replacement

Kyoseung Koo (Seoul National University); Sohyun Kim (Seoul National University); Wonhyeon Kim (Seoul National University); Yoojin Choi (Seoul National University); Juhee Han (Seoul National Unviersity); Bogyeong Kim (Seoul National University); Bongki Moon (Seoul National University)*
145
Privacy Amplification by Sampling under User-level Differential Privacy

Juanru FANG (HKUST); Ke Yi (Hong Kong Univ. of Science and Technology)*
146
Proving Query Equivalence Using Linear Integer Arithmetic

Haoran Ding (Shanghai Jiao Tong University); zhaoguo wang (Shanghai Jiao Tong University)*; Yicun Yang (Shanghai Jiao Tong University); Dexin Zhang (Shanghai Jiao Tong University); Zhenglin Xu (Shanghai Jiao Tong University); Haibo Chen (Shanghai Jiao Tong University); Ruzica Piskac (Yale University); Jinyang Li (New York University)
147
Proximity Queries on Point Clouds using Rapid Construction Path Oracle

Yinzhao YAN (Hong Kong University of Science and Technology)*; Raymond Chi-Wing Wong (Hong Kong University of Science and Technology)
148
Qr-Hint: Actionable Hints Towards Correcting Wrong SQL Queries

Yihao Hu (Duke University)*; Amir Gilad (The Hebrew University); Kristin Stephens-Martinez (Duke University); Sudeepa Roy (Duke University, USA); Jun Yang (Duke University)
149
Query Compilation Without Regrets

Philipp M Grulich (Technische Universität Berlin)*; Aljoscha P Lepping (TU Berlin); Dwi P. A. Nugroho (Technische Universität Berlin); Varun Pandey (TU Berlin); Bonaventura Del Monte (Observe Inc.); Steffen Zeuch (TU Berlin); Volker Markl (Technische Universität Berlin)
150
Query Refinement for Diverse Top-k Selection

Felix S Campbell (Ben-Gurion University of the Negev)*; Alon Silberstein (Ben Gurion University); Yuval Moskovitch (Ben Gurion University); Julia Stoyanovich (New York University)
151
R2D2: Reducing Redundancy and Duplication in Data Lakes

Raunak Shah (Adobe Research); Koyel Mukherjee (Adobe Research)*; Atharv Tyagi (Adobe); Dhruv Joshi (Indian Institute of Technology Kharagpur); Subrata Mitra (Adobe Research); Shivam Pravin Bhosale (Indian Institute of Technology Kharagpur); Sai Keerthana Karnam (IIT Kharagpur)
152
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search

Jianyang Gao (Nanyang Technological University); Cheng Long (Nanyang Technological University)*
153
Range-Filtering Approximate Nearest Neighbor Search

Chaoji Zuo (Rutgers University - New Brunswick); Miao Qiao (The University of Auckland); Wenchao Zhou (Alibaba Group); Feifei Li (Alibaba Group); Dong Deng (Rutgers University - New Brunswick)*
154
Relational Algorithms for Top-k Query Evaluation

Qichen Wang (Hong Kong Baptist University)*; Qiyao Luo (Hong Kong University of Science and Technology); Yilei Wang (Alibaba Cloud)
155
Relative Keys: Putting Feature Explanation into Context

Shuai An (University of Edinburgh); Yang Cao (University of Edinburgh)*
156
Reservoir Sampling over Joins

Binyang DAI (Hong Kong University of Science and Technology)*; Xiao Hu (University of Waterloo); Ke Yi (Hong Kong Univ. of Science and Technology)
157
Rethink of a Learned Cost Model: Why Start from Scratch?

JIANI YANG (Zhejiang University); Sai Wu (Zhejiang University)*; Dongxiang Zhang (Zhejiang University); Jian Dai (Alibaba Group); Feifei Li (Alibaba Group); Gang Chen (Zhejiang University)
158
Rethink Query Optimization in HTAP Databases

Haoze Song (The University of Hong Kong )*; Wenchao Zhou (Alibaba Group); Feifei Li (Alibaba Group); Xiang Peng (Alibaba); Heming Cui (The University of Hong Kong)
159
Rethinking the Encoding of Integers for Scans on Skewed Data

Martin Prammer (University of Wisconsin - Madison)*; Jignesh Patel (Carnegie Mellon University)
160
Revisiting B-tree Compression: An Experimental Study

Chuqing Gao (Purdue University); Shreya Ballijepalli (Purdue University); Jianguo Wang (Purdue University)*
161
RITA: Group Attention is All You Need for Timeseries Analytics

Jiaming Liang (University of Pennslyvania); Lei Cao (University of Arizona/MIT)*; Samuel Madden (MIT); Zack Ives (University of Pennsylvania); Guoliang Li (Tsinghua University)
162
Robustness of Updatable Learning-based Index Advisors

Yihang Zheng (Xiamen University); Chen Lin (Xiamen University)*; xian Lyu (Xiamen University); Xuanhe Zhou (Tsinghua); Guoliang Li (Tsinghua University); Tianqing Wang (Huawei)
163
ROME: Robust Query Optimization via Parallel Multi-Plan Execution

Ziyun Wei (Cornell University)*; Immanuel Trummer (Cornell University)
164
SAGA: A Scalable Framework for Optimizing Data Cleaning Pipelines for Machine Learning Applications

Shafaq Siddiqi (Graz University of Technology)*; Roman Kern (Graz University of Technology); Matthias Boehm (Technische Universität Berlin)
165
SALI: A Scalable Adaptive Learned Index Framework based on Probability Models

Jiake Ge (Renmin University of China)*; Huanchen Zhang (Tsinghua University); Boyu Shi (RENMIN UNIVERSITY of CHINA); Yuanhui Luo (Renmin University of China); Yunda Guo (Renmin University of China); yunpeng chai (renmin university of china); Yuxing Chen (Tencent); Anqun Pan (Tencent Inc., China)
166
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks

Fangyuan ZHANG (The Chinese University of Hong Kong); Dechuang CHEN (The Chinese University of Hong Kong); Sibo Wang (The Chinese University of Hong Kong)*; Yin Yang (Hamad bin Khalifa University); Junhao Gan (University of Melbourne)
167
Scalable Distributed Inverted List Indexes in Disaggregated Memory

Manuel Widmoser (University of Salzburg)*; Daniel Kocher (University of Salzburg); Nikolaus Augsten (University of Salzburg)
168
SchemaPile: A Large Collection of Relational Database Schemas

Till Döhmen (University of Amsterdam)*; Radu Geacu (University of Amsterdam); Madelon Hulsebos (UC Berkeley); Sebastian Schelter (University of Amsterdam)
169
Secure Sampling for Approximate Multi-party Query Processing

Qiyao Luo (Hong Kong University of Science and Technology); Yilei Wang (Alibaba Cloud); Ke Yi (Hong Kong Univ. of Science and Technology)*; Sheng Wang (Alibaba Group); Feifei Li (Alibaba Group)
170
SeeSaw: Interactive Ad-hoc Search Over Image Databases

Oscar Moll (MIT CSAIL)*; Manuel A Favela (Massachusetts Institute of Technology); Vijay Gadepally (MIT Lincoln Laboratory); Michael Cafarella (MIT CSAIL); Samuel Madden (MIT)
171
Selectivity Estimation for Queries Containing Predicates over Set-Valued Attributes

Zizhong Meng (Nanyang Technological University)*; Xin Cao (University of New South Wales); Gao Cong (Nanyang Technological Univesity)
172
Settling Time vs. Accuracy Tradeoffs for Clustering Big Data

Andrew Draganov (Aarhus University)*; David Saulpic (ISTA); Chris Schwiegelshohn (Aarhus University)
173
SH2O: Efficient Data Access for Work-sharing Databases

Panagiotis Sioulas (EPFL)*; Ioannis Mytilinis (EPFL); Anastasia Ailamaki (EPFL)
174
Sibyl: Forecasting Time-Evolving Query Workloads

Hanxian Huang (UC San Diego)*; Tarique Siddiqui (Microsoft Research); Rana Alotaibi (Microsoft Gray Systems Lab); Carlo Curino (Microsoft -- GSL); Jyoti Leeka (Microsoft); Alekh Jindal (SmartApps); Jishen Zhao (UCSD); Jesús Camacho-Rodríguez (Microsoft); Yuanyuan Tian (Microsoft Gray Systems Lab)
175
SIMPLE: Efficient Temporal Graph Neural Network Training at Scale with Dynamic Data Placement

Shihong Gao (The Hong Kong University of Science and Technology)*; Yiming Li (Hong Kong University of Science and Technology); Xin Zhang (Hong Kong University of Science and Technology); Yanyan Shen (Shanghai Jiao Tong University); Yingxia Shao (BUPT); Lei Chen (Hong Kong University of Science and Technology)
176
SkyPIE: A Fast & Accurate Oracle for Object Placement

Tiemo Bang (UC Berkeley)*; Chris Douglas (UC Berkeley ); Natacha Crooks (UC Berkeley); Joseph M Hellerstein (UC Berkeley)
177
Solo: Data Discovery using Natural Language Questions via a Self-Supervised Approach

Qiming Wang (The University of Chicago)*; Raul Castro Fernandez (The University of Chicago)
178
Splitting Tuples of Mismatched Entities

Wenfei Fan (Univ. of Edinburgh ); Ziyan Han (Beihang University); Weilong Ren (Shenzhen Institute of Computing Sciences)*; ding wang (Center of Inernet Governance Research of Tsinghua university); Yaoshu Wang (Shenzhen Institute of Computing Sciences, Shenzhen University); Min Xie (Shenzhen Institute of Computing Sciences ); Mengyi Yan (Beihang University)
179
Spruce: a Fast yet Space-saving Structure for Dynamic Graph Storage

Jifan Shi (University of Science and Technology of China)*; Biao Wang (University of Science and Technology of China); Yun Xu (University of Science and Technology of China)
180
StarfishDB: a query execution engine for relational probabilistic programming

Ouael Ben Amara (University of Michigan - Dearborn); sami hadouaj (university of michigan dearborn); Niccolo Meneghetti (University of Michigan - Dearborn)*
181
Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment

Mengzhao Wang (Zhejiang University)*; Weizhi Xu (Zilliz); Xiaomeng Yi (Zhejiang Lab); Songlin Wu (Tongji University); Zhangyang Peng (Hangzhou Dianzi University); Xiangyu Ke (Zhejiang University, China); Yunjun Gao (Zhejiang University); Xiaoliang Xu (Hangzhou Dianzi University); Rentong Guo (Zilliz); Charles Xie (Zilliz)
182
STile: Searching Hybrid Sparse Formats for Sparse Deep Learning Operators Automatically

Jingzhi Fang (HKUST)*; Yanyan Shen (Shanghai Jiao Tong University); Yue Wang (Shenzhen Institute of Computing Sciences); Lei Chen (Hong Kong University of Science and Technology)
183
Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space

Junfeng Liu (Nanyang Technological University)*; FAN WANG (Nanyang Technological University); Dingheng Mo (Nanyang Technological University); Siqiang Luo (Nanyang Technological University)
184
Sub-optimal Join Order Identification with L1-error

Yesdaulet Izenov (University of California, Merced)*; Asoke Datta (University of California, Merced); Brian Tsan (UC Merced); Florin Rusu (UC Merced)
185
Summarized Causal Explanations For Aggregate Views

Brit Youngmann (MIT)*; Michael Cafarella (MIT CSAIL); Amir Gilad (The Hebrew University); Sudeepa Roy (Duke University, USA)
186
SWIX: A Memory-efficient Sliding Window Learned Index

Liang Liang (Imperial College London)*; Guang Yang (Imperial College London); Ali Hadian (Imperial College London); Luis Alberto Croquevielle (Imperial College London); Thomas Heinis (Imperial College)
187
System-X: Towards Fast Dependency Graph Generation for Database Replay

Wonseok Lee (POSTECH); Jaehyun Ha (POSTECH); Wook-Shin Han (POSTECH)*; Changgyoo Park (SAP Labs Korea); Myunggon Park (SAP Labs Korea); Juhyeng Han (SAP); Juchang Lee (SAP)
188
TabEE: Tabular Embeddings Explanations

Roni Copul (Tel Aviv University); Nave Frost (eBay); Tova Milo (Tel Aviv University); Kathy Razmadze (Tel Aviv University)*
189
Table-GPT: Table-tuned GPT for Diverse Table Tasks

Peng Li (Georgia Institute of Technology); Yeye He (Microsoft Research)*; Dror Y (Microsoft); Weiwei Cui (Microsoft Research Asia); Song Ge (Microsoft Reseach Asia); Haidong Zhang (Microsoft Research Asia); Danielle Rifinski Fainman (Microsoft); Dongmei Zhang (Microsoft Research Asia); Surajit Chaudhuri (Microsoft)
190
TEE-based General-purpose Computational Backend for Secure Delegated Data Processing

Mo Sha (Alibaba Group)*; Jialin Li (NUS); Sheng Wang (Alibaba Group); Feifei Li (Alibaba Group); Kian-Lee Tan (National University of Singapore)
191
Temporal JSON Keyword Search

Curtis Dyreson (Utah State University)*; Amani Shatnawi (Yarmouk University ); Sourav S Bhowmick (Nanyang Technological University); Vishal Sharma (New York Institute of Technology)
192
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs

Laxman Dhulipala (UMD and Google Research)*; Jason Lee (Google); Jakub Łącki (Google); Vahab Mirrokni (Google)
193
ThalamusDB: Approximate Query Processing on Multi-Modal Data

Saehan Jo (Cornell University)*; Immanuel Trummer (Cornell University)
194
The Battleship Approach to the Low Resource Entity Matching Problem

Bar Genossar (Technion -- Israel Institute of Technology)*; Avigdor Gal (Technion -- Israel Institute of Technology); Roee Shraga (Northeastern University)
195
The Image Calculator: 10x Faster Image-AI Inference by Replacing JPEG with Self-designing Storage Format

Utku Sirin (Harvard University)*; Stratos Idreos (Harvard)
196
The Pattern Expressiveness of Relational Query Languages, Illustrated With DiagramsX

Wolfgang Gatterbauer (Northeastern University)*; Cody Dunne (Northeastern University)
197
Time Series Representation for Visualization in Apache IoTDB

Lei Rui (Tsinghua University); Xiangdong Huang (Tsinghua University); Shaoxu Song (Tsinghua University)*; Yuyuan Kang (University of Wisconsin-Madison); Chen Wang (Timecho Limited); Jianmin Wang ("Tsinghua University, China")
198
Towards Buffer Management with Tiered Main Memory

Xiangpeng Hao (University of Wisconsin Madison)*; Xinjing Zhou (Massachusetts Institute of Technology); Xiangyao Yu (University of Wisconsin-Madison); Michael Stonebraker (MIT)
199
Towards Metric DBSCAN: Exact, approximate, and Streaming Algorithms

Mo Guanlin (University of Science and Technology of China); Shihong Song (University of Science and Technology of China); Hu Ding (University of Science and Technology of China)*
200
uBlade: Efficient Batch Processing for Uncertainty Graph Queries

Siyuan Yao (SMU); Yuchen Li (Singapore Management University)*; Shixuan Sun (Shanghai Jiao Tong University); Jiaxin Jiang (National University of Singapore); Bingsheng He (National University of Singapore)
201
Udon: Efficient Debugging of User-Defined Functions in Big Data Systems with Line-by-Line Control

Yicong Huang (UC Irvine)*; Zuozhi Wang (U C IRVINE); Chen Li (UC Irvine)
202
Understanding the Performance Implications of the Design Principles in Storage-Disaggregated Databases

Xi Pang (Purdue University); Jianguo Wang (Purdue University)*
203
Unstructured Data Fusion for Schema and Data Extraction

kaiwen chen (university of Toronto)*; Nick Koudas (University of Toronto)
204
VEIL: A Storage and Communication Efficient Volume-Hiding Algorithm

Shanshan Han (UCI)*; Vishal Chakraborty (University of California, Irvine); Michael T Goodrich (Univ. of California, Irvine); Sharad Mehrotra (U.C. Irvine); Shantanu Sharma (New Jersey Institute of Technology)
205
VeriTxn: Verifiable Transactions for Cloud-Native Databases with Storage Disaggregation

Zhanhao Zhao (Renmin University of China); Hexiang Pan (National University of Singapore); Gang Chen (Zhejiang University); Xiaoyong Du (Renmin University of China); WEI LU (Renmin University of China); Beng Chin Ooi (NUS)*
206
Vexless: A Serverless Vector Data Management System Using Cloud Functions

Yongye Su (Purdue University)*; Yinqi Sun (Purdue University); Minjia Zhang (Microsoft AI and Research); Jianguo Wang (Purdue University)
207
View-based Explanations for Graph Neural Networks

Tingyang Chen (Zhejiang University); Dazhuo Qiu (Aalborg University); Yinghui Wu (Case Western Reserve University); Arijit Khan (Aalborg University); Xiangyu Ke (Zhejiang University, China)*; Yunjun Gao (Zhejiang University)
208
Waffle: An Online Oblivious Datastore for Protecting Data Access Patterns

Sujaya Maiyya (University of Waterloo)*; Sharath Chandra Vemula (UC Santa Barbara); Divy Agrawal (University of California, Santa Barbara); Amr El Abbadi (UC Santa Barbara); Florian Kerschbaum (University of Waterloo)
209
Watchog: A Light-weight Contrastive Learning based Framework for Column Annotation

Zhengjie Miao (Simon Fraser University); Jin Wang (Megagon Labs)*
210
WeBridge: Synthesizing Stored Procedures for Large-Scale Real-World Web Applications

Gansen Hu (Shanghai Jiao Tong University )*; zhaoguo wang (Shanghai Jiao Tong University); Jiahuan Shen (Shanghai Jiao Tong University); Zhiyuan Dong (Shanghai Jiao Tong University); Chuzhe Tang (Shanghai Jiao Tong University); Sheng Yao (Shanghai Jiao Tong University); Haibo Chen (Shanghai Jiao Tong University)
211
Wii: Dynamic Budget Reallocation In Index Tuning

Xiaoying Wang (Simon Fraser University); Wentao Wu (Microsoft Research)*; Chi Wang (Microsoft Research); Vivek Narasayya (Microsoft); Surajit Chaudhuri (Microsoft)
212
Worst-Case-Optimal Similarity Joins on Graph Databases

Diego Arroyuelo (UTFSM, Chile); Benjamin Bustos (Department of Computer Science, University of Chile); Adrián Gómez-Brandón (Universidade da Coruña, Spain); Aidan Hogan (Universidad de Chile, Chile); Gonzalo Navarro (University of Chile); Juan Reutter (PUC)*
213
Wred: Workload Reduction for Scalable Index Tuning

Matteo Brucato (Microsoft Research)*; Tarique Siddiqui (Microsoft Research); Wentao Wu (Microsoft Research); Vivek Narasayya (Microsoft); Surajit Chaudhuri (Microsoft)
214
Zero-sided RDMA: Network-driven Data Shuffling for Disaggregated Heterogeneous Cloud DBMSs

Matthias Jasny (TU Darmstadt)*; Lasse Thostrup (TU Darmstadt); Sajjad Tamimi (TU Darmstadt); Andreas Koch (TU Darmstadt); Zsolt István (TU Darmstadt); Carsten Binnig (TU Darmstadt)
215
Total papers accepted: 213