Search Engines Submit

Search Engines Submit

A search engine is a program that searches for keywords in files and documents found on the World Wide Web. It is very much useful in finding the required data or information on the web. It is also very useful in marketing and advertising over the Internet.

Search Engine:

Search engine marketing is a way of advertising your products using the technology of the search engine. Search engine submit marketing capitalizes on the wide consumer audience that can be reached through the internet. Many businesses have realized the powerful marketing tool that the internet provides through search engine marketing. Everyone who uses the World Wide Web utilizes a search engine.

Search engines are automatically updated by special programs called "robots" or "spiders" that search the World Wide Web for new content and then report their findings to the database. There are many different web search engines and many different types of search engine marketing that are available to businesses.

While Search engine submit something on internet, it is difficult for a user to remember all the website addresses where to search for. The user may not know in which web site the information regarding the topic is available. In the World Wide Web the information of the respective portals are stored in their respective servers. For a single topic, there may be thousands of web pages available on the Internet. The need for a search engine comes into picture in this situation. A search engine searches the entire World Wide Web for information and makes index of the contents. When we request a search engine for the information on some topic, it searches the web and displays the list of web pages which have these topics in them. A top level search engine can search millions of web pages in fraction of a second.

The search engines do three basic tasks to search for information on Internet:

* They search the internet for some important words.

* They keep an index of the words they found and the location where the information is available.

* They allow users to find words or combination of words they found on the Internet.

A Search engine submit must have capability to search for information in the Internet. It must find the information and store it as index in database. The search engines employ software robots called Spider to find new topics and store them as index.

A spider first starts looking for the heavily used servers and most popular web pages. It starts indexing all the words which are read often and follows every link it finds in the site.

Some popular and most used Search engine submit employ multiple spiders. One spider can keep up to 300 connections to the site, at a time. So, if one can employ 4 spiders at a time, their system could search 100 pages per second and 600 kb of data each second.

When a spider looks at a HTML page it notes down two things:

1. The words within the page

2. Where the words were found

A spider also stores the data like Title, sub-title, meta tags and some other very important information for future searches. Different spiders approach search in different ways. Some spider do not consider very common words like articles a, an and the and some common prepositions like of, by and so on. But some spiders consider these words while searching, so that they can display relevant data.

Meta tags are very useful while searching the net. These Meta tags tell the spiders about the content of web site. The Meta tags allow the owner of website to provide key words and concepts under which the page will be indexed. But there is a disadvantage in Meta tags. A careless web designer can include some of things in Meta tags that are not covered in content. In this case, the spider tries to correlate the contents of the page with the Meta tag if, it does not match, the spider will omit those Meta tag contents.

All most all web site owners want their web sites to be included in search engines. But may be some web site owners who have very hot stuffs and update their contents rapidly dont want to be included in search engines. These web sites use Robot Exclusion Protocol, which is a protocol written in meta tags and they instruct the spiders to leave the web site from indexing as well as following its links.

After the web is searched for the information, the spiders collect the indexes. Now, the task is storing these indexes with their web site addresses. The search engine must store the data in such a way that the users can access the data as quick as possible. One more thing is storing only the words and links is not enough, some times the word which is not at all related may be indexed. To overcome this problem, the spiders also note down the number of times that particular word is repeated in the web page. This will be helpful in getting the links which are more relevant.

Searching Submission Index:

An index has a single purpose that allows information to be found as quickly as possible. There are quite a few ways for an index to be built, but one of the most effective ways is to build a hash table. In hashing, a formula is applied to attach a numerical value to each word. The formula is designed to evenly distribute the entries across a predetermined number of divisions. This numerical distribution is different from the distribution of words across the alphabet, and that is the key to a hash table's effectiveness.

Searching and submission through an index involves a user building a query and submitting it through the search engine. The query can be quite simple, a single word at minimum. Building a more complex query requires the use of Boolean operators that allow you to refine and extend the terms of the search.

The Boolean operators most often seen are:

* AND - All the terms joined by "AND" must appear in the pages or documents. Some search engines substitute the operator "+" for the word AND.

* OR - At least one of the terms joined by "OR" must appear in the pages or documents.

* NOT - The term or terms following "NOT" must not appear in the pages or documents. Some search engines substitute the operator "-" for the word NOT.

* FOLLOWED BY - One of the terms must be directly followed by the other.

* NEAR - One of the terms must be within a specified number of words of the other.

* QUOTATION MARKS - The words between the quotation marks are treated as a phrase, and that phrase must be found within the document or file.