141 results about "Database transaction" patented technology

The invention provides a multi-platform informatization construction system and method based on a computer, and solves the problems that existing multi-platform data synchronization is not timely, formats are not compatible and the like. The system comprises a real-time data capture module, and a data change event is generated in real time through database transaction log monitoring; the intelligent routing decision module optimizes a transmission path in combination with rules and machine learning; the data conversion adaptation module realizes automatic adaptation of a format and an interface by utilizing dynamic template matching; the conflict detection and resolution module guarantees data consistency based on version control and priority judgment; the data synchronization execution module transmits data according to an optimized path, and the monitoring management module monitors the whole process in real time. The method comprises the steps of data capture, routing decision, format conversion, synchronous execution and monitoring feedback. According to the scheme, the data synchronization efficiency and accuracy are improved, the multi-platform integration operation and maintenance cost is reduced, and the method is suitable for multi-scene informatization construction of enterprises, government affairs and the like.

The invention provides a resource allocation method and device, electronic equipment, a storage medium and a program product, and relates to the technical field of computers, in particular to the field of cloud computing. The specific implementation scheme is as follows: acquiring a resource allocation request; matching the request with various types of resource pools updated in real time, and obtaining a matched resource pool set meeting at least one request item; capturing the residual resource quantity of each matching resource pool in the matching resource pool set at the current moment, and displaying a result and a resource pool priority template set; in response to selection of the resource pool priority template set, obtaining a target priority template, and in response to setting of a matched resource pool set, obtaining a target resource quantity set for at least one target resource pool; and according to the selection and setting result, starting the database transaction to complete the resource allocation process of the resource allocation request. Automatic resource allocation is realized by designing priorities, a large number of resources do not need to be reserved, the labor cost and the resource occupancy rate are reduced, and the allocation success rate and efficiency are improved.

The invention provides a replication method based on a consensus protocol. For each change operation performed by the leader server on the copy of the database, the leader server creates a copy log record and returns the result to the client. The leader does not wait for a consensus for the change operation from the follower. For submission, the leader creates a submission log record and waits for a consensus. Thus, the leader asynchronously performs database transactions, asynchronously performs replication of change operations, and synchronously performs replication of transaction submissions.

An example method may include receiving first configuration data associated with a network device, the first configuration data comprising a Yet Another Next Generation (YANG) payload; determining a first subset of the YANG payload that is associated with a first network configuration database; determining a first database transaction, wherein the first database transaction represents one or more database updates to the first network configuration database that is determined based on a first state of the network device and one or more configuration requirements represented by the first subset; discarding the first database transaction; determining second configuration data based on the first database transaction, the second configuration data comprising a command line representation (CLI) of the YANG payload; and providing the second configuration data to a system, the system configured to display the command line representation to a user.

The invention discloses a database risk analysis method and device, equipment, a storage medium and a product, and relates to the technical field of databases, and the database risk analysis method comprises the following steps: in response to a risk detection instruction, implanting a probe in a database key transaction operation, and obtaining context information of a database transaction; and dynamically analyzing the context information, and when database risks exist, analyzing and determining database abnormal risks. It can be understood that in response to the risk detection instruction, a probe is implanted in the database key transaction operation, the context information of the database transaction is obtained, and the database abnormal risk is determined by detecting the context information of the transaction full link and performing dynamic analysis, so that the database risk identification precision is improved.

A consensus protocol-based replication approach is provided. For each change operation performed by a leader server on a copy of the database, the leader server creates a replication log record and returns a result to the client. The leader does not wait for consensus for the change operation from the followers. For a commit, the leader creates a commit log record and waits for consensus. Thus, the leader executes database transactions asynchronously, performs replication of change operations asynchronously, and performs replication of transaction commits synchronously.

The invention discloses a database transaction load sequencing method based on a conflict relationship, which is characterized in that non-conflict operations are grouped into operation batches in parallel by analyzing data access conflicts among the operations based on an original execution log of a database transaction load; the original execution sequence of conflict operations is deduced according to operation types, version dependence and lock competition conditions, then operation batches are sorted according to the sequence, an operation batch sequence is constructed, and therefore it is ensured that the execution result of the sequence is equivalent to the original execution result of a transaction load. Compared with the prior art, the method has the advantages that a kernel of a database system does not need to be intruded, the analysis speed is linearly expanded along with the scale of the original execution log, and good expandability and application prospects are achieved.

Methods and systems for recovering databases and other applications with reduced downtime using recoverable chains are described. When protecting or backing up a database, an integrated data management and storage system may capture snapshots of the database at a snapshot frequency (e.g., at 15 minute intervals) and acquire database transaction logs that include data changes of the database at a frequency that is greater than the snapshot frequency. The integrated data management and storage system may generate a particular point in time version of the database by identifying a recoverable chain that comprises a combination of one or more database snapshots including the snapshot closest to the recovery point and one or more database transaction logs.

Aspects of the present disclosure relate to recovery of a target database system. The method comprises receiving multiple batches of database transactions to form the target database system. The method further comprises generating a single recovery bookmark before beginning processing of a current batch, wherein the single recover bookmark comprises: an earliest open entry for a previous batch, a latest commit entry for the previous batch, an earliest open entry for the current batch, a latest commit entry for the current batch, a transactional identifier, and list of tables to be processed; performing the sequence of database transactions; replacing the list of tables from the single recovery bookmark with a flag value upon completion; detecting a fault condition during the performance of the sequence of database transactions; recovering the target database system using the single recovery bookmark; and resuming the sequence of database transactions.

The invention discloses a storage and management method suitable for automatic scoring data of the Internet of Things, and the method comprises the steps: constructing a three-layer heterogeneous storage collaborative architecture fusing a relational database, a time sequence database and a graph database, and achieving the dynamic distribution and collaborative updating of data through an intelligent routing and cross-database transaction consistency mechanism; establishing a self-adaptive index system based on reinforcement learning, dynamically optimizing a multi-class index strategy and supporting low-efficiency index reconstruction; a storage strategy based on data value dynamic adjustment and AI-driven data quality closed-loop management are implemented, and rapid positioning and repairing of problem data are achieved; and elastic scheduling of storage resources is realized by utilizing containerization and Kubernetes technologies. According to the method, the comprehensive performance of the automatic scoring data of the Internet of Things in the aspects of storage efficiency, query performance, consistency, reliability and cost control is remarkably improved, and the method has important practicability and popularization value.

The invention discloses a method for optimizing an incremental migration mode of a database synchronization tool, which comprises the following steps of: acquiring a batch of data change events from a message queue, and grouping according to primary keys of the events; sequencing events in each primary key group according to a time sequence rule, simulating a data state change mode, and performing multiple operations on the same record to obtain a single target operation of a final state; all single target operations are distributed to different data fragments according to the hash values of the primary keys, so that all changes of the same primary key are processed in the same fragment; starting a thread pool, performing parallel processing on each data fragment by an independent database transaction, and writing the data into a target database; according to the method, through a strategy of first merging and second parallelization, redundant database I / O operation is effectively eliminated, multi-core CPU resources are utilized, on the premise of ensuring data consistency, the overall throughput of data synchronization and the utilization rate of system resources are improved, and the stability and efficiency of the synchronization process are enhanced.

A system for managing data availability for database transactions is disclosed. The system is programmed to receive source data and extract a plurality of events from the source data. The system is programmed to create a halt record corresponding to each event of the plurality of events. The system is programmed to resolve conflicts among one or more halt records. The system is programmed to receive a request for a specific database transaction related to a specific database item from a client device. The system is programmed to determine whether any halt record is in effect for the specific database item. The system is programmed to perform the specific database transaction in response to determining no halt record is in effect. The system is programmed to transmit a result of the specific database transaction in response to the request to the client device.

A system for scaling parallelism in sweeping stale data associated with multi-version data management is disclosed. The system is programmed to manage a targeted sweep of stale data stored on distributed storage associated with a set of computing nodes, where the stale data includes metadata for database transactions. The system is programmed to dynamically determine, on a computing node, how many threads to simultaneously perform deletion for the targeted sweep based on historical performance of the computing nodes, historical performance of the distributed storage associated with the computing nodes, or other factors. The system is programmed to then cause a certain number of threads to run on the computing node, where each thread identifies and deletes specific metadata for data transactions within the scope of the targeted sweep.

The invention discloses a database transaction playback system and method. The system comprises a host and a standby; when the system receives a copy starting instruction, starting a receiving thread, an event thread, an application thread and a working thread group; the host starts a log dump thread and sends a logic log to the standby; the receiving thread receives the logic log and copies the logic log to a public memory and a relay log file; the event thread analyzes the data from the public memory or the relay log file to generate a playback transaction, and stores the playback transaction into the annular transaction array; the application thread takes out the playback transactions from the annular transaction array, judges whether all the transactions to be processed are pure insertion operations or not, determines whether to perform parallel dependency judgment or not according to a judgment result, and then issues the playback transactions to an idle working thread; the idle working threads are used to execute playback transactions. By utilizing the system, the common memory is increased, the disk reading frequency is reduced, the original coordination thread is divided into two threads, the lock competition is reduced, and the efficiency is improved.

This invention discloses a low-latency materialized view method, comprising the following steps: S1, after the application server initiates a database transaction to the source database and executes data operation instructions, before the database transaction is committed, a state intent event is constructed. This relates to the field of database technology. This application uses heavy data change information as the state intent event and a lightweight commit confirmation signal as the commit state event. By separating the state intent event and the commit state event and processing them asynchronously in parallel, the update latency of the materialized view no longer depends on the entire CDC link, but only on the transmission latency of the commit confirmation signal. This reduces transmission latency, achieves lower-latency data synchronization, and alleviates the high latency problem inherent in traditional materialized view updates that rely on change data capture technology.

This invention discloses a database transaction request processing method, related devices, and storage media. The method includes: receiving an update transaction request for a first data row in the database; if a first hot row update wait queue for the first data row exists in the storage engine, writing the update transaction request into the first hot row update wait queue; if no first hot row update wait queue exists in the storage engine, determining the queue length of a first row lock wait queue corresponding to the first data row in the storage engine; when the queue length of the first row lock wait queue exceeds a preset length threshold, creating a corresponding first hot row update wait queue for the first data row in the storage engine, and writing the update transaction request into the first hot row update wait queue; and, in response to a preset trigger signal, adding the update transaction request in the first hot row update wait queue to the first row lock wait queue. This invention improves the transaction throughput of the database system under high concurrency conditions.

The invention discloses a rack-mounted server cabinet U-bit visual management method and system, and belongs to the technical field of communication equipment, and the method comprises the following steps: S1, based on machine room physical parameters and cabinet attributes, carrying out the structural data modeling through building a one-to-many correlation index of a machine room and a cabinet, and carrying out the one-to-many correlation index of the machine room and the cabinet; generating a visual cabinet U-bit grid base map corresponding to the physical space by adopting a vertical grid stacking algorithm; and S2, based on the cabinet U bit grid base map, user interaction operation is converted into a target U bit identifier through coordinate mapping, multi-layer verification and U bit occupation conflict detection are carried out on equipment parameters, and an association relationship between equipment and U bits is established through database transactions. According to the method, the digital grid base map accurately corresponding to the physical space is constructed, and core technologies such as coordinate mapping, multi-layer verification and database transaction operation are applied, so that the problems that traditional cabinet U bit management depends on manual planning, information abstraction is not visual and the like are solved.

Recovery of a target database system, comprising forming the target database system 500 and receiving multiple batches of database transactions 502. The following are performed repeatedly: generating

Techniques for supervised access to the error logs stored on a protected database to perform test failure remediation with respect to the failures associated with prior executions of test scripts. In some cases, when the execution of a test script is aborted because a data value provided by the test script fails to match a corresponding data record stored on a target database, a corresponding error log may be created. To remediate the noted test failure, an example system may select a test correction template that is associated with a corresponding test correction script and provide a corrected data value as a parameter of the selected template. Subsequently, the system may perform operations associated with a database transaction that is configured to: (i) re-execute the operations associated with the previously aborted test script, and (ii) upon successful re-execution, remove the corresponding error log.

A method comprises analyzing metrics corresponding to operation of a first node in a first data center using at least one machine learning algorithm, predicting, based at least in part on the analyzing of the metrics, whether the operation of the first node is anomalous, designating the first node as being in an anomalous state responsive to predicting that the operation of the first node is anomalous, and causing routing of one or more database transactions to a second node in a second data center instead of the first node in response to the anomalous state designation.

The invention relates to a method and a related device for realizing API (Application Program Interface) docking based on a custom domain event. The method comprises the following steps of: pre-configuring API interface information and condition rules for triggering API calling in a database; when a business service executes a business operation, generating an event in a database transaction bearing the business operation, and storing the event in an event flow table; then, reading the event by a first background process, performing matching according to a preset condition rule, and if the matching is successful, generating a corresponding to-be-called message in a message flow table; and finally, reading the message by the second background process to execute API calling, and retaining the message which fails to call for subsequent retry. According to the method, the dynamic configuration of the API docking logic is realized, the service flexibility is remarkably improved, and meanwhile, the consistency and reliability of data synchronization are ensured through transaction guarantee and two-stage asynchronous processing.

A method and system for data synchronization between a standby site and a primary site in a distributed database system is provided. A first primary site included in a primary site group of the distributed database system generates a commit action redo log message for a commit action performed by the first primary site on a first database transaction, the commit action redo log message including a transaction ID of the first database transaction and a transaction order indicator representing an order of database transactions in a group of database transactions executed on one or more primary sites in the primary site group. The first primary site sends the commit action redo log message to a corresponding first standby site backing up the first primary site.

The invention discloses a database transaction implementation method, system and equipment based on an array index and a storage medium, and the method comprises the steps: writing actual transaction data into an array index and a value log in advance through the quick access characteristic of the array index and the characteristic of converting all data operations into the value log by a value log module; the TRXID and the ARRAYID are cached in the transaction cache, so that the database transaction is realized; from the perspective that a user reads data with transactions, as actual data are written into the array index module and the value log module in advance, only relevant logic of the data needs to be acquired from the storage module, and meanwhile, the visibility of the transactions is judged, so that the logic of querying the data with the transactions is simplified; from the perspective of the transaction cache size, only the TRXID and the ARRAYID need to be stored in the memory, and a large amount of memory occupation is reduced.

A method and related system may analyze metadata associated with a first set of transactions to determine whether to perform a second set of transactions. The method and related system may include determining a data category based on first device-provided data of a first database transaction indicating a first record associated with a second record, and may further include obtaining, based on whether the data category satisfies a first set of criteria, an identifier and an amount based on image data using a prediction model. The method may further include querying a database based on the identifier to obtain an indication that the identifier is mapped to an object category, validating the amount based on a result indicating whether the object category satisfies a second set of criteria, and causing a second transaction that changes fields of the first and second records.

Disclosed is an approach to autonomously abort a lower priority transaction that is blocking a higher priority transaction, where the lower priority transaction is holding a lock on a resource for which there is contention. Some approaches also provide an efficient way to implement identification of a blocker transaction, which drastically reduces the response time to abort the blocker transaction.

Techniques are disclosed relating to providing and using probabilistic data structures to at least reduce requests between database nodes. In various embodiments, a first database node processes a database transaction that involves writing a set of database records to an in-memory cache of the first database node. As part of processing the database transaction, the first database node may insert, in a set of probabilistic data structures, a set of database keys that correspond to the set of database records. The first database node may send, to a second database node, the set of probabilistic data structures to enable the second database node to determine whether to request, from the first database node, a database record associated with a database key.

A computer implemented method for identifying problematic database operations includes identifying database transactions which exhibit performance issues and corresponding parse trees, transforming corresponding parse trees to create historical descriptor arrays, detecting a new database transaction, generating a new descriptor array corresponding to the new database transaction, analyzing the new descriptor array and the historical descriptor arrays to determine whether the new descriptor array indicates a performance issue corresponding to the new database transaction, and responsive to determining that the new descriptor array indicates a performance issue, adding the new database transaction to a resource controlled pool. The method may additionally comprise encoding one or more data items associated with the database. The method may additionally include sending the new database transaction to a virtual database simulation to simulate the new database transaction's performance, and providing the simulation results to a feedback database system.

The invention is applicable to the technical field of data processing, and provides a data access method based on a Django framework, which comprises the following steps of: analyzing a subclass statement to obtain a table name, a table structure, a primary key and a partition key of a partition table to be established; determining the partition type of the partition table to be established by judging the data type of the partition key; expanding the Django framework on the basis of migrating of the Django framework and the partition type, and generating a partition table building statement on the basis of the expanded Django framework; executing the partition table building statement through a database transaction, and building the partition table; and generating a data management statement based on the ORM of the Django framework, wherein the data management statement is used for adding, updating, filtering or deleting the data records in the partition table. According to the method, a set of complete ORM does not need to be developed for partition table establishment, the development and maintenance cost is reduced, meanwhile, database operation is simplified, the development efficiency is improved, and in addition, the method has the single-table 10 billion-level large-scale data access capacity.

The application provides a financial data correlation network dynamic construction method and system for double-library collaborative processing, solves the problems of low efficiency of multi-hop traversal query of a relational database in financial correlation query, high coupling degree of an independent graph database and a system in related technologies, and difficulty in data synchronization. The application obtains a target entity identifier, a relationship type and a traversal depth by analyzing a query request; performs correlation topology retrieval in a graph database to obtain a correlation entity identifier set and a path topology; performs attribute retrieval in a relational database by taking the correlation entity identifier set as a batch query condition to obtain complete attribute data of an entity; and fuses the path topology and the complete attribute data of the entity to output a structured result. The application realizes the collaboration of transaction capability of the relational database and efficient traversal capability of the graph database by decoupling topology traversal and attribute retrieval, and improves the dynamic construction and query efficiency of the financial correlation network.