2010•Unpublished venueRequires access

MB-tree: A quick indexing structure for multi-dimensional space

Hai Ying Huang, Ying Hou, Liu Li-xiong, Fucai Chen

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.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Search engine indexing, Computer science, Data structure, Nearest neighbor search, Tree (set theory), Dimension (graph theory), Tree structure, k-nearest neighbors algorithm