Name lookups
Lookup
Tree-matching algorithm
AND operations among orthogonal attributes
Polynomial-time in number of attributes
O(nd) where n is number of attributes and d is the depth
Previous slide
Next slide
Back to first slide
View graphic version