54 results about "Database transaction" patented technology

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.

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.

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.

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.

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.

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.

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.

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.

This invention relates to the field of big data processing technology, and provides a method for intelligent binding of WBS nodes based on a dual-source repayment condition pool and semantic scoring. The method includes: constructing a dual-source repayment condition pool, uniformly extracting heterogeneous data into standard repayment condition entities; semantically normalizing the node names and condition texts in the standard repayment condition entities, mapping them to preset standard semantic types; traversing the WBS node tree, and comprehensively scoring each candidate WBS node based on the WBS node name, stage name, condition keywords, and node order preference corresponding to the standard semantic type; determining the binding confidence and outputting the binding status based on the highest score and the difference between the highest and second-highest scores, triggering an alarm when multiple nodes have conflicting high scores; responding to manual rebinding commands, automatically releasing the binding status of the originally occupied node through database transactions, and setting the target node as the bound node. This invention can achieve highly accurate binding of repayment conditions and WBS nodes, ensuring consistency and traceability.

The application discloses a multi-type property maintenance work order automatic generation and management method and system, and the method comprises the following steps: triggering a timing task according to the execution time of a maintenance plan, and judging whether the maintenance plan is overdue; when the maintenance plan is not overdue, creating a work order record and writing the work order record into a business data table, and starting a work flow instance with a business primary key in the same database transaction; the work flow instance triggers an execution listener in a node flow process, updates a work order processing state, and executes corresponding business logic according to a node identifier; a timing job record is written in a user task node, a work order timeout mark is updated and a timeout alarm is sent when a timeout deadline arrives, so that the work order automatic generation, process linkage and timeout control are realized.

The embodiment of the application provides a commissioning and rollback method and system for a communication system configuration, comprising: loading a current effective configuration in a front-end workstation, generating an incremental snapshot in response to an input incremental change instruction; generating a virtual production configuration based on the incremental snapshot and the current effective configuration; generating and outputting a trajectory log based on the virtual production configuration and simulation input parameters; performing configuration mapping on the trajectory log to obtain configuration rule hit information; performing commissioning and pre-checking based on the configuration rule hit information, generating and outputting risk information; generating a commissioning passing instruction through the risk information, and submitting the incremental snapshot to a back-end; when detecting that abnormal information appears in a database transaction, performing a reverse patch to realize atomic rollback; and connecting each incremental change instruction and the reverse patch to a configuration version tree to preview the configuration of any historical node. The method realizes atomic submission and accurate rollback, and can quickly restore the system to an accurate state before the change.

The invention relates to a database operation method and device for function calculation, computer equipment, a computer readable storage medium and a computer program product. The method applied to any function computing node in a function computing cluster comprises the steps that a computing layer in a current function computing node receives a function computing request, wherein the function computing request comprises an object identifier and a function identifier; if the data of the object identifier is stored in the storage layer of the other function computing node, the computing layer forwards the function computing request to the other function computing node; if the data is stored in the storage layer of the current function calculation node, the calculation layer starts the database transaction, the function instance is executed based on the data of the object identifier, and when the function is executed, reading operation is performed on the distributed storage database provided by the storage layer through the database transaction, and data required by writing operation on the distributed storage database is cached; and after the function execution is finished, the database transaction is closed, the cached data is submitted to a storage layer for write operation, and the communication overhead is reduced.

Herein is database transaction throttling to compensate for excessive redo generation and excessive database replication lag. Each time interval in a sequence of contiguous time intervals is assigned to a distinct respective redo counter in a circular buffer. While executing database statements in a database transaction, some of the redo counters are adjusted to reflect a fluctuating amount of redo generated by the transaction. When the redo generation rate of the database transaction is detected as exceeding a threshold, execution of the database statements in the database transaction is paused.

The invention relates to a database transaction management method and device, equipment, a storage medium and a program product. The method comprises the steps that when it is detected that truncation operation needs to be conducted on a transaction submission log, a rollback file in a memory is traversed, and a target transaction identifier in the rollback file is found; the identifier value of the target transaction identifier is the minimum value of a to-be-recycled transaction identifier in the rollback file, and the transaction corresponding to the target transaction identifier is in a rollback state, a to-be-rollback state or a submitted state; the rollback file comprises a plurality of transaction identifiers, the state of each transaction and the information storage address of each transaction; the transaction identifier is coded by adopting 64 bits; and performing truncation operation on all transactions smaller than the target transaction identifier in the transaction submission log. By setting the rollback file in the memory to store the transaction information, the target transaction identifier can be quickly determined when the transaction submission log is cut off, and the transactions smaller than the target transaction identifier are directly judged to be visible, so that the performance fluctuation of the database is avoided.

This invention discloses a method, system, and storage medium for frequent itemset mining. It requires only a single scan of the transaction database, eliminating the need to sort frequent itemsets in descending order of their support counts or to reorder the items in the transaction database. Even after data is added to the database, there's no need to restart; instead, new transaction items are directly inserted into the existing pattern heap using the algorithm proposed in this invention, incrementally constructing a new pattern heap before rule mining. The invention includes: acquiring a database containing at least one transaction, where each transaction contains at least one data item; scanning the database and dynamically generating a database pattern heap based on the transaction's data items and a preset pattern heap; recursively pruning the heap nodes of the database pattern heap based on a preset minimum support to obtain a frequent pattern heap; and determining frequent itemsets based on the frequent pattern heap mining.

This invention provides a non-destructive synchronization method and system for test cases based on template instructions and atomic transactions, comprising: receiving a structured template file, wherein each data row in the file contains an operation instruction field and a unique identifier field; parsing the template to generate an instruction list; pre-querying the database based on the unique identifier field and constructing a memory hash map; initiating a database transaction; traversing the instruction list and routing and executing create, update, delete, or reorder operations according to the operation instruction type, wherein update operations locate records based on the hash map and perform optimistic locking version verification; committing or rolling back the transaction based on the execution results of all instructions; and generating a synchronization report containing execution results and conflict information. This invention enables incremental, precise, and non-destructive synchronization of test cases within a single atomic transaction, supports mixed operation intent expressions, and significantly improves synchronization efficiency, ensures data consistency, and provides intelligent conflict diagnosis through pre-built memory mapping and optimistic locking mechanisms.

In an example embodiment, a solution is provided for coordinating transactions across both relational databases and open format tables on object storage. This technology addresses the challenge of integrating open table formats, such as Delta and Iceberg, with relational databases like SAP HANA. These technical challenges include subtleties imposed by database transaction isolation, asynchronous parallelism, and dealing with instabilities. More specifically, transactions are broken down a transaction into smaller, independent sub-transactions. Each sub-transaction is executed independently. If a sub-transaction fails, compensating actions are performed to undo its effects. This approach ensures that the overall transaction is applied atomically.

This application discloses a method, apparatus, device, system, and medium for accessing distributed data nodes, belonging to the field of data processing. The method includes: determining the target data node accessed by the database operation statement based on a database operation statement transmitted by a client through an established front-end connection; obtaining an idle back-end connection from a preset connection pool as the target connection, the connection pool including idle back-end connections, the target connection undergoing check and synchronization processing to ensure normal use; sending the database operation statement to the target data node using the target connection; and, if the database operation statement has not initiated a database transaction or has already closed a database transaction, adding the target connection as an idle back-end connection to the connection pool. Embodiments of this application can reduce network resource waste.

This invention discloses an integrated method and system for the entire lifecycle processing of spot contracts in the industrial sector, relating to the field of industrial MES / ERP technology. This invention uses a single database stored procedure as a unified entry point to centrally realize all lifecycle operations of spot contracts, including creation, modification, addition / deletion of product batches, and cancellation. Batch data transmission is achieved through table-valued parameters, with contract hash values ​​serving as unique identifiers. This is combined with automatic contract number generation, pre-emptive centralized verification, and database transaction control. Furthermore, it uses standard SQL syntax to support cross-database compatibility (SQL Server, GaussDB, DMDB). This invention solves the problems of fragmented business logic, cumbersome operations, data chaos, and poor cross-platform adaptability in traditional spot contract management. It achieves fully automated and standardized processing of spot contracts, reducing system maintenance costs by over 80% and improving data processing efficiency by 90%. It is suitable for large-volume, high-frequency business scenarios in industrial spot trading and meets the needs of enterprises for domestic transformation. This invention has been fully implemented in actual industrial MES systems and can operate stably in real production environments for a long time, demonstrating mature engineering value and industrial promotion capabilities.

The application relates to a method for realizing API connection based on a self-defined domain event and a related device, which comprises the following steps: API interface information and condition rules for triggering API calling are preconfigured in a database; when a business service executes a business operation, an event is generated in a database transaction bearing the business operation and is stored in an event flow table; then, the event is read by a first background process, and matching is performed according to preset condition rules; if the matching is successful, a corresponding calling message is generated in a message flow table; finally, the message is read by a second background process to perform API calling, and messages failing in calling are reserved for subsequent retry. The application realizes dynamic configuration of API connection logic, significantly improves the flexibility of a business, and ensures the consistency and reliability of data synchronization through transaction guarantee and two-stage asynchronous processing.

The invention provides a hotel intelligent management method and system based on double-screen interaction, and relates to the technical field of intelligent management, and the method comprises the steps: collecting client identity information and order information, carrying out the identity verification through a multi-dimensional verification mode, and entering a subsequent process after the verification succeeds. According to order information, the system adopts a database transaction mechanism to screen out rooms which can be checked in, a candidate room pool is formed, and the candidate room pool is displayed on a client small screen and a foreground large screen in real time through a graphical interface; a client can select a room in a self-service mode through a small screen, the system initiates atomic transaction operation, the state of the selected room is updated to be checked-in, order information and the room are bound to generate a check-in record, and double-screen synchronous display is achieved. And after the customer checks out, the system automatically executes an accounting settlement process, checks and updates the order state to be the leaving state, automatically updates the corresponding room state to be cleaned, and synchronizes the state to a double-screen interface in real time, so that the automation, visualization and high efficiency of room state management are realized.

The invention discloses a full-increment integrated unbounded flow data capture method based on fragmentation, solves the problems of non-interruption capture of full-increment integrated data and automatic generation and reissuing of table metadata on a big data processing cluster, and belongs to the field of big data. Comprising the following steps of: sequentially obtaining a full-quantity fragment queue of a target table by a fragment separator, sending the full-quantity fragment queue to a reader, capturing full-quantity fragments, merging the full-quantity fragments into incremental fragments, and selecting a minimum value of a position line in the full-quantity fragments as an initial offset, the reader analyzes each database transaction log, starts to capture incremental fragments from the initial offset, and stores the incremental fragments into a target database; if capturing of the last full fragment of the current target table is completed and the position deviation between the initial offset and the main record log exceeds one file, full fragment capturing is stopped, increment capturing is preferentially executed, and otherwise, full fragment capturing is repeatedly executed until all the target tables are captured; according to the method, high-reliability, high-throughput and low-delay full-increment integrated real-time unbounded data stream capture is completed.

This invention discloses a method, system, device, and medium for managing multi-layer carriers in semiconductor back-end processes. The method includes: defining a data model containing a carrier type table and a carrier content mapping table; configuring station type parameters for processing stations based on the semiconductor process flow, including station type identifiers to distinguish between ordinary stations, wafer boat stations, and carrier replacement stations, and carrier replacement flags indicating carrier replacement needs; inputting the real-time carrier nesting relationship into the data model to generate a real-time data storage model; when a carrier arrives at a processing station, if it is determined that a carrier replacement is required, automatically querying the target carrier type for the next station, selecting an idle carrier from the available carrier pool to perform the replacement operation, updating the nesting relationship, and ensuring data consistency through database transactions. This invention solves the problems of low replacement efficiency and data consistency caused by insufficient nesting relationship management in multi-layer carriers in semiconductor back-end processes, improving the automation level and reliability of material flow.

This invention discloses an automatic payroll settlement method and system based on event sourcing and dynamic routing. The system includes an event sourcing repository, a settlement rule and routing configuration center, a settlement instruction atomic generator, and a hierarchical verifiable evidence processor. Within a single database transaction, it completes engineering quantity calculation, tax calculation, and fund routing rendering, generating a payment instruction package containing multi-stroke rotor instructions, digitally signing it, and writing it into the event stream. The evidence processor constructs a Merkle tree from the event hash, anchors the root hash and off-chain index to the blockchain, provides a path verification interface, and can perform compensation for payment failures. This invention, through event sourcing-driven idempotent atomic settlement, dynamic fund routing, and hierarchical verifiable evidence storage, achieves anti-duplication in payroll settlement, strong consistency between accounting and payment, immutable evidence chains, and low-cost verifiability, thereby improving fund security, reconciliation efficiency, and audit credibility.

The application discloses a five-level linkage penetration query method and system for sales execution data in an industrial MES, and relates to the technical field of industrial manufacturing execution system (MES) data query and analysis. The application builds a five-level linkage penetration architecture from macroscopic aggregation to microscopic physical material details, designs an automatic transmission mechanism for upper-level screening parameters, constructs a unified data accounting model with temporary tables as the pivot, realizes unique association of full-link data through contract hash values, and introduces database transaction control to ensure stable operation. The application solves the problems of scattered statistics, drilling difficulty, inefficient traceability and different caliber of traditional industrial enterprise sales execution data, realizes cross-module and multi-level full-link linkage penetration query, improves data traceability efficiency by more than 90%, unifies the accounting caliber of multiple modules, provides precise data support for fine management and efficient decision-making of enterprises, and is suitable for the sales execution data management scene of industrial enterprise ERP / MES systems. The application has been completely applied in actual industrial ERP systems, can run stably in real production environment for a long time, and has mature engineering value and industrialization popularization ability.

A method and related system for performing staggered synchronization across different database shards includes obtaining a database transaction request indicating updates to a first record and a second record during a first synchronization of the second record, the first synchronization separating a first unlocked period of the second record from a second unlocked period of the second record. The method further includes selecting an effective unlocked period in response to obtaining the database transaction request during the first synchronization, updating an update sequence of the second record to indicate that the database transaction caused by the database transaction request occurred during the effective unlocked period, and updating an update sequence of the first record to indicate that the database transaction occurred during the effective unlocked period.

The invention relates to the technical field of databases, and particularly discloses an intelligent endogenous database system and a data processing method. According to the system, an artificial intelligence calculation engine is determined to be a native component which is at the same level as a relational query engine and is deeply integrated into a database kernel, and a vectorization scheduler and a unified query optimization engine are created. The basic principle of the method is as follows: in response to an unstructured data write-in transaction, a vectorization scheduler automatically triggers an artificial intelligence calculation engine in a database transaction boundary, an AI model is scheduled to perform in-situ calculation and vectorization on data in a database, and a result and original data are stored in a unified storage management layer in an atomized association manner. According to the method, a safe closed loop of a data processing flow in a single database system process is realized, intrinsically safe data without ex-warehouse, cross-domain zero-copy in-situ high-performance calculation and intelligent optimization of mixed query are achieved, and the systematic defects of a traditional externally-hung architecture in safety, performance and complexity are overcome.