BTree Index
A B+ Tree index is a balanced, sorted tree data structure used by most relational databases to enable fast lookups, range scans, and ordered traversal of indexed columns.
5 resources across 2 libraries
Glossary Terms(2)
Write-Ahead Log
A Write-Ahead Log (WAL) is a durability technique in which a database records every change to a sequential log file before applying that change to its main dat…
B+ Tree Index
A B+ Tree index is a balanced, sorted tree data structure used by most relational databases to enable fast lookups, range scans, and ordered traversal of index…
Interview Questions(3)
How Does a B-Tree Index Work Internally?
A B-tree index is a balanced, sorted tree of fixed-size nodes where every leaf sits at the same depth, letting the database find any key in O(log n) disk reads…
Hash Index vs B-Tree Index: What is the Difference?
A hash index maps each key to a bucket via a hash function, giving O(1) average-case exact-match lookups but no support for range queries or ordering, while a…
What is Index Bloat and When Should You Reindex?
Index bloat is wasted space inside a B-tree index caused by deleted or updated entries whose slots are not fully compacted back, and the fix is to run REINDEX…