Episode
Search Before a Search Engine
- Published
- Jun 20, 2026
- Duration seconds
- 935
- Processing state
not_requested- Canonical source
- https://share.transistor.fm/s/d8665433
Actions
POST https://stenobird.com/v1/public/podcasts/programming-tech-brief-by-hackernoon-6364125/episodes/search-before-a-search-engine/transcription-requests
Idempotently request low-priority transcript generation for this episode.GET https://stenobird.com/podcast/programming-tech-brief-by-hackernoon-6364125/search-before-a-search-engine.md
Read the agent-friendly Markdown representation of this episode resource.
Summary
This story was originally published on HackerNoon at: https://hackernoon.com/search-before-a-search-engine . Why a search feature slows down in MySQL, and how to fix it without a search engine: single round-trip paging, index hints, full-text, and parallel queries. Check more stories related to programming at: https://hackernoon.com/c/programming . You can also check exclusive content about #elasticsearch , #.net , #mysql , #ef-core , #database-optimization , #entity-framework-core , #sql-optimization , #hackernoon-top-story , and more. This story was written by: @fedoryshchev . Learn more about this writer by checking @fedoryshchev's about page, and for more stories, please visit hackernoon.com . A search feature gets slow not because you lack a search engine, but because the access pattern outgrew the data model. To fix it before buying new infrastructure, you climb a ladder of cheaper, reversible changes: single round-trip paging, index hints, full-text and suffix indexing, and parallel queries, weighing each option's price along the way.