This article explains how full-text search engines work by using inverted indexes—data structures that map individual words to the documents containing them. Unlike traditional b-tree indexes that work on exact values, inverted indexes enable fast searching for words anywhere in text by maintaining a term dictionary and postings lists that store document locations.