公开(公告)号：US09705801B2

公开(公告)日：2017-07-11

申请号：US14047840

申请日：2013-10-07

Applicant: Facebook, Inc.

Inventor： Stephen Charles Heise ,  Alessandro Presta ,  Arun Sharma ,  Jianming Wu

IPC: G06F15/167 ,  H04L12/803 ,  H04L29/08 ,  H04L12/26 ,  H04L29/12

CPC classification number: H04L47/125 ,  H04L43/0817 ,  H04L43/16 ,  H04L61/20 ,  H04L67/1021 ,  H04L67/2842 ,  H04L67/327

Abstract: Unique identifiers (IDs) associated with a plurality of nodes may be provided. Nodes clustered within a community may be assigned numerically proximate unique IDs. A number of partitions associated with a plurality of machines may be determined. The unique IDs may be segmented into divisions based on the number of partitions. The unique IDs may be mapped to the plurality of machines based on the divisions.

公开(公告)号：US20160042067A1

公开(公告)日：2016-02-11

申请号：US14454826

申请日：2014-08-08

Applicant: Facebook, Inc.

Inventor： Ching-Chih Weng ,  Alessandro Presta ,  Chun-Yang Chen ,  Po-Lung Chen

IPC: G06F17/30

CPC classification number: G06F17/30864 ,  G06Q50/01

Abstract: In one embodiment, a method includes receiving a search query from a user of an online social network and searching multiple verticals to identify multiple sets of objects in each vertical, respectively, that match the search query, and wherein each vertical stores one or more objects associated with the online social network. The method also includes ranking, for each set of identified objects from a vertical, each identified object in the set of identified objects. The method further includes blending the multiple sets of identified objects from each vertical to form a set of blended search results that includes a threshold number of identified objects, the blending including an iterative process performed at least the threshold number of iterations. Each iteration of the iterative blending process includes determining a blender score for each top-ranked identified object in each set of identified objects.

Abstract translation: 在一个实施例中，一种方法包括从在线社交网络的用户接收搜索查询，并且搜索多个垂直以分别识别与搜索查询匹配的每个垂直中的多个对象集合，并且其中每个垂直存储一个或多个对象 与在线社交网络相关联。 该方法还包括对来自垂直的每组识别对象的排列，在所识别的对象集合中的每个识别的对象。 该方法还包括将来自每个垂直的多组识别对象混合以形成一组混合搜索结果，其包括阈值数目的已识别对象，所述混合包括至少执行阈值迭代次数的迭代过程。 迭代混合过程的每次迭代包括确定每组识别对象中每个排名最高的识别对象的混合器分数。

公开(公告)号：US20170371966A1

公开(公告)日：2017-12-28

申请号：US15698287

申请日：2017-09-07

Applicant: Facebook, Inc.

Inventor： Ching-Chih Weng ,  Alessandro Presta ,  Chun-Yang Chen ,  Po-Lung Chen

IPC: G06F17/30 ,  G06Q50/00

CPC classification number: G06F16/951 ,  G06Q30/0251 ,  G06Q50/01

Abstract: In one embodiment, a method includes receiving a search query, searching a multiple verticals to identify multiple of sets of objects in each respective vertical that match the search query, wherein each vertical stores objects of a particular object-type, generating a set of blended search results by blending the sets of identified objects from each vertical, determining that greater than a threshold proportion of objects in the set of blended search results are from a first vertical, adding at least one object from a second vertical to the set of blended search results in responsive to determining that greater than the threshold proportion of objects in the blended search results are from the first vertical, wherein the second vertical is different from the first vertical; and sending, responsive to the search query, the set of blended search results for display.

公开(公告)号：US09792364B2

公开(公告)日：2017-10-17

申请号：US14454826

申请日：2014-08-08

Applicant: Facebook, Inc.

Inventor： Ching-Chih Weng ,  Alessandro Presta ,  Chun-Yang Chen ,  Po-Lung Chen

IPC: G06F7/00 ,  G06F17/30 ,  G06Q50/00

CPC classification number: G06F17/30864 ,  G06Q50/01

Abstract: In one embodiment, a method includes receiving a search query from a user of an online social network and searching multiple verticals to identify multiple sets of objects in each vertical, respectively, that match the search query, and wherein each vertical stores one or more objects associated with the online social network. The method also includes ranking, for each set of identified objects from a vertical, each identified object in the set of identified objects. The method further includes blending the multiple sets of identified objects from each vertical to form a set of blended search results that includes a threshold number of identified objects, the blending including an iterative process performed at least the threshold number of iterations. Each iteration of the iterative blending process includes determining a blender score for each top-ranked identified object in each set of identified objects.

公开(公告)号：US10409868B2

公开(公告)日：2019-09-10

申请号：US15698287

申请日：2017-09-07

Applicant: Facebook, Inc.

Inventor： Ching-Chih Weng ,  Alessandro Presta ,  Chun-Yang Chen ,  Po-Lung Chen

IPC: G06F7/00 ,  G06F17/30 ,  G06F16/951 ,  G06Q50/00 ,  G06Q30/02

Abstract: In one embodiment, a method includes receiving a search query, searching a multiple verticals to identify multiple of sets of objects in each respective vertical that match the search query, wherein each vertical stores objects of a particular object-type, generating a set of blended search results by blending the sets of identified objects from each vertical, determining that greater than a threshold proportion of objects in the set of blended search results are from a first vertical, adding at least one object from a second vertical to the set of blended search results in responsive to determining that greater than the threshold proportion of objects in the blended search results are from the first vertical, wherein the second vertical is different from the first vertical; and sending, responsive to the search query, the set of blended search results for display.

公开(公告)号：US09934323B2

公开(公告)日：2018-04-03

申请号：US14043730

申请日：2013-10-01

Applicant: Facebook, Inc.

Inventor： Alessandro Presta ,  Alon Michael Shalita

IPC: G06F7/00 ,  G06F17/30 ,  G06Q50/00 ,  G06Q10/10

CPC classification number: G06F17/30958 ,  G06Q10/101 ,  G06Q50/01

Abstract: To dynamically map nodes for locality and balance, computer implemented methods, systems, and computer readable media, in an embodiment, may compute histograms for nodes in a first partition. Histograms may be computed for nodes in a second partition. The second partition may be selected as a candidate partition for a set of nodes in the first partition based on the histograms for the nodes in the first partition. The first partition may be selected as a candidate partition for a set of nodes in the second partition based on the histograms for the nodes in the second partition. At least a portion of the set of nodes in the first partition may be mapped to the second partition and at least a portion of the set of nodes in the second partition may be mapped to the first partition based on load balancing.

公开(公告)号：US09836517B2

公开(公告)日：2017-12-05

申请号：US14047830

申请日：2013-10-07

Applicant: Facebook, Inc.

Inventor： Alessandro Presta ,  Arun Sharma

IPC: G06F17/30

CPC classification number: G06F17/30584

Abstract: Classifications associated with a plurality of nodes may be identified. The classifications may be grouped into first level communities based on edge weights between the classifications. The first level communities may be grouped into second level communities based on edge weights between the first level communities. A sorted list of the plurality of nodes may be generated based on the classifications, the first level communities, and the second level communities. Unique identifiers (IDs) may be assigned sequentially to the sorted list of the plurality of nodes.