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-04-01 to 2024-04-01.)

Article	Citations
MobilityDB	29
Discovering Graph Functional Dependencies	22
Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies	19
Packing R-trees with Space-filling Curves	15
Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins	14
Unified Route Planning for Shared Mobility: An Insertion-based Framework	13
SkinnerDB: Regret-bounded Query Evaluation via Reinforcement Learning	12
Efficient Discovery of Matching Dependencies	12
On Directed Densest Subgraph Discovery	11
Embedded Functional Dependencies and Data-completeness Tailored Database Design	11
Functional Aggregate Queries with Additive Inequalities	10
Influence Maximization Revisited: Efficient Sampling with Bound Tightened	10
Constant-Delay Enumeration for Nondeterministic Document Spanners	8
Incremental and Approximate Computations for Accelerating Deep CNN Inference	7
Error Bounded Line Simplification Algorithms for Trajectory Compression: An Experimental Evaluation	7
Graph Indexing for Efficient Evaluation of Label-constrained Reachability Queries	7
A Formal Framework for Complex Event Recognition	7
On the Enumeration Complexity of Unions of Conjunctive Queries	7
Maintaining Triangle Queries under Updates	7
Succinct Range Filters	6
Scotty	6
Incremental Graph Computations: Doable and Undoable	5
Stream Data Cleaning under Speed and Acceleration Constraints	5
Catching Numeric Inconsistencies in Graphs	5
Adaptive Asynchronous Parallelization of Graph Algorithms	5

Bag Query Containment and Information Theory	4
Optimal Joins Using Compressed Quadtrees	4
Efficient Sorting, Duplicate Removal, Grouping, and Aggregation	3
Evaluation of Machine Learning Algorithms in Predicting the Next SQL Query from the Future	3
Reversible Database Watermarking Based on Order-preserving Encryption for Data Sharing	3
An Empirical Study of Moment Estimators for Quantile Approximation	3
Conjunctive Queries: Unique Characterizations and Exact Learnability	3
Height Optimized Tries	2
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration	2
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries	2
Flexible Skylines	2
The Space-Efficient Core of Vadalog	2
On the Language of Nested Tuple Generating Dependencies	2