DocumentCode :
690337
Title :
An Online Static Index Pruning Algorithm
Author :
Liu Xiaofeng
Author_Institution :
Sch. of Software Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China
fYear :
2013
fDate :
14-15 Dec. 2013
Firstpage :
262
Lastpage :
265
Abstract :
Static index pruning can significantly reduce index size and query processing time. An online static index pruning algorithm is presented, which is a term-centric method and adopts BM25 weighting as the pruning measure. The algorithm scans through documents set with one pass and directly builds pruned index, and therefore avoids the construction of original index. The experiments based on TREC data set show that the online static index pruning algorithm requires less time to build pruned index, and the pruning effectiveness outperforms the baseline method.
Keywords :
indexing; query processing; BM25 weighting; TREC data set; index size; online static index pruning algorithm; pruning effectiveness; pruning measure; query processing time; term-centric method; Indexes; Query processing; Random access memory; Research and development; Software algorithms; Web search; index construction; index pruning; inverted index;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Sciences and Applications (CSA), 2013 International Conference on
Conference_Location :
Wuhan
Type :
conf
DOI :
10.1109/CSA.2013.67
Filename :
6835594
Link To Document :
بازگشت