MCQs Test!! VB Basic Test !! Essentials of VB !! Creating User Services !! function !! Anatomy !! GK March-2019 !! DATA TYPES IN JAVA !! Classes ,Constructor ,Methods,Inheritance !! Ecology-I !! Biology 2019 !! Gk april 2019 !! Biology (living world) !! Plant anatomy !! CELL STRUCTURES AND FUNCTION !! General biology !! Human physiology !! Data structure !! Ecology-II !! GK TEST !! Reproduction in plants !! Human reproduction !! The ABC of C !! Operating system set1 !! Operating system set2 !! Gk and current affairs !! Animal kingdom !! Number system !! Animal kingdom-II !! Gk TEST-III !! Number series !! Microorganisms !! Interview question in c !! Time and Work !! Percentage !! General history !! Average !! Cells !! Locomotion and Movement !! paging !! Bacteriology !! Page replacement policy !! Secondary memory and Disk scheduling !! Introduction of Nervous System and neurons !! Plant harmones !! Transport and Mineral Nutrition in Plants !! Neurotransmitters !! Modern Indian History !! Photosynthesis in Plants !! Modern Indian History-II !! Plant respiration !! Environment & Biodiversity !! Environment & Biodiversity - II !! Algae, Bryophytes, Pteridophytes !! Area !! Cricket !! Days of the Year (India and the World) !! Plant Pathology - I !! Indian Transport System !! Plant Pathology - II !! Aptitude !! Biology !! Botany !! C language !! Computer Science !! Core Java !! Gate !! GK !! Mysql !! Operating system !! Physics !! VB-Visual Basic !! Zoology


Previous Home Next

The physical order of the rows is not the same as the index order Nonclustered indexes are typically created on columns used in joins and WHERE clauses, and whose values may be modified frequently.

SQL server creates nonclustered indexes by default when the CREATE INDEX command is given

There can be as many as 249 nonclustered indexes per table Typically, nonclustered indexes are created on foreign keys.A nonclustered index would need to be rebuilt if it is built before a clustered index

How Nonclustered Indexes Work

  1. Step First SQL sever find the rosot page from the sysindexes table.
  2. Step The search value is compared with the key values on the root page.
  3. Step The page with the highest key value less than or equal to the search value is found.
  4. Step The page pointer is followed the next lower level in the index.
  5. StepStep 3 and 4 repeated until the data page is reached.
  6. Step The rows are searched on the leaf page for the specified value. if a matched is not found, the table contains no matching rows.
  7. Step If a match is found, the pointer is followed to the data page and row-ID in the table, and the requested row is retrieved.



If the row containing Eid E006 were to be searched using the nonclustered index displayed in the figure, the following steps would be followed:

SQL Server starts from page 603, the root page It searches the highest key value on the page, the page with a key value less than or equal to the search value, that is, to the page containing the pointer to Eid E005

The search continues from page 602 There, the Eid E005 is found and the search continues on page 203. Page 203 is searched to find a pointer to the actual row.

Page 203 is the last, or the leaf page of the indexThe search then moves to page 302 of the table to find the actual row.

Previous Home Next