Abstract
A large number of high-dimensional index structures suffer from the so called ’dimensional curse’ problem, i.e., the retrieval performance becomes increasingly degraded as the dimensionality is increased. To solve this problem, the cell-based filtering (CBF) scheme has been proposed, but it shows a linear decrease in performance as the dimensionality is increased. In this paper, we develop a parallel CBF scheme under an SN(Shared Nothing) cluster-based parallel architecture, so as to cope with the linear decrease in retrieval performance. In addition, we devise data insertion, range query and k-NN query processing algorithms which are suitable for the SN parallel architecture. Finally, we show that our parallel CBF scheme achieves good retrieval performance in proportion to the number of servers in the SN architecture and it outperforms a parallel version of the VA-File when the dimensionality is over 10.
This work is financially supported by the Ministry of Education and Human Resources Development (MOE), the Ministry of Commerce, Industry and Energy (MOCIE) and the Ministry of Labor (MOLAB) though the fostering project of the Lab of Excellency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
White, D.A., Jain, R.: 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)
Lin, H.I., Jagadish, H., Faloutsos, C.: The TV-tree: An Index Structure for High Dimensional Data. VLDB Journal 3, 517–542 (1995)
Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An Index Structure for High-Dimensional Data. In: Proceedings of the 22nd VLDB Conference, pp. 28–39 (1996)
Berchtold, S., Bohm, C., Keim, D., Kriegel, H.-P.: A Cost Model for Nearest Neighbor Search in High-Dimensional Data Space. In: ACM PODS Symposium on Principles of Databases Systems, Tucson, Arizona (1997)
Weber, R., Schek, H.-J., Blott, S.: A Quantitative Analysis and Performance Study for Similarity-Search Methods in High- Dimensional Spaces. In: Proceedings of 24rd International Conference on Very Large Data Bases, pp. 24–27 (1998)
Han, S.-G., Chang, J.-W.: A New High-Dimensional Index Structure Using a Cell-Based Filtering Technique. In: Masunaga, Y., Thalheim, B., Štuller, J., Pokorný, J. (eds.) ADBIS 2000 and DASFAA 2000. LNCS, vol. 1884, pp. 79–92. Springer, Heidelberg (2000)
Kim, J.-K., Chang, J.-W.: Horizontally-divided Signature File on a Parallel Machine Architecture. Journal of Systems Architecture 44(9-10), 723–735 (1998)
Kim, J.-K., Chang, J.-W.: Vertically-partitioned Parallel Signature File Method. Journal of Systems Architecture 46(8), 655–673 (2000)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: Proc. ACM Int. Conf. on Management of Data(SIGMOD), pp. 71–79 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, JW., Wang, TW. (2006). Developing Parallel Cell-Based Filtering Scheme Under Shared-Nothing Cluster-Based Architecture. In: Etzion, O., Kuflik, T., Motro, A. (eds) Next Generation Information Technologies and Systems. NGITS 2006. Lecture Notes in Computer Science, vol 4032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780991_22
Download citation
DOI: https://doi.org/10.1007/11780991_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35472-7
Online ISBN: 978-3-540-35473-4
eBook Packages: Computer ScienceComputer Science (R0)