In some implementations, a computer-implemented method includes receiving a state update command. The method further includes, in response to the state update command, sending a command to perform a state update in a first server of a plurality of servers and queueing incoming requests for access to the plurality of servers. The method further includes receiving confirmation from the first server that the state update was successful. The method further includes, after receiving the confirmation, sending a respective command to the plurality of servers to perform the state update and a scheduled update time associated with the state update. The method further includes receiving a respective state update message from a subset of the plurality of servers that the state update was successful and after receiving the state update message, transmitting the queued incoming requests to the subset of the plurality of servers.

An example method of using ad-hoc stored procedures for OLTP operations includes: identifying, by a processing device, one or more values for updating a dataset stored in a database; creating an ad-hoc stored procedure comprising a sequence of commands specifying atomically-executable database update operations with respect to the dataset, wherein the atomically-executable database update operations utilize the one or more values that are encoded into the sequence of commands by respective inline constant values; executing the ad-hoc stored procedure, wherein the executing comprises acquiring a temporary lock of at least part of the dataset; and dropping the ad-hoc stored procedure.

A distributed database compaction system can perform compaction for transactional queries in an asynchronous matter without affecting completion of the queries. The compaction system can implement asynchronous transformation of key pairs in the database, and older keys can be periodically purged using a scheduled compactor. Subsequent queries use the compacted stored keys to perform efficient queries with direct reads of committed transactions and more efficient access to key values stores of the distributed database.

Apparatus and methods to manage annotation of a body of data comprising data files are provided. The apparatus and methods may include an annotation management system concurrently accessible over a network by annotators, data engineers, data scientists, and checkers. The annotation management system may include a label management module, an annotated data management module, a change management module, a navigation management module, an original document reference, a database management module, and an output management module. The apparatus and methods may include locking a data file while an annotator is applying labels but concurrently allowing others to view and manipulate the data file.

A tool for inter-process communication in a multi-tenant environment. The tool creates an advertisement file for each tenant of a plurality of tenants. The tool locks a plurality of synchronization files prior to incrementing a semaphore, wherein the plurality of synchronization files correspond to the plurality of tenants, and wherein locking the plurality of synchronization files ensure that the semaphore is only decremented once per tenant. The tool searches for a response file corresponding to a specific tenant, wherein the response file includes metadata related to an information channel for communication with the specific tenant and information depicting a communication protocol used corresponding to the specific tenant. The tool unlocks the plurality of synchronization files. The tool establishes a connection, wherein the connection comprises an encrypted communication channel between the specific tenant and the attachment process mediated by a daemon.

A size associated with a content file is determined to be greater than a threshold size. In response to the determination, file metadata of the content file split and stored across a plurality of component file metadata structures. The file metadata of the content file specifies tree structure organizing data components of the content file and each component file metadata structure of the plurality of component file metadata structures stores a portion of the tree structure. A snapshot tree is updated to reference the plurality of component file metadata structures for the content file.

The lock time of a database upon the execution of a series of processes is decreased, and the load of the implementation/modification of the database server device upon changing the application destination of the Web system is reduced. A database server provides a prescribed simple API, and comprises a request processing unit, an SQL creation unit, and an SQL processing unit. In the database server device 120, when a plurality of divided requests are received from the Web server device as the request for requesting a series of processing, the SQL processing unit executes SQL integration processing of temporarily storing the generated SQL sentences until generation of the SQL sentences is ended for all of the plurality of divided requests, and integrating and editing the plurality of temporarily stored SQL sentences and creating the whole SQL sentence after generation of the SQL sentence is ended for all of the requests.

A portable, hand-held computer functions as an intermediary between a database server and individual aircraft when the aircraft cannot be connected to the database server. By virtue of being portable and being locally linked (over time) to different aircraft, the intermediary computing device can provide the data upload validation and auditing for accurate billing of database usage for a flight database provided from the server. This ensures that each aircraft which receives an uploaded database is entitled to receive the upload based on a paid license. As a result, billing by the database vendor is based on usage. Licensing and data authentication is mediated by the intermediary computing device.

A method for preventing race conditions in a database comprises: setting a first numerical entry and a second numerical entry in a database; receiving a first online transaction; responsive to determining a lock of the database is in progress due to a second received online transaction, suspending the first online transaction; removing the lock after the second received online transaction is completed; responsive to determining that the first entry is greater than zero, decrementing the first entry by an amount indicated in the first online transaction; responsive to determining the second entry is greater than zero, decrementing the second entry; processing the first transaction; and generating an online transaction record for the first transaction and storing the generated record in an online transaction database.

Multi-tenant hosting of inverted indexes for text searches is implemented. Text search requests are routed to different index nodes that cache inverted indexes for different user accounts. Updates to inverted indexes are routed to index nodes that have acquired a lock on an inverted index. The index nodes have access to a common data store that persistently stores the inverted indexes.