Abstract

Web has become the most enormous distributed databases on the Internet. The numbers of Web pages are growing in an amazing way. This leads to expanding the content information on the Web. With the rapid growing, it is easy to share information in web. At the same time, it is a hard task to search useful information effectively and accurately from vast amounts. This leads to create search methods that are more efficient. In this paper a new search algorithm for documents using blocks and words prefixes are presented. An implementation of the proposed algorithm is given also to check our algorithm performance and validity; we make a comparison between it and binary search.  The experimental results show that the proposed algorithm outperforms the binary search in execution time and number of comparison parameters. Our algorithm using blocks and words prefixes is 66% faster than the binary search.

Key words:  Search methods, binary search, blocks, words prefixes, execution time.