Sunday, June 3, 2007

Question 75

Which is the appropriate description of access efficiency for a relational database?

a) If one optimum access path is prepared at the beginning, efficiency does not decrease even when the data volume is increased.
b) When it comes to read access, efficiency is always better for access paths which use indexes.
c) If data on a column is frequently updated, then efficiency is better without assigning an index to it.
d) Even when many transactions are being processed simultaneously, it is possible to process them without reduced efficiency by using exclusive control functions.


No comments: