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 2022-06-01 to 2026-06-01.)
ArticleCitations
Deciding Robustness for Lower SQL Isolation Levels30
Conjunctive Queries: Unique Characterizations and Exact Learnability18
Degree Sequence Bounds14
Uniform Operational Consistent Query Answering12
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries11
Allocating Isolation Levels to Transactions in a Multiversion Setting11
Identifying the Root Causes of DBMS Suboptimality11
Efficient Parallel Boolean Expression Matching7
Database Repairing with Soft Functional Dependencies7
Mitigating False Positives in Filters: To Adapt or to Cache?6
Synchronizing Disaggregated Data Structures with One-Sided RDMA: Pitfalls, Experiments and Design Guidelines6
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch6
Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys6
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns5
Efficiently Cleaning Structured Event Logs: A Graph Repair Approach4
A Caching-based Framework for Scalable Temporal Graph Neural Network Training4
Enabling Timely and Persistent Deletion in LSM-Engines4
Automated Category Tree Construction: Hardness Bounds and Algorithms4
Witness Generation for Classical JSON Schema4
Influence Maximization Revisited: Efficient Sampling with Bound Tightened4
Semi-Oblivious Chase Termination for Linear Existential Rules and Beyond: An Experimental Analysis4
DomainNet: Homograph Detection and Understanding in Data Lake Disambiguation4
Supporting Better Insights of Data Science Pipelines with Fine-grained Provenance3
Linking Entities across Relations and Graphs3
Accurate Sampling-Based Cardinality Estimation for Complex Graph Queries3
Reversible Database Watermarking Based on Order-preserving Encryption for Data Sharing3
Expressiveness within Sequence Datalog3
Persistent Summaries2
TreeTracker Join: Simple, Optimal, Fast2
Making It Tractable to Detect and Correct Errors in Graphs2
Tight Fine-Grained Bounds for Direct Access on Join Queries2
Ad Hoc Transactions through the Looking Glass: An Empirical Study of Application-Level Transactions in Web Applications2
Efficient Sorting, Duplicate Removal, Grouping, and Aggregation2
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space2
Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization2
Rewriting the Infinite Chase for Guarded TGDs2
From Global to Query-Dependent: Summarization of Large Hierarchical DAGs1
Cost-based Data Prefetching and Scheduling in Big Data Platforms over Tiered Storage Systems1
Finding Smallest Witnesses for Conjunctive Queries1
Adaptive Set Intersection via Trie Partition Certificates1
A Family of Centrality Measures for Graph Data Based on Subgraphs1
Tuple-Independent Representations of Infinite Probabilistic Databases1
0.025743007659912