Notice of Violation of IEEE Publication Principles: The Anatomy of a Large-Scale Hyper Textual Web Search Engine

Notice of Violation of IEEE Publication Principles "The Anatomy of a Large-Scale Hyper Textual Web Search Engine" by Umesh Sehgal, Kuljeet Kaur, Pawan Kumar in the Proceedings of the Second International Conference on Computer and Electrical Engineering, 2009. ICCEE '09, December 2009, pp. 491-495 After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles. This paper contains significant portions of original text from the paper cited below. The original text was copied with insufficient attribution (including appropriate references to the original author(s) and/or paper title) and without permission. Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article: "The Anatomy of a Large-Scale Hypertextual Web Search Engine" by Sergey Brin and Lawrence Page Computer Networks and ISDN Systems, Volume 30, Issue 1-7, Elsevier, April 1998, pp. 107-117.
We present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale web search engine to define the values and traditional techniques of data in hypertext. Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information present in hypertext to produce better search results. This paper addresses this question of how to build a practical large-scale system which can exploit the additional information present in hypertext. Also we look at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.