{"type":"rich","version":"1.0","provider_name":"Transistor","provider_url":"https://transistor.fm","author_name":"Programming Tech Brief By HackerNoon","title":"Search Before a Search Engine","html":"<iframe width=\"100%\" height=\"180\" frameborder=\"no\" scrolling=\"no\" seamless src=\"https://share.transistor.fm/e/d8665433\"></iframe>","width":"100%","height":180,"duration":935,"description":"\n        This story was originally published on HackerNoon at: https://hackernoon.com/search-before-a-search-engine.\nWhy 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.\nCheck more stories related to programming at: https://hackernoon.com/c/programming.\n            You can also check exclusive content about #elasticsearch, #.net, #mysql, #ef-core, #database-optimization, #entity-framework-core, #sql-optimization, #hackernoon-top-story,  and more.\nThis story was written by: @fedoryshchev. Learn more about this writer by checking @fedoryshchev's about page,\n            and for more stories, please visit hackernoon.com.\nA 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.\n        \n        ","thumbnail_url":"https://img.transistorcdn.com/KhCapPSRkLGL2Xw8888yuChkNRWthaKapLYTvNdu4W4/rs:fill:0:0:1/w:400/h:400/q:60/mb:500000/aHR0cHM6Ly9pbWct/dXBsb2FkLXByb2R1/Y3Rpb24udHJhbnNp/c3Rvci5mbS9zaG93/LzQxMTY2LzE2ODM1/ODIzMzAtYXJ0d29y/ay5qcGc.webp","thumbnail_width":300,"thumbnail_height":300}