18300024. SYSTEM AND METHOD FOR SEARCHING FOR PAGES BASED ON B+ TREE STRUCTURE simplified abstract (SK hynix Inc.)

From WikiPatents
Revision as of 06:05, 18 October 2024 by Wikipatents (talk | contribs) (Creating a new page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

SYSTEM AND METHOD FOR SEARCHING FOR PAGES BASED ON B+ TREE STRUCTURE

Organization Name

SK hynix Inc.

Inventor(s)

Andrey Kuyel of Minsk (BY)

SYSTEM AND METHOD FOR SEARCHING FOR PAGES BASED ON B+ TREE STRUCTURE - A simplified explanation of the abstract

This abstract first appeared for US patent application 18300024 titled 'SYSTEM AND METHOD FOR SEARCHING FOR PAGES BASED ON B+ TREE STRUCTURE

The abstract describes a system for searching for pages of a memory device using a B+ tree node structure. The system includes a memory device, a controller with a cache memory, and a search accelerator. The search accelerator receives a key-value pair associated with a target page and searches for the target page in the cache memory based on the key-value pair using a B+ tree node structure.

  • Key Features and Innovation:
  • Utilizes a B+ tree node structure for efficient searching of pages in a memory device.
  • Includes a search accelerator to quickly locate target pages based on key-value pairs.
  • Utilizes a cache memory to store and retrieve pages for faster access.
  • Key-value pair includes a searched key and a value indicating a pointer to a tree node mapped to the target page.
  • Improves search efficiency and performance of memory devices.

Potential Applications: The technology can be applied in various systems requiring fast and efficient searching of pages in memory devices, such as databases, file systems, and data storage systems.

Problems Solved: Addresses the need for quick and accurate retrieval of pages in memory devices. Improves search efficiency and reduces access times for target pages. Enhances overall performance of memory devices by utilizing a B+ tree node structure.

Benefits: Faster and more efficient searching of pages in memory devices. Improved performance and reduced access times for target pages. Enhanced overall system efficiency and reliability.

Commercial Applications: Title: Efficient Memory Page Searching System Potential commercial uses include database management systems, file storage systems, and data processing applications. Market implications include improved system performance, faster data retrieval, and enhanced user experience.

Questions about Efficient Memory Page Searching System: 1. How does the B+ tree node structure improve search efficiency in memory devices? 2. What are the key benefits of using a search accelerator in the system?


Original Abstract Submitted

A system for searching for pages of a memory device based on a B+ tree node structure. The system includes a memory device and a controller including a cache memory and a search accelerator. The search accelerator receives a key-value pair associated with a target page among a plurality of pages; and searches for the target page from the cache memory based on the key-value pair, using a tree structure including B+ tree nodes mapped to the plurality of pages. The key-value pair includes a searched key and a value indicating a pointer to a tree node mapped to the target page, among the B+ tree nodes.