Microsoft technology licensing, llc (20240241873). TREE-BASED DATA STRUCTURE simplified abstract
Contents
TREE-BASED DATA STRUCTURE
Organization Name
microsoft technology licensing, llc
Inventor(s)
Aleksandar Dragojevic of Cambridge (GB)
TREE-BASED DATA STRUCTURE - A simplified explanation of the abstract
This abstract first appeared for US patent application 20240241873 titled 'TREE-BASED DATA STRUCTURE
Simplified Explanation: The patent application describes a system where a writer writes items to leaf nodes of a tree, and a reader reads items from these leaf nodes. Each node consists of a first block and a second block, with the first block containing items sorted in order of key. When new items are written to a leaf, they are added to the second block in the order they were written, rather than being sorted by key. When the reader searches for target items in a leaf, they use the order of the items in the first block and sort the items in the second block by key relative to the first block.
Key Features and Innovation:
- Items are written to leaf nodes of a tree by a writer and read by a reader.
- Each node has a first block with items sorted by key and a second block for new items written in the order they were added.
- The reader searches for target items based on the order of items in the first block and sorts the items in the second block by key.
Potential Applications: This technology could be used in database systems, file systems, and any other application that requires efficient storage and retrieval of data.
Problems Solved: This technology addresses the problem of efficiently storing and retrieving items in a tree structure, especially when new items are added frequently.
Benefits:
- Improved efficiency in storing and retrieving items in a tree structure.
- Simplified process for adding new items to leaf nodes.
- Enhanced performance for searching for target items.
Commercial Applications: Potential commercial applications include database management systems, content management systems, and any system that requires efficient data storage and retrieval.
Prior Art: Readers can start their search for prior art related to this technology by looking into existing tree data structures, database systems, and indexing methods.
Frequently Updated Research: Researchers are constantly exploring new ways to optimize data storage and retrieval in tree structures, which could lead to advancements in this technology.
Questions about the Technology: 1. How does this technology compare to traditional methods of storing and retrieving data in tree structures? 2. What are the potential scalability issues that could arise with this technology?
Original Abstract Submitted
a writer writes items to leaf nodes of a tree, and a reader read items from the leaf nodes. each node comprises a respective first block and second block, the first block comprising a plurality of the items of the respective leaf sorted in order of key. when writing new items to a leaf, the writer writes the new items to the second block of the identified leaf node in an order in which written, rather than sorted in order of key. when reading one or more target items from a leaf, the reader searches the leaf for the one or more target items based on a) the order of the items as already sorted in the first block and b) the reader sorting the items of the second block by key relative to the items of the first block.
