string - Data structure for fast full text search - Stack Overflow

A trie seems like it would work for small strings, but not for large documents, so not sure (1-100's of pages of text). Maybe it is possible to combine an inverted index with a suffix tree to get the

string - Data structure for fast full text search - Stack Overflow The 2026 Annual Developer Survey is live— take the Survey today! Collectives™ on Stack Overflow Find centralized, trusted content and collaborate around the technologies you use most. Learn more about Collectives Stack Internal Knowledge at work Bring the best of human thought and AI automation together at your work. Explore Stack Internal Data structure for fast full text search Ask Question Asked 8 years, 2 months ago Modified 8 years, 2 months ago Viewed 8k times 13 A trie seems like it would work for small strings, b

related reading

• Fast regex search: indexing text for agent tools · Cursorcursor.com
• turbopufferturbopuffer.com
• Trie - Wikipediaen.wikipedia.org
• Regular Expression Matching with a Trigram Indexswtch.com
• The Anatomy of a Search Engineinfolab.stanford.edu
• The vector database to build knowledgeable AI | Pineconepinecone.io
• Ternary search tree - Wikipediaen.wikipedia.org
• Faster phrase search with shingled bloom filters in Brainstorebraintrust.dev
• Trie Data Structure - GeeksforGeeksgeeksforgeeks.org
• Static search trees: 40x faster than binary search · CuriousCodingcuriouscoding.nl
• Pattern Searching using Suffix Tree - GeeksforGeeksgeeksforgeeks.org
• GitHub - thesephist/monocle: Universal personal search engine, powered by a full text search algorithm written in pure Ink, indexing Linus's blogs and private note archives, contacts, tweets, and over a decade of journals.github.com