Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2003.10D.1.001

Design and Implementation of High-dimensional Index Structure for the support of Concurrency Control  

Lee, Yong-Ju (한국전자통신연구원 컴퓨터시스템연구부)
Chang, Jae-Woo (전북대학교 전자정보공학부(컴퓨터공학과))
Kim, Hang-Young (한국전자통신연구원 컴퓨터시스템연구부)
Kim, Myung-Joon (한국전자통신연구원 컴퓨터소프트웨어 연구소)
Publication Information
The KIPS Transactions:PartD / v.10D, no.1, 2003 , pp. 1-12 More about this Journal
Abstract
Recently, there have been many indexing schemes for multimedia data such as image, video data. But recent database applications, for example data mining and multimedia database, are required to support multi-user environment. In order for indexing schemes to be useful in multi-user environment, a concurrency control algorithm is required to handle it. So we propose a concurrency control algorithm that can be applied to CBF (cell-based filtering method), which uses the signature of the cell for alleviating the dimensional curse problem. In addition, we extend the SHORE storage system of Wisconsin university in order to handle high-dimensional data. This extended SHORE storage system provides conventional storage manager functions, guarantees the integrity of high-dimensional data and is flexible to the large scale of feature vectors for preventing the usage of large main memory. Finally, we implement the web-based image retrieval system by using the extended SHORE storage system. The key feature of this system is platform-independent access to the high-dimensional data as well as functionality of efficient content-based queries. Lastly. We evaluate an average response time of point query, range query and k-nearest query in terms of the number of threads.
Keywords
Concurrency Control; High-dimensional Index Structure; Multimedia Data; SHORE Storage System;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 Berchtold S., Keim D., and Kriegel H.-P., 'The X-tree : An Index Structure for High-Dimensional Data,' 22nd Conf. on Very Large Databases, pp.28-39, 1996
2 K. I. Lin, H. Jagadish, and C. Faloutsos, 'The TV-tree : An Index Structure for High Dimensional Data,' VLDB Journal, Vol.3, pp.517-542, 1994   DOI
3 Beckmann N., Kriegel H. P, Schneider R., and Seeger B., 'The $R^*-tree$ : An Efficient and Robust Access Method for Points and Rectangles,' Proc. ACM SIGMOD Int. Conf. on Management of Data, pp.322-331, 1990   DOI
4 Arya S., Mount D. M., and Narayan O., 'Accounting for Boundary Effects in Nearest Neighbor Searching,' Proc. 11th Annual Symp. on Computational Geometry, pp.336-344, 1995   DOI
5 H-T Chou, et al, 'Design and Implementation of the Wis-consin Storage System,' Software Practice and Experience, Vol.15, No.10, 1985   DOI   ScienceOn
6 Berchtold S., Bohm C, Keim D., Kriegel H. P, 'A Cost Model fro Nearest Neighbor Search in High-Dimensional Data Space,' ACM PODS Symposium on Principles of Databases Systems, Tucson, Arizona, 1997
7 한성근, 이용주, 장재우, 김현진, '효율적인 고차원 데이터색인을 위한 셀-기반 필터링 기법', Proceedings of Korean Data base Conference, pp.26-35, 2000
8 Sung-Geun Han and Jae Woo Chang, 'A New High-Dimen-sional Index Structure Using a Cell-Based Filtering Technique,' Proc. of International Conf. on ADBIS-DASFAA, pp.79-92, 2000
9 Kwang Taek Song, Hwa-Jin Nam, and Jae-Woo Chang, 'A cell-based index structure for similarity search in high-dimensional feature spaces,' Proc. of ACM SAC, pp.264 268, 2001   DOI
10 Carey, M., DeWitt, D., Naughton, J., Solomon, M., et. al, 'Shoring Up Persistent Applications,' Proc. of International Conf. on ACM SIGMOD, pp.383-394, 1994   DOI
11 정재욱, 장재우, '멀티미디어 응용을 위한 SHORE 하부저장 시스템의 확장', 한국정보과학회 가을학술발표논문집(1), pp. 6-8, 1999   과학기술학회마을
12 M. Kornacker, C. Mohan and J. M. Hellerstein, 'Concur-rency and Recovery in Generalized Search Trees,' Proc. of International Conf. on ACM SIGMOD, pp.62 72, 1997   DOI