VLDB Journal

Papers
(The median citation count of VLDB Journal is 3. 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.)
ArticleCitations
To share or not to share vector registers?377
Threshold queries in theory and in the wild103
An efficient and scalable graph database with built-in temporal support75
Efficiently Counting Four-Node Motifs in Large-Scale Temporal Graphs75
Beyond influence: voting theory for opinion maximization63
Optimizing navigational graph queries57
Generating highly customizable python code for data processing with large language models45
The full story of 1000 cores29
Transactional panorama: a conceptual framework for user perception in analytical visual interfaces (extended version)27
Third and Boyce–Codd normal form for property graphs25
Reverse spatial top-k keyword queries25
Hu-Fu: efficient and secure spatial queries over data federation25
Efficient and robust active learning methods for interactive database exploration23
BioGITOM: Matching Biomedical Ontologies with Graph Isomorphism Transformer22
FOSS: A learned doctor for query optimization22
Model reusability in Reinforcement Learning21
Fast subgraph query processing and subgraph matching via static and dynamic equivalences21
Learned sketch for subgraph counting: a holistic approach20
On efficient 3D object retrieval19
A new window Clause for SQL++19
In-database query optimization on SQL with ML predicates18
Hyper-distance oracles in hypergraphs18
Special issue on the best papers of DaMoN 202017
Discovering critical vertices for reinforcement of large-scale bipartite networks16
Ontological databases with faceted queries15
SQUID: subtrajectory query in trillion-scale GPS database15
Approximation and inapproximability results on computing optimal repairs14
Efficient top-k spatial-range-constrained approximate nearest neighbor search on geo-tagged high-dimensional vectors14
GPU-based butterfly counting13
An update-intensive LSM-based R-tree index13
DB-BERT: making database tuning tools “read” the manual12
P$$^2$$CG: a privacy preserving collaborative graph neural network training framework12
On Querying Historical Connectivity in Large-scale Temporal Graphs11
The Status-Quo in nested data processing for high-energy physics11
DBSP: automatic incremental view maintenance for rich query languages11
Special issue on big graph data management and processing11
Multi-constraint shortest path using forest hop labeling10
HFUL: a hybrid framework for user account linkage across location-aware social networks10
DumpyOS: A data-adaptive multi-ary index for scalable data series similarity search9
Incremental discovery of denial constraints9
ByShard: sharding in a Byzantine environment9
Efficient detection of multivariate correlations with different correlation measures9
Efficient and effective algorithms for densest subgraph discovery and maintenance9
Towards flexibility and robustness of LSM trees9
A graph pattern mining framework for large graphs on GPU9
LIST: learning to index spatio-textual data for embedding based spatial keyword queries9
Correction to: BugDoc Iterative debugging and explanation of pipeline executions9
Efficient and scalable huge embedding model training via distributed cache management8
AutoML in heavily constrained applications8
Tiered-Indexing: Optimizing Access Methods for Skew8
Privacy-Utility Balanced Cooperative Online Matching in Spatial Crowdsourcing8
Survey of window types for aggregation in stream processing systems8
Anytime bottom-up rule learning for large-scale knowledge graph completion8
Assisted design of data science pipelines8
Accelerating directed densest subgraph queries with software and hardware approaches8
A survey on the evolution of stream processing systems7
A survey on deep learning approaches for text-to-SQL7
Eris: efficiently measuring discord in multidimensional sources7
A survey on outlier explanations7
xDBTagger: explainable natural language interface to databases using keyword mappings and schema graph6
A multi-facet analysis of BERT-based entity matching models6
ICS-GNN$$^+$$: lightweight interactive community search via graph neural network6
Performant almost-latch-free data structures using epoch protection in more depth6
Scalable decoupling graph neural network with feature-oriented optimization6
Editorial for Special Issue: VLDB 20226
How good are machine learning clouds? Benchmarking two snapshots over 5 years6
Morphtree: a polymorphic main-memory learned index for dynamic workloads6
Efficient Algorithms for Uncertain Restricted Skyline Query Processing6
HINT: a hierarchical interval index for Allen relationships6
Special issue: modern hardware6
Resource-aware adaptive indexing for in situ visual exploration and analytics5
Join optimization revisited: a novel DP algorithm for join&sort order selection5
Editorial: Special Issue for Selected Papers of VLDB 20215
FlexpushdownDB: rethinking computation pushdown for cloud OLAP DBMSs5
A near-optimal approach to edge connectivity-based hierarchical graph decomposition5
HPCache: memory-efficient OLAP through proportional caching revisited5
Tee-based key-value stores: a survey5
Identifying similar-bicliques in bipartite graphs5
Netherite: efficient execution of serverless workflows5
An Evaluation of B-tree Compression Techniques5
BatchHL$$^{+}$$: batch dynamic labelling for distance queries on large-scale networks5
BugDoc5
VUS: effective and efficient accuracy measures for time-series anomaly detection5
Time-topology analysis on temporal graphs5
Leveraging user itinerary to improve personalized deep matching at Fliggy4
Highly distributed and privacy-preserving queries on personal data management systems4
HERMES: data placement and schema optimization for enterprise knowledge bases4
Cardinality estimation using normalizing flow4
Hypergraph motifs and their extensions beyond binary4
eRiskCom: an e-commerce risky community detection platform4
Application-driven graph partitioning4
A generic framework for efficient computation of top-k diverse results4
Efficient kNN query for moving objects on time-dependent road networks4
AutoCTS++: zero-shot joint neural architecture and hyperparameter search for correlated time series forecasting4
MinJoin++: a fast algorithm for string similarity joins under edit distance4
MSAD: A deep dive into model selection for time series anomaly detection4
Data collection and quality challenges in deep learning: a data-centric AI perspective4
Table integration in data lakes unleashed: pairwise integrability judgment, integrable set discovery, and multi-tuple conflict resolution4
Ingress: an automated incremental graph processing system3
Butterfly counting and bitruss decomposition on uncertain bipartite graphs3
Detecting rumours with latency guarantees using massive streaming data3
Accelerating maximum biplex search over large bipartite graphs3
Raster interval object approximations for spatial intersection joins3
Enhancing domain-aware multi-truth data fusion using copy-based source authority and value similarity3
Similarity-driven and task-driven models for diversity of opinion in crowdsourcing markets3
A systematic evaluation of machine learning on serverless infrastructure3
SWOOP: top-k similarity joins over set streams3
Measuring approximate functional dependencies: a comparative study3
Making graphs compact by lossless contraction3
Efficient algorithms for reachability and path queries on temporal bipartite graphs3
Editorial for S.I.: VLDB 20203
C5: cloned concurrency control that always keeps up3
A powerful reducing framework for accelerating set intersections over graphs3
HMI: hierarchical knowledge management for efficient multi-tenant inference in pretrained language models3
Efficient indexing and searching of constrained core in hypergraphs3
Density decomposition on large static and dynamic graphs: algorithms and applications3
Temporal graph patterns by timed automata3
Reliability evaluation of individual predictions: a data-centric approach3
Fast, exact, and parallel-friendly outlier detection algorithms with proximity graph in metric spaces3
Flexible grouping of linear segments for highly accurate lossy compression of time series data3
0.068283081054688