Efficient and effective solutions for search engines

Abstract

IR efficiency is normally addressed in terms of accumulator initialisation, disk I/O, decompression, ranking and sorting. In this paper, The bottlenecks of search engines are investigated and several solutions for efficiency optimisation are proposed. Particularly, the proposed heapk pruning algorithm is very efficient and effective. The future directions of this research work are also discussed.