-
1.发明申请APPARATUS AND METHOD FOR EFFICIENTLY MANAGING DATA IN A SOCIAL NETWROKING SERVICE 有权在社交网络服务中有效管理数据的设备和方法公开(公告)号：US20110252099A1
公开(公告)日：2011-10-13
申请号：US12831888
申请日：2010-07-07
CPC分类号： G06Q10/10 , G06F17/30371 , H04W4/21
摘要： An apparatus, method, and machine-readable medium are described for managing data within a friend service. In one embodiment, a key/value data store can be used to provide an efficient and highly-scalable friend service database. Various techniques can be used to ensure data consistency between friend service data records. For example, in one embodiment, operations are detected which require updates to a plurality of related friend state records. A key may be generated to represent each of the operations and then used to create an entry in a write-ahead log database. In one embodiment, each entry in the write-ahead log database may specify the operation to be performed on the friend state records. If the plurality of friend state records are successfully updated, then the entry in the write-ahead log database may be deleted. However, if the plurality of friend state records are not successfully completed, then the entry is not deleted from the write-ahead log database. The friend state records associated with old entries in the write-ahead log database are checked for consistency and inconsistent records are repaired. In addition, optimistic locking techniques may be used in one embodiment to improve performance of the friend service database.
摘要翻译： 描述了一种用于管理朋友服务内的数据的装置，方法和机器可读介质。 在一个实施例中，密钥/值数据存储可用于提供高效且高度可扩展的朋友服务数据库。 可以使用各种技术来确保朋友服务数据记录之间的数据一致性。 例如，在一个实施例中，检测到需要更新多个相关朋友状态记录的操作。 可以生成一个键来表示每个操作，然后用于在预写日志数据库中创建一个条目。 在一个实施例中，预写日志数据库中的每个条目可以指定要对朋友状态记录执行的操作。 如果多个朋友状态记录被成功地更新，则可以删除预写日志数据库中的条目。 然而，如果多个朋友状态记录未成功完成，则该记录不会从预写日志数据库中删除。 检查与预写日志数据库中的旧条目相关联的朋友状态记录是否一致，并且修复不一致的记录。 此外，在一个实施例中可以使用乐观锁定技术来改善朋友服务数据库的性能。
-
2.发明授权Apparatus and method for efficiently managing data in a social networking service 有权用于有效管理社交网络服务中的数据的装置和方法公开(公告)号：US08396932B2
公开(公告)日：2013-03-12
申请号：US12831888
申请日：2010-07-07
IPC分类号： G06F15/16
CPC分类号： G06Q10/10 , G06F17/30371 , H04W4/21
摘要： An apparatus, method, and machine-readable medium are described for managing data within a friend service. In one embodiment, a key/value data store can be used to provide an efficient and highly-scalable friend service database. Various techniques can be used to ensure data consistency between friend service data records. For example, in one embodiment, operations are detected which require updates to a plurality of related friend state records. A key may be generated to represent each of the operations and then used to create an entry in a write-ahead log database. In one embodiment, each entry in the write-ahead log database may specify the operation to be performed on the friend state records. If the plurality of friend state records are successfully updated, then the entry in the write-ahead log database may be deleted. However, if the plurality of friend state records are not successfully completed, then the entry is not deleted from the write-ahead log database. The friend state records associated with old entries in the write-ahead log database are checked for consistency and inconsistent records are repaired. In addition, optimistic locking techniques may be used in one embodiment to improve performance of the friend service database.
摘要翻译： 描述了一种用于管理朋友服务内的数据的装置，方法和机器可读介质。 在一个实施例中，密钥/值数据存储可用于提供高效且高度可扩展的朋友服务数据库。 可以使用各种技术来确保朋友服务数据记录之间的数据一致性。 例如，在一个实施例中，检测到需要更新多个相关朋友状态记录的操作。 可以生成一个键来表示每个操作，然后用于在预写日志数据库中创建一个条目。 在一个实施例中，预写日志数据库中的每个条目可以指定要对朋友状态记录执行的操作。 如果多个朋友状态记录被成功地更新，则可以删除预写日志数据库中的条目。 然而，如果多个朋友状态记录未成功完成，则该记录不会从预写日志数据库中删除。 检查与预写日志数据库中的旧条目相关联的朋友状态记录是否一致，并且修复不一致的记录。 此外，在一个实施例中可以使用乐观锁定技术来改善朋友服务数据库的性能。
-
公开(公告)号：US20120011189A1
公开(公告)日：2012-01-12
申请号：US12832015
申请日：2010-07-07
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L29/12471 , H04L29/1249 , H04L29/12528 , H04L61/2553 , H04L61/256 , H04L61/2575 , H04L63/0428 , H04L63/104 , H04L67/16
摘要： An apparatus, method, and machine-readable medium are described for establishing peer-to-peer (“P2P”) communication channels. In particular, in one embodiment, a matchmaker service performs a series of operations to service match requests received from a group of mobile devices. In one embodiment, the matchmaker service groups the match requests into matchable sets based on the application for which the requests are received and one or more variables associated with the application. Match requests within each match set can then be matched based on variables such as the NAT type, connection type and language associated with each of the mobile devices. Other variables such as geographical location, experience level, and age of the match requests may also be used to render match decisions.
摘要翻译： 描述了用于建立点对点（“P2P”）通信信道的装置，方法和机器可读介质。 特别地，在一个实施例中，匹配器服务执行一系列操作以对从一组移动设备接收的匹配请求进行服务。 在一个实施例中，匹配器服务基于接收到请求的应用和与应用相关联的一个或多个变量将匹配请求分组为可匹配集合。 然后可以基于诸如NAT类型，连接类型和与每个移动设备相关联的语言的变量来匹配每个匹配集合内的匹配请求。 诸如地理位置，经验水平和匹配请求的年龄等其他变量也可用于呈现匹配决策。
-
公开(公告)号：US08412833B2
公开(公告)日：2013-04-02
申请号：US12832003
申请日：2010-07-07
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , A63F13/34 , A63F13/795 , A63F2300/406 , A63F2300/408 , A63F2300/5566 , H04L29/125 , H04L29/12509 , H04L61/2564 , H04L61/2567
摘要： An invitation service performs a series of transactions to enable P2P communication between two or more mobile data processing devices. Prior to attempting to establish a P2P network communication channel, the invitation service may first collect network information for each of the mobile devices and use the network information to determine if a direct P2P network communication channel is feasible. If a direct connection is feasible, then the invitation service provides for direct P2P communication, pushing the necessary network information to each of the mobile devices. If, however, a direct connection is infeasible or if a direct connection is attempted and fails, then the invitation service may identify network information associated with a relay service. The network information may then be used by any pair of mobile devices to establish a connection through the relay service.
摘要翻译： 邀请服务执行一系列事务以实现两个或多个移动数据处理设备之间的P2P通信。 在尝试建立P2P网络通信信道之前，邀请服务可以首先收集每个移动设备的网络信息，并使用网络信息来确定直接的P2P网络通信信道是否可行。 如果直接连接是可行的，则邀请服务提供直接P2P通信，将必要的网络信息推送到每个移动设备。 然而，如果直接连接是不可行的或者如果尝试直接连接并且失败，则该邀请服务可以标识与中继服务相关联的网络信息。 然后可以由任何一对移动设备使用网络信息来建立通过中继服务的连接。
-
公开(公告)号：US08341207B2
公开(公告)日：2012-12-25
申请号：US12832015
申请日：2010-07-07
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L29/12471 , H04L29/1249 , H04L29/12528 , H04L61/2553 , H04L61/256 , H04L61/2575 , H04L63/0428 , H04L63/104 , H04L67/16
摘要： An apparatus, method, and machine-readable medium are described for establishing peer-to-peer (“P2P”) communication channels. In particular, in one embodiment, a matchmaker service performs a series of operations to service match requests received from a group of mobile devices. In one embodiment, the matchmaker service groups the match requests into matchable sets based on the application for which the requests are received and one or more variables associated with the application. Match requests within each match set can then be matched based on variables such as the NAT type, connection type and language associated with each of the mobile devices. Other variables such as geographical location, experience level, and age of the match requests may also be used to render match decisions.
摘要翻译： 描述了用于建立点对点（P2P）通信信道的装置，方法和机器可读介质。 特别地，在一个实施例中，匹配器服务执行一系列操作以对从一组移动设备接收的匹配请求进行服务。 在一个实施例中，匹配器服务基于接收到请求的应用和与应用相关联的一个或多个变量将匹配请求分组为可匹配集合。 然后可以基于诸如NAT类型，连接类型和与每个移动设备相关联的语言的变量来匹配每个匹配集合内的匹配请求。 诸如地理位置，经验水平和匹配请求的年龄等其他变量也可用于呈现匹配决策。
-
公开(公告)号：US20110252079A1
公开(公告)日：2011-10-13
申请号：US12832003
申请日：2010-07-07
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , A63F13/34 , A63F13/795 , A63F2300/406 , A63F2300/408 , A63F2300/5566 , H04L29/125 , H04L29/12509 , H04L61/2564 , H04L61/2567
摘要： An apparatus, method, and machine-readable medium are described for establishing peer-to-peer (“P2P”) communication channels. In particular, in one embodiment, an invitation service performs a series of transactions to enable P2P communication between two or more mobile data processing devices. Prior to attempting to establish a P2P network communication channel, the invitation service may first collect network information for each of the mobile devices and use the network information to determine if a direct P2P network communication channel is feasible. If a direct connection is feasible, then the invitation service provides for direct P2P communication, pushing the necessary network information to each of the mobile devices. If, however, a direct connection is infeasible or if a direct connection is attempted and fails, then the invitation service may identify network information associated with a relay service. The network information may then be used by any pair of mobile devices to establish a connection through the relay service. In addition, in one embodiment, the invitation service can perform its functions without maintaining any per-connection state information for any of the mobile devices.
摘要翻译： 描述了用于建立点对点（“P2P”）通信信道的装置，方法和机器可读介质。 特别地，在一个实施例中，邀请服务执行一系列事务以使两个或多个移动数据处理设备之间进行P2P通信。 在尝试建立P2P网络通信信道之前，邀请服务可以首先收集每个移动设备的网络信息，并使用网络信息来确定直接的P2P网络通信信道是否可行。 如果直接连接是可行的，则邀请服务提供直接P2P通信，将必要的网络信息推送到每个移动设备。 然而，如果直接连接是不可行的或者如果尝试直接连接并且失败，则该邀请服务可以标识与中继服务相关联的网络信息。 然后可以由任何一对移动设备使用网络信息来建立通过中继服务的连接。 此外，在一个实施例中，邀请服务可以执行其功能，而不维护任何移动设备的任何每个连接状态信息。
-
-
-
-
-
搜索结果
6 条记录 (耗时 0.028 秒)
