Generally, multidimensional data require a large amount of storage space. There are a few limits to store and manage those large amounts of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can get highly improved performance. In this paper, we propose an efficient index structure for multidimensional data that exploits the parallel computing environment. The proposed index structure is constructed based on nP(processor)-n̈mD(disk) architecture which is the hybrid type of nP-nD and 1P-nD. Its node structure increases fanout and reduces the height of an index tree. Our proposed index structure gives a range search algorithm that maximizes I/O parallelism. The range search algorithm is applied to k-nearest neighbor queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Bok, K. S., Seo, D. M., Song, S. I., Kim, M. H., & Yoo, J. S. (2005). An index structure for parallel processing of multidimensional data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3739 LNCS, pp. 589–600). https://doi.org/10.1007/11563952_51
Mendeley helps you to discover research relevant for your work.