How Database Indexes Work: A Billion Rows in 1.9 ms
Share

An index is a sorted copy of one column, kept as a B-tree, so a lookup costs four page reads instead of a hundred-gigabyte scan, and the…

 

 An index is a sorted copy of one column, kept as a B-tree, so a lookup costs four page reads instead of a hundred-gigabyte scan, and the…Continue reading on Medium » Read More Sql on Medium 

#sql

By ali

Leave a Reply