3 ms·
Doesnt this mean you have to do a row scan though? With BTREE you have O(log N) index query and that’s it
by EGreg 1y ago
Doesnt this mean you have to do a row scan though? With BTREE you have O(log N) index query and that’s it
- dangoodmanUT 1y agoTo 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. https://itnext.io/how-do-open-source-solutions-for-logs-work-elasticsearch-loki-and-victorialogs-9f7097ecbc2f https://itnext.io/how-do-open-source-solutions-for-logs-work... covers this very well