1) Thinking about dynamic tree and hashing techniques for databases, how would they compare in terms of speed and what they can accomplish? It says speed and not complexity because you should discuss the expected and practical speed. This can and should involve formulas and discussion but should also include practical considerations of speed and the formulas shown. This is similar to what we did in class.

2) The load factor in hashing is generally kept small so the expected number of items at any hash location is small if the hash function effectively spreads out the entries. In the hashing you learned in data structures and algorithms, the hash table/array is increased in size to reduce the load factor when it gets too large. This requires rehashing all entries. Extensible and linear hashing both avoid having to rehash all the entries. Why is this important? How does each technique accomplish this?