【MOS】Troubleshooting 'enq: TX - index contention' Waits (文件 ID 873243.1)

APPLIES TO:

GOAL

This document explains the how to troubleshoot and resolve 'enq: TX - index contention' waits.

SOLUTION

When running an OLTP systems, it i??s possible to see high TX enqueue contention on index associated with tables, which are having high concurrency from the application.  This usually happens when the application performs lot of INSERTs and DELETEs concurrently. For RAC system, the concurrent INSERTs and DELETEs could happen from all the instances . 

The reason for this is the index block splits while inserting a new row into the index. The transactions will have to wait for TX lock in mode 4, until the session that is doing the block splits completes the operations.

Splitter has to do the following activities:

    o          Allocate a new block.
    o          Copy a percentage of rows to the new buffer.
    o          Add the new buffer to the index structure and commit the operation.

In RAC environments, this could be an expensive operation, due to the global cache operations included. The impact will be more if the split is happening at a branch or root block level.

Causes:

Most probable reasons are:

   o          Indexes on the tables which are being accessed heavily from the application.
   o          Indexes on table columns which are monotonically growing. In other words, most of the index insertions occur only on the right edge of an index.
   o          Large data purge has been performed, followed by high concurrent insert 

Identifying the Hot index:

The indexes which are having contention can be identified from the AWR reports taken during the time of the issue.

And the objects can be found either from V$SEGMENT_STATISTICS or from 'Segments by Row Lock Waits' or 'Segments by ITL Waits' or 'Service ITL Waits' of the AWR reports.

Solutions:

Solution here is to tune the indexes avoid heavy access on a few set of blocks.

Following are the options we could try:

o        Rebuild the index  as reverse key indexes or hash partition the indexes which are listed in the 'Segments by Row Lock Waits' of the AWR reports

For example:

From the Performance Tuning Guide - 

Reverse key indexes are designed to eliminate index hot spots on insert applications.  These indexes are excellent for insert performance.  But the downside of it is that, it may affect the performance of index range scans. 

The hash method can improve performance of indexes where a small number leaf blocks in the index have high contention in multiuser OLTP environment. In some OLTP applications, index insertions happen only at the right edge of the index. This could happen when the index is defined on monotonically increasing  columns. In such situations right edge of the index becomes a hotspot because of contention for index pages, buffers, latches for update, and additional index  maintenance activity, which results in performance degradation.

It's recommended to test the application performance,  after rebuilding the indexes as  reverse key or hash partitioned.

o        Consider increasing the CACHE size of the sequences

When we use monotonically increasing sequences for populating column values, the leaf block which is having high sequence key will be changing with every  insert, which makes it a hot block and potential candidate for a block split. 

With CACHE SIZE (and probably with NOORDER option), each instance would use start using the sequence keys with a different range reduces the index keys getting insert same set of leaf blocks.

o       Rebuild or shrink associated index after huge amount of data purge

If there is a huge amount of data purge (delete) has been done, rebuild or shrink associated index should help to reduce the wait via alter index rebuild or alter index shrink command.

o       Increase PCT_FREE for the index

.......................................................................................................................................................................................................................................................................................................... ● 本文來自於MOS轉載文章，(文件 ID  873243.1) ● 本文在itpub（http://blog.itpub.net/26736162）、部落格園(http://www.cnblogs.com/lhrbest)和個人微信公眾號（xiaomaimiaolhr）上有同步更新 ● QQ群：230161599  微信群：私聊 ● 小麥苗分享的其它資料：http://blog.itpub.net/26736162/viewspace-1624453/ ● 小麥苗雲盤地址：http://blog.itpub.net/26736162/viewspace-1624453/ ● QQ群： 230161599   微信群：私聊 ● 聯絡我請加QQ好友(642808185)，註明新增緣由 ●版權所有，歡迎分享本文，轉載請保留出處 .......................................................................................................................................................................................................................................................................................................... 手機長按下圖識別二維碼或微信客戶端掃描下邊的二維碼來關注小麥苗的微信公眾號：xiaomaimiaolhr,免費學習最實用的資料庫技術。