Database Index Fundamentals

This video explains the fundamental principles of indexing table columns in a database to speed up queries. It illustrates the difference between clustered indexes and non-clustered indexes, which are also known as secondary keys. It explains that the primary key of a table is normally the one and only clustered index, because this defines the sort order of the table, and that a table can have multiple non-clustered indexes. The video also mentions that database indexes are normally implemented behind the scenes as binary tree data structures, because these allow for fast searching.

[sergeypoprygin]

author, your voice is perfect for the discovery channel

[fireburnrs]

Holy shit dude - this helped me understand the concept so easily. I read a few prior, but they were more in-depth, so was harder to follow. This vid helped me go to those articles and understand them better. You dont use jargon and I love that. thanks!

[carlesgn]

please more in-depth technical vids :)

[normanmunge]

What do you mean by secondary storage for a clustered and non-clustered index?

[nicoqueijo]

So would updating a record to a non-clustered index be O(log n)? I'm assuming it's stored as a balanced tree?

[shreyasrai]

Wouldnot modifying the data impact both clusterd index and non-clustered index if the records are stored in binary tree?

[tmanley]

Don't you mean that the clustered index is stored as a B-Tree and not a Binary Tree data structure? Even this doesn't this depend on the database engine? I may be mistaken about this.