MB-tree: A quick indexing structure for multi-dimensional space
Hai Ying Huang, Ying Hou, Liu Li-xiong, Fucai Chen · 2010
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.