Interview: How Database Indexing Works🌳
Database Indexing Explained With a B-Tree! Without an index, finding one user means a full table scan, where the database checks every row until it hits a match. An index avoids that by keeping a separate, alphabetically sorted copy of one column with the row number written next to each value.
KodeKloud