International business machines corporation (20240111773). Computer Memory Management With Efficient Index Access simplified abstract

From WikiPatents
Jump to navigation Jump to search

Computer Memory Management With Efficient Index Access

Organization Name

international business machines corporation

Inventor(s)

Shuo Li of Beijing (CN)

Xiaobo Wang of Beijing (CN)

Sheng Yan Sun of Beijing (CN)

YING Zhang of Beijing (CN)

Computer Memory Management With Efficient Index Access - A simplified explanation of the abstract

This abstract first appeared for US patent application 20240111773 titled 'Computer Memory Management With Efficient Index Access

Simplified Explanation

The patent application describes a computer technology for retrieving data stored in a table using an index tree data structure. Here is a simplified explanation of the abstract:

  • Receiving an original index tree data structure from persistent storage.
  • Storing a memory-based index tree data structure in volatile memory based on the original index tree data structure.
  • Retrieving data from a table in a database by traversing the memory-based index tree data structure.
      1. Potential Applications

This technology can be applied in database management systems, data retrieval systems, and information retrieval systems.

      1. Problems Solved

1. Efficient data retrieval from tables in a database. 2. Optimized memory usage for storing index tree data structures.

      1. Benefits

1. Faster data retrieval process. 2. Reduced memory consumption. 3. Improved overall performance of database operations.

      1. Potential Commercial Applications

Optimized database management systems for large-scale enterprises.

      1. Possible Prior Art

One possible prior art could be the use of B-tree data structures for indexing and retrieving data in databases.

        1. Unanswered Questions
        1. How does this technology handle concurrent data access and updates?

The patent application does not provide details on how the technology manages concurrent data access and updates in a multi-user environment.

        1. What are the scalability limitations of this technology?

The scalability limitations of the technology in terms of handling large volumes of data and increasing numbers of users are not addressed in the patent application.


Original Abstract Submitted

computer technology for retrieving data stored in a table that includes the following computer operations: receiving, from persistent storage of a computer, an original index tree data structure; storing, in volatile memory, a memory-based index tree data structure based on the original index tree data structure, with the memory-based index tree data structure including: a root node, a set of hierarchically arranged intermediate layer(s) with each intermediate layer including a plurality of non-leaf nodes, and a leaf layer including a plurality of leaf nodes; and retrieving data from a table in a database, with the retrieval including traversing the memory-based index tree data structure through a plurality of child lock pointers to locate pages including the data to be retrieved from the table.