Tree-Based Indexes for Image Data

As in conventional database management systems (DBMSs), to allow users to efficiently access and retrieve data objects, a multimedia database management system (MMDBMS) must employ an effective access method such as indexing and hashing. This paper provides a survey of tree-based multidimensional indexing techniques for MMDBMSs that maintain image data represented as feature vectors. These techniques support such data while maintaining desirable characteristics of a B-tree, an index structure most commonly used in traditional DBMSs. In this survey, we provide descriptions of each tree as well as give examples of the different data organization schemes. We also describe the advantages and disadvantages of using each technique. In addition, we provide classifications of the trees using several different properties. These classifications should assist researchers in identifying the strengths and weaknesses of any new indexing technique they develop as well as help users determine the most appropriate data structure for their applications.