17526207. CHAINING VERSION DATA BI-DIRECTIONALLY IN DATA PAGE TO AVOID ADDITIONAL VERSION DATA ACCESSES simplified abstract (International Business Machines Corporation)
Contents
CHAINING VERSION DATA BI-DIRECTIONALLY IN DATA PAGE TO AVOID ADDITIONAL VERSION DATA ACCESSES
Organization Name
International Business Machines Corporation
Inventor(s)
CHAINING VERSION DATA BI-DIRECTIONALLY IN DATA PAGE TO AVOID ADDITIONAL VERSION DATA ACCESSES - A simplified explanation of the abstract
This abstract first appeared for US patent application 17526207 titled 'CHAINING VERSION DATA BI-DIRECTIONALLY IN DATA PAGE TO AVOID ADDITIONAL VERSION DATA ACCESSES
Simplified Explanation
The patent application describes a computer-implemented method, system, and computer program product for improving the performance of a distributed database. Here is a simplified explanation of the abstract:
- The method involves receiving a query to store version data in the distributed database.
- Upon receiving the query, the version data is stored in a row of a data page of the main table of the distributed database.
- The main table can be organized as a heap or an index organized table.
- The row in the data page contains a pointer that points to a later or previous version of the version data if it exists in the same data page.
- This allows for bi-directional chaining of version data within the distributed database.
Potential applications of this technology:
- This technology can be applied in any system or application that relies on a distributed database.
- It can be particularly useful in scenarios where versioning of data is important, such as in document management systems or version control systems.
- It can also be beneficial in situations where efficient storage and retrieval of versioned data is crucial, such as in data archival systems.
Problems solved by this technology:
- The technology addresses the challenge of efficiently storing and retrieving versioned data in a distributed database.
- It eliminates the need for separate tables or complex data structures to manage versioning, simplifying the database design.
- By allowing bi-directional chaining of version data, it enables efficient navigation between different versions of the data within the distributed database.
Benefits of this technology:
- Improved performance: The method optimizes the storage and retrieval of versioned data, leading to faster query execution and improved overall database performance.
- Simplified database design: The approach eliminates the need for additional tables or complex data structures to manage versioning, making the database design simpler and easier to maintain.
- Enhanced data navigation: The bi-directional chaining of version data allows for efficient navigation between different versions, enabling easier access to historical data and facilitating version control processes.
Original Abstract Submitted
A computer-implemented method, system and computer program product for improving performance of a distributed database. A query is received to store version data in the distributed database. Upon receiving the query to store the version data, the version data is stored in a row of a data page of a main table of a heap organized table/index organized table of the distributed database, where the row of the data page of the main table of the heap organized table/index organized table of the distributed database contains a pointer pointing to a later/previous version of the version data if the later/previous version of the version data is stored in the data page thereby chaining version data bi-directionally.
