SEARCH LOGS FASTER THAN SONIC
This blog post goes over the inner workings of log search engines and explains how they achieve fast search speeds. It starts with a simple, inefficient example using jq and bash, then progressively introduces more sophisticated data structures like inverted indexes, Tries, and Finite State Transducers (FSTs). FSTs are the most common choice in production search engines due to their efficiency in handling prefix, suffix, and infix searches.