How search works
How search engines workThe five steps from discovery to rankingComponentsThe parts that make a search engine runCrawlingHow bots find and fetch your pagesIndexingHow a page gets stored so it can be foundCheck if indexedFour ways to confirm a page is on GoogleCrawling and indexing
Web crawlersGooglebot, Bingbot and the new AI botsGooglebotHow Google's crawler reads your siteRobots.txtRules, examples and a free testerXML sitemapCreate one, then submit it to GoogleCanonical tagPick the main version of a pageNoindex tagKeep a page out of search resultsRanking and results
Search engine rankingWhy one page appears above anotherGoogle ranking factorsWhat really matters, grouped simplyPageRankHow links pass value between pagesAlgorithmsTF-IDF, PageRank and modern rankingResults page (SERP)What each block on the page is forAI searchHow AI answers are built from the indexUnderstand
What is a search engineA plain definition with real examplesTypes of search enginesCrawler, meta, vertical, private and AIBrowser vs search engineTwo tools that people often mix upExplore
Best search enginesGoogle, Bing, DuckDuckGo and moreUses of search enginesThe everyday jobs that search handlesHistory of search enginesFrom Archie in 1990 to AI answersThe components of a search engine are the web crawler, the indexer, the query processor, the ranking algorithm and the user interface. Each part has one job, much like the staff of a large public library, while together they turn billions of pages into a short list of answers. This guide explains every part with a simple analogy, shows how the pieces connect, then describes what breaks when one of them fails.
A search engine has five main parts: a web crawler, an indexer, a query processor, a ranking algorithm and a user interface. The crawler collects pages for the indexer to store, while the other three parts run every time someone searches.
The big picture
Picture a huge library with no fixed catalogue. Someone has to collect the books, someone has to file them, then someone at the front desk has to help each visitor find the right one.
| Component | Library analogy | Main job |
|---|---|---|
| Web crawler | The collector who fetches new books | Find pages, then download them |
| Indexer | The cataloguer who files every book | Store words so they can be looked up fast |
| Query processor | The librarian at the reference desk | Understand the question behind the words |
| Ranking algorithm | The expert who picks the best books | Order the matches by usefulness |
| User interface | The reading room with its signs | Present results in a clear layout |
Some textbooks group these differently, for example by folding the query processor into ranking. The underlying jobs stay the same, which is why every search engine, from Google to the search box on a shopping site, contains some version of each one.
Interactive · Switch off a component
Tap any part to switch it off, then watch the mini results page to see what breaks for the searcher.
Try this: switch off two parts at once. The first broken part in the chain usually decides what the searcher sees, which is why every component matters.
Component 1
A web crawler is a program that visits pages automatically. You will also hear it called a spider or a bot, because it moves across the web by following links.
Imagine a collector who walks from shelf to shelf in every bookshop in the world. Each book she picks up mentions other books, so she writes those titles on her list for the next trip. A crawler behaves in much the same way, starting from pages it already knows. It reads the links on them, then adds any new addresses to a queue called the crawl frontier.
Google’s crawler is called Googlebot, while Bing uses Bingbot. Before visiting a site, a polite crawler reads a small file called robots.txt, which tells it which folders it may enter. It also paces its visits, because sending thousands of requests at once could slow a small website down.
Our step-by-step guide to how search engines work covers crawling in more depth, including how rendering lets an engine see content built with JavaScript.
Component 2
Downloaded pages are useless until they are organised. The indexer reads each page, then files its contents so that any word can be found in a fraction of a second.
Think of the old card catalogue in a library. Instead of one card per book, the indexer keeps one entry per word, with a list of every page that contains it. This structure is called an inverted index, because it flips the usual order: rather than listing the words on each page, it lists the pages for each word.
The indexer strips away layout code, then keeps the visible words, headings, links and image descriptions.
Sentences become single terms, so a search for one word can match a page that uses it anywhere.
Knowing where each word sits lets the engine tell whether two words appear side by side as a phrase.
Near-identical pages are clustered, then one version is chosen as the main copy shown in results.
A page that is crawled is not automatically indexed. If the indexer judges a page thin, duplicated or marked with a noindex tag, it can leave that page out entirely.
Component 3
When you type a search, the query processor is the first part that reacts. Its task is to understand your words well enough to look up the right entries in the index.
A good reference librarian does more than repeat your question back. If you ask for books about jaguars, she might check whether you mean the animal or the car. The query processor plays this role for every search. It fixes spelling, splits your words into terms, adds close synonyms, then guesses the intent behind the search.
Component 4
The index might return thousands of pages that mention your words. The ranking algorithm decides which few deserve the top of the list.
Back in the library, the expert librarian looks at the pile of possible books, then hands you the three that actually answer your question. She considers how closely each one matches, how trusted its author is, whether it is up to date and whether it suits your reading level. A ranking algorithm weighs similar signals, only at enormous speed.
Google groups its ranking signals into broad families. These cover the meaning of the query, the relevance of the content, its quality, the usability of the page and the searcher’s context. No engine publishes exact weights, partly because they shift from one type of query to another. You can read more in our hub on search engine ranking, while the deeper mechanics are covered in search engine algorithms.
Ranking is calculated fresh for each search. The same page can sit near the top for one query yet far down for another, because the relevance part of the score changes with every question.
Component 5
The user interface covers everything you see and touch: the search box, the suggestions as you type, then the results page itself.
In the library analogy, this is the reading room. Clear signs, good lighting and a tidy desk make the same collection far easier to use. A search engine’s interface does the same job by laying out results so you can judge them quickly.
Autocomplete suggests popular searches as you type, which helps people phrase what they mean.
Each result shows a title, a web address and a short snippet, so you can choose before clicking.
Maps, image packs, featured snippets or AI-written summaries answer some questions right on the page.
Tabs for news, images or shopping let people switch to a different kind of result.
The results page has its own vocabulary, which our guide to the SERP explains feature by feature.
How they connect
Engineers split the system into two halves that run on different clocks. One half builds the index around the clock, while the other half answers questions in well under a second.
The offline half is slow, patient work. Crawlers fetch pages day and night, then the indexer updates the catalogue as new copies arrive. Nobody waits on this process directly, so it can take hours or days without anyone noticing.
The online half has to be quick. When you press enter, the interface hands your words to the query processor, which looks up matching entries in the index. The ranking algorithm scores those candidates, then the interface displays the winners. Because the index was built in advance, this whole chain usually finishes faster than you can blink.
The index sits in the middle as the link between the two halves. That gap explains why freshness matters so much. A page changed this morning will only show its new text once the crawler has fetched it again, after which the indexer stores the update.
Troubleshooting
Because each part depends on the one before it, a failure early in the chain hides a page completely. Knowing which component broke tells you where to look.
| Component | What a failure looks like | Typical cause |
|---|---|---|
| Web crawler | A new page never appears anywhere in search | No links point to it, or robots.txt blocks the folder |
| Indexer | The page was visited but is still missing from results | A noindex tag, duplicate text or very thin content |
| Query processor | Results answer a different question than the one asked | An ambiguous query or unusual wording |
| Ranking algorithm | The page is indexed yet buried on page five | Other pages answer the query more fully |
| User interface | The result shows a confusing title or snippet | A missing title tag or a weak page summary |
Site owners can influence the first, second and fifth rows most directly. Clear internal links help the crawler, unique content helps the indexer, while a descriptive title gives the interface something useful to show. The middle rows depend more on how well your page matches what people actually search for.
Try it yourself
The easiest way to understand the parts of a search engine is to run a very small one in your imagination. Pretend the whole web is just three short pages.
Page A reads “apple pie recipe”, Page B reads “apple phone repair”, while Page C reads “easy pie crust recipe”. Your crawler copies all three into storage.
Your index now holds four entries: apple (A, B), pie (A, C), recipe (A, C) and repair (B only).
Someone types “apple pie” into your search box. Your query processor splits it into two terms, then notes that this looks like a cooking question.
Page A contains both terms, so it scores highest. Pages B and C each match one term, although C wins on topic because it is also about baking.
Finally, your user interface shows Page A first, Page C second, then Page B last. Real engines do exactly this, only across hundreds of billions of pages with far richer signals. To see the same ideas with live demos, visit our full search engine basics guide.
FAQ
The five main parts are the web crawler, the indexer, the query processor, the ranking algorithm and the user interface. Some sources group them into three: crawling, indexing and ranking.
No, the crawler is only the part that collects pages. A full search engine also needs an index to store them, plus ranking systems to order results.
It is a lookup table that lists, for each word, every page containing it. This structure lets an engine find matching pages almost instantly instead of reading the whole web again.
The ranking algorithm makes that decision, although it can only work with pages the crawler found and the indexer stored. Problems earlier in the chain stop a page from being ranked at all.
At a broad level they do, because every engine needs the same basic jobs done. Google, Bing and smaller engines all crawl, index, process queries, then rank results, yet each builds its own version of every part.
Keep learning