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-06-01 to 2025-06-01.)
ArticleCitations
To share or not to share vector registers?251
Correction to: Data dependencies for query optimization: a survey85
Generating highly customizable python code for data processing with large language models68
Optimizing navigational graph queries62
PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search52
Third and Boyce–Codd normal form for property graphs52
Efficiently Counting Four-Node Motifs in Large-Scale Temporal Graphs52
A fractional memory-efficient approach for online continuous-time influence maximization39
Hu-Fu: efficient and secure spatial queries over data federation35
PrefixFPM: a parallel framework for general-purpose mining of frequent and closed patterns28
The full story of 1000 cores26
Transactional panorama: a conceptual framework for user perception in analytical visual interfaces (extended version)22
Model reusability in Reinforcement Learning21
Reverse spatial top-k keyword queries20
Efficient and robust active learning methods for interactive database exploration20
On efficient 3D object retrieval19
Learned sketch for subgraph counting: a holistic approach19
A new window Clause for SQL++19
Hyper-distance oracles in hypergraphs18
In-database query optimization on SQL with ML predicates17
Special issue on the best papers of DaMoN 202016
An authorization model for query execution in the cloud16
Cross-chain deals and adversarial commerce16
SQUID: subtrajectory query in trillion-scale GPS database16
Fast subgraph query processing and subgraph matching via static and dynamic equivalences16
GPU-based butterfly counting15
An update-intensive LSM-based R-tree index14
Approximation and inapproximability results on computing optimal repairs14
Discovering critical vertices for reinforcement of large-scale bipartite networks13
Parallel mining of large maximal quasi-cliques13
Special issue on big graph data management and processing13
Efficient top-k spatial-range-constrained approximate nearest neighbor search on geo-tagged high-dimensional vectors13
Ontological databases with faceted queries13
DB-BERT: making database tuning tools “read” the manual12
HFUL: a hybrid framework for user account linkage across location-aware social networks12
ABSTAT-HD: a scalable tool for profiling very large knowledge graphs12
P$$^2$$CG: a privacy preserving collaborative graph neural network training framework12
ByShard: sharding in a Byzantine environment11
Multi-constraint shortest path using forest hop labeling11
DBSP: automatic incremental view maintenance for rich query languages11
Correction to: BugDoc Iterative debugging and explanation of pipeline executions10
DumpyOS: A data-adaptive multi-ary index for scalable data series similarity search10
Fast data series indexing for in-memory data10
A graph pattern mining framework for large graphs on GPU9
Efficient and effective algorithms for densest subgraph discovery and maintenance9
Efficient detection of multivariate correlations with different correlation measures9
Efficient and scalable huge embedding model training via distributed cache management8
Incremental discovery of denial constraints8
LIST: learning to index spatio-textual data for embedding based spatial keyword queries8
Picket: guarding against corrupted data in tabular data during learning and inference8
Accelerating multi-way joins on the GPU8
AutoML in heavily constrained applications7
Towards flexibility and robustness of LSM trees7
Eris: efficiently measuring discord in multidimensional sources7
Assisted design of data science pipelines7
Anytime bottom-up rule learning for large-scale knowledge graph completion7
Tiered-Indexing: Optimizing Access Methods for Skew7
Survey of window types for aggregation in stream processing systems7
Accelerating directed densest subgraph queries with software and hardware approaches7
A survey on outlier explanations7
A survey on the evolution of stream processing systems7
HINT: a hierarchical interval index for Allen relationships6
Morphtree: a polymorphic main-memory learned index for dynamic workloads6
A survey on semantic schema discovery6
Have query optimizers hit the wall?6
Performant almost-latch-free data structures using epoch protection in more depth6
A survey on deep learning approaches for text-to-SQL6
ICS-GNN$$^+$$: lightweight interactive community search via graph neural network6
A multi-facet analysis of BERT-based entity matching models6
xDBTagger: explainable natural language interface to databases using keyword mappings and schema graph6
Efficient Algorithms for Uncertain Restricted Skyline Query Processing5
How good are machine learning clouds? Benchmarking two snapshots over 5 years5
BatchHL$$^{+}$$: batch dynamic labelling for distance queries on large-scale networks5
Editorial: Special Issue for Selected Papers of VLDB 20215
Special issue: modern hardware5
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
Scalable decoupling graph neural network with feature-oriented optimization5
A survey of RDF stores & SPARQL engines for querying knowledge graphs5
Join optimization revisited: a novel DP algorithm for join&sort order selection5
Time-topology analysis on temporal graphs4
Netherite: efficient execution of serverless workflows4
Application-driven graph partitioning4
Continuous monitoring of moving skyline and top-k queries4
FlexpushdownDB: rethinking computation pushdown for cloud OLAP DBMSs4
BugDoc4
A generic framework for efficient computation of top-k diverse results4
HERMES: data placement and schema optimization for enterprise knowledge bases4
Span-reachability querying in large temporal graphs4
Efficient distributed discovery of bidirectional order dependencies4
A near-optimal approach to edge connectivity-based hierarchical graph decomposition4
VUS: effective and efficient accuracy measures for time-series anomaly detection4
Data collection and quality challenges in deep learning: a data-centric AI perspective4
Efficient kNN query for moving objects on time-dependent road networks4
Answering reachability and K-reach queries on large graphs with label constraints4
Highly distributed and privacy-preserving queries on personal data management systems4
Identifying similar-bicliques in bipartite graphs4
AutoCTS++: zero-shot joint neural architecture and hyperparameter search for correlated time series forecasting3
Cardinality estimation using normalizing flow3
RNE: computing shortest paths using road network embedding3
Similarity-driven and task-driven models for diversity of opinion in crowdsourcing markets3
Adaptive algorithms for crowd-aided categorization3
eRiskCom: an e-commerce risky community detection platform3
Leveraging user itinerary to improve personalized deep matching at Fliggy3
Hypergraph motifs and their extensions beyond binary3
C5: cloned concurrency control that always keeps up3
Fast, exact, and parallel-friendly outlier detection algorithms with proximity graph in metric spaces3
General graph generators: experiments, analyses, and improvements3
Table integration in data lakes unleashed: pairwise integrability judgment, integrable set discovery, and multi-tuple conflict resolution3
MinJoin++: a fast algorithm for string similarity joins under edit distance3
Ingress: an automated incremental graph processing system3
Efficient exploratory clustering analyses in large-scale exploration processes3
Flexible grouping of linear segments for highly accurate lossy compression of time series data3
A powerful reducing framework for accelerating set intersections over graphs2
Complex event forecasting with prediction suffix trees2
Raster interval object approximations for spatial intersection joins2
HMI: hierarchical knowledge management for efficient multi-tenant inference in pretrained language models2
A systematic evaluation of machine learning on serverless infrastructure2
Temporal graph patterns by timed automata2
Butterfly counting and bitruss decomposition on uncertain bipartite graphs2
Enhancing domain-aware multi-truth data fusion using copy-based source authority and value similarity2
Making graphs compact by lossless contraction2
Efficient indexing and searching of constrained core in hypergraphs2
Editorial for S.I.: VLDB 20202
Reliability evaluation of individual predictions: a data-centric approach2
In-order sliding-window aggregation in worst-case constant time2
Efficient algorithms for reachability and path queries on temporal bipartite graphs2
Detecting rumours with latency guarantees using massive streaming data2
Accelerating maximum biplex search over large bipartite graphs2
SWOOP: top-k similarity joins over set streams2
0.11554002761841