3 ms·
That's why disk indexes usually use B-trees.
by dvirsky 5y ago
That's why disk indexes usually use B-trees.
- anamax 5y agodisk block # = f(index) can be implemented with a b-tree but it can also be implemented (in some cases) with a deep-learning based approach.