OLTP – Phase 8 B-Tree Index

📝

内容提要

Without an index, every query scans every row. WHERE id = 42 on a million-row table reads all million rows to find one. That’s O(n) — slow. A B+ tree index is a sorted data structure that maps key...

🏷️

标签

➡️

继续阅读