Scalable network distance browsing in spatial databases

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 43-54

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

^a UNIVERSITY OF MARYLAND   (United States)

^b GOOGLE INC   (United States)

Author keywords

Decoupling; Nearest neighbor; Scalability; Shortest path quadtree; Spatial networks

Indexed keywords

DECOUPLING; DO-MAINS; K-NEAREST NEIGHBORS; NEAREST NEIGHBOR; NETWORK DISTANCES; PRECOMPUTING; QUERY OBJECTS; ROAD NETWORKS; SCALABLE NETWORKS; SHORTEST PATH QUADTREE; SHORTEST PATHS; SPATIAL COHERENCES; SPATIAL DATABASES; SPATIAL NETWORKS; SQUARE ROOTS; THEORETICAL ANALYSES; WORST CASES;

ELECTRIC NETWORK ANALYSIS; GRAPH THEORY; MOTOR TRANSPORTATION;

WIRELESS SENSOR NETWORKS;

EID: 57149143446     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376623     Document Type: Conference Paper

References (32)

1. J. E, Bresenham. Algorithm for computer control of a digital plotter. IBM Systems Journal, 4(l):25-30, 1965.
2. H.-J. Cho and C.-W. Chung. An efficient and scalable approach to CNN queries in a road network. In VLDB '05, pp. 865-876, Trondheim, Norway, Sep. 2005.
3. K. L. Clarkson. Fast algorithm for the all nearest neighbors problem. In FOCS'83, pp. 226-232, Tucson, AZ, Nov. 1983.
4. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
5. G. N. Frederickson. Planar graph decomposition and all pairs shortest paths. JACM, 38(1): 162-204, Jan. 1991.
6. K. Fukunaga and P. M. Narendra. A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. on Comp., 24(7):750-753, July 1975.
7. I. Gargantini. An effective way to represent quadtrees. CACM, 25(12):905-910, Dec. 1982.
8. * search meets graph theory. In SODA '05, pp. 156-165, Vancouver, Canada, Jan. 2005.
9. A. Henrich. A distance-scan algorithm for spatial access structures. In ACM GIS'94, pp. 136-143, Gaithersburg, MD, Dec. 1994.
10. G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. TODS, 24(2):265-318, June 1999.
11. E. G. Hoel and H. Samet. Efficient processing of spatial queries in line segment databases. In SSD'91, LNCS 525, pp. 237-256, Zurich, Switzerland, Aug. 1991.
12. H. Hu, D. L. Lee, and V. C. S. Lee. Distance indexing on road networks. In VLDB'06, pp. 894-905, Seoul, Korea, Sep. 2006.
13. G. M. Hunter and K. Steiglitz. Operations on images using quad trees. PAMI, 1(2): 145-153, Apr. 1979.
14. 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, 10(3):409-432, May 1998.
15. M. R. Kolahdouzan and C. Shahabi. Voronoi-based k nearest neighbor search for spatial network databases. In VLDB'04, pp. 840-851, Toronto, Canada, Sep. 2004.
16. M. R. Kolahdouzan and C. Shahabi. Continuous k-nearest neighbor queries in spatial network databases. In STDBM'04, pp. 33-40, Toronto, Canada, Aug. 2004.
17. M. Lindenbaum, H. Samet, and G. R. Hjaltason. A probabilistic analysis of trie-based sorting of large collections of line segments in spatial databases. SIAM J. on Computing, 35(l):22-58, Sep. 2005.
18. G. M. Morton. A computer oriented geodetic data base and a new technique in file sequencing. Tech. report, IBM Ltd., Ottawa, Canada, 1966.
19. R. C. Nelson and H. Samet. A population analysis for hierarchical data structures. In SIGMOD'87, pp. 270-277, San Francisco, May 1987.
20. J. A. Orenstein. Multidimensional tries used for associative searching. Inf. Proc. Letters, 14(4): 150-157, June 1982.
21. D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query processing in spatial network databases. In VLDB'03, pp. 802-813, Berlin, Germany, Sep. 2003.
22. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In SIGMOD'95, pp. 71-79, San Jose, CA, May 1995.
23. H. Samet. Region representation: quadtrees from binary arrays. CGIP'80, 13(l):88-93, May 1980.
24. H. Samet. An algorithm for converting rasters to quadtrees. PAMI, 3(1):93-95, Jan. 1981.
25. H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann, San Francisco, 2006.
26. H. Samet and R. E. Webber. Storing a collection of polygons using quadtrees. TOGS, 4(3): 182-222, July 1985.
27. J. Sankaranarayanan, H. Alborzi, and H. Samet. Efficient query processing on spatial networks. In ACM GIS'05, pp. 200-209, Bremen, Germany, Nov. 2005.
28. C. A. Shaffer and H. Samet. Optimal quadtree construction algorithms. CVGIP '87, 37(3):402-419, Mar. 1987.
29. C. A. Shaffer, H. Samet, and R. C. Nelson. QUILT: a geographic information system based on quadtrees. Int. Jour. of Geog. Inf. Sys., 4(2): 103-131, Apr.-Jun. 1990.
30. C. Shahabi, M. R. Kolahdouzan, and M. Sharifzadeh. A road network embedding technique for k-nearest neighbor search in moving object databases. Geoinformatica, 7(3):255-273, Sep. 2003.
31. D. Wagner and T. Willhalm. Geometric speed-up techniques for finding shortest paths in large sparse graphs. In ESA '03, LNCS 2832, pp. 776-787, Budapest, Hungary, Sep. 2003.
32. F. Zhan and C. E. Noon. Shortest path algorithms: an evaluation using real road networks. Transportation Science, 32(l):65-73, Feb. 1998.