19 results about "Multiversion concurrency control" patented technology

The invention discloses a digital production plan scheduling method and system, and belongs to the technical field of optimal scheduling, and the method comprises the steps: constructing a distributed storage architecture based on edge computing nodes; a central coordinator is adopted to realize cross-node data synchronization through an improved Raft consensus algorithm, multi-version concurrency control is realized based on a vector clock, and a global consistent data view is established; a visual scheduling platform is built based on a Vue3 framework, and man-machine interaction is realized by adopting a Canvas and WebGL collaborative rendering framework; establishing a dynamic coordinate conversion model based on bilinear interpolation, designing a space mapping function containing distortion compensation, establishing a multi-thread coordinate service based on WebWorker, and realizing submillimeter-level bidirectional mapping of pixel coordinates and physical coordinates; constructing a three-dimensional space-time analysis model fused with the multi-dimensional features; and all the units are subjected to feature fusion through residual connection, and finally a scheduling scheme with a confidence coefficient weight is output. The method and the device have the effect of meeting various scheduling requirements.

The invention discloses a system and a method for supporting multi-version concurrency control in a column storage database, belongs to the technical field of databases, and aims to solve the technical problem of how to provide efficient and flexible concurrency control and data operation management. Comprising a multi-version management module for creating a transaction ID and a timestamp for each transaction and maintaining a version linked list for each data segment in a column storage database; the operation optimization module is used for performing data operation on the data in the column storage database based on the submitted transaction, performing operation according to a comparison result of a version number and a transaction timestamp when the data operation is executed, and storing the data before modification into a revocation buffer area; the transaction conflict processing module is used for detecting and processing transaction conflicts based on a preset conflict processing rule; the storage space management module divides the storage of the column storage database into table storage and local storage; and the version linked list management module is used for deleting the version information which is no longer referenced by any active transaction based on the transaction state and the version information.

The invention discloses an AI policy consultation database and an AI consultation method, and belongs to the technical field of artificial intelligence and government affair information services. The invention aims to solve the problems of unreliable information source, large semantic understanding deviation and low policy matching accuracy of the existing general AI tool in the field of policy consultation. According to the technical scheme, the method comprises the steps that a multi-level, multi-dimension and versioning management policy database is constructed, and entity version snapshots and a multi-version concurrency control (MVCC) mechanism are adopted to process time sequence conflicts caused by policy revision; the retrieved trusted policy text and an original query request of a user are integrated into an enhanced Prompt (Augmented Prompt); and receiving and analyzing a preliminary conclusion returned by the LLM, and generating a standardized policy consultation report containing a structured table and attachments by using a natural language generation (NLG) and chapter structure analysis technology. And the accuracy, timeliness and reliability of policy consultation are remarkably improved.

The invention provides a territorial space knowledge evolution model construction method, and belongs to the technical field of territorial space knowledge evolution models.The territorial space knowledge evolution model construction method includes the steps that a distributed graph storage framework is constructed, sub-graph partitions are divided through a community detection algorithm, and external event information is collected and converted into a graph operation instruction sequence; positioning a k-hop neighborhood sub-graph by using an incremental sub-graph matching algorithm and executing local updating to generate an intermediate knowledge graph, calculating node state embedding representation of a fusion time coding vector, capturing a time sequence dependence mode through a time perception graph attention aggregation algorithm, executing semantic consistency constraint detection to identify conflicting nodes, and obtaining a time perception graph attention aggregation algorithm; when the conflict degree exceeds a threshold value, the multi-version concurrency control protocol is triggered to roll back to the snapshot version, otherwise, the intermediate knowledge graph is reserved as final output, and the problem that it is difficult to give consideration to updating efficiency and semantic consistency guarantee when the territorial space knowledge graph responds to an external event for evolution updating is solved.

According to the financial market data-oriented distributed memory database system and the implementation method thereof, a hierarchical data storage module and a table-level multi-version concurrency control module establish indexes by constructing a tree table structure and using a lock-free hashmap to finally generate a chain array; the problem that the concurrent processing capacity is affected by lock competition caused by limitation of a single-thread model is solved, a hierarchical data storage module and a shared memory persistence module store binlogs through a tree table structure and a shared memory, and the problem that data is not persistent due to storage of key values is solved; the real-time data distribution module solves the problem that the distributed expansion capability is limited due to point-to-point synchronization through a multicast and TCP hybrid transmission mechanism.

The invention relates to the technical field of data processing, in particular to a power grid multi-dimensional information base construction method and system based on data mapping. According to the method, data source change events are monitored in real time, and incremental data records are extracted; constructing a data association graph containing a dynamic association relationship, calculating the influence degree of incremental data records on other data items based on graph path propagation or space-time neighborhood analysis, and obtaining a quantized influence degree factor; updating tasks of other data items are generated according to the influence degree factors, priority ranking is carried out, and a multi-version concurrency control mechanism is adopted to carry out atomic updating on the data items according to the priority. The real-time accurate updating of the multi-source heterogeneous data of the power grid is realized by capturing the increment change in real time and quantifying the dynamic association influence, the problems of data lag and weak association caused by a traditional batch processing mode are solved, and the timeliness of power grid state sensing and scheduling is effectively improved.

The present invention relates to a multi-version concurrency control method for an openGauss database under a distributed multi-write architecture. The method comprises: generating an xid when creating a tuple, and recording xmin and xmax information in the tuple; calculating the segment_id, timestamp, and auto-increment id triple information through the xid, and determining the unique storage location of the transaction status in the cluster; generating a transaction snapshot, which contains oldest_xid and timestamp information; obtaining the global oldest_xid; updating a linked list by querying historical tuples, and combining the transaction snapshot, the xmin and xmax information in the tuple, and the transaction status information to determine whether the tuple is visible to the current transaction; and regularly performing dead tuple cleanup and tuple freezing. The method solves the problem that the existing MVCC technology is not applicable to a distributed multi-write architecture, expands the applicable scenarios of the MVCC technology, and provides a practical multi-version concurrency control solution for a distributed multi-write architecture database.

The application provides a transaction processing method and related product of a memory engine. The method comprises the following steps: determining a multi-version concurrent control version chain; in response to a transaction request, determining an acquisition mode of a snapshot serial number according to an isolation level of a current transaction; in response to the current transaction being a read operation, acquiring a first target data version from the multi-version concurrent control version chain based on the acquisition mode of the snapshot serial number, and taking data values in the first target data version as a read result of the current transaction; in response to the current transaction being a write operation, acquiring a second target data version of a row record before the write operation is performed, and storing data values in the second target data version to a private storage area of the current transaction; and writing new data values corresponding to the write operation to the private storage area of the current transaction and taking the new data values as to-be-submitted modification contents. The scheme of the application reduces mutual interference and mutual blocking during transaction execution while ensuring transaction consistency.

The application discloses a data synchronization method, system and device based on multi-version concurrent control and a medium, and belongs to the technical field of databases.The method comprises the following steps: obtaining a consistency identifier in a source database; determining to-be-synchronized data in the source database based on the consistency identifier, and dividing the to-be-synchronized data based on a preset division rule to obtain a plurality of data shards; allocating a corresponding execution unit to each data shard, taking the consistency identifier as a snapshot point of each execution unit, executing a read-only transaction in parallel through all the execution units to obtain a data snapshot corresponding to the consistency identifier; simultaneously, obtaining incremental data after the consistency identifier; applying the data snapshot to a target end, and if the application of the data snapshot is completed, applying the incremental data to the target end to realize data synchronization from the source database to the target end, so that the efficiency and consistency of data synchronization can be improved by implementing the application.

This disclosure relates to a high-throughput algorithm for multi-version concurrency control with globally synchronized time. Throughput is preserved in the distributed system while concurrency is maintained by pushing commit wait periods to the client commit path and future readers. Instead of the server performing commit waits, the server assigns timestamps, which are used to ensure that causality is preserved. When the server executes a transaction that writes data to the distributed database, the server acquires a user-level lock and assigns the transaction a timestamp equal to the current time plus an interval corresponding to the range of clock uncertainty in the distributed system. After assigning the timestamp, the server releases the user-level lock. Any client device must wait until the assigned timestamp has elapsed before performing a read of the written data.

Commit time logging is performed as part of implementing time-based Multi-Version Concurrency Control (MVCC). A query engine may determine a commit time for a database transaction is committed to a database by applying MVCC to select different versions of data in the database according to transaction commit times. The query engine may store the commit time for the database transaction in a log structure stored in a non-volatile data store. A segment describing the log structure maintained in a volatile memory maintained in a volatile memory may be updated to include the commit time for the database transaction.

The application relates to the field of databases and discloses a database transaction method, device, equipment and storage medium. The method processes a to-be-processed object according to a data processing instruction in a database transaction, retains a lock for the to-be-processed object, the retained lock is used for representing that the database transaction will modify the to-be-processed object, records an operation of processing the to-be-processed object, saves the generated record through a log, allocates a resource for updating the to-be-processed object, and updates the database according to the log. Since the application manages the modification of the to-be-processed object through the retained lock and updates the database through the record in the log, the problem that the RC isolation level in the prior art usually adopts a multi-version concurrent control mechanism, the method needs mutual exclusion in the program and exists implicit locks, and the concurrent transactions cannot be concurrent is solved, more lock modes are introduced, the time for which a lock is held by a concurrent transaction is shortened, and the concurrency of transaction processing is improved.

The invention belongs to the technical field of GPU (Graphics Processing Unit) processing, and discloses a multi-version concurrency control method for GPU accelerated transaction processing. The high parallel computing capability of the GPU is utilized, and a multi-version data storage scheme is adopted, so that the transaction processing speed is increased. According to the method and the system, the transactions are stored, the concurrency among the transactions is increased, the concurrency in the transactions is increased, the atomicity of the transactions is ensured, and large-scale concurrency of the transactions is realized and resource consumption caused by a high transaction abortion rate due to conflicts is reduced through a multi-version storage scheme in which metadata and loads are separated and an in-batch repair technical framework. According to the method, transaction processing on a GPU end is expanded to a multi-version storage scheme, GPU resources are utilized to the maximum extent through separation of metadata and load data and an efficient merging access mechanism, and a low abortion rate is ensured while the concurrency degree during execution is improved by adopting an optimistic concurrency control scheme and an in-batch repair mechanism. And meanwhile, the overhead of multiple data transmission is reduced by using light garbage collection and data reuse.

The invention discloses an efficient database active transaction registration method and system, and the method comprises the steps: creating an independent active transaction registration chain table for each process, limiting the registration and logout operation of transactions in a local chain table, and avoiding the global lock contention; the method comprises the following steps: periodically acquiring active transaction information from a linked list of each process through an active transaction summarization process, and summarizing and managing by constructing an active transaction tree, so as to generate an active transaction snapshot; the recovery process judges the recovery condition of the data version by using the active transaction snapshot, and de-references the snapshot to release resources after the recovery operation is completed; according to the method, by adopting the lock-free design, the efficiency of transaction registration, logout and version recovery is remarkably improved, the resource utilization rate and the concurrency performance of the system are optimized, and the method has excellent expansibility and adaptability and is suitable for transaction management and optimization of the multi-version concurrency control database.

The present application provides a data query method and device, an electronic device, and a readable storage medium. The method includes: a first search engine determines the type of structured query language (SQL); if the SQL is associated with the first search engine, the first search engine parses the SQL and queries the data node for target data corresponding to the parsed result; if the SQL is associated with a second search engine, the first search engine generates a multi-version concurrency control hint; the first search engine forwards the SQL and the multi-version concurrency control hint to the second search engine; the second search engine obtains an active transaction ID based on a global transaction manager (GTM), and the second search engine forwards the active transaction ID and the multi-version concurrency control hint to the data node; the second search engine parses the SQL and queries the data node for target data corresponding to the parsed result. The present application solves the technical problem of lack of global consistency when data is stored in a distributed manner.

The present disclosure presents methods and architectures that allow non-deterministic concurrent executions that can potentially interleave with other executions and replays in a SMR system. The current disclosure further discloses architectures and methods that executes, validates (replay) then merges transactions without the need to first order the transactions therefore achieves higher throughput. Another aspect of the invention involves organizing SM state as a Multi-Version Concurrency Control (MVCC) database with all concurrent execution / replay generating operation logs on each resource. This disclosure additionally outlines methods for integrating client nodes with State Machine Replication (SMR) systems. This disclosure further provides improved Directed Acyclic Graph (DAG) based consensus protocols.

This invention discloses a multi-user real-time collaborative editing method based on virtual nodes and distributed control, leveraging the Cooper distributed control architecture. By introducing control nodes such as Brokers, Curators and Binders, it ensures precise control and efficient handling of collaborative instructions, maintaining data consistency and system responsiveness while significantly enhancing real-time performance, stability, and scalability. Through the integration of Multi-Version Concurrency Control (MVCC) and real-time file system monitoring, the method supports concurrent multi-user editing and conflict management of the same file, optimizing system performance. The design includes virtual Peer nodes that seamlessly connect front-end editors with back-end services, improving compatibility and adaptability. The linkage mechanism between Brokers and Emitters achieves fine-grained processing and efficient distribution of instructions, optimizing system performance in high-frequency interaction scenarios. This technical approach overcomes the limitations of existing collaborative editing systems and provides an innovative, efficient, and stable solution for multi-user real-time collaboration.

This invention proposes a multi-level optimization execution method and system for a smart contract virtual machine based on the Go language. By constructing a three-level collaborative optimization architecture, it significantly improves execution efficiency and resource utilization. The intermediate code optimization layer integrates automatic vectorization technology with a dynamic profile-guided optimization recompilation mechanism driven by production environment configuration, breaking through the performance bottleneck of the core algorithm. The memory management optimization layer expands the underlying memory pool of the Go language and introduces an application-layer automated pooling mechanism, effectively reducing memory pressure and connection overhead. The instruction scheduling optimization layer combines dynamic time slice adjustment for computationally intensive tasks at the single-core level with optimistic locking concurrent execution technology for multi-core multi-version concurrency control, achieving efficient task collaboration. Through static compilation optimization, dynamic resource adaptation, and a full-process collaborative mechanism, a dynamic balance between high performance and low latency is achieved in scenarios such as encrypted computing and multi-core concurrency, providing a high-performance and highly scalable execution solution for the Go language smart contract virtual machine.

In one aspect, data is received to be written in a data store (106) in a first format, wherein the first format is a multi-version concurrency control row format (206). The data is stored in the data store (106) in the first format and converted from the first format to a second format based on first conversion parameters, wherein the second format is a multi-version concurrency control column format (208). The data is stored in the data store (106) in the second format and converted from the second format to a third format based on second conversion parameters, wherein the third format is a column format (210). The data store stores non-overlapping data in the first format, the second format, and the third format. In another aspect, data is retrieved from the data store (106) by a node cluster corresponding to a type of query.