Linear Hashing Test Page
Linear Hashing Test Page
Test 1
Insert up to 1000 key / rid pairs into the index.
Test 2
In Test 2, scans are performed that make no sense (e.g.,
low values higher than
the high values, etc.). The index that was created in Test 1 is used
for testing these scans. The scans should return no tuples. They should not
return any errors.
Test 3
Basically the same as Test 1, except that instead of an integer
key, a string is used. The keys are inserted in ascending order, as
in Test 1.
Test 4
The same as Test 3, except that the keys are inserted in descending
order.
Linear Hashing Page
Back to the Components Page
Back to the Minibase Home Page