［8］Guttman A. R-trees: A dynamic index structure for spatial
[4]
［10］Kim W, Garza J, Keskin A. Spatial data management in
[5]
［12］Date C J. An introduction to database systems. New York:
[6]
［14］Selinger P G, Astrahan M M, Chamberlin D D et al. Access path selection in a relational database management system. In Proc. Of the ACM SIGMOD Int\'l Conf. On Management of Data, Boston, 1979.
[7]
［1］Codd E F. A relational model of data for large shared data
[8]
［3］Theodoridis Y, Stefanakis E, Sellis T. Cost models for join
[9]
［4］queries in spatial databases. IEEE Trans. On Knowledge and Data Engineering, 1998.
[10]
［5］Papadias D, Theodoridis Y, Sellis T et al. Topological relations in the world of minimum bounding rectangles: A study with R-trees. In: Proc. Of ACM SIGMOD Int\'l Conf. on Management of Data, 1995.4 Brinkhoff T, Kriegel H, Seeger B. Efficient processing of spatial joins using R-trees. In:Proc. Of ACM SIGMOD Int\'l Conf. on Management of Data, 1993.
[11]
［7］Walid G Aref, Hanan Samet. Optimization strategies for spatial query processing. In:17th Int\'l Conf. On Very Large Data Bases(VLDB), Spain, Madrid,Sep.1991.
[12]
［9］searching. In:Proc. Of ACM SIGMOD Int\'l Conf. on Management of Data, 1984.
[13]
［11］database systems: Research directions. In 3rd Symposium on Large Spatial Databases, Zurich, Switzerland, Aug.1995.
