Mysql Index Tutorial | [Simple Explanation] [2020]

Показать описание

In this video, we'll see how basic Mysql Index concept works. We'll see how Mysql B-Tree index concept works with a simple example.

Mysql Index works similar to how an index in a Book works. Mysql Indexes stored indexed column data in a separate storage in an Ordered List. When we search for a value, Mysql searches in the index column using the B-tree concept.

Mysql B-tree index works by first checking the middle value in the ordered indexed column, if the value is greater, it will continue to search on the right side of the column. If the value is lesser than the the middle value, it will search to left of the column. This method of search continues till it matches the value. This way, indexed columns need not scan all the rows of the table.

Рекомендации по теме

Комментарии

So sad you stopped making videos. Your explanations are so clear. You should have much more subscribers. Thanks for everything.

nelsonalva

This is a fantastic explanation of how MySQL indexes work, the key is how binary indexes work- great job

myelibrary

Perfect explanation. The index converts a linear search O(n) to a binary search O(logn).

davidbierman

After watching 5 other videos, finally I understand what indexing is. Thank you

justinabosco

This is exactly what I was searching for. So, in layman terms it creates a new table with column on which index has been created and memory pointer locations of each associated record. Then it sorts it and applies the Binary search algorithm to search the requested column value and there by fetches the associated pointer location, which in turn takes us directly to that memory location and presents the record to user.

growtogether

The explanation was too good, better than others out there.

mohdramees

To be honest
I swear you are an amazing person
And a creative teacher
You deserve all respect 🙏
I hope you continue creating useful videos

helalabboud