1-Indexes
•
Analyzing the 1-index
•
always: size(I) <= size(DB) (unlike Dataguide)
•
always: can compute in O(nlogn) time n=size(DB)
•
When DB is a tree:
»
b
,
»
s
,
º
coincide
–
no penalty for
»
b
,
»
s
–
1-index = Dataguide = XSet