Oracle International Corporation

Facebook, Inc.

Haobo Xu

Lik Wong

Nimar Singh Arora

Thuvan Hoang

James William Stamos

Edwina Lu

Dhrubajyoti Borthakur

Byron Wang

Lakshminarayanan Luxi Chidambaran

Mayank Agarwal

Jason Curtis Jenks

Lei Gao

Hairong Kuang

Thomas Apostolos Georgiou

Lakshminaray Chidambaran

Nagavamsi Ponnekanti

Deon Chris Nicholas

The disclosure is directed to moving an application, e.g., a messenger service in a social networking application, to various locations in a distributed computing system, e.g., to improve an efficiency of the application. For example, the application can be moved to a data center that is closer to a location of a user to decrease a latency associated with accessing the application. In another example, the application can be moved to a data center that is closer to a location of a storage system that stores data associated with the application to improve a throughput of the application, e.g., a rate at which data is read and/or written.

Mobility of application services in a distributed computing system

Technology is disclosed for retrieving data from a specific storage layer of a storage system ('the technology'). A query application programming interface (API) is provided that allows an application to specify a storage layer on which the query should be executed. The query API can be used in a multi-threaded environment which employs a combination of fast threads and slow threads to serve read/write requests from applications. The fast threads are configured to query on a first set of storage layers, e.g., storage layers in a primary storage, while the slow threads are configured to query on a second set of storage layers, e.g., storage layers in a secondary storage. If a fast thread does not find the requested data in the first set, the request is transferred to a slow thread and the fast thread is allocated to another request while the slow thread is serving the current request.

Querying a specified data storage layer of a data storage system

Technology is disclosed for performing atomic update operations in a storage system ('the technology'). The technology can receive an update command to update a value associated with a key stored in the storage system as a function of an input value; store the input value in a log stored at the storage system but not updating the value stored in the storage system; and update the value associated with the key with the received input values value based on the a function to generate an updated value, the updating occurring asynchronously with respect to receiving the update command.

Atomic update operations in a data storage system

Techniques for replicating data in database systems are described. In an example embodiment, a set of changes is received at a destination database, where the set of changes has been applied at a source database and is being replicated from the source database to the destination database. The set of changes is analyzed and it is determined that the set of changes includes two or more of: a subset of row-level changes, a subset of statement-level changes, and a subset of procedure-level changes. A set of dependencies is determined at least between the changes that are included in the subsets of changes. The changes, in the subsets of changes, are assigned to two or more processing elements. The set of changes is applied to the destination database by executing the two or more processing elements in parallel to each other and based on the set of dependencies.

Statement-level and procedural-level replication

A method for sharing information between a publisher and multiple subscribers is provided. The publisher uses a latch-free, single publisher, multiple subscriber shared queue to share information. Logical change records representing changes made to a database are enqueued in the shared queue as messages in a stream of messages, and subscribers read the logical change records. Subscribers may filter logical change records before sending to apply processes for processing. An identifying property of the source instance of a change encapsulated in a logical change record may be included with each message enqueued.

High performant information sharing and replication for single-publisher and multiple-subscriber configuration

Techniques for combining statement level, procedural, and row level replication

Growing community of inventors

Palo Alto, CA, United States of America

Haobo Xu