Probably Faster Than You Can Count: Scalable Search with Probabilistic Techniqueblog.vegasecurity.com6 points·by duckuks·anno scorso·2 comments
duckuks·anno scorso·discussGreat breakdown of data structures like Tries, FSTs, and DAWGs for log search! How do these compare in terms of memory usage and update performance? Awesome read!