ACM Transactions on Database Systems

Papers
(The median citation count of ACM Transactions on Database Systems is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-02-01 to 2025-02-01.)
ArticleCitations
Constant-Delay Enumeration for Nondeterministic Document Spanners22
Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins21
Deciding Robustness for Lower SQL Isolation Levels15
Model Counting Meets F 0 Estimation15
Efficient Bi-objective SQL Optimization for Enclaved Cloud Databases with Differentially Private Padding14
A Family of Centrality Measures for Graph Data Based on Subgraphs13
Ad Hoc Transactions through the Looking Glass: An Empirical Study of Application-Level Transactions in Web Applications12
An Empirical Study of Moment Estimators for Quantile Approximation11
Making It Tractable to Detect and Correct Errors in Graphs10
Rewriting the Infinite Chase for Guarded TGDs10
On Finding Rank Regret Representatives8
A Caching-based Framework for Scalable Temporal Graph Neural Network Training8
Timely Reporting of Heavy Hitters Using External Memory8
Conjunctive Queries: Unique Characterizations and Exact Learnability6
The Space-Efficient Core of Vadalog6
Incremental Graph Computations: Doable and Undoable5
Reversible Database Watermarking Based on Order-preserving Encryption for Data Sharing5
DomainNet: Homograph Detection and Understanding in Data Lake Disambiguation4
Scotty3
Embedded Functional Dependencies and Data-completeness Tailored Database Design3
Partial Order Multiway Search3
Error Bounded Line Simplification Algorithms for Trajectory Compression: An Experimental Evaluation3
Evaluation of Machine Learning Algorithms in Predicting the Next SQL Query from the Future3
Robust and Efficient Sorting with Offset-value Coding3
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries2
A Formal Framework for Complex Event Recognition2
Sampling a Near Neighbor in High Dimensions — Who is the Fairest of Them All?2
GraphZeppelin : How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive)2
Linking Entities across Relations and Graphs2
Efficiently Cleaning Structured Event Logs: A Graph Repair Approach2
Proximity Queries on Terrain Surface2
Height Optimized Tries2
0.91146397590637