3 ms·
search in 5% the time it would take to search a btree? anyone can see that with actual data?
by gcb0 11y ago
search in 5% the time it would take to search a btree? anyone can see that with actual data?
- gcb0 11y agohttp://pythonsweetness.tumblr.com/post/119568339102/block-range-brin-indexes-in-postgresql-95 http://pythonsweetness.tumblr.com/post/119568339102/block-ra... the very first example points to BRIN indexes resulting in smaller index than btree but with much longer search time... so i guess the 5% time figure was very use-case specific?