130 results about "Commit" patented technology

Systems and methods for securing transactions in accordance with various embodiments of the invention are illustrated. One embodiment includes a method for confirming token ownership rights. The method generates a pre-image value using a random number generator. The method generates an action request that corresponds to an action performed cryptographic token(s). The method derives a commit output based on the pre-image value. The method generates a commit request that obfuscates the action request based on the commit output and submits the commit request to an immutable ledger. The method receives a confirmation when the commit request is approved by the ledger. When a reveal request referencing the commit output is published, the method receives a confirmation of at least one of: the reveal request being published, that the reveal request comprises a reference to the commit output, or that the action request has been approved.

A computer-security architecture removes activation authority from client-facing purchase flows. A server records a digital entitlement in an INACTIVE state and issues a presentation artifact. A verification service accepts messages only from trusted origins carrying freshness-bounded evidence and validates using (i) stateless keyed recomputation over a time-windowed payload, (ii) confirmation that token-rail authorization data maps to a registered association within a policy freshness bound, or (iii) a server-maintained session. Activation occurs only on an authoritative commit path that enforces no activation without a durable audit record and effective-once behavior: either a single ACID transaction that conditionally updates state and writes an insert-only audit in the same commit, or an append-only activation ledger with idempotent materialization. Access controls deny issuance-facing code permission to set ACTIVE. Expiration is timer-free via batch or TTL evaluation.

The invention particularly relates to a distributed time series data cross-node atomic writing and transaction management method. According to the distributed time series data cross-node atomic writing and transaction management method, a coordination node receives a time series writing request, generates a unique TID and issues the unique TID; the storage node writes the data into a pre-write log WAL, marks the data as pending, and establishes mapping between the TID and log entries; the cooperative node sends a pre-submission instruction, and the node responds after being ready; and if verification is passed, broadcasting submission is carried out, a formal storage update version is written, otherwise, rollback is carried out, operation is cancelled according to WAL, and finally associated logs and states are cleared. According to the distributed time series data cross-node atomic write-in and transaction management method, end-to-end atomicity, consistency, low delay and rapid recovery of cross-node time series data write-in are achieved, a write-in path only needs one-time WAL write-in, synchronous blocking is avoided, and the concurrent throughput performance is remarkably improved; and the scheme does not invade an upper-layer application interface, and can be reused in any distributed storage system supporting the WAL.

The present subject matter discloses techniques to efficiently update a resource. The resource is updated in response to changes in an operational status indicator associated with the resource. A first signal is received in response to change in the operational status indicator. Based on the operational status indicator, it is ascertained whether to trigger generation of a virtual instance of a modification enabling framework for generating a data file. Further, a second signal is received in response to subsequent change in the operational status indicator. Parsing of at least one of an executable content and a commit message from the data file is then triggered to generate an updated specification that provides an updated overview for the resource. Further, a resource updation signal is generated to associate the updated specification with the resource.

The invention discloses a construction method and device of an incremental upgrade patch, electronic equipment and a storage medium, and relates to the technical field of computers, a file list and a change type are extracted from a code submission record, difference comparison is performed on files of an original version and a target version based on the information to generate code difference data, and the code difference data are sent to a server; therefore, the problem that the upgrade package contains a large number of redundant codes or key change contents are omitted and the upgrade accuracy and reliability are affected due to the fact that only a file name or a directory structure is used as a change judgment basis in an existing incremental upgrade method can be solved; the technical effects of improving the accuracy and reliability of incremental upgrading and reducing upgrading package redundancy are achieved.

The invention discloses a database replication method and device, equipment and a storage medium, and relates to the field of distributed systems.The method comprises the steps that a database write-in request of a target database is obtained through a client API, nested key values are generated based on the database write-in request, and all the nested key values are combined to determine a target transaction; determining a main node and auxiliary nodes based on a distributed consistency algorithm, packaging a target transaction as an initial log entry by using the main node, synchronizing the initial log entry to the auxiliary nodes, and obtaining synchronization confirmation of each auxiliary node; wherein the synchronization confirmation is information fed back after the secondary node completes synchronization of the initial log entry; and when the number of the auxiliary nodes feeding back the synchronization confirmation is greater than a preset threshold value, submitting and marking the initial log entry to obtain a marked log entry, executing a database write-in operation in the marked log entry by using a state machine, updating a corresponding target database, and returning an operation execution result to the user side. And the consistency between the data copies is ensured.

A server-side restore technique enables restoring of files / folders of a distributed share directly on a file server executing on a node by a file server administrator using self-service restore (SSR) snapshots in accordance with an atomic 2-phase restore-commit transaction. The technique involves share-level restore wherein the entire share state transitions to a previous state of a snapshot, i.e., the granularity of the restore is at the share level (not the file level) for the technique (whereas file level restore granularity is typically used for the client-side restore). The technique is directed to server-side share level restore that allows an “undo” (i.e., rollback) of a previous restore operation into a live snapshot that has become corrupted by a subsequent rollback to a last known good (LKG) snapshot that is uncorrupted. An administration interface may be used to trigger the server-side restore technique for the distributed share.

In some implementations, a computing device determines that project code in a development system references an older version of a component in a third-party library, determines that the older version of the component has a vulnerability, determines that a newer version of the component in the third-party library addresses the vulnerability, determines code changes associated with the fix commit, determines a subset of the code changes associated with the fix commit that addresses the vulnerability, creates a patch based on the subset of the code changes associated with the fix commit, applies the patch to the older version of the component to create a patched component, validates the patch, and based on successfully validating the patch, builds the patched component and uploads the patched component and information associated with the patch to a registry to enable a software developer to download the patched component.

In some implementations, a fault diagnosis system may track information associated with a first execution of a code pipeline to deploy an updated version of software associated with the code pipeline. The fault diagnosis system may receive an indication of a failure in a second execution of the code pipeline, wherein the second execution of the code pipeline is triggered by a commit of source code to a source code repository. The fault diagnosis system may determine whether the updated version of the software associated with the code pipeline or the source code committed to the source code repository is a cause of the failure in the second execution of the code pipeline. The fault diagnosis system may send a request to plan code development to resolve the cause of the failure in the second execution of the code pipeline.

Method, apparatus and system for assigning a commit sequence number (CSN) to a WRITE transaction in a network having nodes and a global time server. The CSN is defined by a timestamp of the WRITE transaction and an error bound of the timestamp. The WRITE transaction is committed after the timestamp is issued and an amount of time equal to the error bound plus a time adjust value has passed. The time adjust value is based on round-trip times between the plurality of nodes and the global time server. The time adjust value may be the longest expected round-trip time. By waiting for an amount of time equal to the error bound plus the time adjust value, any READ transaction occurring after the WRITE transaction may receive a READ timestamp without any delay, provided the READ timestamp error bound is less than or equal to the time adjust value.

A method for detecting vulnerability fixes in software code is disclosed. A source code file containing source code is obtained. The source code file may, for example, be one of the files of a source code commit. The code changes associated with the file are determined, the code changes indicating differences between a previous version and a current version of the source code. Based on the code changes, a first code representation of the previous version of the source code and a second code representation of the current version of the source code are determined. A first embedding of the first code representation and a second embedding of the second code representation are obtained. By computing a distance between the first and second embeddings, a file-level code change representation for the source code is determined, and the source code file is classified based on the file-level code change representation.

Various methods, apparatuses / systems, and media for detecting fake software tests are disclosed. A processor detects changes in a code against a commit timeline and stores historical record of code change differences over time onto a database. An API call is made to obtain from the database, for only the changed files in a given pull request, a list of the change differences which comes as a structured object. The processor converts the structured object into a single string value containing all of the change differences; and searches the string for a set of disallowed commands for checking for assertions in the given pull request which is attempting only to change code with a fake test that always passes the code in connection with testing the application. When such a command is found, comments back to the given pull request indicating that the given pull request contains the fake test.

As described herein, a system, method, and computer program are provided for enhanced two-phase commit protocol with participant interdependencies. In use, a two-phase commit protocol for a distributed transaction involving multiple participants is initiated. A prepare request from a coordinator is received at a first participant. A confirmation message indicating completion of a preparation stage is sent from the first participant to other participants. The confirmation message from the first participant is received at a second participant. In response to receiving the confirmation message, transaction-related data is retrieved by the second participant from the first participant using a transaction identifier. A preparation stage is completed by the second participant using the retrieved transaction-related data. A vote indicating readiness to commit the transaction is sent from the second participant to the coordinator.

The application relates to a transaction submission control method and system. The method comprises the following steps: based on a transaction request sent by a client being received, freezing a write set of a transaction corresponding to the transaction request; writing a transaction log record of the transaction request into a prewrite log, including all modification records in the transaction corresponding to the transaction request and a submission mark record; performing a persistence operation on the prewrite log by a persistence module, and returning a persistence completion information and a corresponding log location LSN to a submission point control module after a preset persistence condition is met, the persistence module and the submission point control module being isolated from each other; marking the transaction corresponding to the transaction request as reaching a persistent submission point by the submission point control module, and writing the mark into the prewrite log to form a recoverable submission point record; and returning a transaction submission success response to the client only after the mark representing the persistent submission point is written into the prewrite log. The normalization of transaction submission semantics is realized.

This invention relates to the field of vector instruction processing technology, specifically to a method and apparatus for processing vector memory access instructions. It includes an instruction issuance step, an address authentication step, whereby if all elements pass authentication, the vector processor sends a commit permission instruction to the scalar pipeline; if any element fails authentication, address authentication is immediately stopped, the location information of the failed element is recorded in an exception location register, and an exception signal is sent to the scalar pipeline, followed by a vector execution step. This invention avoids the blocking problem caused by vector memory access instructions occupying the pipeline for a long time, significantly improves the utilization rate of the scalar pipeline, effectively hides authentication latency, and allows for rapid instruction commit after all elements pass authentication, with the remaining elements then executed without obstruction. Overall memory access latency is significantly reduced, authentication throughput is improved, and the release speed of the scalar pipeline is accelerated.

Techniques for processing "Sessionless" transactions are provided. In one technique, a commit transaction instruction (that includes a transaction identifier) is received from a requesting entity at a first instance of a database server. In response a prepare message is transmitted to a second instance of the database server. A response that indicates that the second instance successfully performed an action in response to the prepare message is received from the second instance based on the prepare message. After the response is received, a transaction that is identified by the transaction identifier is committed. A response, to the commit transaction instruction, that indicates that the transaction is committed is transmitted to the requesting entity. Other techniques include piggybacking transaction instructions with database operation instructions and allowing different database server instances to perform work for a single transaction.

The application discloses a kind of distributed reservation systems and methods for multi-resource cooperation, comprising: transaction manager, at least two resource managers, lock manager, transaction log module and workflow controller;Transaction manager coordinates each resource manager through two-phase commit 2PC protocol, realizes the atomicity execution of cross-node shadow and summary table update;Lock manager adopts read-write lock separation mechanism to resolve concurrent conflict, and handles deadlock problem through timeout detection and active unlocking strategy;Transaction log module is based on prewrite log mechanism Complete record shadow and summary table linkage operation details, provide reliable support for fault recovery and transaction rollback;Workflow controller encapsulates distributed call details, realizes service survival real-time detection and automatic reconnection function.The application has high expansibility, strong consistency, high concurrent adaptation capability and perfect exception fault-tolerant mechanism, and can be widely applied to travel service scene of multi-node deployment.

The invention discloses a duplication data deletion metadata management method based on a persistent memory. The method comprises the following steps: managing a global fingerprint table and a logic address to a fingerprint mapping cache in a DRAM (Dynamic Random Access Memory), and managing an additional redo log and a global mapping table in the persistent memory. The write-in path firstly writes metadata update into the DRAM and forms a transaction record, the transaction record is sequentially added to a persistent memory log in a group submission mode, persistence is aligned according to the read-write granularity of the persistent memory, and random write and lock competition is reduced; in the checkpoint stage, an aggregation strategy is dynamically selected according to the redundancy rate and the coverage write proportion obtained through online load detection, and therefore metadata write amplification is remarkably reduced on the premise that collapse consistency is guaranteed. Meanwhile, three self-adaptive deduplication modes are provided, fingerprint management is bypassed in the low redundancy stage, redundancy is sampled and estimated in the medium redundancy stage, and full deduplication is started in the high redundancy stage, so that the metadata management cost is stably reduced under different loads, and the system throughput is improved.

A system and method may create and manage a code repository structure and related files for a ML system such as a NN by executing code to create a version control management platform template commit including a pipeline folder comprising deploy files; a configuration folder comprising key-value pairs describing variables used as input to the neural network; a notebooks folder; a steps folder including ML or NN code; a tests folder comprising test scripts; and a utils folder; and executing code to create a tag associated with a pull request and alter version control management platform data such that the tag is displayed in conjunction with data describing the branch associated with the pull request. Executing code to create a tag may include searching a commit history for a unique commit number associated with a pull request, and based on this search creating a tag.

Systems and methods enforce non-bypassable, fail-closed permit-before-commit control of external-effect requests at an effect boundary between an execution substrate and one or more external interfaces. An interceptor captures each request, deterministically canonicalizes it, computes an action digest, and obtains a machine-verifiable permit receipt bound to a policy digest and epoch identifier with a time-bounded validity. Prior to commitment, the interceptor verifies receipt authenticity, authorization by digest match and / or cryptographic commitment verification, epoch-compatibility, and revocation status using signed revocation data and / or transparency-log proofs subject to policy-defined recency, including in intermittently connected environments, and may enforce scope and permit-provenance constraints. If required verification evidence is missing, stale, conflicting, or indeterminate, the external effect is denied. Optional embodiments use trusted execution boundaries, capability tokens for dual enforcement, and machine-verifiable decision, audit, and denial receipts.

The application provides a globally serializable multi-database transaction control method and system, comprising the following steps: an application service registers multi-database transaction processing logic to a shim layer; a multi-database transaction request initiated by a client is received, and the shim layer intercepts and starts a global transaction of the multi-database transaction; the shim layer executes a sub-transaction request of the multi-database transaction according to the multi-database transaction processing logic; the global transaction is submitted to a two-phase commit coordinator, and an execution result of the multi-database transaction request is returned to the client. The application provides atomicity, durability and global serializability guarantee for the multi-database transaction; based on the shim layer, the concurrent control of the existing database system is reused, and the application can be seamlessly integrated into the existing application; the transaction coordination overhead is low, and the application is suitable for a high concurrency environment; the distributed transaction control has good ACID characteristics; the application does not depend on a specific service implementation platform; the application has low invasiveness, and the transaction control does not affect the writing of normal business code.

The application discloses a kind of blockchain-based smart contract asynchronous execution method, system, equipment and medium, mainly related to smart contract asynchronous execution technical field, to solve the problem of slow efficiency of existing smart contract execution. It includes: generating Pre-Prepare message, sending to all nodes;When any node receives external Pre-Prepare message, the legality verification and correctness verification of external Pre-Prepare message are carried out, to be cached to local after the verification result is legal and correct, and Prepare message is sent to all nodes;When any node receives external Prepare message, the legality verification of external Prepare message is carried out, to obtain the verification result after verification is legal, to send Commit message to all nodes after the verification result meets preset rule;After any node is verified legal and correct, the Pre-Prepare message corresponding to external Prepare message in local cache is read, and the block data in the corresponding Pre-Prepare message is put into the waiting execution queue.

A method for defragmentation management, the method includes (a) moving, by a defragmentation process related to a set of database entries, content of a current subset of the set to a next subset of the set; (b) marking the current subset as being moved and linking the current subset to a location of the next subset; (c) receiving a user transaction write request for writing user data related to the current subset, following the moving; (d) writing the user data to the current subset and to the next subset, before the current subset is deleted; and (e) deleting the current subset when a start time of an oldest transaction follows a time of commit of the defragmentation process.

This invention provides a distributed transaction processing method for BOM data in a PLM system, belonging to the technical field of PLM systems. When initiating a BOM data modification transaction, this invention sends a preparation request to participating nodes and performs field-level lock acquisition. A majority vote determines whether the transaction should be committed or rolled back. Transaction logs are batch-aggregated into group commit log blocks according to time windows and copied to persistent memory via RDMA. A closure table is established for the BOM tree structure to store ancestor-descendant relationships. An artificial intelligence model is used to monitor node response latency and log write rate to dynamically adjust parameters. When a network partition is detected, nodes holding a majority lease continue processing the transaction. After partition recovery, data merging is performed using version vector conflict detection and a compensation transaction mode. This solves the problem of data consistency being difficult to guarantee due to network partitions when processing BOM data modification transactions in a distributed PLM system.

Embodiments of the present application provide a consistent data writing method and system, electronic equipment and storage medium, which are applied to a connector of a data source or a connector of a destination. The connector of the data source is used to write data from the data source to Kafka, and the connector of the destination is used to write data from Kafka to the destination. First, it is determined whether the connector has transaction capability. If the connector has transaction capability, the data writing operation and the offset writing operation are submitted as a same transaction through the connector, so that it is determined that the transaction is successfully executed after the data writing operation and the offset writing operation are both completed. If the connector does not have transaction capability, it is determined that the data writing is completed after the data writing operation and the offset writing operation are both executed through the connector by using a two-phase commit protocol. By determining whether the connector has transaction capability and taking different measures, the consistency of data before and after data writing is ensured.

A method for a transactional commit in a storage unit is provided. The method includes receiving a logical record from a storage node into a transaction engine of a storage unit of the storage node and writing the logical record into a data structure of the transaction engine. The method includes writing, to a command queue of the transaction engine, an indication to perform an atomic update using the logical record and transferring each portion of the logical record from the data structure of the transaction engine to non-persistent memory of the storage unit as a committed transaction. A storage unit for a storage system is also provided.

Systems, methods, and computer-readable storage media are described for processing data change requests. In one exemplary embodiment, a computer-implemented method receives one or more requests in a software production environment for one or more data changes to data from a requestor. The method executes the request(s) in a rollback mode. The method generates a snapshot of the executed request(s). The method also transmits the snapshot to an approver. In response to an approval of the snapshot from the approver, the method also executes the request(s) in a commit mode.

Disclosed herein are system, method, and computer program product embodiments for implementing database queries using a major commit time stamp (CTS). An embodiment operates by receiving a data query indicating a predetermined delay from a user equipment (UE) and retrieving a major CTS from a memory. The data query corresponds to data in the memory. The major CTS indicates an age of the data. The embodiment determines that the major CTS is within the predetermined delay. In response to determining that the major CTS is within the predetermined delay, the embodiment transmits the data corresponding to the major CTS to the UE.

This specification provides a database management system that simultaneously supports single-machine and distributed tenants, and offers adaptive data processing capabilities. For single-machine tenants, at least one worker thread located on the same database node can generate execution plans for SQL statements and submit the corresponding pending transactions via group commit. Data processing is then performed based on these pending transactions through an I / O interface that supports single-machine parallel processing. For distributed tenants, multiple worker threads located on different database nodes can generate pending transactions for SQL statements and submit them via distributed transactions. Data processing is then performed based on these pending transactions through an I / O interface that supports distributed processing. Through this approach, tenants in a distributed database can adaptively select between single-machine and distributed modes to use the database, thereby improving database efficiency.

The invention discloses a visibility judgment method and device, equipment, a medium and a product, and the method comprises the steps: initiating an asynchronous task through an asynchronous task thread, and requesting a metadata node for a global submission serial number snapshot of a first transaction; after the global submission sequence number snapshot is obtained, the global submission sequence number snapshot is stored in node registration information; performing visibility judgment through the expired submission sequence number snapshot of the first transaction and the target submission sequence number of the second transaction to obtain a preliminary result about whether the second transaction is visible relative to the first transaction; under the condition that the preliminary result indicates that the second transaction is invisible relative to the first transaction, acquiring a global submission serial number snapshot from the node registration information; and performing visibility judgment based on the global submission sequence number snapshot and the target submission sequence number to obtain a target result about whether the second transaction is visible relative to the first transaction. According to the technical scheme, the cost of interaction with the metadata node during visibility judgment is reduced, the waiting time is shortened, and the transaction processing efficiency is improved.