Database Theory: What is BRIN (Block Range Index), How is faster than BTREE Index
The BRIN index is very new type of index in a Database System. Currently we are using B-Tree indexes most, but BRIN Indexes are much faster than B-Tree Indexes. It is not correct to say that BRIN is a 100% replacement of B-Tree but in some situation, it executes 10 times faster than B-Tree Index. … Continue reading Database Theory: What is BRIN (Block Range Index), How is faster than BTREE Index
Copy and paste this URL into your WordPress site to embed
Copy and paste this code into your site to embed