Ind write

Index writes per second.

Higher than expected values can indicate unnecessary indexes.

When a write operation is made to a table, this counter is incremented for each index that must be updated.

Ind nomrg write

Number of nonmerged rows (committed and uncommitted) in the Bonsai tree. This counter applies only to disk-based tables.

High or growing values means the Bonsai tree is too large.

This counter is essentially the size of the Bonsai tree. If this counter is large or is constantly growing, performance is affected because the Bonsai tree consumes more database cache. This leaves less room for data caching and might ultimately cause disk paging.

Index search both

Search is done from both the Bonsai tree and the storage tree

Index search storage

Index search is done from storage tree only

B-tree node search keys storage

Internal use only. DBE B-tree storage nodes searches/sec

B-tree node search keys Bonsai

Internal use only. DBE B-tree Bonsai node searches/sec

B-tree node search mismatch storage

A search was done by using the mismatch index search structure within a B-tree node. Mismatch index is a search structure where an array of mismatch index positions is built within a B-tree node. This mismatch index is a compact and linear data structure that is used to perform a fast scan over compressed key information to find a key position within the B-tree node. It attempts to optimize the search by using fast access in the processor cache row by packing relevant search information in one to three processor cache pages.

B-tree node search mismatch Bonsai

A search was done by using the mismatch index search structure within a B-tree node. Mismatch index is a search structure where an array of mismatch index positions is built within a B-tree node. This mismatch index is a compact and linear data structure that is used to perform a fast scan over compressed key information to find a key position within the B-tree node. It attempts to optimize the search by using fast access in the processor cache row by packing relevant search information in one to three processor cache pages.

B-tree node build mismatch storage

A new mismatch index search structure is built within a B-tree node. Mismatch index is a search structure where an array of mismatch index positions is built within a B-tree node. This mismatch index is a compact and linear data structure that is used to perform a fast scan over compressed key information to find a key position within the B-tree node. It attempts to optimize the search by using fast access in the processor cache row by packing relevant search information in one to three processor cache pages.

B-tree node build mismatch Bonsai

A new mismatch index search structure is built within a B-tree node. Mismatch index is a search structure where an array of mismatch index positions is built within a B-tree node. This mismatch index is a compact and linear data structure that is used to perform a fast scan over compressed key information to find a key position within the B-tree node. It attempts to optimize the search by using fast access in the processor cache row by packing relevant search information in one to three processor cache pages.

B-tree node split storage

Number of B-tree node splits/sec

B-tree node split Bonsai

Number of B-tree node splits/sec

B-tree node multisplit storage

 

B-tree node multisplit Bonsai

 

B-tree node join storage

Number of joined B-tree nodes

B-tree node join Bonsai

Number of joined B-tree nodes

B-tree node relocate storage

A B-tree node is relocated. This happens when a block that belongs to a previous checkpoint is changed for the first time. Typically, this value is highest immediately after a checkpoint.

B-tree node relocate Bonsai

A B-tree node is relocated. This happens when a block that belongs to a previous checkpoint is changed for the first time. Typically, this value is highest immediately after a checkpoint.

B-tree node delete empty storage

An empty B-tree node is deleted.

B-tree node delete empty Bonsai

An empty B-tree node is deleted.

B-tree node exclusive storage

Exclusive access to the B-tree is used. This can happen, for example, in a node split case such as when the tree root is split.

B-tree node exclusive Bonsai

Exclusive access to the B-tree is used. This can happen, for example, in a node split case such as when the tree root is split.

B-tree node fill factor storage

Average fill factor for B-tree node

B-tree node fill factor Bonsai

Average fill factor for B-tree node

B-tree key read storage

Normal key value is read from the B-tree.

B-tree key read Bonsai

Normal key value is read from the B-tree.

B-tree key read delete Bonsai

Delete mark is read from the B-tree.

B-tree key read oldversion Bonsai

Old row version is read from the B-tree.

B-tree key read abort Bonsai

A row from an aborted transaction is read from the B-tree. This includes all transactions that were not successfully completed.

B-tree height storage

Current storage tree height in levels.

B-tree height Bonsai

Current Bonsai tree height in levels.

B-tree lock full path

Number of B-tree node lock calls.

B-tree lock partial path

Number of B-tree partial node path lock calls.

B-tree get shared lock

Number of B-tree shared lock calls.