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

Design and Performance Analysis of a Parallel Cell-Based Filtering Scheme using Horizontally-Partitioned Technique  

Chang, Jae-Woo (전북대학교 컴퓨터공학과)
Kim, Young-Chang (전북대학교 대학원 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartD / v.10D, no.3, 2003 , pp. 459-470 More about this Journal
Abstract
It is required to research on high-dimensional index structures for efficiently retrieving high-dimensional data because an attribute vector in data warehousing and a feature vector in multimedia database have a characteristic of high-dimensional data. For this, many high-dimensional index structures have been proposed, but they have so called ‘dimensional curse’ problem that retrieval performance is extremely decreased as the dimensionality is increased. To solve the problem, the cell-based filtering (CBF) scheme has been proposed. But the CBF scheme show a linear decreasing on performance as the dimensionality. To cope with the problem, it is necessary to make use of parallel processing techniques. In this paper, we propose a parallel CBF scheme which uses a horizontally-partitioned technique as declustering. In order to maximize the retrieval performance of the proposed parallel CBF scheme, we construct our parallel CBF scheme under a SN (Shared Nothing) cluster architecture. In addition, we present a data insertion algorithm, a rage query processing one, and a k-NN query processing one which are suitable for the SN cluster architecture. Finally, we show that our parallel CBF scheme achieves better retrieval performance in proportion to the number of servers in the SN cluster architecture, compared with the conventional CBF scheme.
Keywords
Multimedia Information Retriebal; Content-based retrieval; High-dimensional Index Structure;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Berchtold, D. A. Keim, H.-P. Kriegel, 'The X-tree : An Index Structure for High-Dimensional Data,' Proceedings of the 22nd VLDB Conference, pp.28-39, 1996
2 S. Arya, D. M. Mount, O. Narayan, 'Accounting for Boundary Effects in Nearest Neighbor Searching,' Proc. 11th Annaual Symp. on Computational Geometry, Vancouver, Canada, pp.336-344, 1995   DOI
3 S.-G. Han and J.-W. Chang, 'A New High-Dimensional Index Structure Using a Cell-based Filtering Technique,' In Lecture Notes in Computer Science 1884(Current Issues in Databases and Information Systems), Springer, pp.79-92, 2000
4 Roger Weber, Hans-Jorg Schek, Stephen Blott, 'A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces,' Proceedings of 24rd International Conference on Very Large Data Bases, pp.24-27, 1998
5 H. I. Lin, H. Jagadish and C. Faloutsos, 'The TV-tree : An Index Structure for High Dimensional Data,' VLDB Journal, Vol.3, pp.517-542, 1995   DOI
6 C. Faloutsos, 'Design of a Signature File Method that Accounts for Non-Uniform Occurrence and Query Frequencies,' ACM SIGMOD, pp.165-170, 1985
7 J.-K. Kim and J.-W. Chang, 'Horizontally-divided Signature File on a Parallel Machine Architecture,' Journal of Systems Architecture, Vol.44, No.9-10, pp.723-735, June, 1998   DOI   ScienceOn
8 N. Roussopoulos, S. Kelley, F. Vincent, 'Nearest Neighbor Queries,' Proc. ACM Int. Conf. on Management of Data(SIGMOD), pp.71-79, 1995   DOI
9 J.-K. Kim and J.-W. Chang, 'Vertically-partitioned Parallel Signature File Method,' Journal of Systems Architecture, Vol.46, No.8, pp.655-673, June, 2000   DOI   ScienceOn
10 J. T. Robinson, 'The K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indexes,' Proc. ACM SIGMOD Int. Conf. on Management of Data, pp.10-18, 1981   DOI
11 D. A. White and R. Jain, 'Similarity Indexing : Algorithms and Performance,' In Proc. of the SPIE : Storage and Retrieval for Image and Video Databases IV, Vol.2670, pp.62-75, 1996   DOI
12 Berchtold, S., Bohm, C., Keim, D., Kriegel, H.-P., 'A Cost Model for Nearest Neighbor Search in High-Dimensional Data Space,' ACM PODS Symposium on Principles of Databases Systems, Tucson, Arizona, 1997   DOI