Publication Type

Conference Proceeding Article

Publication Date

9-2010

Abstract

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 this model the data are continuously transmitted on the air, while clients listen to the broadcast and process their queries locally. Although spatial problems have been considered in this environment, there exists no study on shortest path queries in road networks. We develop the rst framework to compute shortest paths on the air, and demonstrate the practicality and e ciency of our techniques through exper- iments with real road networks and actual device speci ca- tions.

Keywords

Air indexes, Device specification, Location dependents, Network industries, Real road networks, Road network, Shortest path, Shortest path computations, Spatial problems, Transportation network, Wireless broadcast

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing

Research Areas

Data Management and Analytics

Publication

Proceedings of the VLDB Endowment: VLDB'10, September 13-17, 2010, Singapore

Volume

3

Issue

1

First Page

747

Last Page

757

ISSN

2150-8097

Identifier

10.14778/1920841.1920936

Publisher

VLDB Endowment

City or Country

New York

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.14778/1920841.1920936

Share

COinS