SYMBOLIC GRAY CODE AS A DATA ALLOCATION SCHEME FOR 2-DISK SYSTEMS

In this paper, we are concerned with the multi-disc data allocation problem. We shall show that the symbolic Gray code can be used as a data allocation scheme for two-disc systems. We then show that this allocation method is a strictly optimal one for all possible partial match queries. There are many other interesting properties of this allocation method. For example, there is a disc-to-record transformation which can he used to determine the records stored on certain disc. In addition, all records are uniformly stored on discs if this allocation method is used. At the end of this paper, we shall point out that the resulting allocation is good for nearest neighbour searching.