Efficient and flexible bitmap indexing for complex similarity queries
- Authors
- Cha, GH
- Issue Date
- Mar-2004
- Publisher
- SPRINGER-VERLAG BERLIN
- Citation
- DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, v.2973, pp 708 - 720
- Pages
- 13
- Journal Title
- DATABASE SYSTEMS FOR ADVANCED APPLICATIONS
- Volume
- 2973
- Start Page
- 708
- End Page
- 720
- URI
- https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/16124
- ISSN
- 0302-9743
- Abstract
- In this paper, we propose a novel indexing method for complex similarity queries in high-dimensional image and video data-bases. 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 speedup over the linear scan.
- Files in This Item
-
Go to Link
- Appears in
Collections - ICT융합공학부 > IT공학전공 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/16124)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.