关键词: 空间索引, 空间数据库, 空间查询, R-树, 松散四叉树

Abstract: Spatial index is the key technology to realize spatial query, and its performance decides the storage efficiency of spatial data and the performance of spatial query directly. In order to improve spatial query efficiency, a hybrid spatial index structure called LQR-tree is proposed. For the existing QR- tree index structure, there may be a problem that smaller objects fall into larger nodes in the allocation of nodes. The structure will combine loose quardtree and R-tree and can move nodes from the upper level to the lower level. The index can optimize query  performance of moving spatial objects. In this paper, the structure of LQR-tree is given and insert and delete algorithm are put forward. And relevant theorems and proofs are given.

Key words: spatial index, spatial database, spatial query, R-tree, loose quardtree