Introduction:
Search engine is a special site on the Internet that is designed to help the Netter to
find
information stored in the another site .There’s differences in how the work of several kinds of search engines available on the internet, but there are 3 main things done by every
search engine, there is the 3 main thing ;
1. browse the Internet or scan the internet based on important words.
2. record the index of words that are found and where it founded.
3. allows users to search for words or combine words that are found in the index.
About Search Engine
How do search engines work When people talk about Internet search engines, meaning it is actually the World Wide Web search engine.Before become part of the internet, there has been search engine that helps people to find information on the computer network .A program called "Gophers" and "archie" record index files stored on the server that is connected to the Internet, and dramatically reduce the amount of time needed to search for programs and document .On late 1980s the development of the Internet are significant with the present of Gophers, archie, veronica, and so forth.
A method all the search engines basically same .There’s four important processes that are used in almost all types of search engines on the internet, the web crawler , Indexing of words, storage a data, and the last is how present the search results.
Crawling the Web page Before search engines indicate where the file or document is, search engines should find it first. To search for information that amounted to hundreds of millions data or word, a search engine uses a special robot called a "spider". Spider duty to record this list of words that have been found in website.The Proses when spider make a list ,it called as Web Crawling.To make and keep a list of important words, a Spider should scaning a multiple Web pages.
How do the robot start the journey creep a web page? Usually first point is a list server and a web page that is very popular. Spider will start creep a popular site, indexing the words contained in the web page, and follow each link found in the site. In this way a process quickly travel to reach the majority of successful web.Afet that index of words found in a site, a spider will save the data accessed by the user to present in search engines.
Indexing data and word Once the spider to complete its work exploring the information on the web page, Search engines need to save the information as data, even if the factual robot spider does not finish its work well. This is because a change regularly on the web, so the spider should be creep over web page regularly too. There are 2 key components that involve the collection of data,that can be accessed by users, which are ;
1. Information stored as data.
2. Method to the way indexing information.
Search engines can only save the words and the URL where it was found. In fact, this may make the engine perform has limited functions. Because there is no determination of an important word which is not included in the web, or if the web contains a link that connected with web page is not suitable by internet user.In the other words there is no ranking, where’s the more important pages placed in the top of search results.
To present the results more useful, search engines should not just save the word and URL. Search engines may be able to save the length of time a word is displayed in a web page. It can also record with weighting any data, record the words which are in the top of the document, in the subtitles, in links, in the meta tags or in the title of each page. Each search engine has a different formula in weighting. This is one of the reasons why for the same words in the search engine will produce a different list that is different with another search engine,the view also different each other.
With or without fidelity view additional information stored by search engines, data will be stored for encode. For example, use google disjoint 2-bit and 8 bit, each for storing information on weighting. Are the words in capital letters, font sizing, position and other information to help determine the rank of hit.Each factor can take a bit of 2 or 3 in 2 byte (1 byte = 8 bits). As a result a lot of information that are stored in the form of a capsule. After the summary information is ready for the indexing.
The index has had a single function, namely the information can be found as soon as possible. There are several ways used in indexing, but there is one the most effective way, the hash table. A formula is applied to include the numerical value of each word. This formula is designed to distribute the input data through the alphabet, and this is key to how the effectiveness of hash table.