OOIR: Observatory of International Research

Papers

(The median citation count of ACM Transactions on Database Systems is 2. 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 2020-11-01 to 2024-11-01.)

Article	Citations
MobilityDB	38
Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins	22
Unified Route Planning for Shared Mobility: An Insertion-based Framework	21
SkinnerDB: Regret-bounded Query Evaluation via Reinforcement Learning	15
On Directed Densest Subgraph Discovery	15
Influence Maximization Revisited: Efficient Sampling with Bound Tightened	14
Embedded Functional Dependencies and Data-completeness Tailored Database Design	13
Functional Aggregate Queries with Additive Inequalities	13
On the Enumeration Complexity of Unions of Conjunctive Queries	12
A Formal Framework for Complex Event Recognition	11
Error Bounded Line Simplification Algorithms for Trajectory Compression: An Experimental Evaluation	10
Graph Indexing for Efficient Evaluation of Label-constrained Reachability Queries	10
Incremental and Approximate Computations for Accelerating Deep CNN Inference	10
Constant-Delay Enumeration for Nondeterministic Document Spanners	8
Stream Data Cleaning under Speed and Acceleration Constraints	8
Scotty	8
Incremental Graph Computations: Doable and Undoable	6
Bag Query Containment and Information Theory	6
Optimal Joins Using Compressed Quadtrees	5
Evaluation of Machine Learning Algorithms in Predicting the Next SQL Query from the Future	5
Efficient Sorting, Duplicate Removal, Grouping, and Aggregation	4
Flexible Skylines	3
Conjunctive Queries: Unique Characterizations and Exact Learnability	3
Sampling a Near Neighbor in High Dimensions — Who is the Fairest of Them All?	3
An Empirical Study of Moment Estimators for Quantile Approximation	3

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration	3
Reversible Database Watermarking Based on Order-preserving Encryption for Data Sharing	3
Enabling Timely and Persistent Deletion in LSM-Engines	2
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries	2
The Space-Efficient Core of Vadalog	2
Cost-based Data Prefetching and Scheduling in Big Data Platforms over Tiered Storage Systems	2
Proximity Queries on Terrain Surface	2
On Finding Rank Regret Representatives	2
Efficiently Cleaning Structured Event Logs: A Graph Repair Approach	2
Height Optimized Tries	2