OOIR: Observatory of International Research

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-07-01 to 2025-07-01.)

Article	Citations
Deciding Robustness for Lower SQL Isolation Levels	30
Degree Sequence Bounds	24
Conjunctive Queries: Unique Characterizations and Exact Learnability	23
Allocating Isolation Levels to Transactions in a Multiversion Setting	20
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries	16
Database Repairing with Soft Functional Dependencies	14
Identifying the Root Causes of DBMS Suboptimality	13
Unified Route Planning for Shared Mobility: An Insertion-based Framework	12
Stream Data Cleaning under Speed and Acceleration Constraints	10
Efficient Parallel Boolean Expression Matching	8
Mining Order-preserving Submatrices under Data Uncertainty: A Possible-world Approach and Efficient Approximation Methods	7
Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys	7
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch	6
Synchronizing Disaggregated Data Structures with One-Sided RDMA: Pitfalls, Experiments and Design Guidelines	6
Efficiently Cleaning Structured Event Logs: A Graph Repair Approach	6
On Directed Densest Subgraph Discovery	5
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns	5
Height Optimized Tries	5
SkinnerDB: Regret-bounded Query Evaluation via Reinforcement Learning	4
Automated Category Tree Construction: Hardness Bounds and Algorithms	4
Enabling Timely and Persistent Deletion in LSM-Engines	4
Influence Maximization Revisited: Efficient Sampling with Bound Tightened	4
Optimal Joins Using Compressed Quadtrees	3
Timely Reporting of Heavy Hitters Using External Memory	3
A Caching-based Framework for Scalable Temporal Graph Neural Network Training	3

The Space-Efficient Core of Vadalog	3
Accurate Sampling-Based Cardinality Estimation for Complex Graph Queries	2
Reversible Database Watermarking Based on Order-preserving Encryption for Data Sharing	2
Supporting Better Insights of Data Science Pipelines with Fine-grained Provenance	2
Linking Entities across Relations and Graphs	2
DomainNet: Homograph Detection and Understanding in Data Lake Disambiguation	2
Expressiveness within Sequence Datalog	2
Sampling a Near Neighbor in High Dimensions — Who is the Fairest of Them All?	2
Persistent Summaries	1
Tight Fine-Grained Bounds for Direct Access on Join Queries	1
Ad Hoc Transactions through the Looking Glass: An Empirical Study of Application-Level Transactions in Web Applications	1
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space	1
A Family of Centrality Measures for Graph Data Based on Subgraphs	1
Efficient Sorting, Duplicate Removal, Grouping, and Aggregation	1
Rewriting the Infinite Chase for Guarded TGDs	1