So be aware that while reverse key indexes can increase insert concurrency and throughput, they can also have a severe negative impact on previously tuned queries. As a performance analyst, your job will be to find a performance compromise or implement a creative solution (like partitioning the index or the data) to maximize performance for both insert and select operations.

Enqueues are used to lock relational and nonrelational Oracle structures in an orderly fashion. The relational structures could be Oracle data dictionary tables or application tables. For example, when Oracle updates the sys.col$ table or an application updates its employee table, enqueues are involved. If a server process is prevented from locking a table, not only will it be posting an enqueue wait event, but the lock will show in v$lock, dba_lock, v$enqueue_statistics and other views. Nonrelational structures that are locked to prevent an inappropriate change could be a library cache cursor.

As their name implies, enqueues are very orderly and ensure the structures are changed in a very deterministic manner. Compared to latching, enqueues are very boring and, as I like to say, mature. There is no likelihood or probability involved with enqueues. A process's enqueue request simply gets pushed onto the appropriate queue, and when it's time to be processed, its enqueue entry is popped off the queue (known as a dequeue). Not much excitement here, but then enqueues are not about adventure, they are about ensuring Oracle structures are changed in a very orderly and accountant-like fashion.