Efficient dynamic pruning on largest scores first (LSF) retrieval
Kun JIANG,Yue-xiang YANG
Table 2
The average number of processed elements for different index traversal techniques with the number of results
k
= 10
Algorithm
N
hi
N
sc
(×10
3
)
N
de
(×l0
3
)
N
cd
OR_TAAT
10.0
2591.6
2591.6
284.8
OR_DAAT
119.5
2591.6
2591.6
284.8
OR_LSF
83.4
2591.6
3256.1
650.0
AND_TAAT
10.0
207.6
2591.6
284.8
AND_DAAT
50.5
76.8
227.7
250.0
AND_LSF
50.5
76.8
227.7
250.0