MB+-Tree: A New Index Structure for Multimedia Databases
Qi Yang, Asha Vellaikal, Son K. Dao · 1995
We describe a new indexing structure, named the MB + -tree which has been designed to assist content-based retrieval in image and video databases. We initially consider the types of queries that would be prevalent in such databases and map them to nearest-neighbor searches and range searches in a multidimensional space. The MB + -tree is based on linear order in a high dimensional space and has several features of the standard B + -tree. The linear order gives it many advantages over other structures which are commonly used for indexing in multidimensional space. Specifically, the algorithm for finding nearest-neighbors is efficient and flexible as it optimally finds the subtrees which can contain the desired point(s) while allowing the use of different weighted euclidean-distance similarity measures. It is expected that the projected advantages of the MB + -tree will be confirmed by experimental results. 1 Introduction With the proliferation of multimedia data, it is becom...