Tuesday 3 December 2013

Hypertext-Matching Analysis

Hypertext-Matching Analysis
Unlike its conventional counterparts, Google is a search engine which is hypertext-based. This means that it analyzes all the content on each web page and factors in fonts, subdivisions, and the exact positions of all terms on the page. Not only that, Google also evaluates the content of its nearest web pages. This policy of not disregarding any subject matter pays off in the end and enables Google to return results that are closest to user queries. Google has a very simple 3-step procedure in handling a query submitted in its search box:
1. When the query is submitted and the enter key is pressed, the web server sends the query to the index servers. Index server is exactly what its name suggests. It consists of an index much like the index of a book which displays where is the particular page containing the queried term is located in the entire book.
2. After this, the query proceeds to the doc servers, and these servers actually retrieve the stored documents. Page descriptions or “snippets” are then generated to suitably describe each search result.
3. These results are then returned to the user in less than a one second!
(Normally.)
Approximately once a month, Google updates their index by recalculating the Page Ranks of each of the web pages that they have crawled. The period during the update is known as the Google dance.

No comments:

Post a Comment