6 results about "Radix tree" patented technology

The invention relates to a separate memory architecture-oriented swap space cache optimization system and method, and the method comprises the steps: receiving a page swap request sent by a host memory space, and converting the page swap request into a swap space memory access request; a cardinal number tree cache index is generated according to the logic block number in the exchange space memory access request, searching is conducted according to the index, and if searching succeeds, a data block is obtained from a cache space and sent to a host memory space; if the search is not successful, adopting an asynchronous active cache replacement strategy to select a data block from the original cache region, writing the data block back to the remote memory pool, and meanwhile, adopting a dynamic pre-fetching strategy based on historical access to read pre-fetching data from the remote memory, and storing the pre-fetching data into a pre-fetching cache region. On the premise that an existing switching mechanism of an operating system is not changed, the access efficiency of the switching space of the separated memory is improved, the access frequency of the remote memory is reduced, and therefore the memory access time delay of the whole system is reduced, and the I / O performance of the system is improved.

The application relates to the technical field of storage, and provides a request processing method and device, a storage device and a storage medium, the method comprises the following steps: acquiring a base number tree, the base number tree comprises a plurality of leaf nodes, each leaf node comprises a preset number of index values arranged in sequence; if a target leaf node exists in the base number tree, then performing to-be-written data merging according to effective index values in the target leaf node to generate a writing request, the target leaf node is a leaf node with adjacent effective index values, and the effective index values are index values corresponding to to-be-written data; and the writing request is sent to a hard disk, so that the hard disk writes the merged to-be-written data into the hard disk according to the writing request. The application reduces the IO interaction times of the storage device and the hard disk, thereby improving the IO request processing capacity of the storage device.

The embodiment of the invention provides a vector hybrid retrieval method and system, and is applied to the technical field of data processing. The method is applied to a two-layer vector hybrid index (TLHI), and the TLHI comprises a cardinal tree-based index (RTBI) and a hierarchical navigation small world (HNSW) index. Vector data and attribute information corresponding to the to-be-retrieved data are obtained, the attribute information is traversed in sequence through RTBI, and a target partition comprising the attribute information is obtained. And performing vector retrieval on the target partition by using the HNSW index to obtain a retrieval result matched with the vector data. The retrieval result comprises Top K pieces of data similar to the vector data. According to the method, the hybrid retrieval is performed based on the double-layer vector hybrid index TLHI, the first layer of the index uses RTBI to realize efficient attribute filtering, and the second layer of the index uses HNSW to perform vector similarity retrieval, so that the requirements of vector similarity retrieval and attribute filtering can be met at the same time, and the retrieval efficiency of vector hybrid retrieval is improved.

The application provides a persistent variable radix tree access system supporting lock-free concurrent access, comprising: a data storage module: organizing and managing the persistent storage of prefix nodes, leaf nodes and data of the variable radix tree, and supporting a general variable radix tree read-write access interface; a local access module: receiving read-write requests of local applications on the variable radix tree and putting the requests into a processing queue to wait for processing by a background processing module; the background processing module: processing the read-write requests in the processing queue, updating the prefix nodes and leaf nodes of the variable radix tree, and ensuring that the metadata and data of the variable radix tree are in a consistent state; and a data recovery module: detecting fault consistency after the persistent variable radix tree access system is restarted, and recovering all data in the variable radix tree to a consistent state when the data is inconsistent.

The invention relates to a data-centered adaptive radix tree hardware accelerator and an acceleration method. The hardware accelerator comprises an on-chip memory, a control unit, a merging unit, a distributor and an operation unit. The control unit is used for sending the operation information to the scanning buffer area; the merging unit is used for reading the prefixes of the keys corresponding to the operation information from the scanning buffer area and distributing the operation information to different buckets according to a mode that the prefixes of the keys are matched with the prefixes of the buckets, so that the same operation information of the ART nodes is merged and combined operation information is formed; sending each bucket to a bucket buffer area; the dispatcher is used for calling buckets with different prefixes from the bucket buffer area and randomly sending the buckets to the idle operation unit; and the operation unit is used for searching each piece of operation information in the bucket according to the key value sequence, and searching a target node corresponding to the operation information by traversing the tree buffer area or indexing the shortcut buffer area, so as to trigger all operations related to the target node in the bucket to be executed at the same time.

This invention relates to the field of database systems and storage systems, and in particular to a writing method and apparatus based on a computable storage device. The method includes receiving a write transaction for a database; when the database is under non-write-intensive load, writing the flushed data corresponding to the write transaction to the actual storage area based on a B+ tree index structure; dividing the entire key space of the database into multiple partitions according to the range of keys, and for each partition, storing the key value falling into the partition and a pointer to the actual data in the leaf nodes of an adaptive radix tree, obtaining a multi-instance adaptive radix tree index structure; when the database is under write-intensive load, writing the flushed data corresponding to the write transaction to the virtual storage area of ​​the computable storage device based on the multi-instance adaptive radix tree index structure, and having the computable storage device complete the process of migrating the flushed data from the virtual storage area to the actual storage area. This invention can improve write performance.