Efficient and Flexible Bitmap Indexing for Complex Similarity Queries

  • Guang-Ho Cha
Conference paper

DOI: 10.1007/978-3-540-24571-1_63

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2973)
Cite this paper as:
Cha GH. (2004) Efficient and Flexible Bitmap Indexing for Complex Similarity Queries. In: Lee Y., Li J., Whang KY., Lee D. (eds) Database Systems for Advanced Applications. DASFAA 2004. Lecture Notes in Computer Science, vol 2973. Springer, Berlin, Heidelberg


In this paper, we propose a novel indexing method for complex similarity queries in high-dimensional image and video databases. In order to provide the indexing method with the flexibility in dealing with multiple features and multiple query objects, we treat every dimension independently. The efficiency of our method is realized by a specialized bitmap indexing that represents all objects in a database as a set of bitmaps. The percentage of data accessed in our indexing method is inversely proportional to the overall dimensionality, and thus the performance deterioration with the increasing dimensionality does not occur. To demonstrate the efficacy of our method we conducted extensive experiments and compared the performance with the linear scan by using real image and video datasets, and obtained a remarkable speed-up over the linear scan.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Guang-Ho Cha
    • 1
  1. 1.Department of Multimedia ScienceSookmyung Women’s UniversitySeoulSouth Korea

Personalised recommendations