1
$\begingroup$

In database query processing, the approximate time for selection operation using primary index when equality is on key is $2(b_s + b_t)$ where $b_s$ is disk seek time and $b_t$ is disk transfer time (assuming one level of indexing), because one seek and transfer time will be needed for finding the index and another one will be for the actual data.

But what will happen if the equality is on a no- key value? Since now we cannot search in the index, don't we have to do a linear search?

$\endgroup$

1 Answer 1

1
$\begingroup$

In this case full table scan will be executed.

The cost is $N$ I/O operations (where $N$ is a number of pages/blocks in your table)

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.