An index structure for improving closest pairs and related join queries in spatial databases

Proceedings of the International Database Engineering and Applications Symposium, IDEAS

Volumn 2002-January, Issue , 2002, Pages 140-149

  Yang, Congjun ^a   Lin, King Ip ^a  

^a University of Memphis   (United States)

Author keywords

Computer science; Indexes; Multidimensional systems; Multimedia databases; Multimedia systems; Navigation; Nearest neighbor searches; Pollution measurement; Production facilities; Spatial databases

Indexed keywords

COMPUTER SCIENCE; FORESTRY; MULTIMEDIA SYSTEMS; NAVIGATION; NEAREST NEIGHBOR SEARCH;

INDEXES; MULTIDIMENSIONAL SYSTEMS; MULTIMEDIA DATABASE; POLLUTION MEASUREMENT; PRODUCTION FACILITY; SPATIAL DATABASE;

DATABASE SYSTEMS;

EID: 79955122494     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2002.1029666     Document Type: Conference Paper

References (12)

1. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter. Scalable sweeping-based spatial join. In Proceedings of the Twenty-fourth International Conference on Very Large Databases, pages 570-581, 1998.
2. T. Brinkhoff, H.-P. Kriegel, R. Schneider, and B. Seeger. Multi-step processing of spatial joins. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, pages 197-208, Minneapolis, MN, May 1994.
3. T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient processing of spatial joins using R-trees. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 237-246, Washington, D.C., May 1993.
4. A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos. Closest pair queries in spatial databases. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pages 189-200, May 2000.
5. G. R. Hjaltason and H. Samet. Incremental distance join algorithms for spatial databases. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pages 237-248, 1998.
6. Y.-W. Huang, N. Jing, and E. A. Rundensteiner. Spatial joins using r-trees: Breadth-first traversal with global optimizations. In Proceedings 23th International Conference on Very Large Data Bases, pages 396-405, Aug. 1997.
7. F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In Proceedings of 2000 ACM SIGMOD International Conference on Management of Data, pages 201-212, May 2000.
8. N. Koudas and K. C. Sevcik. Size separation spatial join. In Proceedings of 1997 ACM SIGMOD International Conference on Management of Data, pages 324-335, 1997.
9. M.-L. Lo and C. V. Ravishankar. Spatial joins using seeded trees. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, pages 209-220, Minneapolis, MN, May 1994.
10. M.-L. Lo and C. V. Ravishankar. Spatial hash-joins. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pages 247-258, Montreal, Quebec, Canada, 4-6 June 1996.
11. J. M. Patel and D. J. DeWitt. Partition based spatial-merge join. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pages 259-270, 1996.
12. C. Yang and K.-I. Lin. An index structure for efficient reverse nearest neighbor queries. In Proceedings of the 17th IEEE International Conf. on Data Engineering, pages 485-492, Apr. 2001.