|
Explanation: It's better to allocate space explicitly to tables, clusters and indexes in OLTP system to avoid the performance load of dynamic space allocation. B-tree indexing is preferred to bitmap indexes in OLTP systems, because of locking issues affecting DML operations. Most of DML operations related with bitmap indexes will require high-level locking due to low cardinality nature of bitmap indexes and it will cause performance issues because of high level of DML operations in OLTP systems. Incorrect Answers:
1: OLTP works mostly with bind variables due to nature of OLTP system, so it's impossible to work only with literals. 4: It's not reasonable to use hash clusters for tables with heavy inserts. 5: Constraints are cheaper to process if compare them with business rules in application code. Oracle 8, DBA Certification Exam Guide, Jason S. Couchman, p. 793-795. Chapter 18: Tuning Memory and Operating System Use
|