works just like using the mod operator in Pascal or the % operator in C or C++. The key to a record is divided with a prime-number and the remainder from the division is used as the relative address for that record.Digit ExtractionThis method analyzes the key values to determine which digit positions in the key are more evenly distributed. The more evenly distributed digit positions are assigned from right to left, and the digit values are extracted and used as the relative address. For example, for a key value 546032178, the relative address could be 8134, from left to right the first, third, fifth, and eighth digit positions has been extracted. Note that the extraction will map the key values into a range of 0 to 9999, generating 10,000 positions.FoldingFolding involves the splitting of the key into two or more parts and then summing the parts together to form the relative address. For example if we have a key value that is 25936715, and we need to map it to a range between 0 and 9999. We could split the numbers as 2593 and 6715, which the summation would result in 9308, and this would be our relative address. We could also fold the key in three parts, that is splitting the key into 3 different parts and then summing the parts together to get the relative address. As you can see, folding is very useful if we have a key that is very large.Radix ConversionRadix conversion make use of a number base to calculate the relative address. For example, we usually count in base 10 and use base 2 for binary numbers. We can use any uncommon number as our base to calculate the relative address for a particular record. Let’s say we have a key value of 38652, and we want to calculate the relative address using base 11 into a range between 0 and 9999. The conversion is as follows:3x11^4 + 8x11^3 + 6x11^2 + 5x11^1 + 2x11^0 = 55354 (^ means exponent and x meansmultiply).This is our key value in base 11. Since we want the relative address to be i...
