Updated on 2024-06-07 GMT+08:00

UB-Tree

The B-tree is enhanced as follows, which is referred to as UB-tree.

  • Transaction information is added to UB-tree indexes, and MVCC can be performed independently. The proportion of IndexOnlyScan is increased, greatly reducing the number of times that the table is queried by TABLE ACCESS BY INDEX ROWID.
  • VACUUM is not the only way to clear historical data. Spaces are recycled independently. Indexes are decoupled from heap tables and can be cleared independently. The I/O stability is better.