A range key query scheme for multidimensional databases

In this paper, a new implementation scheme of range key query for multidimensional databases is proposed and evaluated. The scheme implements a multidimensional database by employing an extendible multidimensional array. By using multidimensional arrays, fast random addressing functions for element access can be invoked by knowing a tuple of subscripts of an array element. However these kinds of multidimensional arrays suffer from some problems. In our scheme, these problems are solved by an efficient scheme of record encoding based on the notion of extendible array. The scheme shows good retrieval performance for range key query compared with conventional implementation of RDMS.