13 results about "B+ tree" patented technology

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.

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.

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.

The invention belongs to the technical field of databases, and discloses a persistent memory-oriented load-aware dynamic mixed B + tree index structure. Comprising a dynamic hybrid B + tree and a load awareness prediction module. The dynamic hybrid B + tree is responsible for storage, query, insertion and deletion of all data, internal nodes are in pure ordered layout, and leaf nodes are in dynamic hybrid layout; the load sensing prediction module comprises a prediction model and a load sensing module; the load sensing module collects a read-write proportion, and when the load sensing module judges that the read proportion exceeds a dynamic threshold value, the prediction model is operated, and the capacity proportion of the ordered key value pair area and the disordered key value pair area of the leaf nodes in the dynamic mixed B + tree is updated. The core problem that the performance of an existing persistent memory index structure is seriously limited under the dynamic working load is solved, self-adaptive real-time adjustment of the ordered storage / unordered storage proportion at the node level is achieved, and the approximate optimal comprehensive throughput capacity is continuously maintained under the dynamic load.

A system can maintain a copy-on-write b+ tree for a data storage system that is configured to store data as chunks, and a mapping between tree page identifiers of the b+ tree and first in-use chunk identifiers. The system can perform reference count validation, comprising iterating over the mapping, wherein the iterating over the mapping comprises, based on a first tree page identifier of the tree page identifiers being present in the mapping, loading second in-use chunk identifiers that correspond to the first tree page identifier directly from the mapping; and based on the first tree page identifier of the tree page identifiers being absent, loading corresponding content, extracting third in-use chunk identifiers from object metadata of the content, and updating the mapping based on the third in-use chunk identifiers, to produce an updated mapping. The system can perform garbage collection of the data storage system based on the validation.

This invention provides a method for reading data stored in a tree data structure, such as a B+ tree, using near data processing (NDP) in a cloud-native database. According to an embodiment, the expected LSN is used for NDP page reads on a primary compute node (e.g., a primary SQL node). When the primary compute node (e.g., a primary SQL node) reads a regular page, the maximum expected LSN of that regular page (e.g., the latest page version number) is used. The embodiment utilizes the expected LSN and page locking features, where the correct version of a page can be obtained by combining the expected LSN associated with the page with the page locking, and consistent tree structure readings can be achieved, resulting in good read / write concurrency.

The application belongs to the field of data storage, and particularly relates to a segmented B+ tree index structure based on PM. The HGB+ tree improves the performance of the index structure through a 'hourglass' leaf node structure and four mechanisms. The constructed HGB+ tree index structure is directly stored on the PM, and only the PM is used to complete the creation and use of the index structure. When the tree is created, the memory pool is first created or opened through the management library in the PM. Then, the necessary global metadata structure is created for the HGB+ tree in the PM, and subsequent operations are performed on the HGB+ tree. The internal nodes and leaf nodes of the HGB+ tree are deployed on the PM. The application designs a unique 'hourglass' leaf node structure scheme, and improves the performance of the storage system through the optimization of the basic operation strategy of the index structure and four beneficial mechanisms.

This invention belongs to the field of database technology and discloses a load-aware dynamic hybrid B+ tree index structure for persistent memory. It includes a dynamic hybrid B+ tree and a load-aware prediction module. The dynamic hybrid B+ tree is responsible for all data storage, querying, insertion, and deletion. Its internal nodes have a purely ordered layout, while the leaf nodes have a dynamically hybrid layout. The load-aware prediction module includes a prediction model and a load-aware module. The load-aware module collects the read / write ratio. When the load-aware module determines that the read ratio exceeds a dynamic threshold, it runs the prediction model and updates the capacity ratio of ordered and unordered key-value pair areas in the leaf nodes of the dynamic hybrid B+ tree. This invention solves the core problem of the severely limited performance of existing persistent memory index structures under dynamic workloads, achieving adaptive real-time adjustment of the ordered / unordered storage ratio at the node level, and continuously maintaining near-optimal overall throughput under dynamic loads.

The application provides a non-unique index structure updating method and device based on PostgreSQL. The method comprises the following steps: obtaining a non-unique index, wherein the data organization structure of the non-unique index is a B+ tree structure, the leaf node in the B+ tree comprises a TID pointer structure pointing to a data tuple, the TID pointer structure is provided with a count value representing the number of repeated key values and an address list; and in response to an updating operation on the non-unique index, the count value and the address list are synchronously updated. The application optimizes the index structure under the premise of maintaining the B+ tree, combines the repeated key value rows in the leaf tuple, creates an address list for each group of key values, stores the physical addresses of each row of the repeated key values, saves the storage space of the non-unique index, and improves the scanning efficiency of the non-unique index.

The invention relates to a B + tree merging method and device, equipment, a storage medium and a program product. The method comprises the steps of obtaining at least two to-be-merged B + trees; key value pairs are extracted from the first leaf nodes of the at least two B + trees to be combined, and the key value pairs are sorted according to the sequence of values of keys from small to large; and sequentially writing the key value pairs into a second leaf node of the combined B + tree based on a pre-acquired structure parameter, and generating an upper layer node of the second leaf node to obtain the combined B + tree. According to the method, the key value pair is extracted from the first leaf node of the to-be-merged B + tree and written into the second leaf node of the merged B + tree, and the upper layer node of the second leaf node is generated to obtain the complete merged B + tree, so that when data on a plurality of B + trees are integrated, the data on the plurality of B + trees can be integrated; the change of a large number of nodes and tree depth caused by inserting the nodes into the B + tree in batches is avoided, the consumption of computing resources is reduced, and meanwhile, the processing efficiency is improved.

A B+-tree-based data management method includes writing, when a first write operation on a node data of a B+ tree is detected, the node data to a base page of a disk, wherein the base page contains a pointer field configured to indicate an associated delta page; creating a first delta record in a delta page based on the base page, when a first write operation on a target entry in the base page is detected; creating a second delta record in the delta page when a second write operation on the target entry is detected, the second delta record is used to record second data corresponding to the second write operation. Accordingly, a waste of disk space may be reduced, and complexity of read-write operations may be lowered.

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.