A Novel and Efficient Approach For Near Duplicate Page Detection in Web Crawling

The drastic development of the World Wide Web in the recent times has made the concept of Web crawling receive remarkable significance. The voluminous amounts of Web documents swarming the Web have posed huge challenges to the Web search engines making their results less relevant to the users. The presence of duplicate and near duplicate Web documents in abundance has created additional overheads for the search engines critically affecting their performance and quality. The detection of duplicate and near duplicate Web pages has long been recognized in Web crawling research community. It is an important requirement for search engines to provide users with the relevant results for their queries in the first page without duplicate and redundant results. In this paper, we have presented a novel and efficient approach for the detection of near duplicate Web pages in Web crawling. Detection of near duplicate Web pages is carried out ahead of storing the crawled Web pages in to repositories. At first, the keywords are extracted from the crawled pages and the similarity score between two pages is calculated based on the extracted keywords. The documents having similarity scores greater than a threshold value are considered as near duplicates. The detection has resulted in reduced memory for repositories and improved search engine quality.