Hash Table Summary
Supports insert, find, and delete
Exceptionally good for storing unordered data
Various useful versions
- open hashing is flexible
- closed uses less storage but performs poorly with high ?
- extendible handles large data sets
Hashing pros and cons
- very fast
- simple to implement
- particularly effective for static data
- lazy deletion necessary
- uses extra storage
- does not support range queries or other order dependent operations
- does not have good locality properties