3 ms·
I could give a general explanation about reducing the number of disk seeks by using B-trees to store index values with pointers to the database row. That being
by positr0n 9y ago
I could give a general explanation about reducing the number of disk seeks by using B-trees to store index values with pointers to the database row.
That being said I mostly agree with the other commenters that while a senior developer should know the answer, it isn't disqualifying if they don't. And if that's the case what is the point in asking it?
- ovao 9y agoI think that explanation might actually be shooting yourself in the foot slightly, depending on the interviewer, because an index needn't necessarily be a B-tree.