An unordered table contains 1000 rows, each 200 bytes long. A query needs to search the whole table. How many pages must be read if the page size is (a) 200 bytes, (b) 8 Kbytes? How could a...

An unordered table contains 1000 rows, each 200 bytes long. A query needs to search the whole table. How many pages must be read if the page size is (a) 200 bytes, (b) 8 Kbytes?

How could a division/remainder hash function be applied to non-numeric attribute values?