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

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

Sampling a Near Neighbor in High Dimensions — Who is the Fairest of Them All?	3
The Space-Efficient Core of Vadalog	3
Linking Entities across Relations and Graphs	3
DomainNet: Homograph Detection and Understanding in Data Lake Disambiguation	3
Supporting Better Insights of Data Science Pipelines with Fine-grained Provenance	2
Tight Fine-Grained Bounds for Direct Access on Join Queries	2
Accurate Sampling-Based Cardinality Estimation for Complex Graph Queries	2
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space	1
Graph Indexing for Efficient Evaluation of Label-constrained Reachability Queries	1
Efficient Sorting, Duplicate Removal, Grouping, and Aggregation	1
Persistent Summaries	1