Clearly, the theoretical minimum for the selectivity of an access path is the number of pages that hold the output of the relational operator involved. What is the best theoretical upper bound on the selectivity of an access path when selection or projection operators are involved?

What will be an ideal response?


The theoretical upper bound on the selectivity of an access path when selection or projection operators are involved is the number of pages in the original relation.

Computer Science & Information Technology

You might also like to view...

Why should you use a named constant for the size of an array?

a. Readability of code b. Makes changes to the program easier c. Helps reduce logic errors d. All of the above

Computer Science & Information Technology

From the XPath expressions and results in Fig. 11.16, generate the XML document.

Computer Science & Information Technology

Which of the following are required for individuals to log on to Windows 10 and use resources on the computer?

A. Public keys B. IP addresses C. User accounts D. Digital certificates

Computer Science & Information Technology

Which advanced tar option does not have a short name?

A. append B. update C. delete D. compare

Computer Science & Information Technology