Implementing dictionaries
Schemes based on key comparison - keys viewed as elements of arbitrary total order
Ordered list
Binary search trees
Schemes based on direct key ? address-in-table translation.
Hashing
Bloom filters
Previous slide
Next slide
Back to first slide
View graphic version