| 87 |
Essentially,it involves storing a number of nodes together in one page of disk storage
...Scatter storage or hash addressing One file structure which does not relate very well to the ones mentioned before is known as Scatter Storage
...Let us assume that the available storage is of size 2 [m]then three simple transformations are as follows:1 if Ki is the key,then take the square of its binary representation and select m bits from the middle of the result;2 cut the binary representation of Ki into pieces each of m bits and add these together
...3 divide the integer corresponding to Ki by the length of the available store 2 [m]and use the remainder as the hash address
...Each of these methods has disadvantages
... |
