Technologies are described providing adaptive query routing in a replicated database environment. The technologies can be used with a variety of replication protocols. Prepared statements, such as for queries, from a database client can be routed to a source node, or a source node and available replica nodes, when a replica node becomes unavailable. When a replica node becomes available again, a prepared statement can be updated to indicate that the updated prepared statement can be executed at nodes including the replica node that is available again. Prepared statement routing can also be used when a portion of replicated data becomes unavailable at a replica node, but a portion of replicated data remains available.

Various examples described herein are directed to systems and methods for managing a cloud-implemented database management application, the method comprising. At least one cloud service may receive a request from a first user group to launch a first instance of the database management application. The at least one cloud service may access a version metadata record for the database management application and use the version metadata record to launch the first instance of the database management application. The at least one cloud service may store first instance metadata for first instance of the database management application at a container management metadata persistence associated with the first instance of the database management application. The first instance metadata may comprise an indication of the first container image.

Systems and methods are provided for synchronizing messages. The systems and methods include operations for: identifying a difference between a current state of a messaging application and a shared synchronization database, wherein the shared synchronization database is updated via a third-party application in response to the third-party application receiving, from a server, a notification related to the messaging application, the messaging application and the third-party application being implemented on a client device; retrieving information from the shared synchronization database to update the current state of the messaging application based on the identified difference; and transmitting, to the server by the messaging application, a request for content based on the update to the current state of the messaging application.

The present invention is a computer implemented method for determining and conforming the position of finishing materials within a building, comprising: accessing, by at least one processor, a model; identifying, by at least one processor, sheathing materials and frame members; detecting, by at least one processor, at least one instance where the sheathing material interfaces with at least one of the frame members; calculating, by at least one processor, an actual location of the sheathing material relative to the frame members; comparing, by at least one processor, the actual location of the sheathing material relative to the frame members to a required location; and generating, by at least one processor, a list of interfaces which the actual location is outside the predetermined range of the required locations.

A method includes: repeatedly executing a first processing configured to generate, in response to input of conversion examples of values set, a conversion program for converting values of records, convert the values of the records by executing the conversion program, and display a conversion result; and executing a second processing configured to select one or more second records from the records, each of the one or more records being a record on an upper side of a first record, the first record being a record for which a conversion example is added in second or subsequent input, determine whether a value of each second record is changed in a latest conversion result from a previous conversion result, and in response that a value of the second record is changed, cause the first processing to highlight a value of the second record in display of the latest conversion result.

One embodiment provides for a method including performing, by a processing thread, a process that analyzes transactional operations by maintaining the transactional operations in transaction local side logs, and waiting until a successful transaction commit to append the transaction local side logs to a log stream. The processing thread processes the transactional operations on a key used to determine whether existing data is found for the key. The transactional operations are sped up through parallelism based on partitioning tables across nodes handling the transactional operations. A first process is performed by a first processor that processes updates for values of a key based on updating a first start time table index using unique keys and a start time field of a row for a first appearance of each unique key from the transactional operations.

Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.

A method may include receiving a first transaction inserting a record into a database and a second transaction deleting the record from the database. A validity period for the record may be determined based on a first commit time at which the first transaction is committed and a second commit time at which the second transaction is committed. A current table and/or a history table of a system versioned table may be updated to include the record based on the validity period of the record. One or more temporal operations may be performed based on the system versioned table. For example, a time travel operation may be performed to retrieve, based on the system versioned table, one or more records that are valid at a given point in time. Related systems and computer program products are also provided.

This application provides a data processing method and apparatus. The method includes: receiving, by a master storage node, information that is about a first transaction and that is sent by a read-write node, where the information about the first transaction is used to request to perform a write operation on first data stored on the master storage node; determining, by the master storage node, the first data based on the information about the first transaction, and executing the first transaction; generating, by the master storage node, first transaction status metadata when the first transaction ends, where the first transaction status metadata includes identification information of expired data and identification information of the first transaction; and sending, by the master storage node, the first transaction status metadata to at least one read-only node. According to the data processing method and apparatus, a read delay of a read-only node can be eliminated.

Technologies are described providing adaptive query routing in a replicated database environment. The technologies can be used with a variety of replication protocols. Prepared statements, such as for queries, from a database client can be routed to a source node, or a source node and available replica nodes, when a replica node becomes unavailable. When a replica node becomes available again, a prepared statement can be updated to indicate that the updated prepared statement can be executed at nodes including the replica node that is available again. Prepared statement routing can also be used when a portion of replicated data becomes unavailable at a replica node, but a portion of replicated data remains available.