A database transaction slot multiplexing method and related product

By storing transaction slot indices in the database index tuples, the issues of space utilization and query response speed in multi-version concurrency control at the index level are resolved, achieving efficient visibility determination and index structure stability.

CN122332031APending Publication Date: 2026-07-03CETC JINCANG (BEIJING) TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
CETC JINCANG (BEIJING) TECH CO LTD
Filing Date
2026-04-02
Publication Date
2026-07-03

AI Technical Summary

Technical Problem

Existing database systems cannot effectively balance space utilization and query response speed in multi-version concurrency control at the index level. Directly storing transaction information leads to a decrease in index page density, and table lookups increase input and output overhead.

Method used

By storing transaction slot indices in the index tuple instead of directly storing transaction identifiers, the utilization efficiency of transaction slots is optimized, the storage overhead of index pages is reduced, and visibility determination is achieved through transaction slot indices, reducing table lookups.

Benefits of technology

It increases the tuple density of index pages, reduces storage costs, reduces disk I/O operations, improves query response speed, and ensures the stability of the index structure.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN122332031A_ABST
    Figure CN122332031A_ABST
Patent Text Reader

Abstract

This invention provides a database transaction slot reuse method and related products. The method includes: based on the current transaction's access request to a B-tree index page, querying the transaction slot array maintained by the B-tree index page to find a target transaction slot matching the current transaction; if a target transaction slot is found, obtaining its transaction slot index for the current transaction to reference when inserting an index tuple; if no target transaction slot is found, checking the transaction slot array for a reusable transaction slot; if a reusable transaction slot exists, determining a set of reusable transaction slots, and selecting one from the cleaned-up set to store the transaction identifier of the current transaction; if no reusable transaction slot exists, creating a new transaction slot to store the transaction identifier of the current transaction. This invention achieves dual optimizations: lightweight index tuple storage and localized visibility determination.
Need to check novelty before this filing date? Find Prior Art