US 9,542,504 B2Granted

Metanodes for open graph protocols

AssigneeFacebook, Inc.

InventorsBrian Piepgrass Hale, Siddharth Kar

Life of this patent

Estimating the term…

Loading patent…

Abstract

In one embodiment, a social graph associated with a social networking system may comprise user nodes, concept nodes, meta nodes, and edges between the nodes. A meta node may be connected by an edge to each of a set of concept nodes sharing attributes. A request associated with a first user may be received, wherein a user node for the first user is associated with a first one of the concept nodes. A meta node connected to the first concept node may be identified. Second concept nodes may be identified, wherein each of the second concept nodes is connected to the identified meta node. A value may be determined for each of the second concept nodes. Finally, information may be presented to the first user, wherein the information is related to at least one of the second concept nodes based on respective values for the second concept nodes.

Claims20

Dependent claims

A method comprising:

by one or more computing devices, maintaining one or more data stores storing a social graph associated with a social networking system, the social graph comprising a plurality of user nodes, a plurality of concept nodes, one or more meta nodes, and a plurality of edges between nodes, wherein:
a user node corresponds to a user of the social networking system;
and
a concept node corresponds to a concept;
by one or more of the computing devices, determining that a first concept node and a second concept node share one or more attributes;
by one or more of the computing devices, based on the determining that the first concept node and the second concept node share one or more attributes, creating a first edge connecting the first concept node to a meta node and creating a second edge connecting the second concept node to the meta node, wherein the meta node comprises the one or more attributes;
by one or more of the computing devices, receiving a request associated with a first user, wherein a user node for the first user is associated with the first concept node;
by one or more of the computing devices, identifying the meta node based on the first edge connecting the first concept node to the meta node;
by one or more of the computing devices, identifying the second concept node based on the second edge connecting the second concept node to the meta node;
and
by one or more of the computing devices, presenting, to the first user, information related to the second concept node.

8 more elements

Dependencies are inferred from the claim text.

Facts

Application: 14/628,180Filed 20 Feb 2015 · division
Priority: 9 Dec 2011
Published: US 2015/0169787 A118 Jun 2015
Granted: 10 Jan 2017
Term ends: Not estimatedThe source records don’t support an estimate.

Classification8 codes

G06Q 30/02
Commerce: marketing; Price estimation or determination; Fundraising
G06F 16/9024
Indexing; Data structures therefor; Storage structures: graphs; Linked lists
G06Q 10/42
Business processes related to social networking or social networking services: determination of affinities or common interests between users
G06Q 10/48
Business processes related to social networking or social networking services: using social graphs

Family

Application13/316,222Parent of this division · filed 9 Dec 2011
US 2015/0169787 A1Pre-grant publication · published 18 Jun 2015
US 9,002,936 B2Parent of this division
US 2013/0151606 A1Published application
US 9,542,504 B2This patent

From the US filing history. Foreign family members aren’t listed.