database basics
tags: learning database source-node
content
an index is a data structure that can perform quick lookups. … most database indexes are just binary trees or B-trees! The binary tree can be stored in ram as well as on disk, and it makes it easy to lookup the location of an entire row. … In terms of Big-O complexity, a binary tree index ensures that lookups are O(log(n)). → boot.dev