Shortest path computation on air indexes

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 747-757

  Kellaris, Georgios ^a   Mouratidis, Kyriakos ^a  

^a SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS; GRAPH THEORY; ROADS AND STREETS; TELECOMMUNICATION SERVICES;

DEVICE SPECIFICATION; LOCATION DEPENDENTS; NETWORK INDUSTRIES; REAL ROAD NETWORKS; SHORTEST PATH COMPUTATIONS; SHORTEST PATH QUERIES; TRANSPORTATION NETWORK; WIRELESS BROADCAST;

LOCATION BASED SERVICES;

EID: 84856451025     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920936     Document Type: Article

References (17)

1. Mobile World Congress: Network Breaking Point, February 17 2010.
2. C.-Y. Chow, M. F. Mokbel, and W. G. Aref. Casper*: Query processing for location services without compromising privacy. ACM TODS, 34(4), 2009.
3. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
4. A. V. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In SODA, pages 156-165, 2005.
5. P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE TSSC, 4(2):100-107, 1968.
6. T. Imielinski, S. Viswanathan, and B. R. Badrinath. Data on air: Organization and access. IEEE TKDE, 9(3):353-372, 1997.
7. N. Jing, Y.-W. Huang, and E. A. Rundensteiner. Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE TKDE, 10(3):409-432, 1998.
8. E.-S. Jung and N. H. Vaidya. An energy efficient MAC protocol for wireless LANs. In INFOCOM, 2002.
9. S. Jung and S. Pramanik. An efficient path computation model for hierarchically structured topographical road maps. IEEE TKDE, 14(5):1029-1046, 2002.
10. E. Köhler, R. H. Möhring, and H. Schilling. Fast point-to-point shortest path computations with arc-ags. In 9th DIMACS Implementation Challenge - Shortest Paths, 2007.
11. R. H. Möhring, H. Schilling, B. Schütz, D. Wagner, and T. Willhalm. Partitioning graphs to speedup Dijkstra's algorithm. J. Exp. Algorithmics, 11:2.8, 2006.
12. K. Mouratidis, S. Bakiras, and D. Papadias. Continuous monitoring of spatial queries in wireless broadcast environments. IEEE TMC, 8(10):1297-1311, 2009.
13. J. Pigg. Mobile backhaul: Will the levees hold?, 2009.
14. H. Samet, J. Sankaranarayanan, and H. Alborzi. Scalable network distance browsing in spatial databases. In SIGMOD, pages 43-54, 2008.
15. I. Stojmenovic. Handbook of wireless networks and mobile computing. John Wiley & Sons, 2002.
16. B. Zheng, W.-C. Lee, and D. L. Lee. Spatial queries in wireless broadcast systems. Wireless Networks, 10(6):723-736, 2004.
17. B. Zheng, W.-C. Lee, K. C. K. Lee, D. L. Lee, and M. Shao. A distributed spatial index for error-prone wireless data broadcast. VLDB J., 18(4):959-986, 2009.