Google Inc.

Jean-Christophe Emmanuel Lilot

Pavan Kumar Desikan

Dennis Troper

Jonathan Terleski

Brynn Marie Evans

Karthik Murili Nagaraj

Amar Gandhi

David Mark Byttow

Michael Nestler

David Gary Besbris

Gregory Matthew Marra

Nishant Antul Thakkar

Abhishek Sethi

Bryant Fong

Nicolas Thakis Weber

Oscar Del Pozo Triscon

Nish Thakkar

Methods, systems, and computer programs are presented for managing electronic messages of users in a social network. One method includes an operation for receiving attributes of a profile of a person with a person account that has started following an entity with an entity account, in the social network. Further, the person is added to one or more groups in the entity account based on the attributes. Each of the groups is associated with defined properties for adding persons to each group. Furthermore, messages, created by the entity and addressed to the one or more groups, are distributed to a stream of the person account.

Automatic group assignment of users in a social network

Technology for managing the flow of messages among accounts of a social network. One method enables a first account (e.g., person or entity account) to elect a second account (e.g., person or entity account) in the social network. The election causes the first account to follow the second account to receive electronic messages of the second account. Further, an election of the first account by the second account is disabled until the first account follows the second account. Additionally, the method includes an operation for detecting the first account has followed the second account and has added the second account to a communication group managed by the first account.

Management of commercial messages in a social network

Methods, systems, and computer programs are presented for managing the flow of messages among users of a social network. One method enables the election of an entity in the social network by a person in the social network. The election indicates that the person follows the entity to receive entity electronic messages. Further, an election of the person by the entity is disabled until it is detected that the person has elected to follow the entity. Additionally, the method includes an operation for detecting the election of the entity by the person, where the person is enabled to add the entity to communication groups managed by the person after the election. The entity is enabled to follow the person after the person elects to follow the entity, and messages from the person to communication groups including the entity will reach the entity.

Methods, systems, and computer programs are presented for managing the visibility of relationships within a social network. One method includes an operation for enabling a person to establish a first follow relationship from the person to an entity in the social network. However, the entity is disabled to establish a second follow relationship from the entity to the person until the first follow relationship from the person to the entity is established. Further, the establishment of the first follow relationship with a limited visibility is detected, and the establishment of the second follow relationship is also detected. The method further includes an operation for disabling a user in the social network to obtain visibility of the second follow relationship if the first follow relationship is invisible to the user.

Following an entity in a social network

A method for determining membership/follower status in a social network is provided. Outgoing edge data and anti-outgoing edge data of a first user are read. A second user is determined to be a member of the first user's social graph when the second user is designated in the outgoing edge data and not designated in the anti-outgoing edge data of the first user. In another implementation, a method for removing a second user from a social graph of a first user is provided. A designation of the second user is removed from outgoing edge data of the first user, and a designation of the first user is removed from incoming edge data of the second user. A designation of the first user is added to anti-outgoing edge data of the second user, and a designation of the second user is added to anti-incoming edge data of the first user.

Determining membership in a social graph

Methods, systems, and computer programs are presented for processing data to control display of followers of an entity to viewers of an entity page of the entity in a social network. One method includes detecting a request to view the entity page by a viewer. Fetching a first row of data associated with the social network. The method processes the first row of data to read a set of bits to determine whether certain ones of the users that are following the entity are to be displayed as following the entity in the entity page. The method also fetches a second row of data to determine whether the viewer is in one of the groups of the users that are following the entity and not displaying the users that follow the entity to the viewer when the viewer is not in one of the groups.

Evaluating access control list data for a social network

Disclosed is a computer implemented method of determining an aggregated web analytics value. A first data storage medium stores a sequence of episodic values, each associated with a respective time interval. A second data storage medium stores a sequence of aggregate values, each aggregating an equal number of the episodic values. Further aggregates are stored and provided in a like manner, until an additional sequence of higher level aggregate values cannot be created using the same base number. When a request for an aggregate value over a range of episodic values is received, the system queries the storage mediums in a parallel operation, retrieving as little aggregated values and episodic values needed to compute the requested value.

Growing community of inventors

Mountain View, CA, United States of America

Jean-Christophe Emmanuel Lilot