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
- 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
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-04-22 21:05 CEST 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:
