default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProceedings of the ACM on Management of Data, Volume 3
Volume 3, Number 1, February 2025
SIGMOD Conference 2025
- Azza Abouzied
, Joseph M. Hellerstein, Divyakant Agrawal:
PACMMOD V3, N1 (SIGMOD), February 2025: Editorial. 1:1-1:2 - Victor Giannakouris, Immanuel Trummer:
λ-Tune: Harnessing Large Language Models for Automated Database System Tuning. 2:1-2:26 - Rodrigo Laigner, Zhexiang Zhang, Yijian Liu, Leonardo Freitas Gomes, Yongluan Zhou:
Online Marketplace: A Benchmark for Data Management in Microservices. 3:1-3:26 - Chenghan Zhang, Yuanyuan Zhu, Lijun Chang:
A Local Search Approach to Efficient (k,p)-Core Maintenance. 4:1-4:26 - Coral Scharf, Carmel Domshlak, Avigdor Gal, Haggai Roitman:
A Rank-Based Approach to Recommender System's Top-K Queries with Uncertain Scores. 5:1-5:26 - Wenqian Zhang, Zhengyi Yang, Dong Wen, Wentao Li, Wenjie Zhang, Xuemin Lin:
Accelerating Core Decomposition in Billion-Scale Hypergraphs. 6:1-6:27 - Dennis M. Hofmann, Peter M. VanNostrand, Lei Ma, Huayi Zhang, Joshua DeOliveira, Lei Cao, Elke A. Rundensteiner:
Agree to Disagree: Robust Anomaly Detection with Noisy Labels. 7:1-7:24 - Joanna Purich, Anthony Wise, Leilani Battle:
An Adaptive Benchmark for Modeling User Exploration of Large Datasets. 8:1-8:24 - Rico Bergmann, Claudio Hartmann, Dirk Habich, Wolfgang Lehner:
An Elephant Under the Microscope: Analyzing the Interaction of Optimizer Components in PostgreSQL. 9:1-9:28 - Qing Chen, Michael H. Böhlen, Sven Helmer:
An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs. 10:1-10:26 - Runjie Yu, Weizhou Huang, Shuhan Bai, Jian Zhou, Fei Wu:
AquaPipe: A Quality-Aware Pipeline for Knowledge Retrieval and Large Language Models. 11:1-11:26 - Dingheng Mo, Junfeng Liu, Fan Wang, Siqiang Luo:
Aster: Enhancing LSM-structures for Scalable Graph Database. 12:1-12:26 - Sibei Chen, Ju Fan, Bin Wu, Nan Tang, Chao Deng, Pengyi Wang, Ye Li, Jian Tan, Feifei Li, Jingren Zhou, Xiaoyong Du:
Automatic Database Configuration Debugging using Retrieval-Augmented Language Models. 13:1-13:27 - Marcus Müller, Lawrence Benson, Viktor Leis:
B-Trees Are Back: Engineering Fast and Pageable Node Layouts. 14:1-14:26 - Yujie Lu, Zhijie Zhang, Weiguo Zheng:
BⓈX: Subgraph Matching with Batch Backtracking Search. 15:1-15:27 - Jianxiong Ye, Zhaonian Zou, Dandan Liu, Bin Yang, Xudong Liu:
BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs. 16:1-16:27 - Bohyun Lee, Seongjae Moon, Jonghyeok Park, Sang-Won Lee:
Boosting OLTP Performance with Per-Page Logging on NVDIMM. 17:1-17:28 - Lyu Xu, Jiaxin Jiang, Byron Choi, Jianliang Xu, Bingsheng He:
Bursting Flow Query on Large Temporal Flow Networks. 18:1-18:26 - Yongan Xiang, Zezhong Ding, Rui Guo, Shangyou Wang, Xike Xie, S. Kevin Zhou:
Capsule: An Out-of-Core Training Mechanism for Colossal GNNs. 19:1-19:30 - Suyong Kwon, Kyuseok Shim, Woohwan Jung:
Cardinality Estimation of LIKE Predicate Queries using Deep Learning. 20:1-20:26 - Yuanhao Lai, Pengfei Zheng, Chenpeng Ji, Yan Li, Songhan Zhang, Rutao Zhang, Zhengang Wang, Yunfei Du:
Centrum: Model-based Database Auto-tuning with Minimal Distributional Assumptions. 21:1-21:26 - Yuxiang Wang, Zhangyang Peng, Xiangyu Ke, Xiaoliang Xu, Tianxing Wu, Yuan Gao:
Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs. 22:1-22:27 - Qihao Cheng, Da Yan, Tianhao Wu, Zhongyi Huang, Qin Zhang:
Computing Approximate Graph Edit Distance via Optimal Transport. 23:1-23:26 - Chi Zhang, Manuel Rigger:
Constant Optimization Driven Database System Testing. 24:1-24:24 - Nuno Faria, José Pereira:
CRDV: Conflict-free Replicated Data Views. 25:1-25:27 - Yiming Qiao, Huanchen Zhang:
Data Chunk Compaction in Vectorized Execution. 26:1-26:25 - Mukul Singh, José Cambronero, Sumit Gulwani, Vu Le, Carina Negreanu, Arjun Radhakrishna, Gust Verbruggen:
DataVinci: Learning Syntactic and Semantic String Repairs. 27:1-27:26 - Qing Sima, Jianke Yu, Xiaoyang Wang, Wenjie Zhang, Ying Zhang, Xuemin Lin:
Deep Overlapping Community Search via Subspace Embedding. 28:1-28:26 - Ziqi Yin, Jianyang Gao, Pasquale Balsebre, Gao Cong, Cheng Long:
DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph. 29:1-29:28 - Yalong Zhang, Rong-Hua Li, Qi Zhang, Hongchao Qin, Lu Qin, Guoren Wang:
Density Decomposition of Bipartite Graphs. 30:1-30:25 - Reham Omar, Omij Mangukiya, Essam Mansour:
Dialogue Benchmark Generation from Knowledge Graphs with Cost-Effective Retrieval-Augmented LLMs. 31:1-31:26 - Rebecca Sattler, Sarah Kleest-Meißner, Steven Lange, Markus L. Schmid, Nicole Schweikardt, Matthias Weidlich:
DISCES: Systematic Discovery of Event Stream Queries. 32:1-32:26 - Wenshao Zhong, Chen Chen, Xingbo Wu, Jakob Eriksson:
Disco: A Compact Index for LSM-trees. 33:1-33:27 - Renjie Liu, Yichuan Wang, Xiao Yan, Haitian Jiang, Zhenkun Cai, Minjie Wang, Bo Tang, Jinyang Li:
DiskGNN: Bridging I/O Efficiency and Model Accuracy for Out-of-Core GNN Training. 34:1-34:27 - Muhammad Farhan, Henning Koehler, Qing Wang:
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks. 35:1-35:25 - Meihao Liao, Cheng Li, Rong-Hua Li, Guoren Wang:
Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs. 36:1-36:27 - Yang Liu, Hejiao Huang, Kaiqiang Yu, Shengxin Liu, Cheng Long:
Efficient Maximum s-Bundle Search via Local Vertex Connectivity. 37:1-37:27 - Yuyang Xia, Yixiang Fang, Wensheng Luo:
Efficiently Counting Triangles in Large Temporal Graphs. 38:1-38:27 - Bowen Wu, Dimitrios Koutsoukos, Gustavo Alonso:
Efficiently Processing Joins and Grouped Aggregations on GPUs. 39:1-39:27 - Philipp Skavantzos, Sebastian Link:
Entity/Relationship Graphs: Principled Design, Modeling, and Data Integrity Management of Graph Databases. 40:1-40:26 - Aaron Huber, Oliver Kennedy, Atri Rudra, Zhuoyue Zhao, Su Feng, Boris Glavic:
FastPDB: Towards Bag-Probabilistic Queries at Interactive Speeds. 41:1-41:25 - Yuemin Zhang, Qingqing Ye, Haibo Hu:
Federated Heavy Hitter Analytics with Local Differential Privacy. 42:1-42:27 - Ilias Azizi, Karima Echihabi, Themis Palpanas:
Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art. 43:1-43:31 - Shweta Pandey, Arkaprava Basu:
H-Rocks: CPU-GPU accelerated Heterogeneous RocksDB on Persistent Memory. 44:1-44:28 - Yifan Wu, Ke Chen, Gang Chen, Dawei Jiang, Huan Li, Lidan Shou:
HyperMR: Efficient Hypergraph-enhanced Matrix Storage on Compute-in-Memory Architecture. 45:1-45:27 - Yunxiang Su, Kenny Ye Liang, Shaoxu Song:
In-Database Time Series Clustering. 46:1-46:26 - Weijie Sun, Zihuan Xu, Wangze Ni, Lei Chen:
InTime: Towards Performance Predictability In Byzantine Fault Tolerant Proof-of-Stake Consensus. 47:1-47:27 - Chengyu Wang, Tongqing Zhou, Lin Chen, Shan Zhao, Zhiping Cai:
ISSD: Indicator Selection for Time Series State Detection. 48:1-48:25 - Lei Rui, Xiangdong Huang, Shaoxu Song, Chen Wang, Jianmin Wang, Zhao Cao:
Largest Triangle Sampling for Visualizing Time Series in Database. 49:1-49:26 - Longtao Zhang, Ruoyu Li, Congrong Ren, Sheng Di, Jinyang Liu, Jiajun Huang, Robert Underwood, Pascal Grosset, Dingwen Tao, Xin Liang, Hanqi Guo, Franck Cappello, Kai Zhao:
LCP: Enhancing Scientific Data Management with Lossy Compression for Particles. 50:1-50:27 - Qitong Wang, Ioana Ileana, Themis Palpanas:
LeaFi: Data Series Indexes on Steroids with Learned Filters. 51:1-51:27 - Jiangneng Li, Haitao Yuan, Gao Cong, Han Mao Kiah, Shuhao Zhang:
MAST: Towards Efficient Analytical Query Processing on Point Cloud Data. 52:1-52:27 - Pinxue Zhao, Hailin Zhang, Fangcheng Fu, Xiaonan Nie, Qibin Liu, Fang Yang, Yuanbo Peng, Dian Jiao, Shuaipeng Li, Jinbao Xue, Yangyu Tao, Bin Cui:
MEMO: Fine-grained Tensor Management For Ultra-long Context LLM Training. 53:1-53:28 - Lantian Xu, Dong Wen, Lu Qin, Ronghua Li, Ying Zhang, Yang Lu, Xuemin Lin:
Minimum Spanning Tree Maintenance in Dynamic Graphs. 54:1-54:24 - Maximilian Böther, Ties Robroek, Viktor Gsteiger, Robin Holzinger, Xianzhe Ma, Pinar Tözün, Ana Klimovic:
Modyn: Data-Centric Machine Learning Pipeline Orchestration. 55:1-55:30 - Bo-Young Lim, Jeongha Park, Kisung Lee, Hyuk-Yoon Kwon:
Multi-Level Graph Representation Learning Through Predictive Community-based Partitioning. 56:1-56:27 - Pengjie Cui, Haotian Liu, Dong Jiang, Bo Tang, Ye Yuan:
Nezha: An Efficient Distributed Graph Processing System on Heterogeneous Hardware. 57:1-57:27 - Zikai Ye, Xiangyu Wang, Zesen Liu, Dan Zhu, Jianfeng Ma:
OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves. 58:1-58:24 - Zijin Feng, Miao Qiao, Chengzhi Piao, Hong Cheng:
On Graph Representation for Attributed Hypergraph Clustering. 59:1-59:26 - Xu Chen, Shuncheng Liu, Tong Yuan, Tao Ye, Kai Zeng, Han Su, Kai Zheng:
Optimizing Block Skipping for High-Dimensional Data with Learned Adaptive Curve. 60:1-60:26 - Weihe Li:
Pandora: An Efficient and Rapid Solution for Persistence-Based Tasks in High-Speed Data Streams. 61:1-61:26 - Ziyang Men, Zheqi Shen, Yan Gu, Yihan Sun:
Parallel kd-tree with Batch Updates. 62:1-62:26 - Binbin Gu, Juncheng Fang, Faisal Nawab:
PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL-Query Verification. 63:1-63:27 - Xinjing Zhou, Viktor Leis, Jinming Hu, Xiangyao Yu, Michael Stonebraker:
Practical DB-OS Co-Design with Privileged Kernel Bypass. 64:1-64:27 - Jakub Maciejewski, Konstantinos Nikoletos, George Papadakis, Yannis Velegrakis:
Progressive Entity Matching: A Design Space Exploration. 65:1-65:25 - Tarique Siddiqui, Arnd Christian König, Jiashen Cao, Cong Yan, Shuvendu K. Lahiri:
QURE: AI-Assisted and Automatically Verified UDF Inlining. 66:1-66:26 - Ziling Chen, Shaoxu Song:
Randomized Sketches for Quantile in LSM-tree based Store. 67:1-67:26 - Kyungmin Lim, Minseok Yoon, Kihwan Kim, Alan David Fekete, Hyungsoo Jung:
Rapid Data Ingestion through DB-OS Co-design. 68:1-68:28 - Kaiwen Chen, Yueting Chen, Nick Koudas, Xiaohui Yu:
Reliable Text-to-SQL with Adaptive Abstention. 69:1-69:30 - Jixian Su, Chiyu Hao, Shixuan Sun, Hao Zhang, Sen Gao, Jiaxin Jiang, Yao Chen, Chenyi Zhang, Bingsheng He, Minyi Guo:
Revisiting the Design of In-Memory Dynamic Graph Storage. 70:1-70:27 - Zhihan Zheng, Haitao Yuan, Minxiao Chen, Shangguang Wang:
RLER-TTE: An Efficient and Effective Framework for En Route Travel Time Estimation with Reinforcement Learning. 71:1-71:26 - Chandan Sharma, Pierre Genevès, Nils Gesbert, Nabil Layaïda:
Schema-Based Query Optimisation for Graph Databases. 72:1-72:29 - Zongda Han, Xiang Cheng, Wenhong Zhao, Jiaxin Fu, Zhaofeng He, Sen Su:
SecureXGB: A Secure and Efficient Multi-party Protocol for Vertical Federated XGBoost. 73:1-73:26 - Kaiqiang Xu, Di Chai, Junxue Zhang, Fan Lai, Kai Chen:
Sequoia: An Accessible and Extensible Framework for Privacy-Preserving Machine Learning over Distributed Data. 74:1-74:27 - Junyuan Pang, Jian Pei, Haocheng Xia, Xiang Li, Jinfei Liu:
Shapley Value Estimation based on Differential Matrix. 75:1-75:28 - Hadar Ben-Efraim, Susan B. Davidson, Amit Somech:
SHARQ: Explainability Framework for Association Rules on Relational Data. 76:1-76:25 - Kyle Luoma, Arun Kumar:
SNAILS: Schema Naming Assessments for Improved LLM-Based SQL Inference. 77:1-77:26 - Xiaochen Li, Tianyu Li, Yitian Cheng, Chen Gong, Kui Ren, Zhan Qin, Tianhao Wang:
SPAS: Continuous Release of Data Streams under w-Event Differential Privacy. 78a:1-78a:27 - Jiuqi Wei, Xiaodong Lee, Zhenyu Liao, Themis Palpanas, Botao Peng:
Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search. 79:1-79:29 - Yutong Gou, Jianyang Gao, Yuexuan Xu, Cheng Long:
SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search. 80:1-80:26 - Yongliang Zhang, Yuanyuan Zhu, Hao Zhang, Congli Gao, Yuyang Wang, Guojing Li, Tianyang Xu, Ming Zhong, Jiawei Jiang, Tieyun Qian, Chenyi Zhang, Jeffrey Xu Yu:
TGraph: A Tensor-centric Graph Processing Framework. 81:1-81:27 - Qian Xu, Juan Yang, Feng Zhang, Junda Pan, Kang Chen, Youren Shen, Amelie Chi Zhou, Xiaoyong Du:
Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle Inequalities. 82:1-82:28 - Yahong Chen, Xiaoyi Pang, Xiaoguang Li, Hanyi Wang, Ben Niu, Shengnan Hu:
U-DPAP: Utility-aware Efficient Range Counting on Privacy-preserving Spatial Data Federation. 83a:1-83a:25 - Ronny Ko, Chuan Xiao, Makoto Onizuka, Zhiqiang Lin, Yihe Huang:
Ultraverse: An Efficient What-if Analysis Framework for Software Applications Interacting with Database Systems. 84:1-84:27 - Amedeo Pachera, Angela Bonifati, Andrea Mauri:
User-Centric Property Graph Repairs. 85:1-85:27 - Meng Li, Huayi Chai, Siqiang Luo, Haipeng Dai, Rong Gu, Jiaqi Zheng, Guihai Chen:
VEGA: An Active-tuning Learned Index with Group-Wise Learning Granularity. 86:1-86:26
Volume 3, Number 2, May 2025
PODS 2025
- Nofar Carmeli, Floris Geerts, Ahmet Kara, Benny Kimelfeld:
PACMMOD, V3, N2 (PODS), May 2025 Editorial. 87:1-87:4 - Stefan Mengel, Harry Vinall-Smeeth:
A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity. 88:1-88:19 - Luisa Gerlach, Tobias Köppl, Stefanie Scherzinger, Nicole Schweikardt, René Zander:
A Quantum-Leap into Schema Matching: Beyond 1-to-1 Matchings. 89:1-89:24 - Aryan Esmailpour, Sainyam Galhotra, Rahul Raychaudhury, Stavros Sintos:
A Theoretical Framework for Distribution-Aware Dataset Search. 90:1-90:26 - Sepehr Assadi, Vihan Shah:
An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication. 91:1-91:24 - Austen Z. Fan, Paraschos Koutris, Hangdong Zhao:
Circuit Bounds for Conjunctive Queries with Self-joins. 92:1-92:24 - Austen Z. Fan, Paraschos Koutris, Sudeepa Roy:
Circuits and Formulas for Datalog over Semirings. 93:1-93:22 - Julián García, Cristian Riveros:
Complex Event Recognition under Time Constraints: Towards a Formal Framework for Efficient Query Evaluation. 94:1-94:17 - Giulia Bernardini, Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
Differentially Private Substring and Document Counting. 95:1-95:27 - Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints. 96:1-96:26 - Pablo Barceló, Alexander Kozachinskiy, Miguel Romero, Bernardo Subercaseaux, José Verschae:
Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations. 97:1-97:26 - Mahmoud Abo Khamis, Xiao Hu, Dan Suciu:
Fast Matrix Multiplication meets the Submodular Width. 98:1-98:26 - Sofya Raskhodnikova, Teresa Anna Steiner:
Fully Dynamic Algorithms for Graph Databases with Edge Differential Privacy. 99:1-99:28 - Diego Figueira, Rémi Morvan, Miguel Romero:
Minimizing Conjunctive Regular Path Queries. 100:1-100:25 - Lucas Larroque, Piotr Ostropolski-Nalewaja, Michaël Thomazo:
No Cliques Allowed: The Next Step Towards BDD/FC Conjecture. 101:1-101:20 - Michael Kapralov, Mikhail Makarov, Christian Sohler:
On the Adversarial Robustness of Locality-Sensitive Hashing in Hamming Space. 102:1-102:24 - Rasmus Pagh, Lukas Retschmeier, Hao Wu, Hanwen Zhang:
Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation. 103:1-103:26 - Xiao Hu:
Output-Optimal Algorithms for Join-Aggregate Queries. 104:1-104:27 - Mahmoud Abo Khamis, Ahmet Kara, Dan Olteanu, Dan Suciu:
Output-Sensitive Evaluation of Regular Path Queries. 105:1-105:20 - David P. Woodruff, Shenghao Xie, Samson Zhou:
Perfect Sampling in Turnstile Streams Beyond Small Moments. 106:1-106:27 - Rayne Holland, Seyit Camtepe, Chandra Thapa, Minhui Xue:
Private Synthetic Data Generation in Bounded Memory. 107:1-107:25 - Antoine Amarilli, Wolfgang Gatterbauer, Neha Makhija, Mikaël Monet:
Resilience for Regular Path Queries: Towards a Complexity Classification. 108:1-108:18 - David Carral, Lukas Gerlach, Lucas Larroque, Michaël Thomazo:
Restricted Chase Termination: You Want More than Fairness. 109:1-109:17 - Phokion G. Kolaitis, Nina Pardal, Jonni Virtema, Jef Wijsen:
Rewriting Consistent Answers On Annotated Data. 110:1-110:26 - Qin Zhang:
Robust Statistical Analysis on Streaming Data with Near-Duplicates in General Metric Spaces. 111:1-111:25 - Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade:
Shapley Revisited: Tractable Responsibility Measures for Query Answers. 112:1-112:26 - Aryan Esmailpour, Boris Glavic, Xiao Hu, Stavros Sintos:
Smallest Synthetic Witnesses for Conjunctive Queries. 113:1-113:25 - Matthias Lanzinger, Cem Okulmus, Reinhard Pichler, Alexander Selzer, Georg Gottlob:
Soft and Constrained Hypertree Width. 114:1-114:25 - Giovanni Buzzega, Alessio Conte, Yasuaki Kobayashi, Kazuhiro Kurita, Giulia Punzi:
The Complexity of Maximal Common Subsequence Enumeration. 115:1-115:19 - Kuldeep S. Meel, Alexis de Colnet:
Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence. 116:1-116:23 - Xiao Hu, Qichen Wang:
Towards Update-Dependent Analysis of Query Maintenance. 117:1-117:25
Volume 3, Number 3, June 2025
SIGMOD Conference 2025
- Azza Abouzied, Joseph M. Hellerstein, Divyakant Agrawal:
PACMMOD V3, N3 (SIGMOD), June 2025: Editorial. 118:1-118:2 - Juliana Silva Barbosa, Ulhas Gondhali, Gohar Petrossian, Kinshuk Sharma, Sunandan Chakraborty, Jennifer Jacquet, Juliana Freire:
A Cost-Effective LLM-based Approach to Identify Wildlife Trafficking in Online Marketplaces. 119:1-119:23 - Taiyi Wang, Liang Liang, Guang Yang, Thomas Heinis, Eiko Yoneki:
A New Paradigm in Tuning Learned Indexes: A Reinforcement Learning Enhanced Approach. 120:1-120:26 - Jens E. d'Hondt, Haojun Li, Fan Yang, Odysseas Papapetrou, John Paparrizos:
A Structured Study of Multivariate Time-Series Distance Measures. 121:1-121:29 - Yifei Yang, Xiangyao Yu:
Accelerate Distributed Joins with Predicate Transfer. 122:1-122:27 - Mengzhao Wang, Haotian Wu, Xiangyu Ke, Yunjun Gao, Yifan Zhu, Wenchao Zhou:
Accelerating Graph Indexing for ANNS on Modern CPUs. 123:1-123:29 - Yuanyuan Zeng, Yixiang Fang, Wensheng Luo, Chenhao Ma:
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs. 124:1-124:26 - Kuan Lu, Zhihui Yang, Sai Wu, Ruichen Xia, Dongxiang Zhang, Gang Chen:
Adda: Towards Efficient in-Database Feature Generation via LLM-based Agents. 125:1-125:27 - Xinyi Ye, Xiangyang Gou, Lei Zou, Wenjie Zhang:
AJOSC: Adaptive Join Order Selection for Continuous Queries. 126:1-126:27 - Nils Strassenburg, Boris Glavic, Tilmann Rabl:
Alsatian: Optimizing Model Search for Deep Transfer Learning. 127:1-127:27 - Yuan Qiu, Ke Yi:
Approximate DBSCAN under Differential Privacy. 128:1-128:24 - Jiwon Chang, Fatemeh Nargesian:
Approximating Opaque Top-k Queries. 129:1-129:25 - Shihong Gao, Xin Zhang, Yanyan Shen, Lei Chen:
Apt-Serve: Adaptive Request Scheduling on Hybrid Cache for Scalable LLM Inference Serving. 130:1-130:28 - Cuong D. T. Nguyen, Kevin Chen, Christopher DeCarolis, Daniel J. Abadi:
Are Database System Researchers Making Correct Assumptions about Transaction Workloads? 131:1-131:26 - Runzhong Li, Qilong Li, Haotian Liu, Rui Mao, Qing Li, Bo Tang:
Athena: An Effective Learning-based Framework for Query Optimizer Performance Improvement. 132:1-132:24 - Qixu Chen, Yeye He, Raymond Chi-Wing Wong, Weiwei Cui, Song Ge, Haidong Zhang, Dongmei Zhang, Surajit Chaudhuri:
Auto-Test: Learning Semantic-Domain Constraints for Unsupervised Error Detection in Tables. 133:1-133:27 - Yicun Yang, Zhaoguo Wang, Yu Xia, Zhuoran Wei, Haoran Ding, Ruzica Piskac, Haibo Chen, Jinyang Li:
Automated Validating and Fixing of Text-to-SQL Translation with Execution Consistency. 134:1-134:28 - Matthew Butrovich, Samuel Arch, Wan Shen Lim, William Zhang, Jignesh M. Patel, Andrew Pavlo:
BPF-DB: A Kernel-Embedded Transactional Database Management System For eBPF Applications. 135:1-135:27 - Shubham Agarwal, Sai Sundaresan, Subrata Mitra, Debabrata Mahapatra, Archit Gupta, Rounak Sharma, Nirmal Joshua Kapu, Tong Yu, Shiv Kumar Saini:
Cache-Craft: Managing Chunk-Caches for Efficient Retrieval-Augmented Generation. 136:1-136:28 - Peiqi Yin, Qihui Zhou, Xiao Yan, Chao Wang, Eric Lo, Changji Li, Lan Lu, Hua Fan, Wenchao Zhou, Ming-Chang Yang, James Cheng:
CARINA: An Efficient CXL-Oriented Embedding Serving System for Recommendation Models. 137:1-137:29 - Feng Yu, Hongshi Tan, Xinyu Chen, Yao Chen, Bingsheng He, Weng-Fai Wong:
Clementi: Efficient Load Balancing and Communication Overlap for Multi-FPGA Graph Processing. 138:1-138:27 - Jiaxin Jiang, Siyuan Yao, Yuhang Chen, Bingsheng He, Yudong Niu, Yuchen Li, Shixuan Sun, Yongchao Liu:
Community Detection in Heterogeneous Information Networks Without Materialization. 139:1-139:27 - Shubhankar Mohapatra, Amir Gilad, Xi He, Benny Kimelfeld:
Computing Inconsistency Measures Under Differential Privacy. 140:1-140:27 - Wei Zhou, Yuyang Gao, Xuanhe Zhou, Guoliang Li:
Cracking SQL Barriers: An LLM-based Dialect Translation System. 141:1-141:26 - Stefano Marchesin, Gianmaria Silvello:
Credible Intervals for Knowledge Graph Accuracy Estimation. 142:1-142:26 - Sungwoo Park, Seyeon Oh, Min-Soo Kim:
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns. 143:1-143:28 - Amélie Gheerbrant, Leonid Libkin, Alexandra Rogova:
Dangers of List Processing in Querying Property Graphs. 144:1-144:25 - Wenfei Fan, Xiaoyu Han, Weilong Ren, Zihuan Xu:
Data Enhancement for Binary Classification of Relational Data. 145:1-145:28 - Junyi Zhao, Kai Su, Yifei Yang, Xiangyao Yu, Paraschos Koutris, Huanchen Zhang:
Debunking the Myth of Join Ordering: Toward Robust SQL Analytics. 146:1-146:28 - Chen Ding, Kai Lu, Quanyi Zhang, Zekun Ye, Ting Yao, Daohui Wang, Huatao Wu, Jiguang Wan:
DFlush: DPU-Offloaded Flush for Disaggregated LSM-based Key-Value Stores. 147:1-147:28 - Mengxu Jiang, Zhi Yang, Fangyuan Zhang, Guanhao Hou, Jieming Shi, Wenchao Zhou, Feifei Li, Sibo Wang:
DIGRA: A Dynamic Graph Indexing for Approximate Nearest Neighbor Search with Range Filter. 148:1-148:26 - Muhammad Farhan, Henning Koehler, Qing Wang:
Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks. 149:1-149:25 - Jiaxin Jiang, Siyuan Yao, Yuchen Li, Qiange Wang, Bingsheng He, Min Chen:
Dupin: A Parallel Framework for Densest Subgraph Discovery in Fraud Detection on Massive Graphs. 150:1-150:26 - Dongdong Xie, Pinghui Wang, Quanqing Xu, Chuanhui Yang, Rundong Li:
Efficient and Accurate Differentially Private Cardinality Continual Releases. 151:1-151:27 - Fangyuan Zhang, Mengxu Jiang, Guanhao Hou, Jieming Shi, Hua Fan, Wenchao Zhou, Feifei Li, Sibo Wang:
Efficient Dynamic Indexing for Range Filtered Approximate Nearest Neighbor Search. 152:1-152:26 - Libin Wang, Raymond Chi-Wing Wong:
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks. 153:1-153:24 - Joris Nix, Jens Dittrich:
Extending SQL to Return a Subdatabase. 154:1-154:26 - Hanbing Zhang, Yinan Jing, Zhenying He, Kai Zhang, X. Sean Wang:
FAAQP: Fast and Accurate Approximate Query Processing based on Bitmap-augmented Sum-Product Network. 155:1-155:26 - Benton Li, Nativ Levy, Brit Youngmann, Sainyam Galhotra, Sudeepa Roy:
Fair and Actionable Causal Prescription Ruleset. 156:1-156:28 - Haralampos Gavriilidis, Kaustubh Beedkar, Matthias Boehm, Volker Markl:
Fast and Scalable Data Transfer Across Data Systems. 157:1-157:28 - Jiadong Xie, Jeffrey Xu Yu, Yingfan Liu:
Fast Approximate Similarity Join in Vector Databases. 158:1-158:26 - Vaishali Surianarayanan, Anikait Mundhra, Ajaykrishnan E. S., Daniel Lokshtanov:
Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized. 159:1-159:27 - Kaiqiang Yu, Kaixin Wang, Cheng Long, Laks V. S. Lakshmanan, Reynold Cheng:
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach. 160:1-160:27 - Quan Xue, T.-H. Hubert Chan:
Faster and Efficient Density Decomposition via Proportional Response with Exponential Momentum. 161:1-161:26 - Jiaoyi Zhang, Liqiang Peng, Mo Sha, Weiran Liu, Xiang Li, Sheng Wang, Feifei Li, Mingyu Gao, Huanchen Zhang:
Femur: A Flexible Framework for Fast and Secure Querying from Public Key-Value Store. 162:1-162:29 - Qiuyang Mang, Jinsheng Ba, Pinjia He, Manuel Rigger:
Finding Logic Bugs in Graph-processing Systems via Graph-cutting. 163:1-163:27 - Kyle Deeds, Willow Ahrens, Magdalena Balazinska, Dan Suciu:
Galley: Modern Query Optimization for Sparse Tensor Programs. 164:1-164:24 - Jiaping Cao, Le Xu, Man Lung Yiu, Jianbin Qin, Bo Tang:
GPH: An Efficient and Effective Perfect Hashing Scheme for GPU Architectures. 165:1-165:26 - Wenchao Bai, Wenfei Fan, Shuhao Liu, Kehan Pang, Xiaoke Zhu, Jiahui Jin:
Rule-Based Graph Cleaning with GPUs on a Single Machine. 166:1-166:27 - Mouyi Xu, Lijun Chang:
Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods. 167:1-167:24 - Libin Zhou, Lu Xing, Yeasir Rayhan, Walid G. Aref:
GTX: A Write-Optimized Latch-free Graph Data System with Transactional Support. 168:1-168:27 - Baiyan Zhang, Zepeng Li, Dongxiang Zhang, Huan Li, Kian-Lee Tan, Gang Chen:
High-Throughput Ingestion for Video Warehouse: Comprehensive Configuration and Effective Exploration. 169:1-169:27 - Jiacheng Wu, Dan Suciu:
HoneyComb: A Parallel Worst-Case Optimal Join on Multicores. 170:1-170:27 - Dakai Kang, Suyash Gupta, Dahlia Malkhi, Mohammad Sadoghi:
HotStuff-1: Linear Consensus with One-Phase Speculation. 171:1-171:29 - Roman Heinrich, Manisha Luthra, Johannes Wehrstein, Harald Kornmayer, Carsten Binnig:
How Good are Learned Cost Models, Really? Insights from Query Optimization Tasks. 172:1-172:27 - Dingheng Mo, Siqiang Luo, Stratos Idreos:
How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice. 173:1-173:25 - Gaurav Tarlok Kakkar, Jiashen Cao, Aubhro Sengupta, Joy Arulraj, Hyesoon Kim:
Aero: Adaptive Query Processing of ML Queries. 174:1-174:27 - Haoxian Chen, Wenfei Fan, Jiaye Zheng:
Incremental Rule Discovery in Response to Parameter Updates. 175:1-175:28 - Yalong Zhang, Rong-Hua Li, Longlong Lin, Qi Zhang, Lu Qin, Guoren Wang:
Integral Densest Subgraph Search on Directed Graphs. 176:1-176:26 - Shangqi Lu, Ru Wang, Yufei Tao:
Interactive Graph Search Made Simple. 177:1-177:25 - Xukang Zhang, Huanchen Zhang, Xiaofeng Meng:
Intra-Query Runtime Elasticity for Cloud-Native Data Analysis. 178:1-178:28 - Jeffrey Tao, Natalie Maus, Haydn Thomas Jones, Yimeng Zeng, Jacob R. Gardner, Ryan Marcus:
Learned Offline Query Planning via Bayesian Optimization. 179:1-179:29 - Kasidis Chanthatrojwong, Sourav S. Bhowmick, Byron Choi:
LICS: Towards Theory-Informed Effective Visual Abstraction of Property Graph Schemas. 180:1-180:26 - Dario Satriani, Enzo Veltri, Donatello Santoro, Sara Rosato, Simone Varriale, Paolo Papotti:
Logical and Physical Optimizations for SQL Query Execution over Large Language Models. 181:1-181:28 - Kaisong Huang, Jiatang Zhou, Zhuoyue Zhao, Dong Xie, Tianzheng Wang:
Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? 182:1-182:25 - Zixuan Yi, Yao Tian, Zachary G. Ives, Ryan Marcus:
Low Rank Learning for Offline Query Optimization. 183:1-183:26 - Haozhe Zhang, Christoph Mayer, Mahmoud Abo Khamis, Dan Olteanu, Dan Suciu:
LpBound: Pessimistic Cardinality Estimation Using ℓp-Norms of Degree Sequences. 184:1-184:27 - Haoyang Li, Fangcheng Fu, Hao Ge, Sheng Lin, Xuanyu Wang, Jiawen Niu, Yujie Wang, Hailin Zhang, Xiaonan Nie, Bin Cui:
Malleus: Straggler-Resilient Hybrid Parallel Training of Large-scale Models via Malleable Data and Model Parallelization. 185:1-185:28 - Zhichao Shi, Youhuan Li, Ziming Li, Yuequn Dou, Xionghu Zhong, Lei Zou:
MatCo: Computing Match Cover of Subgraph Query over Graph Data. 186:1-186:24 - Marko Kabic, Shriram Chandran, Gustavo Alonso:
Maximus: A Modular Accelerated Query Engine for Data Analytics on Heterogeneous Systems. 187:1-187:25 - Sairaj Voruganti, M. Tamer Özsu:
MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search. 188:1-188:27 - Chenyang Zhang, Junxiong Peng, Chen Xu, Quanqing Xu, Chuanhui Yang:
Mitigating the Impedance Mismatch between Prediction Query Execution and Database Engine. 189:1-189:28 - Zichen Zhu, Yanpeng Wei, Ju Hyoung Mun, Manos Athanassoulis:
Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees. 190:1-190:28 - Lam-Duy Nguyen, Adnan Alhomssi, Tobias Ziegler, Viktor Leis:
Moving on From Group Commit: Autonomous Commit Enables High Throughput and Low Latency on NVMe SSDs. 191:1-191:24 - Alice Rey, Maximilian Rieger, Thomas Neumann:
Nested Parquet Is Flat, Why Not Use It? How To Scan Nested Data With On-the-Fly Key Generation and Joins. 192:1-192:24 - Jiachen Shi, Jingyi Yang, Gao Cong, Xiaoli Li:
NEXT: A New Secondary Index Framework for LSM-based Data Storage. 193:1-193:25 - Xiangjin Xie, Guangwei Xu, Lingyan Zhao, Ruijie Guo:
OpenSearch-SQL: Enhancing Text-to-SQL with Dynamic Few-shot and Consistency Alignment. 194:1-194:24 - Youzhe Liu, Xiaojun Dong, Yan Gu, Yihan Sun:
Parallel k-Core Decomposition: Theory and Practice. 195:1-195:27 - Leonardo Kuffó, Elena Krippner, Peter Boncz:
PDX: A Data Layout for Vector Similarity Search. 196:1-196:26 - Yiru Chen, Xupeng Li, Jeffrey Tao, Lana Ramjit, Subrata Mitra, Javad Ghaderi, Ravi Netravali, Aditya G. Parameswaran, Dan Rubenstein, Eugene Wu:
Physical Visualization Design: Decoupling Interface and System Design. 197:1-197:27 - Yuxuan Zhu, Tengjun Jin, Stefanos Baziotis, Chengsong Zhang, Charith Mendis, Daniel D. Kang:
PilotDB: Database-Agnostic Online Approximate Query Processing with A Priori Error Guarantees. 198:1-198:28 - Xianghong Xu, Xiao He, Tieying Zhang, Lei Zhang, Rui Shi, Jianjun Chen:
PLM4NDV: Minimizing Data Access for Number of Distinct Values Estimation with Pre-trained Language Models. 199:1-199:28 - Muhammad Imam Luthfi Balaka, David Alexander, Qiming Wang, Yue Gong, Adila Krisnadhi, Raul Castro Fernandez:
Pneuma: Leveraging LLMs for Tabular Data Representation and Retrieval in an End-to-End System. 200:1-200:28 - Hailin Zhang, Xiaodong Ji, Yilin Chen, Fangcheng Fu, Xupeng Miao, Xiaonan Nie, Weipeng Chen, Bin Cui:
PQCache: Product Quantization-based KVCache for Long Context LLM Inference. 201:1-201:30 - Jianyang Gao, Yutong Gou, Yuexuan Xu, Yongyi Yang, Cheng Long, Raymond Chi-Wing Wong:
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search. 202:1-202:26 - Hong Guan, Lei Yu, Lixi Zhou, Li Xiong, Kanchan Chowdhury, Lulu Xie, Xusheng Xiao, Jia Zou:
Privacy and Accuracy-Aware AI/ML Model Deduplication. 203:1-203:28 - Kuntai Cai, Xiaokui Xiao, Yin Yang:
PrivPetal: Relational Data Synthesis via Permutation Relations. 204:1-204:26 - Liantong Yu, Qingqing Ye, Rong Du:
PrivRM: A Framework for Range Mean Estimation under Local Differential Privacy. 205:1-205:26 - Panagiotis Bouros, Nikos Mamoulis:
Relevance Queries for Interval Data. 206:1-206:26 - Hengrui Wang, Jiansheng Qiu, Fangzhou Yuan, Huanchen Zhang:
Rethinking The Compaction Policies in LSM-trees. 207:1-207:26 - Lingkai Meng, Yu Shao, Long Yuan, Longbin Lai, Peng Cheng, Xue Li, Wenyuan Yu, Wenjie Zhang, Xuemin Lin, Jingren Zhou:
Revisiting Graph Analytics Benchmark. 208:1-208:28 - Minxiao Chen, Haitao Yuan, Nan Jiang, Zhihan Zheng, Sai Wu, Ao Zhou, Shangguang Wang:
RLOMM: An Efficient and Robust Online Map Matching Framework with Reinforcement Learning. 209:1-209:26 - Qiyao Luo, Jianzhe Yu, Wei Dong, Quanqing Xu, Chuanhui Yang, Ke Yi:
RM2: Answer Counting Queries Efficiently under Shuffle Differential Privacy. 210:1-210:24 - Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Wei Ni:
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy. 211:1-211:26 - Anas Ait Aomar, Karima Echihabi, Marco Arnaboldi, Ioannis Alagiannis, Damien Hilloulin, Manal Cherkaoui:
RWalks: Random Walks as Attribute Diffusers for Filtered Vector Search. 212:1-212:26 - Abdul Atif Khan, Rashmi Maheshwari, Mohammad Maksood Akhter, Sraban Kumar Mohanty:
SBSC: A fast Self-tuned Bipartite proximity graph-based Spectral Clustering. 213:1-213:22 - Chenxia Han, Chaokun Chang, Srijan Srivastava, Yao Lu, Eric Lo:
Scalable Complex Event Processing on Video Streams. 214:1-214:29 - Enhao Zhang, Nicole Sullivan, Brandon Haynes, Ranjay Krishna, Magdalena Balazinska:
Self-Enhancing Video Data Management System for Compositional Events with Large Language Models. 215:1-215:29 - Ruiyuan Li, Zechao Chen, Ruyun Lu, Xiaolong Xu, Guangchao Yang, Chao Chen, Jie Bao, Yu Zheng:
Serf: Streaming Error-Bounded Floating-Point Compression. 216:1-216:27 - Viraj Thakkar, Dongha Kim, Yingchun Lai, Hokeun Kim, Zhichao Cao:
SHIELD: Encrypting Persistent Data of LSM-KVS from Monolithic to Disaggregated Storage. 217:1-217:28 - Mehmet Aytimur, Theodoros Chondrogiannis, Michael Grossniklaus:
SPACE: Cardinality Estimation for Path Queries Using Cardinality-Aware Sequence-based Learning. 218:1-218:26 - Saehan Jo, Immanuel Trummer:
SpareLLM: Automatically Selecting Task-Specific Minimum-Cost Large Language Models under Equivalence Constraint. 219:1-219:26 - Fan Yang, John Paparrizos:
SPARTAN: Data-Adaptive Symbolic Time-Series Approximation. 220:1-220:30 - Jakob Bach:
Subgroup Discovery with Small and Alternative Feature Sets. 221:1-221:27 - Steven Purtzel, Matthias Weidlich:
SuSe: Summary Selection for Regular Expression Subsequence Aggregation over Streams. 222:1-222:27 - Zhen Song, Yu Gu, Tianyi Li, Yushuai Li, Qing Sun, Yanfeng Zhang, Christian S. Jensen, Ge Yu:
SWASH: A Flexible Communication Framework with Sliding Window-Based Cache Sharing for Scalable DGNN Training. 223:1-223:26 - Wenqi Jiang, Oleh-Yevhen Khavrona, Martin Parvanov, Gustavo Alonso:
SwiftSpatial: Spatial Joins on Modern Hardware. 224:1-224:27 - Zhuoxing Zhang, Sebastian Link:
Synthesizing Third Normal Form Schemata that Minimize Integrity Maintenance and Update Overheads: Parameterizing 3NF by the Numbers of Minimal Keys and Functional Dependencies. 225:1-225:25 - Kyriakos Psarakis, George Christodoulou, Georgios Siachamis, Marios Fragkoulis, Asterios Katsifodimos:
Styx: Transactional Stateful Functions on Streaming Dataflows. 226:1-226:28 - Maximilian Rieger, Thomas Neumann:
T3: Accurate and Fast Performance Prediction for Relational Database Systems With Compiled Decision Trees. 227:1-227:27 - Francesco Pugnaloni, Luca Zecchini, Matteo Paganelli, Matteo Lissandrini, Felix Naumann, Giovanni Simonini:
Table Overlap Estimation through Graph Embeddings. 228:1-228:25 - Hafiz Tayyab Rauf, André Freitas, Norman W. Paton:
TableDC: Deep Clustering for Tabular Data. 229:1-229:28 - Jingyu Zhu, Weiwei Deng, Yu Sun, Shaoxu Song, Haiwei Zhang, Xiaojie Yuan:
The Best of Both Worlds: On Repairing Timestamps and Attribute Values for Multivariate Time Series. 230:1-230:27 - Yuhao Deng, Chengliang Chai, Kaisen Jin, Linan Zheng, Lei Cao, Ye Yuan, Guoren Wang:
Two Birds with One Stone: Efficient Deep Learning over Mislabeled Data through Subset Selection. 231:1-231:28 - Suchit Gupte, John Paparrizos:
Understanding the Black Box: A Deep Empirical Dive into Shapley Value Approximations for Tabular Data. 232:1-232:31 - Zilu Tian, Dan Olteanu, Christoph Koch:
Using Process Calculus for Optimizing Data and Computation Sharing in Complex Stateful Parallel Computations. 233:1-233:28 - Yuan Sui, Xiaochun Yang, Bin Wang, Yujie Zhang, Baihua Zheng:
Wait and See: A Delayed Transactions Partitioning Approach in Deterministic Database Systems for Better Performance. 234:1-234:27 - Qichen Wang, Bingnan Chen, Binyang Dai, Ke Yi, Feifei Li, Liang Lin:
Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees. 235:1-235:28 - Yuvaraj Chesetti, Benwei Shi, Jeff M. Phillips, Prashant Pandey:
Zombie Hashing: Reanimating Tombstones in Graveyard. 236:1-236:27
Volume 3, Number 4, September 2025
SIGMOD Conference 2026
- Carsten Binnig, Sudeepa Roy, Divyakant Agrawal:
PACMMOD V3, N4 (SIGMOD), September 2025: Editorial. 237:1-237:2 - Ningyi Liao, Haoyu Liu, Zulun Zhu, Siqiang Luo, Laks V. S. Lakshmanan:
A Comprehensive Benchmark on Spectral GNNs: The Impact on Efficiency, Memory, and Effectiveness. 238:1-238:29 - Zhicheng Li, Pinghui Wang, Zeli Lin, Bichun Chen, Dongdong Xie:
A Fast, Mergeable, and LDP Compatible Sketch for Counting the Number of Distinct Values in Fully Dynamic Tables. 239:1-239:27 - Yihao Zheng, Jinfei Liu, Kui Ren, Li Xiong:
B2Mark: A Blind and Buyer-Traceable Watermarking Scheme for Tabular Datasets. 240:1-240:26 - Zhijie Zhang, Weiguo Zheng:
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching. 241:1-241:27 - Manos Chatzakis, Yannis Papakonstantinou, Themis Palpanas:
DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search. 242:1-242:26 - Amir Gilad, Tova Milo, Kathy Razmadze, Ron Zadicario:
Differentially Private Explanations for Clusters. 243:1-243:27 - Yinzhao Yan, Raymond Chi-Wing Wong:
Efficient Proximity Queries on Simplified Height Maps. 244:1-244:26 - Xinyu Zeng, Ruijun Meng, Martin Prammer, Wes McKinney, Jignesh M. Patel, Andrew Pavlo, Huanchen Zhang:
F3: The Open-Source Data File Format for the Future. 245:1-245:27 - Christian Rauch, Panagiotis Bouros:
Fast Indexing for Temporal Information Retrieval. 246:1-246:28 - Pavel Sulimov, Claude Lehmann, Kurt Stockinger:
GenJoin: Conditional Generative Plan-to-Plan Query Optimizer that Learns from Subplan Hints. 247:1-247:25 - Pingchuan Ma, Zhaoyu Wang, Zhenlan Ji, Zongjie Li, Ao Sun, Shuai Wang:
Guardrail: Automated Integrity Constraint Synthesis From Noisy Data. 248:1-248:26 - Qian Xu, Feng Zhang, Chengxi Li, Lei Cao, Zheng Chen, Jidong Zhai, Xiaoyong Du:
HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search. 249:1-249:28 - Yuhang Li, Rong Gu, Chengying Huan, Zhibin Wang, Renjie Yao, Chen Tian, Guihai Chen:
HotPrefix: Hotness-Aware KV Cache Scheduling for Efficient Prefix Sharing in LLM Inference Systems. 250:1-250:27 - Feifan Liu, Rong Gu, Meng Li, Haipeng Dai, Baohan Wang, Jie Tao, Dian Shen:
Hourglass: An Adaptive Range Filter with Lightweight Hybrid Encoding. 251:1-251:26 - Jiajie Fu, Haitong Tang, Arijit Khan, Sharad Mehrotra, Xiangyu Ke, Yunjun Gao:
In-context Clustering-based Entity Resolution with Large Language Models: A Design Space Exploration. 252:1-252:28 - Manuel Schönberger, Immanuel Trummer, Wolfgang Mauerer:
Large-Scale Multiple Query Optimisation with Incremental Quantum(-Inspired) Annealing. 253:1-253:25 - Masaya Yamada, Hiroyuki Kitagawa, Salman Ahmed Shaikh, Toshiyuki Amagasa, Akiyoshi Matono:
LPStream: Fine-grained Lazy Provenance for Stream Processing. 254:1-254:25 - Wenjie Hu, Guanzhou Hu, Mahesh Balakrishnan, Xiangyao Yu:
Marlin: Efficient Coordination for Autoscaling Cloud DBMS. 255:1-255:28 - Jiahui Chen, Yu Sun, Shaoxu Song, Haiwei Zhang, Xiaojie Yuan:
Minimum Change≠ Best Cleaning: Parallel and Incremental Error Detection under Integrity Constraints. 256:1-256:26 - Chunyu Cao, Xin Ai, Qiange Wang, Yanfeng Zhang, Zhenbo Fu, Hao Yuan, Mingyi Cao, Chaoyi Chen, Yingyou Wen, Yu Gu, Ge Yu:
NeutronHeter: Optimizing Distributed Graph Neural Network Training for Heterogeneous Clusters. 257:1-257:29 - Junjie Zhou, Meihao Liao, Rong-Hua Li, Longlong Lin, Guoren Wang:
One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor. 258:1-258:26 - Shenglin Chen, Wenfei Fan, Ruochun Jin:
Outliers: The Good, the Bad and the Ugly. 259:1-259:30 - Haoze Song, Xusheng Chen, Ruijie Gong, Zekai Sun, Tianxiang Shen, Cheng Li, Hao Feng, Sen Wang, Heming Cui:
Perseus: Achieving Strong Consistency and High Data Freshness for Scalable Geo-distributed HTAP. 260:1-260:29 - Hao Duan, Yitong Song, Bin Yao, Anqi Liang:
PGTuner: An Efficient Framework for Automatic and Transferable Configuration Tuning of Proximity Graphs. 261:1-261:27 - Kecheng Luo, Ruiyang Ma, Peng Cai:
Rainbow: Risk-aware Index Benefit Estimation Facing Out Of Distribution Workloads. 262:1-262:25 - Yue Zeng, Miao Qiao, Rong-Hua Li, Hongchao Qin, Guoren Wang:
Scaling Up k-Clique Percolation Community Detection. 263:1-263:27 - Shishi Zhang, Yaping Xu, Lu Tang:
SieveSketch: A Fine-grained and Adaptive Sketch Framework for Accurate Frequency Estimation. 264:1-264:25 - Yirui Zhan, Wen Nie, Jun Gao:
SSCard: Substring Cardinality Estimation using Suffix Tree-Guided Learned FM-Index. 265:1-265:24 - Rui Guo, Zezhong Ding, Xike Xie, Jianliang Xu:
SWIFT: Enabling Large-Scale Temporal Graph Learning on a Single Machine. 266:1-266:27 - Ties Robroek, Neil Kim Nielsen, Pinar Tözün:
TensorSocket: Shared Data Loading for Deep Learning Training. 267:1-267:26 - Zijing Yin, Si Liu, David A. Basin:
Testing Graph Databases with Synthesized Queries. 268:1-268:26 - Xiaowei Ye, Rong-Hua Li, Guoren Wang:
The Power of Core Clique Removal for Exact Clique Enumeration. 269:1-269:27 - Yuanhui Luo, Minhui Xie, Yiheng Tong, Shichao Jiang, Yunpeng Chai:
Understanding Robustness Issues of Updatable Learned Indexes: [Experiments & Analysis]. 270:1-270:25 - Jingyi Xi, Chenghao Mo, Ben Karsin, Artem M. Chirkin, Mingqin Li, Minjia Zhang:
VecFlow: A High-Performance Vector Data Management System for Filtered-Search on GPUs. 271:1-271:27
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-16 23:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
