Range Query Processing in Multidisk Systems

In order to reduce the disk access time,a database can be stored on several simultaneously accessible disks.In this paper,we are concerned with the dynamic d-attribute database allocation problem for range queries,An allocation method,called coordinate moule allocation method,is proposed to allocate data in a d-attribute database among disks so that the maximum disk accessing concurrency can be achieved for range queries.Our analysis and experiments show that the method achieves the optimum or near-optimum parallelism for range queries.The paper offers the conditions under which the method is optimal .The worst case bounds of the performance of the method are also given.In addition,the parallel algorithm of processing range queries in described at the end of the paper.The method has been used in the statistic and scientific database management system whic is being designed by us.

Range query processing in multidisk systems

In order to reduce the disk access time, a database can be stored on several simultaneously accessible disks. In this paper, we are concerned with the dynamicd-attribute database allocation problem for range queries. An allocation method, called coordinate modulo allocation method, is proposed to allocate data in ad-attribute database among disks so that the maximum disk accessing concurrency can be achieved for range queries. Our analysis and experiments show that the method achieves the optimum or near-optimum parallelism for range queries. The paper offers the conditions under which the method is optimal. The worst case bounds of the performance of the method are also given. In addition, the parallel algorithm of processing range queries is described at the end of the paper. The method has been used in the statistic and scientific database management system which is being designed by us.