ACM Transactions on Database Systems

Papers
(The TQCC of ACM Transactions on Database Systems is 3. 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 2022-01-01 to 2026-01-01.)
ArticleCitations
Deciding Robustness for Lower SQL Isolation Levels37
Conjunctive Queries: Unique Characterizations and Exact Learnability26
Degree Sequence Bounds17
Allocating Isolation Levels to Transactions in a Multiversion Setting13
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries11
Uniform Operational Consistent Query Answering11
Identifying the Root Causes of DBMS Suboptimality10
Database Repairing with Soft Functional Dependencies9
Efficient Parallel Boolean Expression Matching8
Unified Route Planning for Shared Mobility: An Insertion-based Framework8
Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys7
Synchronizing Disaggregated Data Structures with One-Sided RDMA: Pitfalls, Experiments and Design Guidelines6
Mining Order-preserving Submatrices under Data Uncertainty: A Possible-world Approach and Efficient Approximation Methods6
Efficiently Cleaning Structured Event Logs: A Graph Repair Approach5
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch5
Mitigating False Positives in Filters: To Adapt or to Cache?5
Height Optimized Tries4
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns4
Automated Category Tree Construction: Hardness Bounds and Algorithms4
Enabling Timely and Persistent Deletion in LSM-Engines3
A Caching-based Framework for Scalable Temporal Graph Neural Network Training3
DomainNet: Homograph Detection and Understanding in Data Lake Disambiguation3
Optimal Joins Using Compressed Quadtrees3
Sampling a Near Neighbor in High Dimensions — Who is the Fairest of Them All?3
Linking Entities across Relations and Graphs3
Influence Maximization Revisited: Efficient Sampling with Bound Tightened3
Semi-Oblivious Chase Termination for Linear Existential Rules and Beyond: An Experimental Analysis3
Reversible Database Watermarking Based on Order-preserving Encryption for Data Sharing3
The Space-Efficient Core of Vadalog3
0.082057952880859