欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对现有的基于R-树和四叉树的空间索引结构中存在的问题，以减少兄弟节点间的交叠为目标，通过定义空间数据的排序方法对要索引的数据空间及其子空间按照数据的分布进行分割，使得索引树上每层节点间的交叠极小化，同时使树的高度尽可能低，建立了一种新的空间数据索引结构-QRM0树．给出了QRMO树的生成、节点插入和区域查询算法及相应算法的可行性和正确性定理及时间复杂度分析．对新结构进行了中间节点交叠试验分析和对比，实验表明，新的索引结构上的同层节点间的交叠得到明显减少．
英文摘要：
To reduce overlap between brother nodes, a new index structure for spatial data-a QRMO-tree-was proposed by mapping order relationships between spatial data to partition data space and its subspaees according to the distribution of spatial data contained in it. This minimizes overlap among the nodes on the same level of the tree, making the height of the tree as low as possible. It overcomes problems existing in other spatial structures that are based on R- trees or quadtrees. The algorithms for constructing the index structure, node insertion and range query, theorems for the corresponding algorithm＇s feasibilities and the accuracy and time complexities of the corresponding algorithms were analyzed. Experimental analysis and comparisons of the overlap among middle nodes were made for the new structure. The experiment showed that overlap among the nodes on the same level of the tree is greatly reduced.
同期刊论文项目
同项目期刊论文
期刊信息
位置：