Efficient query processing on spatial networks

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2005, Pages 200-209

  Sankaranarayanan, Jagan ^a   Alborzi, Houman ^a   Samet, Hanan ^a  

^a University of Maryland ^*  (United States)

Author keywords

Location based services; Path coherence; Query processing; SILC framework; Spatial databases; Spatial networks

Indexed keywords

LOCATION-BASED SERVICES; PATH COHERENCE; QUERY PROCESSING; SILC FRAMEWORK; SPATIAL DATABASES; SPATIAL NETWORKS;

COMPUTER SCIENCE; DATA PROCESSING; DATABASE SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS; INFORMATION RETRIEVAL; QUERY LANGUAGES;

COMPUTER NETWORKS;

EID: 33644584911     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1097064.1097093     Document Type: Conference Paper

References (39)

1. P. A. Burrough and R. A. McDonnell. Principles of Geographical Information Systems. Oxford University Press, New York, NY, USA, Apr. 1998.
2. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
3. G. G. Filho and H. Samet. A linear iterative approach for hierarchical shortest path finding. Computer Science Department CS-TR-4417, University of Maryland, College Park, MD, Nov. 2002.
4. R. W. Floyd. Algorithm 97: Shortest path. Commun. ACM, 5(6):345, June 1962.
5. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596-615, July 1987.
6. H. Freeman. Computer processing of line-drawing images. ACM Computing Surveys, 6(1):57-97, Mar. 1974.
7. I. Gargantini. An effective way to represent quadtrees. Commun. ACM, 25(12):905-910, Dec. 1982.
8. A. V. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In SODA '05: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 156-165, Vancouver, BC, Canada, Jan. 2005.
9. A. V. Goldberg and R. F. Werneck. Computing point-to-point shortest paths from external memory. In ALENEX '05: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments, Vancouver, BC, Canada, Jan. 2005.
10. S. Gupta, S. Kopparty, and C. Ravishankar. Roads, codes, and spatiotemporal queries. In PODS '04: Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 115-124, Paris, France, June 2004.
11. A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD '84: Proceedings of the International Conference on Management of Data, pages 47-57, Boston, MA, USA, June 1984.
12. M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci., 55(1):3-23, Aug. 1997.
13. G. R. Hjaltason and H. Samet. Ranking in spatial databases. In SSD '91: Proceedings of the 4th International Symposium on Large Spatial Databases, pages 83-95, Portland, ME, USA, Aug. 1991.
14. G. R. Hjaltason and H. Samet. Incremental distance join algorithms for spatial databases. In SIGMOD '98: Proceedings of the International Conference on Management of Data, pages 237-248, Seattle, WA, USA, June 1998.
15. G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Trans. Database Syst., 24(2):265-318, June 1999.
16. D. A. Hutchinson, A. Maheshwari, and N. Zeh. An external memory data structure for shortest path queries, Discrete Applied Mathematics, 126(1):55-82, 2003.
17. 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 Transactions on Knowledge and Data Engineering, 10(3):409-432, May 1998.
18. M. R, Kolahdouzan and C. Shahabi. Voronoi-based k nearest neighbor search for spatial network databases. In VLDB'04: Proceedings of the 30th International Conference on Very Large Data Bases, pages 840-851, Toronto, Canada, Sept. 2004.
19. P. Micikevicius. General parallel computation on commodity graphics hardware: case study with the all-pairs shortest paths problem. In PDPTA '04: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, pages 1359-1365, Las Vegas, NV, USA, June 2004.
20. J. Mitchell, D. Mount, and C. Papadimitriou. The discrete geodesic problem. SIAM J. Comput., 16(4):647-668, Aug. 1987.
21. R. C. Nelson and H. Samet. A consistent hierarchical representation for vector data. SIGGRAPH Computer Graphics, 20(4); 197-206, Aug. 1986.
22. D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query processing in spatial network databases. In VLDB'03: Proceedings of the 29th International Conference on Very Large Databases, pages 802-813, Berlin, Germany, Sept. 2003.
23. S. Saltenis and C. S. Jensen. Indexing of moving objects for location-based services. In ICDE '02: Proceedings of the 18th International Conference on Data Engineering, pages 462-472, San Jose, CA, USA, Feb. 2002.
24. H. Samet. A quadtree medial axis transform. Commun. ACM, 26(9):680-693, Sept. 1983.
25. H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann, San Francisco, CA, USA, 2005.
26. H. Samet, H. Alborzi, F. Brabec, C. Esperança, G. R. Hjaltason, F. Morgan, and E. Tanin. Use of the SAND spatial browser for digital government applications. Commun. ACM, 46(1):63-66, Jan, 2003.
27. R. E. Schofer and F. F. Goodyear. Electronic computer applications in urban transportation planning. In Proceedings of the 1967 22nd ACM National Conference, pages 247-253, Washington, DC, USA, 1967.
28. +-tree: a dynamic index for multi-dimensional objects. In VLDB '87: Proceedings of the 13th International Conference on Very Large Databases, pages 507-518, Brighton, England, Sept. 1987.
29. C. Shahabi, M. R. Kolahdouzan, and M. Sharifzadeh. A road network embedding technique for k-nearest neighbor search in moving object databases. Geolnformatica, 7(3):255-273, Sept. 2003.
30. S, Shekhar and T. A. Yang. Motion in a geographical database system. In SSD '91: Proceedings of the 2nd Symposium on Large Spatial Databases, pages 339-358, Zürich, Switzerland, Aug. 1991.
31. S. Shekhar and J. S. Yoo. Processing in-route nearest neighbor queries: a comparison of alternative approaches. In GIS '03: Proceedings of the 11th ACM International Symposium on Advances in Geographic Information Systems, pages 9-16, New Orleans, LA, USA, 2003.
32. V. Surazhsky, T. Surazhsky, D. Kirsanov, S. J. Gortler, and H. Hoppe. Fast exact and approximate geodesies on meshes. ACM Trans. Gr., 23(3):553-560, Aug. 2005.
33. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM, 46(3):362-394, May 1999.
34. U.S. Census Bureau. TIGER/Line Files, Census 2000. U.S. Census Bureau, Washington, DC, USA, Oct. 2001. http://www.census.gov/geo/www/tiger/ tiger2k/tiger2000.html.
35. U.S. Geological Survey. Major Roads of the United States. U.S. Geological Survey, Reston, VA, USA, 199911. http://nationalatlas.gov/atlasftp.html.
36. D. Wagner and T. Willhalm. Geometric speed-up techniques for finding shortest paths in large sparse graphs. In ESA '03: Proceedings of the 11th Annual European Symposium on Algorithms, pages 776-787. 2003.
37. D. Wagner and T. Willhalm. Drawing graphs to speed up shortest-path computations. In ALENEX '05: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments, Vancouver, BC, Canada, Jan. 2005.
38. 0. Wolfson, P. Sistla, B. Xu, J, Zhou, and S. Chamberlain. Domino: databases for moving objects tracking. In SIGMOD '99: Proceedings of the International Conference on Management of Data, pages 547-549, Philadelphia, PA, USA, June 1999.
39. F. B. Zhan and C. E. Noon. Shortest path algorithms: An evaluation using real road networks. Transportation Science, 32(1):65-73, Feb. 1998.