Cover Image

Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Koehler, Henning, Farhan, Muhammad, Wang, Qing
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
by: Farhan, Muhammad, et al.
Published: (2025)

Optimized Customizable Route Planning in Large Road Networks with Batch Processing
by: Farhan, Muhammad, et al.
Published: (2026)

Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries
by: Kothalawala, Buddhi, et al.
Published: (2026)

COL-Trees: Efficient Hierarchical Object Search in Road Networks
by: Abeywickrama, Tenindra, et al.
Published: (2026)

Algorithms for Optimizing Acyclic Queries
by: Luo, Zheng, et al.
Published: (2025)

Approximating Queries on Probabilistic Graphs
by: Amarilli, Antoine, et al.
Published: (2023)

Socio-Spatial Group Queries for Impromptu Activity Planning
by: Shen, Chih-Ya, et al.
Published: (2015)

Range (Rényi) Entropy Queries and Partitioning
by: Esmailpour, Aryan, et al.
Published: (2023)

Enumeration Algorithms for Conjunctive Queries with Projection
by: Deep, Shaleen, et al.
Published: (2021)

Computing Data Distribution from Query Selectivities
by: Agarwal, Pankaj K., et al.
Published: (2024)

Querying in Constant Expected Time with Learned Indexes
by: Croquevielle, Luis, et al.
Published: (2024)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
by: Carmeli, Nofar, et al.
Published: (2025)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
by: Arenas, Marcelo, et al.
Published: (2024)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
by: Arroyuelo, Diego, et al.
Published: (2023)

Grafite: Taming Adversarial Queries with Optimal Range Filters
by: Costa, Marco, et al.
Published: (2023)

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
by: Bringmann, Karl, et al.
Published: (2022)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
by: Im, Sungjin, et al.
Published: (2025)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
by: Yang, Huihui, et al.
Published: (2025)

GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
by: Fan, Xiaoyu, et al.
Published: (2024)

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
by: Zhong, Ming, et al.
Published: (2023)

Accelerating Graph Similarity Search through Integer Linear Programming
by: D'Ascenzo, Andrea, et al.
Published: (2025)

Optimal Dynamic Parameterized Subset Sampling
by: Gan, Junhao, et al.
Published: (2024)

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
by: Bringmann, Karl, et al.
Published: (2026)

Parallel Dynamic Spatial Indexes
by: Men, Ziyang, et al.
Published: (2026)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
by: De Man, Quinten, et al.
Published: (2026)

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
by: Liao, Meihao, et al.
Published: (2025)

Towards Lazy B-Trees
by: Rysgaard, Casper Moldrup, et al.
Published: (2025)

GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs
by: Kreis, Lara, et al.
Published: (2026)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
by: Wang, Carrie, et al.
Published: (2025)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
by: Fan, Zhuochen, et al.
Published: (2024)

Correlation Sketches for Approximate Join-Correlation Queries
by: Santos, Aécio, et al.
Published: (2021)

Bounding the Fragmentation of B-Trees Subject to Batched Insertions
by: Bender, Michael A., et al.
Published: (2026)

Group Trip Planning Query Problem with Multimodal Journey
by: Ali, Dildar, et al.
Published: (2025)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
by: Hamada, Kou, et al.
Published: (2024)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
by: Wang, Kaixin, et al.
Published: (2026)

Efficient $k$-Clique Listing: An Edge-Oriented Branching Strategy
by: Wang, Kaixin, et al.
Published: (2023)

U-HNSW: An Efficient Graph-based Solution to ANNS Under Universal Lp Metrics
by: Wang, Huayi, et al.
Published: (2026)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
by: Yu, Kaiqiang, et al.
Published: (2025)

Weighted Fourier Factorizations: Optimal Gaussian Noise for Differentially Private Marginal and Product Queries
by: Lebeda, Christian Janos, et al.
Published: (2025)

QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
by: Qi, Yiyan, et al.
Published: (2024)