基于聚类分解的高维度量空间索引B.pdf

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.19, No.6, June 2008, pp .1401− 1412 DOI: 10.3724/SP.J.1001.2008.01401 Tel/Fax : +86-10 © 2008 by Journal of Software. All rights reserved. ∗ + 基于聚类分解的高维度量空间索引B -Tree + 张军旗, 周向东 , 王 梅, 施伯乐 (复旦大学 计算机与信息技术系,上海 200433) + Cluster Splitting Based High Dimensional Metric Space Index B -Tree + ZHANG Jun-Qi, ZHOU Xiang-Dong , WANG Mei, SHI Bai-Le (Department of Computing and Information Technology, Fudan University, Shanghai 200433, China) + Corresponding author: E-mail: xdzhou@ + Zhang JQ, Zhou XD, Wang M, Shi BL. Cluster splitting based high dimensional metric space index B -Tree. Journal of Software, 2008,19(6):1401−1412. /1000-9825/19/1401.htm Abstract: In order to improve the query efficiency, K-means cluster approach is often used to estimate the data distribution in the context of high dimensional metric space index. But in previous work, the parameters of clustering are usually selected according to some heuristic manner. This paper presents a new high dimensional index approach —cluster splitting based high dimensional B+ -tree. Through cluster splitting, the data space is partitioned more finely to reduce the cost of data