Efficient dynamic pruning on largest scores first (LSF) retrieval |
Kun JIANG,Yue-xiang YANG |
Fig. 2 An example showing the index traversal procedure of DAAT with two posting lists of the query terms 'piano' and 'music'. The solid line separates different iterations of the procedure from left to right, and the scoring operation scans from top to bottom in each iteration to sum up all of the term frequencies ft, d. The full result score of a document can be obtained when both 'piano' and 'music' are considered in parallel. Reprinted from Jiang and Yang ( |
![]() |