Methods and systems for coordinating migration for a database of a service are described herein. Multiple releases of the service may be simultaneously implemented, and these multiple releases may access a shared database. As new releases of the service are activated, the database may be incrementally migrated to a new data schema version. The new data schema version may be compatible with each release of the service that is in use. After a migration has begun, instances of the service may be instructed to perform database operations using methods compatible with the new data schema version. Continuation tokens may be returned during the migration, which indicate portions of the shared database that have not yet been migrated. If an error occurs during the migration, the continuation tokens may be discarded, and the migration may be restarted.

The disclosure discloses a transaction processing method, a processing node, and a central node. The method includes: receiving, by the processing node in the cluster, global snapshot information according to a preset time interval, where the global snapshot information includes a transaction identifier of a running transaction in a cluster; storing the received global snapshot information in a cache; and processing the transaction according to the global snapshot information stored in the cache. In the transaction processing method, a central node in a cluster sends latest global snapshot information to each processing node according to a preset time interval, so that the processing node can store the global snapshot information. When applying for global snapshot information during transaction processing, the processing node does not need to obtain latest snapshot information from the central node. Therefore, network overheads can be reduced, and transaction processing efficiency can be improved.

Techniques for non-disruptive versioning of in-memory units in a database are provided. A database server generates and maintains a first IMU that reflects changes made to a mirrored-data-set up to a first snapshot time, and a second IMU that reflects changes made to the mirrored-data-set up to a second snapshot time. During a first period, the database server responds to updates to first data items in the mirrored data by storing first staleness metadata that indicates that the copies of the first data items in the first IMU are stale. During a second period, the database server responds to updates to second data items in the mirrored data by storing second staleness metadata that indicates that the copies of the second data items in the second IMU are stale. The database server responds to a request by accessing the first IMU or the second IMU.

Aspects of the embodiments are directed to synchronizing at least a portion of a link-state database. A network element can lose an adjacency. The network element can transmit a request to a neighboring network element for synchronization of a link-state database. The request can include a version number of a last synchronized link-state database from the neighboring network element. The neighboring network element can determine whether the version of the link-state database is greater than or less than a copy of the link-state database stored by the neighboring network element. If the requested version number is less than the neighboring network element's link-state database version number, then the neighboring network element can send changes to the link-state database since the requested link-state database version number.

The present invention is a computer implemented method for determining and conforming the position of furniture within a building, comprising: accessing, by at least one processor, a model; identifying, by at least one processor, components and frame members, wherein the components are positioned within the model and interface with select frame members; detecting, by at least one processor, at least one instance where the component interfaces with at least one of the frame members; calculating, by at least one processor, an actual location of the component relative to the frame members; comparing, by at least one processor, the actual location of the component 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.

Disclosed are some implementations of systems, apparatus, methods and computer program products for facilitating version control for a client device. A server system may select one of two or more versions of a procedure based, at least in part, on a user profile. The server system may generate a message including a procedure name of the procedure, a version identifier identifying the selected version of the procedure, a set of computer-readable instructions corresponding to the selected version of the procedure, and a client directive pertaining to storing the procedure in a database. The server system may transmit the message to a client device associated with the user.

Methods and systems are presented for identifying user accounts selectively authorized to modify at least respective first and second fields of a data table, obtaining field-dependent validation rules selectively applicable to the respective fields, transmitting spreadsheet files to devices associated with the respective user accounts, filtering user-modified spreadsheet files so that the first field is selectively accepted from the first device and the second field is selectively accepted from the second device, allowing the values of the first and second fields to be edited contemporaneously, and recording an edited version of the data table.

Systems and methods are described for modifying input and output (I/O) to an object storage service by implementing one or more owner-specified functions to I/O requests. A function can implement a data manipulation, such as filtering out sensitive data before reading or writing the data. The functions can be applied prior to implementing a request method (e.g., GET or PUT) specified within the I/O request, such that the data to which the method is applied my not match the object specified within the request. For example, a user may request to obtain (e.g., GET) a data set. The data set may be passed to a function that filters sensitive data to the data set, and the GET request method may then be applied to the output of the function. In this manner, owners of objects on an object storage service are provided with greater control of objects stored or retrieved from the service.

Among other disclosed subject matter, a computer program product is tangibly embodied in a computer-readable storage medium and includes instructions that when executed by a processor perform a method for recording information about an item. The method includes assigning a unique identifier to an item in a repository, the item supporting versioning and being subject to a data model having no predefined schema for items. The method includes associating a first attribute with the unique identifier, the first attribute being part of the item and being configured for modification. The method includes associating the first attribute with a version number, wherein the versioning is supported without recording in the repository a time period when the first attribute is valid.

Methods, systems and computer-readable storage mediums encoded with computer programs executed by one or more processors for providing a compressed representation of a transaction token are disclosed. In an embodiment, a transaction token maintains statues of transaction to a database in a first data structure and a second data structure. The first data structure includes a plurality of identifiers respectively corresponding to the transactions to the database and a corresponding status of each identifier indicating whether a given transaction is open or closed, wherein the plurality of identifiers is maintained below a threshold number of identifiers. The second data structure includes a plurality of identifiers of transactions to the database beyond the threshold and whose status is open.