Efficient dynamic pruning on largest scores first (LSF) retrieval
Kun JIANG,Yue-xiang YANG
Table 4
The average number of processed elements of different dynamic pruning techniques with the number of results
k
= 10
Algorithm
N
hi
N
sc
(×l0
3
)
N
de
(×l0
3
)
N
cd
WAND
119.4
114.6
379.5
280.0
MaxScore
119.4
215.4
238.9
223.3
LSF_LO
83.4
258.6
393.9
324.0
LSF_PS
83.4
188.5
219.0
240.6