Multi-Dimensional Indexing System Considering Distributions of Sub-indexes and Data

The development of information technology and personal computers enable us to get various multimedia data. In order to retrieve these data quickly, it is necessary to construct a multi-dimensional index including the R-tree family [1–3]. However, when the index becomes large, insertion time and retrieval time become long. The previous researches of the parallel multi-dimensional index have tried to improve the retrieval performance, although these does not consider the insertion performance [3–7]. When we must store multimedia data continuously, it is required to construct a multi-dimensional index within a limited time.