ACM Transactions on Database Systems

Papers
(The median citation count of ACM Transactions on Database Systems is 1. 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-11-01 to 2025-11-01.)
ArticleCitations
Deciding Robustness for Lower SQL Isolation Levels35
Degree Sequence Bounds24
Conjunctive Queries: Unique Characterizations and Exact Learnability24
Allocating Isolation Levels to Transactions in a Multiversion Setting17
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries14
Uniform Operational Consistent Query Answering12
Database Repairing with Soft Functional Dependencies10
Identifying the Root Causes of DBMS Suboptimality10
Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys9
Unified Route Planning for Shared Mobility: An Insertion-based Framework9
Mining Order-preserving Submatrices under Data Uncertainty: A Possible-world Approach and Efficient Approximation Methods8
Synchronizing Disaggregated Data Structures with One-Sided RDMA: Pitfalls, Experiments and Design Guidelines7
Efficient Parallel Boolean Expression Matching7
Height Optimized Tries5
On Directed Densest Subgraph Discovery5
Efficiently Cleaning Structured Event Logs: A Graph Repair Approach5
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch5
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns5
Automated Category Tree Construction: Hardness Bounds and Algorithms4
Influence Maximization Revisited: Efficient Sampling with Bound Tightened4
Timely Reporting of Heavy Hitters Using External Memory3
Enabling Timely and Persistent Deletion in LSM-Engines3
Reversible Database Watermarking Based on Order-preserving Encryption for Data Sharing3
Optimal Joins Using Compressed Quadtrees3
The Space-Efficient Core of Vadalog3
A Caching-based Framework for Scalable Temporal Graph Neural Network Training3
Accurate Sampling-Based Cardinality Estimation for Complex Graph Queries2
DomainNet: Homograph Detection and Understanding in Data Lake Disambiguation2
Linking Entities across Relations and Graphs2
Expressiveness within Sequence Datalog2
Sampling a Near Neighbor in High Dimensions — Who is the Fairest of Them All?2
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space1
Rewriting the Infinite Chase for Guarded TGDs1
From Global to Query-Dependent: Summarization of Large Hierarchical DAGs1
Persistent Summaries1
Tight Fine-Grained Bounds for Direct Access on Join Queries1
Ad Hoc Transactions through the Looking Glass: An Empirical Study of Application-Level Transactions in Web Applications1
Efficient Sorting, Duplicate Removal, Grouping, and Aggregation1
Supporting Better Insights of Data Science Pipelines with Fine-grained Provenance1
TreeTracker Join: Simple, Optimal, Fast1
Making It Tractable to Detect and Correct Errors in Graphs1
0.032900094985962