LG-Tree: An Efficient Labeled Index for Shortest Distance Search on Massive Road Networks

Dan, Tangpeng; Luo, Changyin; Li, Yanhong; Guan, Zhong; Meng, Xiaofeng

doi:10.1109/tits.2022.3203432

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dan T et al [8] proposed LG-tree, which partitions large graphs into subgraphs and indexes these using balanced trees. LG-tree constructs a hierarchical structure based on Dynamic Index Filtering (DIF) and boundary vertices, using stage-based dynamic programming to ensure the efficiency of the shortest distance search.…”

Section: Related Workmentioning

confidence: 99%

Graph-Indexed kNN Query Optimization on Road Network

Jiang,

Li,

Bai

et al. 2023

Electronics

View full text Add to dashboard Cite

The nearest neighbors query problem on road networks constitutes a crucial aspect of location-oriented services and has useful practical implications; e.g., it can locate the k-nearest hotels. However, researches who study road networks still encounter obstacles due to the method’s inherent limitations with respect to object mobility. More popular methods employ indexes to store intermediate results to improve querying time efficiency, but these other methods are often accompanied by high time costs. To balance the costs of time and space, a lightweight flow graph index is proposed to reduce the quantity of candidate nodes, and with this index the results of a kNN query can be efficiently obtained. Experiments on real road networks confirm the efficiency and accuracy of our optimized algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%