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-09-01 to 2025-09-01.)
ArticleCitations
To share or not to share vector registers?309
Correction to: Data dependencies for query optimization: a survey99
Generating highly customizable python code for data processing with large language models81
Optimizing navigational graph queries73
Efficiently Counting Four-Node Motifs in Large-Scale Temporal Graphs66
Threshold queries in theory and in the wild60
An efficient and scalable graph database with built-in temporal support53
Beyond influence: voting theory for opinion maximization41
Hu-Fu: efficient and secure spatial queries over data federation39
Reverse spatial top-k keyword queries37
Third and Boyce–Codd normal form for property graphs26
Efficient and robust active learning methods for interactive database exploration23
Transactional panorama: a conceptual framework for user perception in analytical visual interfaces (extended version)22
Model reusability in Reinforcement Learning21
The full story of 1000 cores21
Learned sketch for subgraph counting: a holistic approach20
On efficient 3D object retrieval20
A new window Clause for SQL++19
Hyper-distance oracles in hypergraphs19
In-database query optimization on SQL with ML predicates18
Special issue on the best papers of DaMoN 202018
Fast subgraph query processing and subgraph matching via static and dynamic equivalences18
GPU-based butterfly counting17
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
Approximation and inapproximability results on computing optimal repairs16
An update-intensive LSM-based R-tree index15
Ontological databases with faceted queries15
An authorization model for query execution in the cloud15
Parallel mining of large maximal quasi-cliques14
SQUID: subtrajectory query in trillion-scale GPS database14
ByShard: sharding in a Byzantine environment13
ABSTAT-HD: a scalable tool for profiling very large knowledge graphs13
Special issue on big graph data management and processing13
DB-BERT: making database tuning tools “read” the manual11
P$$^2$$CG: a privacy preserving collaborative graph neural network training framework11
HFUL: a hybrid framework for user account linkage across location-aware social networks11
Multi-constraint shortest path using forest hop labeling10
Efficient and effective algorithms for densest subgraph discovery and maintenance10
DBSP: automatic incremental view maintenance for rich query languages10
Correction to: BugDoc Iterative debugging and explanation of pipeline executions10
The Status-Quo in nested data processing for high-energy physics10
Efficient detection of multivariate correlations with different correlation measures9
LIST: learning to index spatio-textual data for embedding based spatial keyword queries9
A graph pattern mining framework for large graphs on GPU9
DumpyOS: A data-adaptive multi-ary index for scalable data series similarity search8
Towards flexibility and robustness of LSM trees8
Eris: efficiently measuring discord in multidimensional sources8
Picket: guarding against corrupted data in tabular data during learning and inference8
Accelerating multi-way joins on the GPU8
Incremental discovery of denial constraints8
Efficient and scalable huge embedding model training via distributed cache management8
Anytime bottom-up rule learning for large-scale knowledge graph completion8
AutoML in heavily constrained applications8
Accelerating directed densest subgraph queries with software and hardware approaches7
Assisted design of data science pipelines7
A survey on deep learning approaches for text-to-SQL7
A survey on semantic schema discovery7
A survey on the evolution of stream processing systems7
Tiered-Indexing: Optimizing Access Methods for Skew7
A multi-facet analysis of BERT-based entity matching models6
ICS-GNN$$^+$$: lightweight interactive community search via graph neural network6
Editorial for Special Issue: VLDB 20226
xDBTagger: explainable natural language interface to databases using keyword mappings and schema graph6
A survey on outlier explanations6
Efficient Algorithms for Uncertain Restricted Skyline Query Processing6
Morphtree: a polymorphic main-memory learned index for dynamic workloads6
Performant almost-latch-free data structures using epoch protection in more depth6
Have query optimizers hit the wall?6
Special issue: modern hardware6
Survey of window types for aggregation in stream processing systems6
How good are machine learning clouds? Benchmarking two snapshots over 5 years5
HPCache: memory-efficient OLAP through proportional caching revisited5
Resource-aware adaptive indexing for in situ visual exploration and analytics5
HINT: a hierarchical interval index for Allen relationships5
Tee-based key-value stores: a survey5
A survey of RDF stores & SPARQL engines for querying knowledge graphs5
Scalable decoupling graph neural network with feature-oriented optimization5
Join optimization revisited: a novel DP algorithm for join&sort order selection5
BatchHL$$^{+}$$: batch dynamic labelling for distance queries on large-scale networks5
Span-reachability querying in large temporal graphs4
A near-optimal approach to edge connectivity-based hierarchical graph decomposition4
HERMES: data placement and schema optimization for enterprise knowledge bases4
VUS: effective and efficient accuracy measures for time-series anomaly detection4
A generic framework for efficient computation of top-k diverse results4
Time-topology analysis on temporal graphs4
Highly distributed and privacy-preserving queries on personal data management systems4
Identifying similar-bicliques in bipartite graphs4
Application-driven graph partitioning4
FlexpushdownDB: rethinking computation pushdown for cloud OLAP DBMSs4
Netherite: efficient execution of serverless workflows4
Editorial: Special Issue for Selected Papers of VLDB 20214
Data collection and quality challenges in deep learning: a data-centric AI perspective4
BugDoc4
Efficient kNN query for moving objects on time-dependent road networks4
General graph generators: experiments, analyses, and improvements3
C5: cloned concurrency control that always keeps up3
Efficient exploratory clustering analyses in large-scale exploration processes3
Hypergraph motifs and their extensions beyond binary3
Continuous monitoring of moving skyline and top-k queries3
eRiskCom: an e-commerce risky community detection platform3
MinJoin++: a fast algorithm for string similarity joins under edit distance3
Flexible grouping of linear segments for highly accurate lossy compression of time series data3
RNE: computing shortest paths using road network embedding3
Table integration in data lakes unleashed: pairwise integrability judgment, integrable set discovery, and multi-tuple conflict resolution3
Cardinality estimation using normalizing flow3
Ingress: an automated incremental graph processing system3
A systematic evaluation of machine learning on serverless infrastructure3
Similarity-driven and task-driven models for diversity of opinion in crowdsourcing markets3
Leveraging user itinerary to improve personalized deep matching at Fliggy3
AutoCTS++: zero-shot joint neural architecture and hyperparameter search for correlated time series forecasting3
Enhancing domain-aware multi-truth data fusion using copy-based source authority and value similarity2
Editorial for S.I.: VLDB 20202
Temporal graph patterns by timed automata2
Accelerating maximum biplex search over large bipartite graphs2
Discovering approximate implicit domain orders through order dependencies2
HeteroStamp: leveraging heterogeneous social interactions for mobility prediction-enhanced cost-aware spatiotemporal crowdsensing2
Raster interval object approximations for spatial intersection joins2
Butterfly counting and bitruss decomposition on uncertain bipartite graphs2
Efficient algorithms for reachability and path queries on temporal bipartite graphs2
SWOOP: top-k similarity joins over set streams2
Reliability evaluation of individual predictions: a data-centric approach2
Detecting rumours with latency guarantees using massive streaming data2
Reconciling tuple and attribute timestamping for temporal data warehouses2
Efficient indexing and searching of constrained core in hypergraphs2
Complex event forecasting with prediction suffix trees2
Measuring approximate functional dependencies: a comparative study2
A powerful reducing framework for accelerating set intersections over graphs2
Fast, exact, and parallel-friendly outlier detection algorithms with proximity graph in metric spaces2
HMI: hierarchical knowledge management for efficient multi-tenant inference in pretrained language models2
ProS: data series progressive k-NN similarity search and classification with probabilistic quality guarantees2
Correction to: TurboLift: fast accuracy lifting for historical data recovery2
Making graphs compact by lossless contraction2
0.08300518989563