MB-TREE: A Quick Indexing Structure for Multi-dimensional Space

摘要：

Efficient indexing structure is the key of multi-dimension retrieval issue. Lots of indexing structures are failed in the parallelism. This paper presents multi-branch indexing tree (MB-tree), using the nearest neighbor criterion to realize the multi space division of the data sets. The experimental results indicate that the structure is suitable for parallel computing and can significantly improve the speed of similarity query.

关键词： multi-branch indexing Tree multi-dimensional indexing structure similar search

作者: HUANG Hai HOU Ying LIU Li-Xiong CHEN Fu-Cai

作者单位: National Digital Switching System Engineering & Technological Research CenterZhengzhou China National Digital Switching System Engineering & Technological Research Center Zhengzhou China

会议类型: 国际会议

会议名称: 2010 3rd International Conference on Advanced Computer Theory and Engineering(2010年第三届先进计算机理论与工程国际会议 ICACTE 2010)

会议地点: 成都

会议语种:英文

页码: 1-3

在线出版日期: 2010-08-20（万方平台首次上网日期，不代表论文的发表时间）