Patent ID: 6412054
Filing Date: 2002-06-25
Classification: G06F,Y10S

Abstract:
A method of declustering and storing data blocks (x, y) of a two-dimensional dataset among a number of storage units for reducing response time of queries concerning a desired range of said data blocks in the x and y dimensions of the dataset once the data blocks are stored on the units, comprising:providing a number (M) of said storage units; defining M pairs (i, keyi) wherein i=0,1, . . . ,Mâˆ’1, and keyi is the fractional part of 2i/(1+5); ordering first components of said pairs according to an ascending order of corresponding keyi values of the pairs, thus defining a permutation array A of size M; defining another permutation array B such that for i=0,1, . . . ,Mâˆ’1, B[A[i]]=i; and assigning data block (x, y) to storage unit m=(xâˆ’B[y mod M]) mod M, wherein mod is the remainder function.