VLDB Journal

Papers
(The median citation count of VLDB Journal 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 2021-11-01 to 2025-11-01.)
ArticleCitations
To share or not to share vector registers?341
Correction to: Data dependencies for query optimization: a survey93
Threshold queries in theory and in the wild71
Efficiently Counting Four-Node Motifs in Large-Scale Temporal Graphs68
An efficient and scalable graph database with built-in temporal support55
Beyond influence: voting theory for opinion maximization54
Generating highly customizable python code for data processing with large language models47
Optimizing navigational graph queries44
The full story of 1000 cores28
Transactional panorama: a conceptual framework for user perception in analytical visual interfaces (extended version)25
BioGITOM: Matching Biomedical Ontologies with Graph Isomorphism Transformer24
Efficient and robust active learning methods for interactive database exploration22
Third and Boyce–Codd normal form for property graphs22
FOSS: A learned doctor for query optimization22
Model reusability in Reinforcement Learning21
Hu-Fu: efficient and secure spatial queries over data federation21
Reverse spatial top-k keyword queries21
On efficient 3D object retrieval20
A new window Clause for SQL++20
In-database query optimization on SQL with ML predicates19
Hyper-distance oracles in hypergraphs19
Special issue on the best papers of DaMoN 202018
Fast subgraph query processing and subgraph matching via static and dynamic equivalences18
Learned sketch for subgraph counting: a holistic approach18
Efficient top-k spatial-range-constrained approximate nearest neighbor search on geo-tagged high-dimensional vectors16
Discovering critical vertices for reinforcement of large-scale bipartite networks16
GPU-based butterfly counting15
SQUID: subtrajectory query in trillion-scale GPS database15
An authorization model for query execution in the cloud15
Ontological databases with faceted queries14
Parallel mining of large maximal quasi-cliques13
Approximation and inapproximability results on computing optimal repairs13
An update-intensive LSM-based R-tree index12
Special issue on big graph data management and processing11
HFUL: a hybrid framework for user account linkage across location-aware social networks11
The Status-Quo in nested data processing for high-energy physics11
ByShard: sharding in a Byzantine environment11
P$$^2$$CG: a privacy preserving collaborative graph neural network training framework11
DB-BERT: making database tuning tools “read” the manual10
Multi-constraint shortest path using forest hop labeling10
DBSP: automatic incremental view maintenance for rich query languages10
Correction to: BugDoc Iterative debugging and explanation of pipeline executions9
Incremental discovery of denial constraints9
Accelerating multi-way joins on the GPU9
Towards flexibility and robustness of LSM trees9
LIST: learning to index spatio-textual data for embedding based spatial keyword queries9
DumpyOS: A data-adaptive multi-ary index for scalable data series similarity search9
Efficient and effective algorithms for densest subgraph discovery and maintenance9
A graph pattern mining framework for large graphs on GPU9
Efficient and scalable huge embedding model training via distributed cache management9
Anytime bottom-up rule learning for large-scale knowledge graph completion8
Efficient detection of multivariate correlations with different correlation measures8
A survey on semantic schema discovery8
Privacy-Utility Balanced Cooperative Online Matching in Spatial Crowdsourcing8
Survey of window types for aggregation in stream processing systems7
AutoML in heavily constrained applications7
A survey on the evolution of stream processing systems7
Assisted design of data science pipelines7
Eris: efficiently measuring discord in multidimensional sources7
A survey on deep learning approaches for text-to-SQL7
xDBTagger: explainable natural language interface to databases using keyword mappings and schema graph6
Performant almost-latch-free data structures using epoch protection in more depth6
Efficient Algorithms for Uncertain Restricted Skyline Query Processing6
Tiered-Indexing: Optimizing Access Methods for Skew6
Accelerating directed densest subgraph queries with software and hardware approaches6
Morphtree: a polymorphic main-memory learned index for dynamic workloads6
A survey on outlier explanations6
A multi-facet analysis of BERT-based entity matching models6
A survey of RDF stores & SPARQL engines for querying knowledge graphs5
Editorial for Special Issue: VLDB 20225
How good are machine learning clouds? Benchmarking two snapshots over 5 years5
Join optimization revisited: a novel DP algorithm for join&sort order selection5
BugDoc5
Scalable decoupling graph neural network with feature-oriented optimization5
HINT: a hierarchical interval index for Allen relationships5
Resource-aware adaptive indexing for in situ visual exploration and analytics5
Tee-based key-value stores: a survey5
HPCache: memory-efficient OLAP through proportional caching revisited5
Special issue: modern hardware5
ICS-GNN$$^+$$: lightweight interactive community search via graph neural network5
BatchHL$$^{+}$$: batch dynamic labelling for distance queries on large-scale networks5
Netherite: efficient execution of serverless workflows4
A generic framework for efficient computation of top-k diverse results4
Data collection and quality challenges in deep learning: a data-centric AI perspective4
Application-driven graph partitioning4
Highly distributed and privacy-preserving queries on personal data management systems4
A near-optimal approach to edge connectivity-based hierarchical graph decomposition4
FlexpushdownDB: rethinking computation pushdown for cloud OLAP DBMSs4
Time-topology analysis on temporal graphs4
Span-reachability querying in large temporal graphs4
HERMES: data placement and schema optimization for enterprise knowledge bases4
Cardinality estimation using normalizing flow4
Identifying similar-bicliques in bipartite graphs4
VUS: effective and efficient accuracy measures for time-series anomaly detection4
MSAD: A deep dive into model selection for time series anomaly detection4
Efficient kNN query for moving objects on time-dependent road networks4
Table integration in data lakes unleashed: pairwise integrability judgment, integrable set discovery, and multi-tuple conflict resolution4
Editorial: Special Issue for Selected Papers of VLDB 20214
AutoCTS++: zero-shot joint neural architecture and hyperparameter search for correlated time series forecasting3
Hypergraph motifs and their extensions beyond binary3
Flexible grouping of linear segments for highly accurate lossy compression of time series data3
Similarity-driven and task-driven models for diversity of opinion in crowdsourcing markets3
Editorial for S.I.: VLDB 20203
eRiskCom: an e-commerce risky community detection platform3
Leveraging user itinerary to improve personalized deep matching at Fliggy3
Efficient exploratory clustering analyses in large-scale exploration processes3
Ingress: an automated incremental graph processing system3
Enhancing domain-aware multi-truth data fusion using copy-based source authority and value similarity3
A systematic evaluation of machine learning on serverless infrastructure3
MinJoin++: a fast algorithm for string similarity joins under edit distance3
C5: cloned concurrency control that always keeps up3
RNE: computing shortest paths using road network embedding3
Fast, exact, and parallel-friendly outlier detection algorithms with proximity graph in metric spaces3
Reliability evaluation of individual predictions: a data-centric approach3
Efficient indexing and searching of constrained core in hypergraphs2
Effective entity matching with transformers2
Discovering approximate implicit domain orders through order dependencies2
HMI: hierarchical knowledge management for efficient multi-tenant inference in pretrained language models2
Making graphs compact by lossless contraction2
Efficient algorithms for reachability and path queries on temporal bipartite graphs2
Butterfly counting and bitruss decomposition on uncertain bipartite graphs2
Raster interval object approximations for spatial intersection joins2
Correction to: TurboLift: fast accuracy lifting for historical data recovery2
ProS: data series progressive k-NN similarity search and classification with probabilistic quality guarantees2
HeteroStamp: leveraging heterogeneous social interactions for mobility prediction-enhanced cost-aware spatiotemporal crowdsensing2
A powerful reducing framework for accelerating set intersections over graphs2
Measuring approximate functional dependencies: a comparative study2
Temporal graph patterns by timed automata2
Density decomposition on large static and dynamic graphs: algorithms and applications2
Reconciling tuple and attribute timestamping for temporal data warehouses2
Detecting rumours with latency guarantees using massive streaming data2
SWOOP: top-k similarity joins over set streams2
Accelerating maximum biplex search over large bipartite graphs2
0.37370896339417