Distance oracles for spatial networks

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 652-663

  Sankaranarayanan, Jagan ^a   Samet, Hanan ^a,b  

^a University of Maryland ^*  (United States)

^b NATIONAL UNIVERSITY OF IRELAND   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE ERRORS; HASH TABLE; K NEAREST NEIGHBOR SEARCH; LARGE NETWORKS; LOCATION-BASED SERVICES; NEAREST NEIGHBORS; NETWORK DISTANCE; REALTIME PROCESSING; RETRIEVAL TIME; ROAD NETWORK; SHORTEST PATH; SPATIAL JOIN; SPATIAL NETWORK; SPATIAL POSITIONS; SPATIAL QUERIES; TRANSPORTATION NETWORK;

RELATIONAL DATABASE SYSTEMS; WIRELESS TELECOMMUNICATION SYSTEMS;

MOTOR TRANSPORTATION;

EID: 67649666647     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.53     Document Type: Conference Paper

References (32)

1. D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, "Query processing in spatial network databases" in Proc. of VLDB, Berlin, Germany, Sep. 2003, pp. 802-813.
2. H.-J. Cho and C.-W. Chung, "An efficient and scalable approach to CNN queries in a road network" in Proc. of VLDB, Trondheim, Norway, Sep. 2005, pp. 865-876.
3. N. Jing, Y.-W. Huang, and E. A. Rundensteiner, "Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation" TKDE, vol. 10, no. 3, pp. 409-432, May 1998.
4. S. Jung and S. Pramanik, "An efficient path computation model for hierarchically structured topographical road maps" TKDE vol. 14, no. 5, pp. 1029-1046, Sep./Oct. 2002.
5. E. W. Dijkstra, "A note on two problems in connexion with graphs" Numerische Mathematik, vol. 1, pp. 269-271, 1959.
6. H. Samet, Foundations of Multidimensional and Metric Data Structures. San Francisco: Morgan-Kaufmann, 2006.
7. H. Samet, J. Sankaranarayanan, and H. Alborzi, "Scalable network distance browsing in spatial databases" in Proc. of SIGMOD, Vancouver, Canada, June 2008, pp. 43-54 (SIGMOD 2008 Best Paper Award).
8. J. Sankaranarayanan, H. Alborzi, and H. Samet, "Efficient query processing on spatial networks" in Proc. of the 13th ACM GIS, Bremen, Germany, Nov. 2005, pp. 200-209.
9. J. D. Foley, A. van Dam, S. K. Feiner, and J. F. Hughes, Computer Graphics: Principles and Practice, 2nd ed. Reading, MA: Addison-Wesley, 1990.
10. D. Wagner and T. Willhalm, "Geometric speed-up techniques for finding shortest paths in large sparse graphs" in Proc. of ESA, LNCS 2832, Budapest, Hungary, Sep. 2003, pp. 776-787.
11. G. M. Hunter and K. Steiglitz, "Operations on images using quad trees" PAMI, vol. 1, no. 2, pp. 145-153, Apr. 1979.
12. H. Samet, "Neighbor finding in images represented by octrees" CVGIP, vol. 46, no. 3, pp. 367-386, June 1989.
13. H. Samet, "Implementing ray tracing with octrees and neighbor finding" Computers & Graphics, vol. 13, no. 4, pp. 445-460, 1989.
14. P. B. Callahan and S. R. Kosaraju, "Faster algorithms for some geometric graph problems in higher dimensions" in Proc. of SODA, Austin, TX, Jan. 1993, pp. 291-300.
15. J. Gao and L. Zhang, "Well-separated pair decomposition for the unitdisk graph metric and its applications" in Proc. of STOC, San Diego, CA, July 2003, pp. 483-492.
16. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid, "Approximate distance oracles for geometric graphs" in Proc. of SODA, San Francisco, CA, Jan. 2002, pp. 828-837.
17. G. Narasimhan and M. Smid, "Approximating the stretch factor of Euclidean graphs" SICOMP, vol. 30, no. 3, pp. 978-989, 2000.
18. C. Shahabi, M. R. Kolahdouzan, and M. Sharifzadeh, "A road network embedding technique for k-nearest neighbor search in moving object databases" GeoInformatica, vol. 7, no. 3, pp. 255-273, Sep. 2003.
19. H.-P. Kriegel, P. Kröger, M. Renz, and T. Schmidt, "Hierarchical graph embedding for efficient query processing in very large traffic networks" in Proc. of SSDBM, LNCS 5069, Hong Kong, China, July 2008, pp. 150-167.
20. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications" Combinatorica, vol. 15, pp. 215-245, 1995.
21. M. Thorup and U. Zwick, "Approximate distance oracles" in Proc. of STOC, Hersonissos, Greece, 2001, pp. 183-192.
22. P. Callahan, "Dealing with higher dimensions: The well-separated pair decomposition and its applications" Ph.D. dissertation, The Johns Hopkins University, Baltimore, MD, Sep. 1995.
23. P. B. Callahan and S. R. Kosaraju, "A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields" JACM, vol. 42, no. 1, pp. 67-90, Jan. 1995.
24. J. A. Orenstein, "Multidimensional tries used for associative searching" Inf. Proc. Let., vol. 14, no. 4, pp. 150-157, June 1982.
25. J. Fischer and S. Har-Peled, "Dynamic well-separated pair decomposition made easy" in Proc. of CCCG, Windsor, Canada, Aug. 2005, pp. 235-238.
26. G. M. Morton, "A computer oriented geodetic data base and a new technique in file sequencing" IBM Ltd., Ottawa, Canada, Tech. Rep., 1966.
27. I. Gargantini, "An effective way to represent quadtrees" CACM, vol. 25, no. 12, pp. 905-910, Dec. 1982.
28. A. V. Goldberg and R. F. Werneck, "Computing point-to-point shortest paths from external memory" in Proc. of ALENEX, Vancouver, Canada, Jan. 2005.
29. U.S. Census Bureau, "TIGER/Line Files, Census 2000" U.S. Census Bureau, Washington, DC, Oct. 2001, http://www.census.gov/geo/www/tiger/tiger2k/ tiger2000.html.
30. U.S. Geological Survey, "Major Roads of the United States" U.S. Geological Survey, Reston, VA, Nov. 1999, http://nationalatlas.gov/atlasftp. html.
31. H. Samet, H. Alborzi, F. Brabec, C. Esperanca, G. R. Hjaltason, F. Morgan, and E. Tanin, "Use of the SAND spatial browser for digital government applications" CACM, vol. 46, no. 1, pp. 63-66, Jan. 2003.
32. J. Sankaranarayanan, H. Alborzi, and H. Samet, "Distance join queries on spatial networks" in Proc. of ACM GIS, Arlington, VA, Nov. 2006, pp. 211-218.