default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProceedings of the ACM on Management of Data, Volume 2
Volume 2, Number 1, February 2024
SIGMOD Conference 2024
- Divy Agrawal
, Alexandra Meliou, S. Sudarshan:
PACMMOD Volume 2 Issue 1: Editorial. 1:1-1:2 - David C. Y. Chu, Rithvik Panchapakesan, Shadaj Laddad, Lucky E. Katahanas, Chris Liu, Kaushik Shivakumar, Natacha Crooks, Joseph M. Hellerstein, Heidi Howard:
Optimizing Distributed Protocols with Query Rewrites. 2:1-2:25 - Marco Costa, Paolo Ferragina, Giorgio Vinciguerra:
Grafite: Taming Adversarial Queries with Optimal Range Filters. 3:1-3:23 - Jinyang Liu, Sheng Di, Kai Zhao, Xin Liang, Sian Jin, Zizhe Jian, Jiajun Huang, Shixun Wu, Zizhong Chen, Franck Cappello:
High-performance Effective Scientific Error-bounded Lossy Compression with Auto-tuned Multi-component Interpolation. 4:1-4:27 - Siyuan Zhang, Zhenying He, Yinan Jing, Kai Zhang, X. Sean Wang:
MWP: Multi-Window Parallel Evaluation of Regular Path Queries on Streaming Graphs. 5:1-5:26 - Yinzhao Yan, Raymond Chi-Wing Wong:
Proximity Queries on Point Clouds using Rapid Construction Path Oracle. 6:1-6:26 - Kaixin Wang, Kaiqiang Yu, Cheng Long:
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy. 7:1-7:26 - Shuai An, Yang Cao:
Relative Keys: Putting Feature Explanation into Context. 8:1-8:28 - Si Liu, Luca Multazzu, Hengfeng Wei, David A. Basin:
NOC-NOC: Towards Performance-optimal Distributed Transactions. 9:1-9:25 - Yihang Zheng, Chen Lin, Xian Lyu, Xuanhe Zhou, Guoliang Li, Tianqing Wang:
Robustness of Updatable Learning-based Index Advisors against Poisoning Attack. V2mod010:1-V2mod010:26 - Xinyi Zhang, Qichen Wang, Cheng Xu, Yun Peng, Jianliang Xu:
FedKNN: Secure Federated k-Nearest Neighbor Search. V2mod011:1-V2mod011:26 - Haojie Ji, Kun Xie, Jigang Wen, Qingyi Zhang, Gaogang Xie, Wei Liang:
FineMon: An Innovative Adaptive Network Telemetry Scheme for Fine-Grained, Multi-Metric Data Monitoring with Dynamic Frequency Adjustment and Enhanced Data Recovery. V2mod012:1-V2mod012:26 - Xianzhi Zeng, Shuhao Zhang, Hongbin Zhong, Hao Zhang, Mian Lu, Zhao Zheng, Yuqiang Chen:
PECJ: Stream Window Join on Disorder Data Streams with Proactive Error Compensation. V2mod013:1-V2mod013:24 - Mengzhao Wang, Weizhi Xu, Xiaomeng Yi, Songlin Wu, Zhangyang Peng, Xiangyu Ke, Yunjun Gao, Xiaoliang Xu, Rentong Guo, Charles Xie:
Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment. V2mod014:1-V2mod014:27 - Yingze Li, Hongzhi Wang, Xianglong Liu:
One Seed, Two Birds: A Unified Learned Structure for Exact and Approximate Counting. 15:1-15:26 - Amir Shaikhha, Dan Suciu, Maximilian Schleich, Hung Q. Ngo:
Optimizing Nested Recursive Queries. 16:1-16:27 - Yesdaulet Izenov, Asoke Datta, Brian Tsan, Florin Rusu:
Sub-optimal Join Order Identification with L1-error. 17:1-17:24 - Yasuhiro Fujiwara, Atsutoshi Kumagai, Yasutoshi Ida, Masahiro Nakano, Makoto Nakatsuji, Akisato Kimura:
Efficient Algorithm for K-Multiple-Means. 18:1-18:26 - Yanchao Xu, Dongxiang Zhang, Shuhao Zhang, Sai Wu, Zexu Feng, Gang Chen:
Predictive and Near-Optimal Sampling for View Materialization in Video Databases. 19:1-19:27 - George Christodoulou, Panagiotis Bouros, Nikos Mamoulis:
LIT: Lightning-fast In-memory Temporal Indexing. 20:1-20:27 - Junran Yang, Hyekang Kevin Joo, Sai S. Yerramreddy, Dominik Moritz, Leilani Battle:
Optimizing Dataflow Systems for Scalable Interactive Visualization. 21:1-21:25 - Yuanyuan Zeng, Yixiang Fang, Chenhao Ma, Xu Zhou, Kenli Li:
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs. 22:1-22:25 - Renchi Yang, Jieming Shi:
Efficient High-Quality Clustering for Large Bipartite Graphs. 23:1-23:27 - Arash Dargahi Nobari, Davood Rafiei:
DTT: An Example-Driven Tabular Transformer for Joinability by Leveraging Large Language Models. 24:1-24:24 - Ziling Chen, Haoquan Guan, Shaoxu Song, Xiangdong Huang, Chen Wang, Jianmin Wang:
Determining Exact Quantiles with Randomized Summaries. 25:1-25:26 - Pinghui Wang, Yitong Liu, Zhicheng Li, Rundong Li:
An LDP Compatible Sketch for Securely Approximating Set Intersection Cardinalities. 26:1-26:27 - Jifan Shi, Biao Wang, Yun Xu:
Spruce: a Fast yet Space-saving Structure for Dynamic Graph Storage. 27:1-27:26 - Tongyu Liu, Ju Fan, Nan Tang, Guoliang Li, Xiaoyong Du:
Controllable Tabular Data Synthesis Using Diffusion Models. 28:1-28:29 - Boyu Yang, Weiguo Zheng, Xiang Lian, Yuzheng Cai, X. Sean Wang:
HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs. 29:1-29:25 - Xiaochen Li, Weiran Liu, Jian Lou, Yuan Hong, Lei Zhang, Zhan Qin, Kui Ren:
Local Differentially Private Heavy Hitter Detection in Data Streams with Bounded Memory. 30:1-30:27 - Xiangpeng Hao, Xinjing Zhou, Xiangyao Yu, Michael Stonebraker:
Towards Buffer Management with Tiered Main Memory. 31:1-31:26 - Jessica Shi, Laxman Dhulipala, Julian Shun:
Parallel Algorithms for Hierarchical Nucleus Decomposition. 32:1-32:27 - Chang Ye, Yuchen Li, Shixuan Sun, Wentian Guo:
gSWORD: GPU-accelerated Sampling for Subgraph Counting. 33:1-33:26 - Juanru Fang, Ke Yi:
Privacy Amplification by Sampling under User-level Differential Privacy. 34:1-34:26 - Lei Rui, Xiangdong Huang, Shaoxu Song, Yuyuan Kang, Chen Wang, Jianmin Wang:
Time Series Representation for Visualization in Apache IoTDB. 35:1-35:26 - Matthias Jasny, Lasse Thostrup, Sajjad Tamimi, Andreas Koch, Zsolt István, Carsten Binnig:
Zero-sided RDMA: Network-driven Data Shuffling for Disaggregated Heterogeneous Cloud DBMSs. 36:1-36:28 - Jintao Zhang, Chao Zhang, Guoliang Li, Chengliang Chai:
PACE: Poisoning Attacks on Learned Cardinality Estimation. 37:1-37:27 - Peizhi Wu, Zachary G. Ives:
Modeling Shifting Workloads for Learned Database Systems. 38:1-38:27 - Diego Arroyuelo, Benjamin Bustos, Adrián Gómez-Brandón, Aidan Hogan, Gonzalo Navarro, Juan L. Reutter:
Worst-Case-Optimal Similarity Joins on Graph Databases. 39:1-39:26 - Tingyang Chen, Dazhuo Qiu, Yinghui Wu, Arijit Khan, Xiangyu Ke, Yunjun Gao:
View-based Explanations for Graph Neural Networks. 40:1-40:27 - Liang Liang, Guang Yang, Ali Hadian, Luis Alberto Croquevielle, Thomas Heinis:
SWIX: A Memory-efficient Sliding Window Learned Index. 41:1-41:26 - Kyoseung Koo, Sohyun Kim, Wonhyeon Kim, Yoojin Choi, Juhee Han, Bogyeong Kim, Bongki Moon:
PreVision: An Out-of-Core Matrix Computation System with Optimal Buffer Replacement. 42:1-42:25 - Tobias Bleifuß, Thorsten Papenbrock, Thomas Bläsius, Martin Schirneck, Felix Naumann:
Discovering Functional Dependencies through Hitting Set Enumeration. 43:1-43:24 - Tim Schwabe, Maribel Acosta:
Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks. 44:1-44:26 - Kyoungmin Kim, Sangoh Lee, Injung Kim, Wook-Shin Han:
ASM: Harmonizing Autoregressive Model, Sampling, and Multi-dimensional Statistics Merging for Cardinality Estimation. 45:1-45:27 - Yiming Lin, Sharad Mehrotra:
PLAQUE: Automated Predicate Learning at Query Time. 46:1-46:25 - Subarna Chatterjee, Mark F. Pekala, Lev Kruglyak, Stratos Idreos:
Limousine: Blending Learned and Classical Indexes to Self-Design Larger-than-Memory Cloud Storage Engines. 47:1-47:28 - Luca Zecchini, Tobias Bleifuß, Giovanni Simonini, Sonia Bergamaschi, Felix Naumann:
Determining the Largest Overlap between Tables. 48:1-48:26 - Meghdad Kurmanji, Eleni Triantafillou, Peter Triantafillou:
Machine Unlearning in Learned Databases: An Experimental Analysis. 49:1-49:26 - Matteo Brucato, Tarique Siddiqui, Wentao Wu, Vivek R. Narasayya, Surajit Chaudhuri:
Wred: Workload Reduction for Scalable Index Tuning. 50:1-50:26 - Hailin Zhang, Zirui Liu, Boxuan Chen, Yikai Zhao, Tong Zhao, Tong Yang, Bin Cui:
CAFE: Towards Compact, Adaptive, and Fast Embedding for Large-scale Recommendation Models. 51:1-51:28 - Utku Sirin, Stratos Idreos:
The Image Calculator: 10x Faster Image-AI Inference by Replacing JPEG with Self-designing Storage Format. 52:1-52:31 - Hanxian Huang, Tarique Siddiqui, Rana Alotaibi, Carlo Curino, Jyoti Leeka, Alekh Jindal, Jishen Zhao, Jesús Camacho-Rodríguez, Yuanyuan Tian:
Sibyl: Forecasting Time-Evolving Query Workloads. 53:1-53:27 - Mehmet Aytimur, Silvan Reiner, Leonard Wörteler, Theodoros Chondrogiannis, Michael Grossniklaus:
LPLM: A Neural Language Model for Cardinality Estimation of LIKE-Queries. 54:1-54:25 - Tiemo Bang, Chris Douglas, Natacha Crooks, Joseph M. Hellerstein:
SkyPIE: A Fast & Accurate Oracle for Object Placement. 55:1-55:27 - Xuan Luo, Jian Pei, Cheng Xu, Wenjie Zhang, Jianliang Xu:
Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games. 56:1-56:28 - Yiyuan Chen, Shimin Chen:
Cabin: A Compressed Adaptive Binned Scan Index. 57:1-57:26 - Stefanos Baziotis, Daniel D. Kang, Charith Mendis:
Dias: Dynamic Rewriting of Pandas Code. 58:1-58:27 - Jesús Camacho-Rodríguez, Ashvin Agrawal, Anja Gruenheid, Ashit Gosalia, Cristian Petculescu, Josep Aguilar-Saborit, Avrilia Floratou, Carlo Curino, Raghu Ramakrishnan:
LST-Bench: Benchmarking Log-Structured Tables in the Cloud. 59:1-59:26 - Zhijie Zhang, Yujie Lu, Weiguo Zheng, Xuemin Lin:
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction. 60:1-60:29 - Wolfgang Gatterbauer, Cody Dunne:
On The Reasonable Effectiveness of Relational Diagrams: Explaining Relational Query Patterns and the Pattern Expressiveness of Relational Languages. 61:1-61:27 - Jiaming Liang, Lei Cao, Samuel Madden, Zack Ives, Guoliang Li:
RITA: Group Attention is All You Need for Timeseries Analytics. 62:1-62:28 - Lijun Chang, Kai Yao:
Maximum k-Plex Computation: Theory and Practice. 63:1-63:26 - Gansen Hu, Zhaoguo Wang, Chuzhe Tang, Jiahuan Shen, Zhiyuan Dong, Sheng Yao, Haibo Chen:
WeBridge: Synthesizing Stored Procedures for Large-Scale Real-World Web Applications. 64:1-64:29 - Yihao Liu, Xinyu Zeng, Huanchen Zhang:
LeCo: Lightweight Compression via Learning Serial Correlations. 65:1-65:28 - Brian Tsan, Asoke Datta, Yesdaulet Izenov, Florin Rusu:
Approximate Sketches. 66:1-66:24 - Wonseok Lee, Jaehyun Ha, Wook-Shin Han, Changgyoo Park, Myunggon Park, Juhyeng Han, Juchang Lee:
DoppelGanger++: Towards Fast Dependency Graph Generation for Database Replay. 67:1-67:26 - Jingzhi Fang, Yanyan Shen, Yue Wang, Lei Chen:
STile: Searching Hybrid Sparse Formats for Sparse Deep Learning Operators Automatically. 68:1-68:26 - Chaoji Zuo, Miao Qiao, Wenchao Zhou, Feifei Li, Dong Deng:
SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search. 69:1-69:26 - Massimo Perini, Milos Nikolic:
In-Database Data Imputation. 70:1-70:27 - Brit Youngmann, Michael J. Cafarella, Amir Gilad, Sudeepa Roy:
Summarized Causal Explanations For Aggregate Views. 71:1-71:27 - Roni Copul, Nave Frost, Tova Milo, Kathy Razmadze:
TabEE: Tabular Embeddings Explanations. 72:1-72:26
Volume 2, Number 2, May 2024
PODS 2024
- Floris Geerts, Wim Martens, Matthias Niewerth:
PACMMOD Volume 2 Issue 2: Editorial. 73 - Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo:
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join. 74 - Hangdong Zhao, Austen Z. Fan, Xiating Ouyang, Paraschos Koutris:
Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization. 75 - Paraschos Koutris, Xiating Ouyang, Jef Wijsen:
Consistent Query Answering for Primary Keys on Rooted Tree Queries. 76 - Víctor Gutiérrez-Basulto, Albert Gutowski, Yazmín Angélica Ibáñez-García, Filip Murlak:
Containment of Graph Queries Modulo Schema. 77 - Markus Lohrey, Markus L. Schmid:
Enumeration for MSO-Queries on Compressed Trees. 78 - Ahmet Kara, Dan Olteanu, Dan Suciu:
From Shapley Value to Model Counting and Back. 79 - Sam M. Thompson, Dominik D. Freydenberger:
Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraïssé Games for FC. 80 - Pankaj K. Agarwal, Xiao Hu, Stavros Sintos, Jun Yang:
On Reporting Durable Patterns in Temporal Proximity Graphs. 81 - Rajesh Jayaram, David P. Woodruff, Samson Zhou:
Streaming Algorithms with Few State Changes. 82 - Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider:
The Complexity of Why-Provenance for Datalog Queries. 83 - Peter Lindner, Sachin Basil John, Christoph Koch, Dan Suciu:
The Moments Method for Approximate Data Cube Queries. 84 - Yu Cheng, Max Li, Honghao Lin, Zi-Yi Tai, David P. Woodruff, Jason Zhang:
Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut. 85 - Andreas Göbel, Leslie Ann Goldberg, Marc Roth:
The Weisfeiler-Leman Dimension of Conjunctive Queries. 86 - Austen Z. Fan, Paraschos Koutris, Hangdong Zhao:
Tight Bounds of Circuits for Sum-Product Queries. 87 - Yizhou Dai, Miao Qiao, Rong-Hua Li:
On Density-based Local Community Search. 88 - C. Aiswarya, Diego Calvanese, Francesco Di Cosmo, Marco Montali:
Verification of Unary Communicating Datalog Programs. 89 - Hangdong Zhao, Shaleen Deep, Paraschos Koutris, Sudeepa Roy, Val Tannen:
Evaluating Datalog over Semirings: A Grounding-based Approach. 90 - Brecht Vandevoort, Bas Ketsman, Frank Neven:
When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control. 91 - Pratik Karmakar, Mikaël Monet, Pierre Senellart, Stéphane Bressan:
Expected Shapley-Like Scores of Boolean functions: Complexity and Applications to Probabilistic Databases. 92 - Philipp Hanisch, Markus Krötzsch:
Chase Termination Beyond Polynomial Time. 93 - Mark Bun, Marco Gaboardi, Marcel Neunhoeffer, Wanrong Zhang:
Continual Release of Differentially Private Synthetic Data from Longitudinal Data Collections. 94 - Bart Bogaerts, Maxime Jakubowski, Jan Van den Bussche:
Postulates for Provenance: Instance-based provenance for first-order logic. 95 - Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu, Dan Suciu:
Join Size Bounds using lp-Norms on Degree Sequences. 96 - Xiao Hu, Paraschos Koutris:
Topology-aware Parallel Joins. 97 - Xiao Hu:
Fast Matrix Multiplication for Query Processing. 98 - Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider:
Combined Approximations for Uniform Operational Consistent Query Answering. 99 - Claire David, Nadime Francis, Victor Marsault:
Distinct Shortest Walk Enumeration for RPQs. 100 - Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul:
Layered List Labeling. 101 - Aduri Pavan, Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel:
On the Feasibility of Forgetting in Data Streams. 102 - Jerzy Marcinkowski, Mateusz Orda:
Bag Semantics Conjunctive Query Containment. Four Small Steps Towards Undecidability. 103 - Neha Makhija, Wolfgang Gatterbauer:
Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries. 104 - Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade:
When is Shapley Value Computation a Matter of Counting? 105 - Christoph Koch, Peter Lindner:
Query Optimization by Quantifier Elimination. 106 - Albert Atserias, Phokion G. Kolaitis:
Consistency of Relations over Monoids. 107 - Michael A. Bender, Martín Farach-Colton, Michael T. Goodrich, Hanna Komlós:
History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures. 108 - Elena Gribelyuk, Pachara Sawettamalya, Hongxun Wu, Huacheng Yu:
Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald. 109 - Christoph Dorn, Haikal Pribadi:
TypeQL: A Type-Theoretic & Polymorphic Query Language. 110 - Kuldeep S. Meel, Sourav Chakraborty, Umang Mathur:
A faster FPRAS for #NFA. 112 - Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity. 113
Volume 2, Number 3, June 2024
SIGMOD Conference 2024
- Divyakant Agrawal, Alexandra Meliou, S. Sudarshan:
PACMMOD Volume 2 Issue 3: Editorial. 114 - Yang Wu, Yao Wan, Hongyu Zhang, Yulei Sui, Wucai Wei, Wei Zhao, Guandong Xu, Hai Jin:
Automated Data Visualization from Natural Language via Large Language Models: An Exploratory Study. 115 - Minguk Choi, Seehwan Yoo, Jongmoo Choi:
Can Learned Indexes be Built Efficiently? A Deep Dive into Sampling Trade-offs. 116 - Jianwei Wang, Ying Zhang, Kai Wang, Xuemin Lin, Wenjie Zhang:
Missing Data Imputation with Uncertainty-Driven Network. 117 - Binyang Dai, Xiao Hu, Ke Yi:
Reservoir Sampling over Joins. 118 - Yingli Zhou, Qingshuo Guo, Yixiang Fang, Chenhao Ma:
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery. 119 - Liana Patel, Peter Kraft, Carlos Guestrin, Matei Zaharia:
ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data. 120 - Xiaoyu Han, Haoran Xiong, Zhenying He, Peng Wang, Chen Wang, X. Sean Wang:
Akane: Perplexity-Guided Time Series Data Cleaning. 121 - Sibei Chen, Yeye He, Weiwei Cui, Ju Fan, Song Ge, Haidong Zhang, Dongmei Zhang, Surajit Chaudhuri:
Auto-Formula: Recommend Formulas in Spreadsheets using Contrastive Learning for Table Representations. 122 - Omer Abramovich, Daniel Deutch, Nave Frost, Ahmet Kara, Dan Olteanu:
Banzhaf Values for Facts in Query Answering. 123 - Qiaolin Yu, Chang Guo, Jay Zhuang, Viraj Thakkar, Jianguo Wang, Zhichao Cao:
CaaS-LSM: Compaction-as-a-Service for LSM-based Key-Value Stores in Storage Disaggregated Infrastructure. 124 - Tarikul Islam Papon, Taishan Chen, Shuo Zhang, Manos Athanassoulis:
CAVE: Concurrency-Aware Graph Processing on SSDs. 125 - Cheng Zhen, Nischal Aryal, Arash Termehchy, Amandeep Singh Chabada:
Certain and Approximately Certain Models for Statistical Learning. 126 - Haoyang Li, Jing Zhang, Hanbing Liu, Ju Fan, Xiaokang Zhang, Jun Zhu, Renjie Wei, Hongyan Pan, Cuiping Li, Hong Chen:
CodeS: Towards Building Open-source Language Models for Text-to-SQL. 127 - Wei Dong, Zijun Chen, Qiyao Luo, Elaine Shi, Ke Yi:
Continual Observation of Joins under Differential Privacy. 128 - Mike Heddes, Igor Nunes, Tony Givargis, Alex Nicolau:
Convolution and Cross-Correlation of Count Sketches Enables Fast Cardinality Estimation of Multi-Join Queries. 129 - Shuai An, Yang Cao:
Counterfactual Explanation at Will, with Zero Privacy Leakage. 130 - Yifan Li, Xiaohui Yu, Nick Koudas:
Data Acquisition for Improving Model Confidence. 131 - Samira Akili, Steven Purtzel, Matthias Weidlich:
DecoPa: Query Decomposition for Parallel Complex Event Processing. 132 - Meihao Liao, Junjie Zhou, Rong-Hua Li, Qiangqiang Dai, Hongyang Chen, Guoren Wang:
Efficient and Provable Effective Resistance Computation on Large Graphs: An Index-based Approach. 133 - Haisong Xia, Zhongzhi Zhang:
Efficient Approximation of Kemeny's Constant for Large Graphs. 134 - Qiangqiang Dai, Rong-Hua Li, Donghang Cui, Meihao Liao, Yu-Xuan Qiu, Guoren Wang:
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee. 135 - Nima Shahbazi, Stavros Sintos, Abolfazl Asudeh:
FairHash: A Fair and Memory/Time-efficient Hashmap. 136 - Yash Kurkure, Miles Shamo, Joseph Wiseman, Sainyam Galhotra, Stavros Sintos:
Faster Algorithms for Fair Max-Min Diversification in Rd. 137 - Anastasiia Kozar, Bonaventura Del Monte, Steffen Zeuch, Volker Markl:
Fault Tolerance Placement in the Internet of Things. 138 - Tianping Zhang, Zhaoyang Wang, Chen Qian, Jian Li, Yin Lou:
FeatureLTE: Learning to Estimate Feature Importance. 139 - Deming Chu, Fan Zhang, Wenjie Zhang, Ying Zhang, Xuemin Lin:
Graph Summarization: Compactness Meets Efficiency. 140 - Hengrui Wang, Te Guo, Junzhao Yang, Huanchen Zhang:
GRF: A Global Range Filter for LSM-Trees with Shape Encoding. 141 - Yifan Zhu, Ruiyao Ma, Baihua Zheng, Xiangyu Ke, Lu Chen, Yunjun Gao:
GTS: GPU-based Tree Index for Fast Similarity Search. 142 - Jingyu Zhu, Yu Sun, Shaoxu Song, Xiaojie Yuan:
High Precision ≠ High Cost: Temporal Data Fusion for Multiple Low-Precision Sensors. 143 - Anran Li, Yuanyuan Chen, Jian Zhang, Mingfei Cheng, Yihao Huang, Yueming Wu, Anh Tuan Luu, Han Yu:
Historical Embedding-Guided Efficient Large-Scale Federated Graph Learning. 144 - Shunkang Zhang, Ji Qi, Xin Yao, André Brinkmann:
Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction. 145 - Soonbo Han, Zachary G. Ives:
Implementation Strategies for Views over Property Graphs. 146 - Yukyoung Lee, Kyoungmin Kim, Wonseok Lee, Wook-Shin Han:
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework. 147 - Jiajun Li, Runlin Lei, Sibo Wang, Zhewei Wei, Bolin Ding:
Learning-based Property Estimation with Polynomials. 148 - Nick Glaze, Tria McNeely, Yiwen Zhu, Matthew Gleeson, Helen Serr, Rajeev Bhopi, Subru Krishnan:
Lorentz: Learned SKU Recommendation Using Profile Data. 149 - Qihang Wang, Decheng Zuo, Zhan Zhang, Yanjun Shu, Xin Liu, Mingxuan He:
Low-Latency Adaptive Distributed Stream Join System Based on a Flexible Join Model. 150 - Jiaoyi Zhang, Kai Su, Huanchen Zhang:
Making In-Memory Learned Indexes Efficient on Disk. 151 - Yue Pang, Lei Zou, Jeffrey Xu Yu, Linglin Yang:
Materialized View Selection & View-Based Query Planning for Regular Path Queries. 152 - Chengyang Luo, Yifan Zhu, Qing Liu, Yunjun Gao, Lu Chen, Jianliang Xu:
MCR-Tree: An Efficient Index for Multi-dimensional Core Search. 153 - Yue Gong, Sainyam Galhotra, Raul Castro Fernandez:
Nexus: Correlation Discovery over Collections of Spatio-Temporal Tabular Data. 154 - Mo Sha, Yifan Cai, Sheng Wang, Linh Thi Xuan Phan, Feifei Li, Kian-Lee Tan:
Object-oriented Unified Encrypted Memory Management for Heterogeneous Memory Architectures. 155 - Chunxu Lin, Wensheng Luo, Yixiang Fang, Chenhao Ma, Xilin Liu, Yuchi Ma:
On Efficient Large Sparse Matrix Chain Multiplication. 156 - Jingyi Song, Dong Wen, Lantian Xu, Lu Qin, Wenjie Zhang, Xuemin Lin:
On Querying Historical Connectivity in Temporal Graphs. 157 - Albert Kim, Samuel Madden:
Optimizing Disjunctive Queries with Tagged Execution. 158 - Rui Kang, Shaoxu Song:
Optimizing Time Series Queries with Versions. 159 - Alireza Pirhadi, Mohammad Hossein Moslemi, Alexander Cloninger, Mostafa Milani, Babak Salimi:
OTClean: Data Cleaning for Conditional Independence Violations using Optimal Transport. 160 - Shuangyu Cai, Boyu Tian, Huanchen Zhang, Mingyu Gao:
PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware. 161 - Zezhong Ding, Yongan Xiang, Shangyou Wang, Xike Xie, S. Kevin Zhou:
Play like a Vertex: A Stackelberg Game Approach for Streaming Graph Partitioning. 162 - Van-Hoang Le, Hongyu Zhang:
PreLog: A Pre-trained Model for Log Analytics. 163 - Yihao Hu, Amir Gilad, Kristin Stephens-Martinez, Sudeepa Roy, Jun Yang:
Qr-Hint: Actionable Hints Towards Correcting Wrong SQL Queries. 164 - Philipp M. Grulich, Aljoscha P. Lepping, Dwi P. A. Nugroho, Varun Pandey, Bonaventura Del Monte, Steffen Zeuch, Volker Markl:
Query Compilation Without Regrets. 165 - Felix S. Campbell, Alon Silberstein, Julia Stoyanovich, Yuval Moskovitch:
Query Refinement for Diverse Top-k Selection. 166 - Jianyang Gao, Cheng Long:
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search. 167 - Qichen Wang, Qiyao Luo, Yilei Wang:
Relational Algorithms for Top-k Query Evaluation. 168 - Chuqing Gao, Shreya Ballijepalli, Jianguo Wang:
Revisiting B-tree Compression: An Experimental Study. 169 - Ziyun Wei, Immanuel Trummer:
ROME: Robust Query Optimization via Parallel Multi-Plan Execution. 170 - Manuel Widmoser, Daniel Kocher, Nikolaus Augsten:
Scalable Distributed Inverted List Indexes in Disaggregated Memory. 171 - Till Döhmen, Radu Geacu, Madelon Hulsebos, Sebastian Schelter:
SchemaPile: A Large Collection of Relational Database Schemas. 172 - Andrew Draganov, David Saulpic, Chris Schwiegelshohn:
Settling Time vs. Accuracy Tradeoffs for Clustering Big Data. 173 - Shihong Gao, Yiming Li, Xin Zhang, Yanyan Shen, Yingxia Shao, Lei Chen:
SIMPLE: Efficient Temporal Graph Neural Network Training at Scale with Dynamic Data Placement. 174 - Junfeng Liu, Fan Wang, Dingheng Mo, Siqiang Luo:
Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in a Colossal Configuration Space. 175 - Peng Li, Yeye He, Dror Yashar, Weiwei Cui, Song Ge, Haidong Zhang, Danielle Rifinski Fainman, Dongmei Zhang, Surajit Chaudhuri:
Table-GPT: Table Fine-tuned GPT for Diverse Table Tasks. 176 - Curtis E. Dyreson, Amani M. Shatnawi, Sourav S. Bhowmick, Vishal Sharma:
Temporal JSON Keyword Search. 177 - Guanlin Mo, Shihong Song, Hu Ding:
Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms. 178 - Siyuan Yao, Yuchen Li, Shixuan Sun, Jiaxin Jiang, Bingsheng He:
uBlade: Efficient Batch Processing for Uncertainty Graph Queries. 179 - Xi Pang, Jianguo Wang:
Understanding the Performance Implications of the Design Principles in Storage-Disaggregated Databases. 180 - Kaiwen Chen, Nick Koudas:
Unstructured Data Fusion for Schema and Data Extraction. 181 - Xiaoying Wang, Wentao Wu, Chi Wang, Vivek R. Narasayya, Surajit Chaudhuri:
Wii: Dynamic Budget Reallocation In Index Tuning. 182 - Chenguang Zheng, Guanxian Jiang, Xiao Yan, Peiqi Yin, Qihui Zhou, James Cheng:
GE2: A General and Efficient Knowledge Graph Embedding Learning System. 183 - Carlos Bobed Lisbona, Jordi Bernad, Pierre Maillot:
Language-Model Based Informed Partition of Databases to Speed Up Pattern Mining. 184 - Ouael Ben Amara, Sami Hadouaj, Niccolò Meneghetti:
StarfishDB: A Query Execution Engine for Relational Probabilistic Programming. 185 - Saehan Jo, Immanuel Trummer:
ThalamusDB: Approximate Query Processing on Multi-Modal Data. 186 - Yongye Su, Yinqi Sun, Minjia Zhang, Jianguo Wang:
Vexless: A Serverless Vector Data Management System Using Cloud Functions. 187 - Jinsheng Ba, Manuel Rigger:
Keep It Simple: Testing Databases via Differential Query Plans. 188
Volume 2, Number 4, September 2024
SIGMOD Conference 2025
- Divyakant Agrawal, Azza Abouzied, Joseph M. Hellerstein:
PACMMOD Volume 2 Issue 4: Editorial. 189:1-189:2 - Raj Kamal, Amitabha Bagchi:
A Lovász-Simonovits Theorem for Hypergraphs with Application to Local Clustering. 190:1-190:27 - Peng Sun, Liantao Wu, Zhibo Wang, Jinfei Liu, Juan Luo, Wenqiang Jin:
A Profit-Maximizing Data Marketplace with Differentially Private Federated Learning under Price Competition. 191:1-191:27 - Richard Wen, Hunter McCoy, David Tench, Guido Tagliavini, Michael A. Bender, Alex Conway, Martin Farach-Colton, Rob Johnson, Prashant Pandey:
Adaptive Quotient Filters. 192:1-192:28 - Qihui Zhou, Peiqi Yin, Xiao Yan, Changji Li, Guanxian Jiang, James Cheng:
Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching. 193:1-193:29 - Tu Gu, Kaiyu Feng, Jingyi Yang, Gao Cong, Cheng Long, Rui Zhang:
BT-Tree: A Reinforcement Learning Based Index for Big Trajectory Data. 194:1-194:27 - Wenfei Fan, Ziyan Han, Min Xie, Guangyi Zhang:
Discovering Top-k Relevant and Diversified Rules. 195:1-195:28 - Siyue Wu, Dingming Wu, Junyi Quan, Tsz Nam Chan, Kezhong Lu:
Efficient and Accurate PageRank Approximation on Large Graphs. 196:1-196:26 - Chen Feng, Xingguang Chen, Qintian Guo, Fangyuan Zhang, Sibo Wang:
Efficient Approximation Algorithms for Minimum Cost Seed Selection with Probabilistic Coverage Guarantee. 197:1-197:26 - Xilin Tang, Feng Zhang, Shuhao Zhang, Yani Liu, Bingsheng He, Xiaoyong Du:
Enabling Adaptive Sampling for Intra-Window Join: Simultaneously Optimizing Quantity and Quality. 198:1-198:31 - Wei Liu, Wei Zhang, Haiyan Zhao, Zhi Jin:
GABoost: Graph Alignment Boosting via Local Optimum Escape. 199:1-199:26 - Zhencan Peng, Yuheng Zhang, Dong Deng:
Near-Duplicate Text Alignment with One Permutation Hashing. 200:1-200:26 - Yujie Hui, Miao Yu, Hao Qi, Yifan Gan, Tianxi Li, Yuke Li, Xueyuan Ren, Sixiang Ma, Xiaoyi Lu, Yang Wang:
On the Feasibility and Benefits of Extensive Evaluation. 201:1-201:24 - Weiping Yu, Siqiang Luo, Zihao Yu, Gao Cong:
CAMAL: Optimizing LSM-trees via Active Learning. 202:1-202:26 - Lei Ma, Lei Cao, Peter M. VanNostrand, Dennis M. Hofmann, Yao Su, Elke A. Rundensteiner:
Pluto: Sample Selection for Robust Anomaly Detection on Polluted Log Data. 203:1-203:25 - Renzhi Wu, Pramod Chunduri, Ali Payani, Xu Chu, Joy Arulraj, Kexin Rong:
SketchQL: Video Moment Querying with a Visual Query Interface. 204:1-204:27 - Haotian Liu, Runzhong Li, Ziyang Zhang, Bo Tang:
Tao: Improving Resource Utilization while Guaranteeing SLO in Multi-tenant Relational Database-as-a-Service. 205:1-205:26 - Qiangqiang Dai, Ronghua Li, Donghang Cui, Guoren Wang:
Theoretically and Practically Efficient Maximum Defective Clique Search. 206:1-206:27
Volume 2, Number 5, November 2024
PODS 2025
- Nofar Carmeli, Floris Geerts, Benny Kimelfeld:
PACMMOD, V2, N5 (PODS), November 2024 Editorial. 207:1-207:3 - Ari Biswas, Graham Cormode, Yaron Kanza, Divesh Srivastava, Zhengyi Zhou:
Differentially Private Hierarchical Heavy Hitters. 208:1-208:25 - Junhao Gan, Seeun William Umboh, Hanzhi Wang, Anthony Wirth, Zhuo Zhang:
Optimal Dynamic Parameterized Subset Sampling. 209:1-209:26 - Ru Wang, Yufei Tao:
Optimal (Multiway) Spatial Joins. 210:1-210:25 - Marco Calautti, Ester Livshits, Andreas Pieris, Markus Schneider:
Below and Above Why-Provenance for Datalog Queries. 211:1-211:21 - Sainyam Galhotra, Rahul Raychaudhury, Stavros Sintos:
k-Clustering with Comparison and Distance Oracles. 212:1-212:26 - Aryan Esmailpour, Stavros Sintos:
Improved Approximation Algorithms for Relational Clustering. 213:1-213:27 - Yufei Tao, Ru Wang, Shiyuan Deng:
Parallel Communication Obliviousness: One Round and Beyond. 214:1-214:24 - Marcelo Arenas, Timo Camillo Merkl, Reinhard Pichler, Cristian Riveros:
Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue. 215:1-215:26 - Dante Pinto, Cristian Riveros:
Complex Event Recognition meets Hierarchical Conjunctive Queries. 216:1-216:26 - Pankaj K. Agarwal, Aryan Esmailpour, Xiao Hu, Stavros Sintos, Jun Yang:
Computing A Well-Representative Summary of Conjunctive Query Results. 217:1-217:27 - Aziz Amezian El Khalfioui, Jef Wijsen:
Computing Range Consistent Answers to Aggregation Queries via Rewriting. 218:1-218:19 - Mahmoud Abo Khamis, Ahmet Kara, Dan Olteanu, Dan Suciu:
Insert-Only versus Insert-Delete in Dynamic Query Evaluation. 219:1-219:26 - Shaleen Deep, Hangdong Zhao, Austen Z. Fan, Paraschos Koutris:
Output-sensitive Conjunctive Query Evaluation. 220:1-220:24 - Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs. 221:1-221:19 - Pawel Gawrychowski, Florin Manea, Markus L. Schmid:
Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration. 222:1-222:19
Volume 2, Number 6, December 2024
SIGMOD Conference 2025
- Azza Abouzied, Joseph M. Hellerstein, Divyakant Agrawal:
PACMMOD V2, N6 (SIGMOD), December 2024: Editorial. 223:1-223:2 - Liang Zheng, Qingjun Xiao, Xuyuan Cai:
A Universal Sketch for Estimating Heavy Hitters and Per-Element Frequency Moments in Data Streams with Bounded Deletions. 224:1-224:28 - Xiaojia Xu, Haoyu Liu, Xiaowei Lv, Yongcai Wang, Deying Li:
An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery. 225:1-225:26 - Mingzhe Du, Michael L. Scott:
Buffered Persistence in B+ Trees. 226:1-226:24 - Yuanyuan Yao, Lu Chen, Ziquan Fang, Yunjun Gao, Christian S. Jensen, Tianyi Li:
Camel: Efficient Compression of Floating-Point Time Series. 227:1-227:26 - Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang:
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy. 228:1-228:26 - Min Shi, Peng Peng, Xu Zhou, Jiayu Liu, Guoqing Xiao, Kenli Li:
Connectivity-Oriented Property Graph Partitioning for Distributed Graph Pattern Query Processing. 229:1-229:26 - Lantian Xu, Dong Wen, Lu Qin, Ronghua Li, Ying Zhang, Xuemin Lin:
Constant-time Connectivity Querying in Dynamic Graphs. 230:1-230:23 - Haotian Gao, Shaofeng Cai, Tien Tuan Anh Dinh, Zhiyong Huang, Beng Chin Ooi:
CtxPipe: Context-aware Data Preparation Pipeline Construction for Machine Learning. 231:1-231:27 - Paolo Ciaccia, Davide Martinenghi:
Directional Queries: Making Top-k Queries More Effective in Discovering Relevant Results. 232:1-232:26 - Rudi Poepsel Lemaitre, Kaustubh Beedkar, Volker Markl:
Disclosure-Compliant Query Answering. 233:1-233:28 - Mihail Stoian, Andreas Kipf:
DPconv: Super-Polynomially Faster Join Ordering. 234:1-234:26 - Wenjing Deng, Qiuyang Mang, Chengyu Zhang, Manuel Rigger:
Finding Logic Bugs in Spatial Database Engines via Affine Equivalent Inputs. 235:1-235:26 - Mengyi Yan, Yaoshu Wang, Yue Wang, Xiaoye Miao, Jianxin Li:
GIDCL: A Graph-Enhanced Interpretable Data Cleaning Framework with Large Language Models. 236:1-236:29 - Nils Boeschen, Tobias Ziegler, Carsten Binnig:
GOLAP: A GPU-in-Data-Path Architecture for High-Speed OLAP. 237:1-237:26 - Maximilian Kuschewski, Jana Giceva, Thomas Neumann, Viktor Leis:
High-Performance Query Processing with NVMe Arrays: Spilling without Killing Performance. 238:1-238:27 - Yuexuan Xu, Jianyang Gao, Yutong Gou, Cheng Long, Christian S. Jensen:
iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search. 239:1-239:26 - Michael Fruth, Stefanie Scherzinger:
Live Patching for Distributed In-Memory Key-Value Stores. 241:1-241:26 - Kashif Rabbani, Matteo Lissandrini, Angela Bonifati, Katja Hose:
Transforming RDF Graphs to Property Graphs using Standardized Schemas. 242:1-242:25 - Song Yu, Shufeng Gong, Qian Tao, Sijie Shen, Yanfeng Zhang, Wenyuan Yu, Pengxi Liu, Zhixin Zhang, Hongfu Li, Xiaojian Luo, Ge Yu, Jingren Zhou:
LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSR. 243:1-243:28 - Navid Eslami, Niv Dayan:
Memento Filter: A Fast, Dynamic, and Robust Range Filter. 244:1-244:27 - Aoqian Zhang, Zexue Wu, Yifeng Gong, Ye Yuan, Guoren Wang:
Multivariate Time Series Cleaning under Speed Constraints. 245:1-245:26 - Yuzheng Cai, Jiayang Shi, Yizhuo Chen, Weiguo Zheng:
Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search. 246:1-246:27 - Jiasheng Zhang, Rex Ying, Jie Shao:
Online Detection of Anomalies in Temporal Knowledge Graphs with Interpretability. 247:1-247:26 - Xiaozhen Liu, Yicong Huang, Xinyuan Lin, Avinash Kumar, Sadeem Alsudais, Chen Li:
Pasta: A Cost-Based Optimizer for Generating Pipelining Schedules for Dataflow DAGs. 248:1-248:26 - Dajun Sun, Wei Dong, Yuan Qiu, Ke Yi:
Personalized Truncation for Personalized Privacy. 249:1-249:25 - Jiachi Zhang, Wenchao Zhou, Benjamin E. Ujcich:
Provenance-Enabled Explainable AI. 250:1-250:27 - Suhyun Lee, Chaemin Lim, Jinwoo Choi, Heelim Choi, Chan Lee, Yongjun Park, Kwanghyun Park, Hanjun Kim, Youngsok Kim:
SPID-Join: A Skew-resistant Processing-in-DIMM Join Algorithm Exploiting the Bank- and Rank-level Parallelisms of DIMMs. 251:1-251:27 - Yunkai Lou, Longbin Lai, Bingqing Lyu, Yufan Yang, Xiaoli Zhou, Wenyuan Yu, Ying Zhang, Jingren Zhou:
Towards a Converged Relational-Graph Optimization Framework. 252:1-252:27 - Suyang Zhong, Manuel Rigger:
Understanding and Reusing Test Suites Across Database Systems. 253:1-253:26 - Wenyue Zhao, Yang Cao, Peter Buneman, Jia Li, Nikos Ntarmos:
Automating Vectorized Distributed Graph Computation. 254:1-254: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-09 00:14 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:
