17936454. Computer Memory Management With Efficient Index Access simplified abstract (International Business Machines Corporation)
Contents
- 1 Computer Memory Management With Efficient Index Access
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 Computer Memory Management With Efficient Index Access - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Potential Commercial Applications
- 1.9 Possible Prior Art
- 1.10 Original Abstract Submitted
Computer Memory Management With Efficient Index Access
Organization Name
International Business Machines Corporation
Inventor(s)
Computer Memory Management With Efficient Index Access - A simplified explanation of the abstract
This abstract first appeared for US patent application 17936454 titled 'Computer Memory Management With Efficient Index Access
Simplified Explanation
The abstract describes a computer technology for retrieving data stored in a table using an Index Tree data structure. Here is a simplified explanation of the patent application:
- 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.
- The memory-based Index Tree data structure includes a root node, intermediate layers with non-leaf nodes, and a leaf layer with leaf nodes.
- Retrieving data from a table in a database by traversing the memory-based Index Tree data structure through child lock pointers to locate the data.
Potential Applications
This technology can be applied in various database management systems for efficient data retrieval and indexing.
Problems Solved
1. Efficient retrieval of data from large tables in databases. 2. Optimized storage and access of Index Tree data structures.
Benefits
1. Faster data retrieval process. 2. Reduced memory usage for storing Index Tree data structures. 3. Improved performance of database queries.
Potential Commercial Applications
Optimized database management systems for industries such as e-commerce, finance, and healthcare.
Possible Prior Art
One possible prior art could be the use of B-trees or other indexing structures for data retrieval in databases.
Unanswered Questions
How does this technology compare to traditional indexing methods in terms of performance and memory usage?
This article does not provide a direct comparison between this technology and traditional indexing methods. Further research or testing may be needed to evaluate the performance and memory usage differences.
Are there any limitations or constraints in implementing this technology in existing database systems?
The article does not mention any potential limitations or constraints in implementing this technology. It would be important to investigate any compatibility issues or requirements for integrating this technology into different database systems.
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.
