Lec-98: Clustered Index in Database with Example

preview_player
Показать описание
By mistake written primary index on board. But in video clustered index with full example is explained.

A clustered index is an index which defines the physical order in which table records are stored in a database. Since there can be only one way in which records are physically stored in a database table, there can be only one clustered index per table. By default a clustered index is created on a primary key column.

►Database Management System(Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Computer Architecture (Complete Playlist):
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Рекомендации по теме
Комментарии
Автор

Index: An index is a data structure that improves the speed of data retrieval operations on a database table. It works like an index in a book, allowing the database to quickly locate specific rows based on the values in one or more columns.

Dense Index: A dense index contains an entry for every record in a table, with each entry pointing directly to the corresponding record. It enables efficient retrieval of individual records but can be resource-intensive due to its larger size.

Sparse Index: A sparse index contains entries for only some of the records in a table, typically at regular intervals. It requires fewer resources compared to a dense index, but retrieval may involve multiple disk accesses.

Clustered Index: A clustered index determines the physical order of data in a table. In other words, the rows in a table with a clustered index are stored on disk in the same order as the index. Each table can have only one clustered index, and it provides fast retrieval when querying data in the order defined by the clustered index.

Ellenki_
Автор

Primary Index: A primary index is a type of index that is created on the primary key of a table. It ensures the uniqueness of the primary key values and typically results in a clustered index. The primary index provides efficient access to specific rows based on the primary key values.

It's important to note that different database systems may have variations in terminology and implementation details.

Ellenki_
Автор

ASSALAM.U.ALAIKUM THANKS SIR ❤️ ALLAH PAK BLESS YOU AND YOUR FAMILY AND ALLAH PAK GIVE YOU EVERYTHINGS YOU WANT AMEEN

mr.gamertech
Автор

The Nicest Explaination that any one can ever find in the internet.

shubhankarpaul
Автор

Bro ur videos are soo simple and easy to understand bro tqs ... U made my dbms subject 😎easy. 🙂

irfankhanpatan
Автор

The PTO example. Another level of explanation.

rajatagarwal
Автор

What is N in log 2 (N) + 1? It was mentioned that it would be the # of blocks in Index Table, but shouldn't it be # of blocks in Hard Disk, since it was mentioned that in sparse, N would be the # of blocks in Hard Drive and for dense, it would be the # of records in Hard Drive?

AsadUllah-wjlq
Автор

Thank you so much sir 🙏 ☺️ 😊 ❤️ 🙏 ☺️ 😊 ❤️

saptarshichattopadhyay
Автор

Apke efforts kids salam sir..
Hum jaise students ka future ho asap🙏🙏🙏🙏👍🙏🙏🙏

dipikasinglaschemistriolog
Автор

Varun sir is a unique sir overall India love and respect from Bangladesh ❤❤❤

Mehedihasan-rahat
Автор

Sir please make videos on types of hashing

richapriya
Автор

Your new student ...plz continue this series

dipikasinglaschemistriolog
Автор

App grate facility h pure duniya me sir❤😢

mdaniquzzaman
Автор

Sir pls try to make some video regarding data structure-most important topics..

GeerishaAcharya
Автор

Sir description me related links bhi diya kijiye please, mujhe primary key ka video mil nhi raha aapka

swapnilswap
Автор

Sir ek doubt ye hai ki exact record tak kese pahuchenge clustered indexing mai...lets take 111 ya 222 ye toh 3-3 jagah toh kaun se waale 1 ya 2 par jaana hai vo kese decide hoga

ashishmamgaingarhwali
Автор

Sir..clustered m donu sparse and dense indexing arahi h..bcox dense in the sense that all records are getting entry in the sorted order..and sparse that for multiple one's..single 1 is taken

rousiarasool
Автор

Woow Sir, you've cleared my concept, thank you so much Sir.

yashtrivedi
Автор

since we are storing hashed key why it will be log N it should be O (1)

Abhishek-tvpx
Автор

Sir if we don't use the block hanger and simply take the value from one block only and same data is not in another block so time complexity will remain same as primary index ...ie log2n plus 1 ...plz tell sir and thnks for this video👍

shubham