
Step by Step SEO Process

Step by Step SEO Process
Google PageRank is a link analysis algorithm, named after Larry Page, used by the Google Internet search engine that assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of “measuring” its relative importance within the set. The algorithm may be applied to any collection of entities with reciprocal quotations and references. The numerical weight that it assigns to any given element E is also called the PageRank of E and denoted by PR(E).
The name “PageRank” is a trademark of Google, and the PageRank process has been patented (U.S. Patent 6,285,999). However, the patent is assigned to Stanford University and not to Google. Google has exclusive license rights on the patent from Stanford University. The university received 1.8 million shares of Google in exchange for use of the patent; the shares were sold in 2005 for $336 million.

Google Page Rank Formal
Mathematical PageRanks (out of 100) for a simple network (PageRanks reported by Google are rescaled logarithmically). Page C has a higher PageRank than Page E, even though it has fewer links to it: the link it has is much higher valued. A web surfer who chooses a random link on every page (but with 15% likelihood jumps to a random page on the whole web) is going to be on Page E for 8.1% of the time. (The 15% likelihood of jumping to an arbitrary page corresponds to a damping factor of 85%.) Without damping, all web surfers would eventually end up on Pages A, B, or C, and all other pages would have PageRank zero. Page A is assumed to link to all pages in the web, because it has no outgoing links.
| Year | Engine | Event |
|---|---|---|
| 1993 | Aliweb | Launch |
| JumpStation | Launch | |
| 1994 | WebCrawler | Launch |
| Infoseek | Launch | |
| Lycos | Launch | |
| 1995 | AltaVista | Launch |
| Open Text Web Index | Launch | |
| Magellan | Launch | |
| Excite | Launch | |
| SAPO | Launch | |
| 1996 | Dogpile | Launch |
| Inktomi | Founded | |
| HotBot | Founded | |
| Ask Jeeves | Founded | |
| 1997 | Northern Light | Launch |
| Yandex | Launch | |
| 1998 | Launch | |
| 1999 | AlltheWeb | Launch |
| GenieKnows | Founded | |
| Naver | Launch | |
| Teoma | Founded | |
| Vivisimo | Founded | |
| 2000 | Baidu | Founded |
| Exalead | Founded | |
| 2003 | Info.com | Launch |
| 2004 | Yahoo! Search | Final launch |
| A9.com | Launch | |
| Sogou | Launch | |
| 2005 | MSN Search | Final launch |
| Ask.com | Launch | |
| GoodSearch | Launch | |
| 2006 | wikiseek | Founded |
| Quaero | Founded | |
| Ask.com | Launch | |
| Live Search | Launch | |
| ChaCha | Beta Launch | |
| Guruji.com | Beta Launch | |
| 2007 | wikiseek | Launched |
| Wikia Search | Launched | |
| Blackle.com | Launched | |
| 2008 | Powerset | Launched |
| Viewzi | Launched | |
| Cuil | Launched | |
| Boogami | Launched | |
| LeapFish | Beta Launch | |
| VADLO | Launch | |
| Sperse! Search | Launch | |
| Dhoondho | Launched | |
| 2009 | Bing | Launched |
A search engine operates, in the following order
Web search engines work by storing information about many web pages, which they retrieve from the WWW itself. These pages are retrieved by a Web crawler (sometimes also known as a spider) — an automated Web browser which follows every link it sees. Exclusions can be made by the use of robots.txt. The contents of each page are then analyzed to determine how it should be indexed (for example, words are extracted from the titles, headings, or special fields called meta tags). Data about web pages are stored in an index database for use in later queries. Some search engines, such as Google, store all or part of the source page (referred to as a cache) as well as information about the web pages, whereas others, such as AltaVista, store every word of every page they find. This cached page always holds the actual search text since it is the one that was actually indexed, so it can be very useful when the content of the current page has been updated and the search terms are no longer in it. This problem might be considered to be a mild form of linkrot, and Google’s handling of it increases usability by satisfying user expectations that the search terms will be on the returned webpage. This satisfies the principle of least astonishment since the user normally expects the search terms to be on the returned pages. Increased search relevance makes these cached pages very useful, even beyond the fact that they may contain data that may no longer be available elsewhere.
When a user enters a query into a search engine (typically by using key words), the engine examines its index and provides a listing of best-matching web pages according to its criteria, usually with a short summary containing the document’s title and sometimes parts of the text. Most search engines support the use of the boolean operators AND, OR and NOT to further specify the search query. Some search engines provide an advanced feature called proximity search which allows users to define the distance between keywords.
The usefulness of a search engine depends on the relevance of the result set it gives back. While there may be millions of webpages that include a particular word or phrase, some pages may be more relevant, popular, or authoritative than others. Most search engines employ methods to rank the results to provide the “best” results first. How a search engine decides which pages are the best matches, and what order the results should be shown in, varies widely from one engine to another. The methods also change over time as Internet usage changes and new techniques evolve.