How NonClustered Index works in SQL Server
问题 I have a question, related to DB theory: Let's assume that we have table with 3 columns: [PersonID], [PersonName], [PersonAge] . We know that when we have a nonclustered index by one column, SQL Server orders table data in accordance with specified column and build B+ tree from it. And when we need to find the row using such an index, SQL Server scans the B++ tree by comparing one atomic data object ( int or string , for example). That is clear, how non-clustered index works and find data