Microsoft Technology Licensing, LLC

Facebook, Inc.

Xiaowei Jiang

Andrea Vaccari

Rui Wang

Robin Dhananjay Dhamankar

Peter Byrne

Qun Guo

Li Hua

Zheng Fang

Michael Habben

David James Mason

Shu Wu

Jia Li

Yimin Chen

Xiaotian Guo

Vishal Kathuria

Mahesh K Sreenivas

Yixue Zhu

Leigh M Stewart

In one embodiment, a method includes receiving a unique identifier of a second user from a mobile client system of a first user after the second user requests to communicate with the first user, identifying the second user based on the unique identifier, retrieving multiple items of profile information of the second user, determining whether the unique identifier is in a list of blocked identifiers, and sending to the first user a notification that a communication request form the second user has been declined if the unique identifier is in the list of blocked identifiers. The method also includes sending the first user multiple items of profile information of the second user if the unique identifier is in the list of blocked identifiers.

Integrated telephone applications on online social networks

In one embodiment, a method includes receiving, from a client system of a first user of an online social network, an unique identifier associated with a second user of the online social network, the unique identifier being sent responsive to a communication between the second user and the first user, accessing a social graph including first and second nodes corresponding to the first and second users, respectively, identifying the second user based on the unique identifier, retrieving profile information associated with the second user and a privacy setting associated with the second user, determining whether the information is visible to the first user based on the privacy setting and a degree of separation in the social graph between the first node and the second node, and sending, to the client system, the profile information that is visible to the first user for display in association with the communication.

Architecture that addresses an end-to-end solution for logical transactional replication from a shared-nothing clustered database management system, which uses adaptive cloning for high availability. This can be time based using a global logical timestamp. The disclosed architecture, used for refreshing stale clones, does not preserve user transaction boundaries, which is a more complex situation than where the boundaries are preserved. In such a scenario it is probable that for a given data segment no clone of the segment may contain the complete user transaction history, and hence, the history has to be pieced together from the logs of multiple different clones. This is accomplished such that log harvesting is coordinated with the clone state transitions to ensure the correctness of logical replication.

Logical replication in clustered database system with adaptive cloning

Aspects of the subject matter described herein relate to data change ordering in multi-log based replication. In aspects, local seeds are maintained for subtransactions involved in a transaction, where each subtransaction may occur on a different node that hosts one or more database fragments involved in the transaction. When a subtransaction communicates with another subtransaction in a transaction, the subtransaction sends its local seed to the other subtransaction. The receiving subtransaction compares its local seed with the received seed and updates its local seed if the received seed is logically after its local seed. A subtransaction uses a local seed to generate sequence identifiers for changes made by the subtransaction. These identifiers allow data changes of a transaction that are made on multiple nodes to be partially ordered relative to other changes made during the transaction.

Data change ordering in multi-log based replication

Growing community of inventors

Bellevue, WA, United States of America

Xiaowei Jiang