OOIR: Observatory of International Research

Papers

(The H4-Index of Proceedings of the Vldb Endowment is 43. 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-01-01 to 2026-01-01.)

Article	Citations
IsoBugView	647
Timestamp as a Service, Not an Oracle	414
Cardinality Estimation for Having-Clauses	256
Opportunities for Quantum Acceleration of Databases: Optimization of Queries and Transaction Schedules	121
A Reproducible Tutorial on Reproducibility in Database Systems Research	120
Privacy for Free: Leveraging Local Differential Privacy Perturbed Data from Multiple Services	104
QPJVis Demo: Quality-Boost Progressive Join Query Processing System	96
Solver-In-The-Loop Cluster Resource Management for Database-as-a-Service	90
How to Optimize SQL Queries? A Comparison Between Split, Holistic, and Hybrid Approaches	77
Unraveling the Impact of Window Semantics: Optimizing Join Order for Efficient Stream Processing	75
Efficient Graph Data Access for Out-of-Memory GPU Streaming Graph Processing	74
Shifting Transaction Isolation on Graphs: From Systems to Data	74
Relational Data Models for Genetic VCF data	69
Accelerating Subgraph Matching through Fine-Grained and Powerful Equivalences	68
Cloudy with a Chance of JSON	64
Unify: A System For Unstructured Data Analytics	63
TSB-AutoAD: Towards Automated Solutions for Time-Series Anomaly Detection	61
Efficient Discovery of Relaxed Functional Dependencies	58
SkyStore: Cost-Optimized Object Storage Across Regions and Clouds	58
SpaceSaving ^±	56
GaussDB: A Cloud-Native Multi-Primary Database with Compute-Memory-Storage Disaggregation	56
Fries	56
DyHealth	55
Spectrum: Speedy and Strictly-Deterministic Smart Contract Transactions for Blockchain Ledgers	53
Efficient Distributed Transaction Processing in Heterogeneous Networks	52

OmniSketch: Efficient Multi-Dimensional High-Velocity Stream Analytics with Arbitrary Predicates	51
VeriBench: Analyzing the Performance of Database Systems with Verifiability	51
Towards Designing and Learning Piecewise Space-Filling Curves	50
Reliable community search in dynamic networks	50
Influential Community Search over Large Heterogeneous Information Networks	50
Approximating probabilistic group steiner trees in graphs	49
Galvatron	49
PARQO: Penalty-Aware Robust Plan Selection in Query Optimization	49
Breathing New Life into an Old Tree: Resolving Logging Dilemma of B ⁺ -tree on Modern Computational Storage Drives	48
Differentially Private Stream Processing at Scale	48
Algorithm and system co-design for efficient subgraph-based graph representation learning	48
G-tran	48
Motiflets	45
DuckDB-wasm	44
Neighborhood-Based Hypergraph Core Decomposition	44
LION: Fast and High-Resolution Network Kernel Density Visualization	43
DoppelGanger++ in Action: A Database Replay System with Fast Dependency Graph Generation	43
POEM	43