DocumentCode
2225699
Title
MB-tree: A quick indexing structure for multi-dimensional space
Author
Huang Hai ; Hou Ying ; Liu Li-xiong ; Chen Fu-Cai
Author_Institution
Nat. Digital Switching Syst. Eng. & Technol. Res. Center, Zhengzhou, China
Volume
5
fYear
2010
fDate
20-22 Aug. 2010
Abstract
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.
Keywords
indexing; query processing; tree data structures; MB-TREE; multi space division; multibranch indexing tree; multidimension retrieval issue; multidimensional space; nearest neighbor criterion; parallel computing; quick indexing structure; similarity query; multi-branch indexing Tree; multi-dimensional indexing structure; similar search;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Computer Theory and Engineering (ICACTE), 2010 3rd International Conference on
Conference_Location
Chengdu
ISSN
2154-7491
Print_ISBN
978-1-4244-6539-2
Type
conf
DOI
10.1109/ICACTE.2010.5579432
Filename
5579432
Link To Document