计算机应用与软件2013，Vol.30Issue(6)：162-165,4.DOI:10.3969/j.issn.1000-386x.2013.06.044
基于KDG-tree的数据库多维索引技术
MULTI-DIMENSIONAL DATABASE INDEX BASED ON KDG-TREE
摘要
Abstract
In view of the problems of redundant data of current grid index and the dimension disaster of dimensional index of KD-tree,etc.,we propose an efficient indexing structure KDG-tree,which combines the grid index with the binary search tree.KDG-tree links the nodes together to form the binary index tree through vertical and horizontal pointers,and all nodes in the tree are divided into intermediate index nodes and the leaf nodes,all the data objects are only saved on leaf nodes.When creating the index,the node is inserted in order from high dimension to low dimension according to the node index value respectively; when to find the object,by-dimensional search will be done.Experimental analysis shows that the KDG-tree avoids the data redundancy of the grid index,and also improves the performances of KD-tree and KDB-tree as well,it is a multi-dimensional index suitable for high dimensional mass data.关键词
多维索引/KDG-tree/网格索引/KD-tree/KDB-treeKey words
Multi-dimensional indexing / KDG-tree / Grid index / KD-tree / KDB-tree分类
信息技术与安全科学引用本文复制引用
李晓东,陈俊健,曾凡智..基于KDG-tree的数据库多维索引技术[J].计算机应用与软件,2013,30(6):162-165,4.基金项目
广东省自然科学基金项目(10452800001004185). （10452800001004185）
