%0 Journal Article %T Research on Dynamic Indexing Structure for Multi-Dimensional Vectors
多维向量动态索引结构研究 %A ZHOU Xue-hai %A LI Xi %A XU Hai-yan %A GONG Yu-chang %A ZHAO Zhen-xi %A
周学海 %A 李曦 %A 徐海燕 %A 龚育昌 %A 赵振西 %J 软件学报 %D 2002 %I %X Multi-Dimentional vectors indexing is one of the key technologies in multimedia database systems. This paper focuses on the dynamic indexing structure based on the vector space. An ER-Tree indexing structure is proposed which is efficient for medium and high dimensional vectors. In the ER-Tree, the efficiency of retrieval could be improved by the ways of partition of the vector space with hyper-sphere and R*-Tree s re-insert technology introduced to enhance ER-Tree s capability to represent the data-sets'features.By introducing safe-inserted-node and safe-deleted-node concept into the structure,the performance of tree creation is reenforced.The algorithms are also given for the creation of ER-Tree.The empirical test test results show that(1)the tree creation algorithm proposed is about 10 times faster thanR*-Tree.(2)the effectiveness of retrieval is highly improved. %K ER-Tree %K dynamic indexing structure %K similarity retrieval
ER-Tree %K 动态索引结构 %K 相似性检索 %U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=5652FE56D08F3D6D&yid=C3ACC247184A22C1&vid=FC0714F8D2EB605D&iid=E158A972A605785F&sid=B5D9C773C430C13C&eid=1F7317C17A9AF4FA&journal_id=1000-9825&journal_name=软件学报&referenced_num=2&reference_num=7