CurveIx vs. Linear Scan (cont)
If we assume that each curve lookup involves 3-4 page access
(i.e. Tsel=3), we can restate (1) as:
(1) (3m+Nf)TP < NPTP
Some observations, given NP = 0.05 N:
- we can't afford to have too many curves (m)
- CurveIx has to do effective filtering (f)
- clustering can reduce the NfTP term
Difficult to analyse further, so we implemented the system to see
how it performed ...
|
