🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Quiz: Indexing: all 10 questions

Quiz: Indexing · Question 8 of 10

Why can a non-clustered index lookup be slower than a clustered one?

Why can a non-clustered index lookup be slower than a clustered one?

  1. A.Non-clustered indexes are not sorted
  2. B.It finds a pointer first and then needs an extra step to fetch the row
  3. C.It always scans the whole table
  4. D.It can store only numbers
Answer & explanation

Correct answer: It finds a pointer first and then needs an extra step to fetch the row

In a clustered index the row data is stored in the index itself.

Can you get the rest right without peeking?

Take the timed Quiz: Indexing quiz free. Pass it to earn XP and count towards your certificate.

Start the quiz →