In spatial database application,to solve the problem that a single special indexing structure constrains retrieval performance with the increment of the amount of data,a hybrid tree special indexing structure is proposed,and so is OR*R*-tree,which is based on Octree and R*R*-tree in 3D GIS.

According to the characteristics of Master Boot Record(MBR) in R*R*-tree, this paper creates the binary segment tree by sweeping the orthogonal overlapping region.

R-tree spatial join algorithm based on the breath-first paradigm;

Multi-scale spatial index structure based on R-tree;

Brand-new node-choosing algorithm of R-tree spatial index;

In terms of the mobility of data set, global distances at different situation are refined and some heuristics are presented for data set indexed by data structure of R tree family.

Optimization research of spatial index structure of R*R*-tree;

This paper from the features of different index structure analyzes the reverse nearest neighbor query superiorities under low dimension based on R*R*-tree and puts forward a new kind reverse nearest neighbor query method about spatial.

A dynamic R-tree index based on hybrid clustering algorithm;

Region Matching Algorithm for DDM Based on Dynamic R-tree;

Research of optimal continuous nearest neighbor query algorithm based on R-tree;

After analyzing the previous researches on the spatial join, this paper introduced a new method, orthogonal polygons, to approximate actual spatial data in spatial access methods, and to join spatial relation based on R trees.