Query Processing in Spatial Network Databases

Proceedings 2003 VLDB Conference: 29th International Conference on Very Large Databases (VLDB)

Volumn , Issue , 2003, Pages 802-813

  Papadias, Dimitris ^a   Zhang, Jun ^a   Mamoulis, Nikos ^b   Tao, Yufei ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85129080892     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-012722442-8/50076-8     Document Type: Chapter

References (27)

1. Agrawal R., Dar S., Jagadish H. Direct Transitive Closure Algorithms: Design and Performance Evaluation TODS 15 3 1990 427-458.
2. Arge L., Procopiuc O., Ramaswamy S., Suel T., Vitter J.S. Scalablc Sweeping-Based Spatial Join VLDB 1998.
3. Beckmann N., Kriegel H.P., Schneider R., Seeger B. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles SIGMOD 1990.
4. Brinkhoff T., Kriegel H., Seeger B. Efficient Processing of Spatial Joins Using R-trees SIGMOD 1993.
5. Corman T.H., Leiserson C.E., Riverst R.L. Introduction to Algorithms 1990 MIT Press.
6. Corral A., Manolopoulos Y., Theodoridis Y., Vassilakopoulos M. Closest Pair Queries in Spatial Databases SIGMOD 2000.
7. Dijkstra E.W. A Note on Two Problems in Connection with Graphs Numeriche Mathematik Vol. 1 1959 269-271.
8. Faloutsos C., Ranganathan M., Manolopoulos Y. Fast Subsequence Matching in Time-Series Databases SIGMOD 1994.
9. Ferhatosmanoglu H., Stanoi I., Agrawal D., El Abbadi A. Constrained Nearest Neighbor Queries SSTD 2001.
10. Guttman A. R-trees: A Dynamic Index Structure for Spatial Searching SIGMOD 1984.
11. Huang Y., Jing N., Rundensteiner E. Effective Graph Clustering for Path Queries in Digital Map Databases CIKM 1996.
12. Huang Y., Jing N., Rundensteiner E. Integrated Query Processing Strategies for Spatial Path Queries ICDE 1997.
13. Hjaltason G., Samet H. Distance Browsing in Spatial Databases TODS 24 2 1999 265-318.
14. Ioannidis Y., Ramakrishnan R., Winger L. Transitive Closure Algorithms Based on Graph Traversal TODS 18 3 1993 512-576.
15. Jiang B. I/O-Efficiency of Shortest Path Algorithms: An Analysis ICDE 1992.
16. Jing N., Huang Y.W., Rundensteiner E. Hierarchical Encoded Path Views for Path Query Processing: an Optimal Model and its Performance Evaluation TKDE 19 1 1997 102-119.
17. Jung S., Pramanik S. HiTi Graph Model of Topographical Roadmaps in Navigation Systems ICDE 1996.
18. Kung R., Hanson E., Ioannidis Y., Sellis T., Shapiro L., Stonebraker M. Heuristic Search in Data Base Systems Expert Database Systems 1986.
19. Papadopoulos A., Rigaux P., Scholl M. A Performance Evaluation of Spatial Join Processing Strategies SSD 1999.
20. Rigaux P., Scholl M., Voisard A. Spatial Databases with Application to GIS 2002 Morgan Kaufmann.
21. Seidl T., Kriegel H. Optimal Multi-Step k-Nearest Neighbor Search SIGMOD 1998.
22. Shekhar S., Kohli A., Coyle M. Path Computation Algorithms for Advanced Traveler Information System (ATIS) ICDE 1993.
23. Shahabi C., Kolahdouzan M., Sharifzadeh M. A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases ACM GIS 2002.
24. Shekhar S., Liu D. CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations TKDE 19 1 1997 102-119.
25. Sellis T., Roussopoulos N., Faloutsos C. The R+tree: a Dynamic Index for Multi-Dimensional Objects VLDB 1987.
26. Tao T., Papadias D., Shen Q. Continuous Nearest Search VLDB 2002.
27. www.maproom.psu.edu/dcw/.