Although they are useful when more than 5% of the rows of a file must be retrieved,clustering indexes are harder to maintain than a non-clustering index when data is modified.
Correct Answer:
Verified
Q9: In a Btree structure,the height of the
Q10: Physical records are synonymous to blocks or
Q11: INSERT and DELETE statements affect only the
Q12: Query binding indicates how to implement a
Q13: Periodic reorganization of a file as it
Q15: The B+tree structure improves the performance of
Q16: Different hash functions may be used on
Q17: In order to optimize queries,some DBMSs allow
Q18: In the processing of an SQL statement
Q19: Bitmap indexes are a good alternative to
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents