Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

44 results about "B+ tree" patented technology

A B+ tree is an N-ary tree with a variable but often large number of children per node. A B+ tree consists of a root, internal nodes and leaves. The root may be either a leaf or a node with two or more children.

Video storage and retrieval method, device and equipment based on B + tree

The invention discloses a video storage and retrieval method, device and equipment based on a B + tree, and relates to the field of data processing. In the method, a video data stream is divided into a plurality of preset space grids; recognizing a dynamic target which continuously moves in the video data stream; determining a target space grid where the dynamic target is located, and generating a spatio-temporal trajectory fragment; constructing a B + tree index structure; receiving a retrieval request, and executing range query by using the B + tree index structure and the compound key to obtain a candidate fragment set; traversing the target spatio-temporal trajectory fragments in the candidate fragment set, determining a corresponding target identifier based on the query dynamic target, and accumulating all overlapping durations generated by the query dynamic target to obtain a total effective stay duration; and screening out the query dynamic targets of which the total effective staying duration is greater than or equal to a preset duration threshold value, and outputting the query dynamic targets as a final retrieval result. By implementing the technical scheme provided by the invention, the retrieval efficiency of the video data is improved.
Owner:JINAN RUOLIN VIDEO TECH CO LTD

Data recovery method and device, computer equipment, storage medium and program product

The invention relates to a data recovery method and device, computer equipment, a storage medium and a program product. The method comprises the steps that a current repairing task of a hybrid tree is determined, the hybrid tree is a hybrid storage structure of a log merging tree LSM tree and a B tree, the hybrid tree comprises multiple layers, the multiple layers comprise the first layer of the LSM tree and all layers of the B tree, ordered character string tables of the first layer of the LSM tree are merged and sunk into the B tree, and each node in the B tree stores at least one ordered character string table obtained through merging and sinking; under the condition that the current repair task indicates that the repaired damaged data storage object belongs to the B tree, obtaining a B tree index of the damaged data storage object from the current repair task; searching a damaged data storage object from the mixed tree according to the B tree index, wherein the damaged data storage object is an ordered character string table or a node; and under the condition that the damaged data storage object is found, repairing the damaged data storage object. By adopting the method, the data recovery efficiency can be improved.
Owner:DAWNING INFORMATION IND (BEIJING) CO LTD +2

Block backup indexing method, system and equipment based on B + tree and storage medium

The invention relates to a block backup indexing method, system and device based on a B + tree and a storage medium, and belongs to the technical field of disaster recovery backup. The method comprises the steps of intercepting a QEMU block write-in request and extracting an IO descriptor, writing block data into a disk and obtaining a physical offset, initializing a two-dimensional B + tree index structure, inserting the block IO descriptor and offset information into a two-dimensional B + tree, querying the position of the block data according to a logic offset and / or timestamp range, and deleting and updating index nodes according to a specified range. The system comprises a block data interception module, a block data writing module, a B + tree initialization module, a block data insertion module, a block data search module and a block data deletion module. According to the method, through a two-dimensional hierarchical index structure of the logic offset and the timestamp, joint efficient positioning of time and space dimensions is achieved, sharing of timestamp leaf nodes between local and global B + trees is supported, data redundancy is effectively avoided, and range query efficiency is improved.
Owner:CHENGDU VINCHIN TECH CO LTD

Index server, user terminal, and method of indexing blockchain transaction data

The provided index server indexes two-dimensional (2D) location data included in the transaction data as a K-d-B tree, constructs partial Merkle trees for a group of leaf nodes in the K-d-B tree, and stores hierarchical hash information based on the partial Merkle trees in each of nodes of the K-d-B tree. When a query related to the location data is acquired via the interface module, the index server searches the K-d-B tree to find a query result corresponding to the acquired query, and generates verification data for verifying the searched query result on the basis of the partial Merkle trees and the hierarchical hash information. The index server then provides the query result and the verification data to the user terminal to verify the integrity of the query result using the partial Merkle trees and the hierarchical hash information by the user terminal.
Owner:ELECTRONICS & TELECOMM RES INST

Dynamically resizing root nodes of hierarchical data structures

A processing system dynamically adjusts the size of root nodes in hierarchical data structures, such as B+ trees. Upon creation, a root node has a predefined initial size. When a request is received to insert a new record, a determination is made as to whether the size of the root node has reached a predefined maximum size. If the root node has not reached the predefined maximum size, the size of the root node is increased to accommodate the new record and the new record is added to the root node. If the root node has reached the predefined maximum size, one or more new child nodes are created, and records are moved from the root node to the new child nodes. The size of the root node is then reduced to a predefined minimum size.
Owner:MICROSOFT TECHNOLOGY LICENSING LLC

Concurrent updating method for account state data, electronic equipment and computer program product

PendingCN121958266AAchieve conflict isolationConflict isolation avoidanceDatabase updatingSecuring communicationData needsTree architecture
The invention relates to the technical field of block chains, and provides an account state data concurrent updating method, electronic equipment and a computer program product. The method comprises the following steps: determining each to-be-updated account of which the state data needs to be updated; sorting the accounts to be updated according to a sequence rule of storing the account state data by each leaf node of the tree structure data; for each to-be-updated account, distributing a state updating operation of the to-be-updated account to an updating task of a to-be-updated leaf node corresponding to the sequence of the to-be-updated account in each leaf node; and concurrently executing the updating task of each to-be-updated leaf node so as to complete the state updating operation of each to-be-updated account. According to the method, the consistency of the updated account state data of each block chain node can be improved while the data updating efficiency is improved by adopting tree structures such as a B + tree and the like.
Owner:HANGZHOU HIGH-TECH ZONE (BINJIANG) INSTITUTE OF BLOCKCHAIN & DATA SECURITY

Managing snapshotting of a dataset using an ordered set of b+ trees

A dataset is represented by an ordered set of B+ trees, with each snapshot of the dataset being represented by an immutable B+ tree. An ordering of B+ trees in the ordered set logically arranges those B+ trees into layers, with the mutable B+ tree representing the current state of the dataset being logically arranged as the uppermost layer and with immutable B+ trees representing snapshots of the dataset being progressively arranged as lower layers with the oldest snapshot being the lowermost layer. A snapshot deletion includes merging a neighbor B+ tree and a subject B+ tree based on identifying partially intersecting records in the subject B+ tree and neighbor B+ tree and splitting one of those records into a non-intersecting record and a fully-intersecting record.
Owner:MICROSOFT TECHNOLOGY LICENSING LLC

A b+ tree index construction method based on zns ssd for dynamic placement of hot and cold data

The application relates to a B+ tree index construction method based on ZNS SSD cold and hot data dynamic placement, which comprises a persistent memory PM, a dynamic random access memory DRAM and a ZNS SSD hard disk; the persistent memory PM and the dynamic random access memory DRAM are directly connected with a CPU memory bus and have the ability of being accessed by the CPU by bytes; internal nodes of the B+ tree are stored in the dynamic random access memory DRAM, wherein the internal nodes only store index information for positioning leaf nodes; pseudo leaf nodes of the B+ tree are stored in the persistent memory PM, wherein the pseudo leaf nodes only store key index information of the leaf nodes; leaf nodes for actually storing key value pairs in the B+ tree are divided into hot leaf nodes and cold leaf nodes according to data access frequencies, wherein the hot leaf nodes are stored in the persistent memory PM, and the cold leaf nodes are stored in the ZNS SSD hard disk. The application utilizes the DRAM to quickly position the leaf nodes, reduces query time, stores the hot leaf nodes in the PM to meet real-time business read-write requirements, stores the hot data in the high-speed DRAM and the PM, reduces random read-write delay and performs well in big data analysis and other scenes.
Owner:GUIZHOU UNIV

A read-write performance optimization method based on persistent memory B+ tree index

The application discloses a read-write performance optimization method based on a persistent memory B+ tree index and belongs to the field of data storage, and comprises the following steps: establishing a B+ tree, non-leaf nodes of the B+ tree are stored in DRAM, and leaf nodes are stored in PM; introducing a concurrent hash table for storing hot data on the DRAM, transferring the access of the hot data from the PM to the DRAM, and relieving the read-write interference problem on the PM; based on the characteristic that there are hot spots in the work load under a real scene, a lightweight hot data identification and replacement strategy is also implemented, a weight is set for each storage element based on the access frequency, and the dynamic change of the hot data in the work load is dealt with; a low-overhead write operation is realized by combining an additional update mechanism and a self-verification insertion mechanism in the B+ tree, the data consistency guarantee overhead is greatly reduced, and a semi-sequenced leaf node is adopted, so that the query efficiency of the leaf node is improved, and meanwhile, the write efficiency is not affected. The application can provide high performance for read operation and write operation simultaneously.
Owner:HUAZHONG UNIV OF SCI & TECH

Storing namespace metadata in a key value store to facilitate space efficient point in time snapshots

Metadata of a file system is maintained in a key value store. The metadata includes a namespace represented as a B+ tree having pages written to the key value store. Identifiers to the pages include a snapshot identifier and a page number. The identifiers are stored as keys in the key value store. The snapshot identifiers are used to track pages that are shared between first and second snapshots. Upon a request to write to an existing page, a determination is made from the snapshot identifiers as to whether the existing page belongs to the first or second snapshot. If the existing page belongs to the second snapshot, the write to the existing page is allowed. If the existing page belongs to the first snapshot, a copy on write (COW) is performed to generate a new page for the write.
Owner:DELL PROD LP

Cloning a clustered file system

A key value store is maintained in which the key value store includes pages of a B+ Tree structure holding file metadata of a logical partition of a filesystem. The pages are associated with keys through which the pages are retrieved from the key value store. The keys are named. A clone is created of the logical partition, the logical partition now being a parent and the clone now being a child. The naming of the keys is used to allow the pages stored in the key value store to be read by any of the parent or child. The naming of the keys is used to allow any of the parent or child to make updates to the pages, where updated pages are owned by a respective parent or child that made the updates, and pages not updated remain accessible by any of the parent or child.
Owner:DELL PROD LP

Method and Device for Data Migration of Blockchain

A method and a device for data migration of a blockchain. The method includes generating a state tree based on state data of accounts in the blockchain, in which the state tree is a B+ tree based on a copy-on-write technology, and each leaf node of the state tree is configured to store the state data; determining a target state tree to be migrated from the generated state tree when data migration is triggered; sending state data of the target state tree to an extended node of a master node; if migration completion information is received from the extended node, updating a data mapping table stored in the master node, in which the data mapping table is configured to represent a mapping relationship between state data stored in the extended node and the extended node; and deleting the target state tree in the master node.
Owner:HANGZHOU HIGH-TECH ZONE (BINJIANG) INSTITUTE OF BLOCKCHAIN & DATA SECURITY