Shortest Path Computation on Air Indexes
Shortest path computation is one of the most common queries in location-based services that involve transportation net- works. Motivated by scalability challenges faced in the mo- bile network industry, we propose adopting the wireless broad- cast model for such location-dependent applications. In t...
Saved in:
Main Authors: | KELLARIS, Georgios, MOURATIDIS, Kyriakos |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2010
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/615 https://ink.library.smu.edu.sg/context/sis_research/article/1614/viewcontent/VLDB10_SPAirIndex.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Effective indexing for approximate constrained shortest path queries on large road networks
by: Wang, Sibo, et al.
Published: (2017) -
Shortest Path Computation with No Information Leakage
by: MOURATIDIS, Kyriakos, et al.
Published: (2012) -
Best Upgrade Plans for Large Road Networks
by: LIN, Yimin, et al.
Published: (2013) -
Efficient Verification of Shortest Path Search Via Authenticated Hints
by: YIU, Man Lung, et al.
Published: (2010) -
Efficient navigation for constrained shortest path with adaptive expansion control
by: XIA, Wenwen, et al.
Published: (2022)