Re:Show HN: BloomSearch – Keyword search with hierarchical b...
by dangoodmanUT on Wednesday July 16, 2025 @04:35PM
(#44586546)
To actually retrieve the row, yeah, but a btree index size scales ~linearly with the dataset size.
You can prune based on partitions, minmax indexes, then bloom filters first. By that point the row group scan, if all other cheks suggest that the row you are after is in the block, is a very small amount of data.
You can prune based on partitions, minmax indexes, then bloom filters first. By that point the row group scan, if all other cheks suggest that the row you are after is in the block, is a very small amount of data.
https://itnext.io/how-do-open-source-solutions-for-logs-work... covers this very well