WO2013086800A1 - Procédé et système d'interopérations de réseaux sociaux - Google Patents

Procédé et système d'interopérations de réseaux sociaux Download PDF

Info

Publication number
WO2013086800A1
WO2013086800A1 PCT/CN2012/071347 CN2012071347W WO2013086800A1 WO 2013086800 A1 WO2013086800 A1 WO 2013086800A1 CN 2012071347 W CN2012071347 W CN 2012071347W WO 2013086800 A1 WO2013086800 A1 WO 2013086800A1
Authority
WO
WIPO (PCT)
Prior art keywords
user
server
social network
identifier
specified
Prior art date
Application number
PCT/CN2012/071347
Other languages
English (en)
Chinese (zh)
Inventor
陶伟成
陈军
姚立哲
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2013086800A1 publication Critical patent/WO2013086800A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/20—Services signaling; Auxiliary data signalling, i.e. transmitting data via a non-traffic channel
    • H04W4/21—Services signaling; Auxiliary data signalling, i.e. transmitting data via a non-traffic channel for social networking applications

Definitions

  • BACKGROUND A Social Network Service is a new online online service. Users can obtain information from social networks (SNs) or personalize them, such as personal logs, moods, pictures, etc. You can also share photos, moods, content, and more. Social networks largely simulate people's social behavior in real life, and are therefore loved by a large number of Internet users.
  • the current state of social networking services is that there are a large number of different social networking services, with little or no interoperability between them, for example: A user sees a good blog in social network A, he wants to share In my own social network B, the prior art provides a sharing button below the blog. When the user clicks the button, the page will jump to the user's social network B login page, asking the user to enter their own username and password. For another example: a user has many friends in social network A. If you want to add these friends to social network B, you need to manually add them one by one. It can be seen that in the related art, when the user operates between two different social networks, the implementation process is rather cumbersome.
  • a method for obtaining a user identity across a social network including: after the server receives the user identifier of the other social network, the server stores the association relationship between the server local or the third-party server. Querying and obtaining the user identifier of the user in the social network, where the association relationship records the correspondence between the user identifiers of the same user in different social networks; or, the server is based on the user identifier of the user in the social network.
  • a method for interoperating a social network including: a first server sending a first request message to a second server, where the first request message includes a user identifier of the first user and/or The first server specifies the condition; the second server queries other users that meet the specified condition; and the first server acquires the second server according to the association relationship of the same user in different social network user identifiers Querying the user identifier of the other user in the first social network, and adding the acquired user identifier of the other user in the first social network to the specified list of the first user, where The first server belongs to the first social network, and the second server belongs to the second social network.
  • the method further includes: the first server carrying the first user identifier of the first user on the first server in the first request message Or the first server searches for the association relationship stored on the local or third server to obtain the user identifier of the first user in the second social network, and the first user is in the second social network.
  • the user identity of the network is carried in the first request message.
  • the method further includes: if the first request message carries the user identifier of the first user in the first social network, The second server searches for the association relationship stored by the local or the third server, and obtains the user identifier of the first user in the second social network.
  • the acquiring, by the first server, the user identifier of the other user that is queried by the second server in the first social network includes: the second server querying the association relationship stored locally or by the third server Obtaining, by the second server, the user identifier of the other user in the first social network that meets the specified condition; and sending, by the second server, the user identifier of the other user in the first social network to the first a server; the first server receives a user identity of the other user from the second server in the first social network.
  • the acquiring, by the first server, the user identifier of the other user that is queried by the second server in the first social network includes: the first server receiving, by the second server, the content that is returned by the second server that meets the specified The user identifier of the other user of the condition; the first server determines that the received user identifier of the other user is not the user identifier of the first social network; the first server searches for the local or the third server The association relationship stored on the user identifier of the other user on the first social network.
  • the condition specified by the first user includes: a user whose predetermined attribute is a predetermined value, or a friend or a blacklist user of the first user in the second social network.
  • the list specified by the first user includes: a buddy list or a blacklist list of the first user, or another storage space specified by the first user.
  • the method further includes: the client sending a second request message to the first server, requesting that the first user meet the designation on the second server The other user of the condition is added to the specified list of the first user on the first server; or, the client performs timing setting/periodic setting on the first server in advance, setting The other users who satisfy the specified condition on the second server are added to the specified list of the first user on the first server periodically or periodically.
  • an interoperability method of another social network including: the first server searches for other users that meet the conditions specified by the first user; and associates the user identifiers of the same user in different social networks.
  • the second server acquires the user identifier of the other user that is found by the first server in the second social network; the second server adds the user identifier of the other user to the second social network to In the specified list of the first user, where the first server belongs to the first social network, and the second server belongs to the second social network.
  • the acquiring, by the second server, the user identifier of the other user that is found by the first server in the second social network includes: the first server querying the local or the storage on the third server The association relationship is obtained, and the user identifier of the other user in the second social network is obtained; the first server sends the user identifier of the other user in the second social network to the second server.
  • the acquiring, by the second server, the user identifier of the other user that is found by the first server on the second social network includes: the second server receiving, by the first server, a condition that meets the specified requirement The identifier of the other user; the second server determines that the received user identifier of the other user is not the user identifier of the second social network; the second server searches for local or storage on the third server The association relationship acquires a user identifier of the other user in the second social network.
  • the condition specified by the first user includes: a user whose predetermined attribute is a predetermined value, or a friend or a blacklist user of the first user in the first social network.
  • the specified list of the first user includes: a buddy list or a blacklist list of the first user or another storage space specified by the first user.
  • the method further includes: the client sending a second request message to the first server, requesting that the first user be on the first server And the other user that meets the specified condition is added to the specified list of the first user on the second server; or the client performs timing on the first server in advance Setting/periodic setting, setting the timing or periodic to add the other users on the first server that meet the specified condition to the specified list of the first user on the second server in.
  • an interoperability system for a social network including: a first server, configured to send a first request message to a second server; and an association according to a user identity of the same user on different social networks a relationship, obtaining a user identifier of the other user that is queried by the second server in the first social network, and adding the acquired user identifier of the other user in the first social network to the first user
  • the first request message includes a user identifier of the first user and/or a condition specified by the first user
  • the second server is configured to query other users that meet the specified condition
  • the first server belongs to the first social network
  • the second server belongs to a second social network.
  • the system further includes: a third server, configured to store an association relationship of user identifiers of the same user on different social networks.
  • the first server is further configured to: carry the first user identifier of the first user on the first server in a first request message; or search for a local or third server The association relationship acquires the user identifier of the first user in the second social network, and carries the user identifier of the first user in the second social network in the first request message.
  • the second server is further configured to: when the first request message is carried as the user identifier of the first user in the first social network, search for local or the third server storage The association relationship is obtained, and the user identifier of the first user in the second social network is obtained.
  • the second server is further configured to query the association relationship stored by the local or the third server, and obtain a user identifier of the other user in the first social network that meets the specified condition; And sending the acquired user identifier of the other user in the first social network to the first server; the first server is further configured to receive the other user from the second server in the The user ID of the first social network.
  • the first server is further configured to: receive a user identifier of the other user that is returned by the second server that meets the specified condition; and determine that the received user identifier of the other user is not the first a user identifier of a social network; and finding the association relationship stored on the local or the third server, and obtaining the user identifier of the other user on the first social network.
  • the first server is further configured to: receive a second request message sent by the client, where the request message requests the first user to satisfy the specified condition on the second server a user added to the specified list of the first user on the first server; or, according to a preset preset by the client, the specified condition is met on the second server periodically or periodically The other users are added to the specified list of the first user on the first server.
  • an interoperability system of another social network including: a first server configured to find other users satisfying a condition specified by the first user; and a second server configured to be in accordance with the same user Correlating the user identifiers of the different social networks, obtaining the user identifiers of the other users found by the first server in the second social network; and adding the user identifiers of the other users in the second social network to In the specified list of the first user, where the first server belongs to the first social network, and the second server belongs to the second social network.
  • the system further includes: a third server, configured to store an association relationship of user identifiers of the same user on different social networks.
  • the first server is further configured to: query the association relationship stored on the local or the third server, and obtain the user identifier of the other user in the second social network;
  • the user identifier of the other user in the second social network is sent to the second server.
  • the second server is further configured to: receive an identifier of the other user that is sent by the first server that meets the specified condition; and determine that the received user identifier of the other user is not the second a user identifier of the social network; searching for the association relationship stored on the local or the third server, and obtaining the user identifier of the other user in the second social network.
  • the first server is further configured to: receive, by the receiving client, a second request message, where the request message requests, where the first user meets the specified condition on the first server Adding other users to the specified list of the first user on the second server; or, according to a preset preset by the client, periodically or periodically, satisfying the specified on the first server The other users of the condition are added to the specified list of the first user on the second server.
  • an operation request is sent to a second server belonging to a different social network by the first server, and interoperation between different social networks is realized, and the operation request is not separately sent to the first server and the second server, thereby simplifying the process. , improved user experience.
  • FIG. 1 is a schematic diagram of an inter-operating system of a social network according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of a preferred inter-operating system of a social network according to an embodiment of the present invention
  • 3 is a flowchart of a method for interworking a social network according to an embodiment of the present invention.
  • FIG. 4 is a flowchart of a method for acquiring a user identifier of another user in a first social network that is queried by a second server according to an embodiment of the present invention.
  • FIG. 5 is a flowchart of another method for obtaining a user identifier of another user queried by a second server in a first social network according to an embodiment of the present invention;
  • FIG. 6 is another socialization according to an embodiment of the present invention;
  • FIG. 7 is a schematic diagram of another preferred social network interoperability system according to an embodiment of the present invention;
  • FIG. 8 is a flowchart of a method for interoperating a social network according to an embodiment of the present invention
  • 9 is a flowchart of a method for a second server to acquire a user identifier of another user found by a first server in a second social network according to an embodiment of the present invention
  • FIG. 10 is another second embodiment according to an embodiment of the present invention.
  • FIG. 11 is a flowchart according to Embodiment 1 of the present invention
  • FIG. 12 is a flowchart of a method for interworking a social network according to Embodiment 2 of the present invention
  • FIG. 13 is a flowchart of a method for establishing an association relationship according to Embodiment 3 of the present invention.
  • FIG. 15 is a flowchart of a friend information adding method of a social network according to Embodiment 5 of the present invention.
  • a user of one social network can automatically add a user in another social network as a friend, and a user in one social network can act on another social network user.
  • the embodiment of the present invention provides a method and system for interworking of a social network. Through the method and system, the user can conveniently operate the account of the user in different social networks. For example, when the client registers the account with different social networks respectively, the data can be shared and synchronized between the accounts of the two social networks.
  • the client can associate accounts of two social networks; or, the client has a user identity ID1 on the first server, and only the associated user identity ID2 on the other server (second server), The client can add users on other servers who have a common interest to themselves as friends to the first server.
  • a method for obtaining a user identifier across a social network is provided, which can be used to obtain a user identifier of the same user in different social networks.
  • the server After receiving the user identifier of the user on other social networks, the server queries and obtains the user identifier of the user in the social network in the association relationship stored by the server or the third-party server.
  • the association relationship records the correspondence between the user identifiers of the same user on different social networks.
  • the server queries and obtains the user identifier of the user in other social networks according to the user identifier of the user in the social network, in the association relationship stored by the server local or the third-party server.
  • the association relationship may be stored in the server and other servers (for example, Converged Address Book (CAB)) that may also be stored in physical/logical.
  • CAB Converged Address Book
  • the foregoing association management may be stored in a third-party server.
  • an interoperability system of a social network is provided, and interoperability between different social networks can be implemented by the system, and information of specified conditions of the same user in other social networks is added to the current login of the user.
  • FIG. 1 is a schematic diagram of an inter-operating system of a social network according to an embodiment of the present invention.
  • the system may include: a first server 10 and a second server 20.
  • the first server 10 belongs to the first social network and the second server 20 belongs to the second social network.
  • the first server 10 is configured to send a first request message to the second server 20; and obtain, according to the association relationship of the user identifiers of the same user in different social networks, the other users queried by the second server 20 are in the first social network.
  • the second server 20 is arranged to query other users who satisfy the conditions specified by the first user.
  • the first server belonging to the first social network sends a first request message to the second server belonging to the second social network, requesting to acquire information of the specified condition of the same user in the second social network, the second server Querying the user identifiers of the other users in the first social network, and the first server adds the acquired user identifiers of the other users in the first social network to the specified list of the first user according to the association relationship of the user identifiers of the same user in different social networks.
  • the same user in the other The information of the specified condition of the social network is added to the account of the social network currently registered by the user, which improves the user experience. The same user registers an account on different social networks.
  • users can associate accounts in different social networks with each other.
  • an association relationship between the identity identifiers of the same user on different social networks may be established, and the association relationship may be stored in the first server 10 and/or the second server 20, or may be stored in a physical/logical third party server. Medium (for example, Converged Address Book (CAB)).
  • CAB Converged Address Book
  • the association management may be stored in a third-party server.
  • the system may further include: a third server 30 configured to store the same user on different social networks. The association of the user ID.
  • the first request message sent by the first server to the second server may include a user identifier of the first user and/or a condition specified by the first user.
  • the user identity of the same user on different social networks may be determined, for example, the user identity of the first user in the second social network (ie, the second user identity).
  • the second server queries other users that meet the conditions specified by the first user according to the queried second user identifier.
  • the second user identifier may be determined by the first server, or may be determined by the second server.
  • the first server 10 may carry the first user identifier of the first user on the first server 10 in the first request message.
  • the second server 20 may search for the association relationship stored by the local or third server, and obtain the second user identifier of the first user in the second social network. Therefore, the first server 10 is further configured to carry the first user identifier of the first user on the first server 10 in the first request message before sending the first request message to the second server 20. The second server 20 is further configured to: if the first request message carries the user identifier of the first user in the first social network, search for the association relationship stored by the local or third server 30, and obtain the first user in the second User ID of the social network.
  • the first server 10 may look up the association relationship stored on the local or third server 30, and obtain the user identifier of the first user in the second social network (second User identifier), carrying the user identifier (second user identifier) of the first user in the second social network in the first request message. Therefore, the first server 10 is further configured to search for the association relationship stored on the local or third server 30 to obtain the user identifier of the first user in the second social network, and carry the user identifier of the first user in the second social network. In a request message.
  • the second server or the first server may be used by the second server.
  • the second server 20 is further configured to query the association relationship stored by the local or third server 30, and acquire other users that meet the specified conditions. a user identifier of a social network; and transmitting the obtained user identifier of the other user in the first social network to the first server 10.
  • the first server 10 is further configured to receive user identifications of other users from the second server 20 on the first social network.
  • the first server 10 queries the user identifiers of the other users in the first social network
  • the first server 10 is further configured to receive the user identifiers of the other users that meet the specified conditions returned by the second server 20; determining the received The user identifier of the other user is not the user identifier of the first social network; and the association relationship stored on the local or third server 30 is searched for, and the user identifier of the other user on the first social network is obtained.
  • the client may send a second request message to the first server, requesting to add other users of the first user on the first server that meet the specified conditions to the first user in the specified list on the second server.
  • the first server 10 is further configured to receive a second request message sent by the client, where the request message requests to add another user that the first user meets the specified condition on the second server 20 to the first user.
  • the client performs timing setting/periodic setting on the first server in advance, and sets other users that meet the specified conditions on the first server periodically or periodically, to the specified list of the first user on the second server.
  • the first server 10 is further configured to add other users who meet the specified conditions on the second server 20 to the specified list of the first user on the first server 10 according to the client preset, timing or periodic. in.
  • FIG. 3 is a flowchart of a method for interworking a social network according to an embodiment of the present invention. As shown in FIG. 3, the method may include the following steps (step S302-step S306): Step S302, the first server is to the second The server sends a first request message, where the first request message includes a user identifier of the first user and/or a condition specified by the first user.
  • Step S304 the second server queries other users that meet the specified conditions.
  • Step S306 The first server acquires the user identifier of the other user that is queried by the second server in the first social network according to the association relationship of the user identifiers of the same user in different social networks, and acquires other users in the first social network.
  • the user ID is added to the specified list of the first user.
  • the first server belongs to the first social network, and the second server belongs to the second social network.
  • the first server belonging to the first social network sends a first request message to the second server belonging to the second social network, requesting to acquire information of the specified condition of the same user in the second social network, the second server Querying the user identifiers of the other users in the first social network, and the first server adds the acquired user identifiers of the other users in the first social network to the specified list of the first user according to the association relationship of the user identifiers of the same user in different social networks.
  • the interoperability between different social networks is realized, and the social network user experience is improved. The above various steps are described in detail below.
  • the first request message sent by the first server to the second server may include a user identifier of the first user and/or a condition specified by the first user.
  • the user identity of the same user on different social networks may be determined, for example, the user identity of the first user in the second social network (ie, the second user identity).
  • the second server queries other users that meet the conditions specified by the first user according to the queried second user identifier.
  • the second user identifier may be determined by the first server or may be determined by the second server.
  • the first server may carry the first user identifier of the first user on the first server In a request message.
  • the association relationship stored by the local or third server may be searched for, and the second user identifier of the first user in the second social network is obtained.
  • the first server may search for an association relationship stored on the local or third server, and obtain a user identifier (second user identifier) of the first user in the second social network. And carrying the user identifier (second user identifier) of the first user in the second social network in the first request message.
  • Step S304 the second server queries other users in the second social network that meet the first user specified condition according to the specified condition of the first user carried in the first request message sent by the first server.
  • the condition specified by the first user may include: a user whose predetermined attribute is a predetermined value, or a friend or blacklist user of the second user in the second social network.
  • the first user registers the first user identity in the first social network
  • the second user identity is registered in the second social network
  • the second server may query the friend information corresponding to the second user identifier of the first user in the second social network, obtain the user identifier of the queried friend in the second social network, and obtain the buddy in the second social network.
  • the user ID in the network is sent to the first server.
  • the second server queries the user identifier of the friend in the first social network according to the association relationship stored in the local or the third server, and queries the friend in the first social network.
  • a user ID of a social network is sent to the first server.
  • Step S306 The first server acquires the user identifier of the other user that is queried by the second server on the first social network according to the association relationship of the user identifiers of the same user on different social networks, and acquires other users in the first social network.
  • the user ID of the network is added to the specified list of the first user.
  • the second server or the first server may be based on the user identifiers of the same user in different social networks.
  • the association relationship querying the user ID of other users in the first social network.
  • the second server queries the user identifier of the other user in the first social network, as shown in FIG.
  • the first server obtains the user identifier of the other user that is queried by the second server on the first social network, and may include the following.
  • steps step S402 - step S406): Step S402, the second server queries the association relationship stored by the local or third server, and obtains the user identifier of the other user in the first social network that meets the specified condition.
  • Step S404 The second server sends the user identifier of the other user in the first social network to the first server.
  • the first server receives the user identifier of the other user from the second server in the first social network. In the case that the first server queries the user identifier of the other user in the first social network, as shown in FIG.
  • the first server obtains the user identifier of the other user that is queried by the second server on the first social network, and may include the following.
  • steps step S502 - step S506: Step S502, the first server receives the user identifier of the other user that the second server returns to meet the specified condition.
  • Step S504 the first server determines that the received user identifier of the other user is not the user identifier of the first social network.
  • the first server searches for an association relationship stored on the local or third server, and acquires a user identifier of the other user on the first social network.
  • one of the first server and the second server may be configured to search for an association relationship stored on the local or third server, and obtain a user identifier of the other user on the first social network.
  • the server or the second server is under heavy load, start an unused server to find the association stored on the local or third server.
  • the first server is configured to query the association relationship.
  • the second server is started to complete the query function according to the setting, and the load balancing is achieved.
  • the first server adds the user identifiers of the other users in the first social network to the specified list of the first user.
  • the first user-specified list may include: a first user's buddy list or blacklist list, or other storage space specified by the first user.
  • the client may send a second request message to the first server, requesting to add another user that meets the specified condition on the second server by the first user, to the first user.
  • the client performs timing setting/periodic setting on the first server in advance, and sets other users that meet the specified conditions on the second server periodically or periodically, to the first The user is in the specified list on the first server.
  • the first server may receive the second request message sent by the client, send the first request message to the second server according to the received second request message, or send the message to the second server periodically or periodically according to the preset setting of the client.
  • the first request message requests the other users who meet the specified conditions on the second server to be added to the specified list of the first user on the first server.
  • an interoperability system of a social network is further provided, and the interoperability between different social networks can be implemented by the system, and the information of the specified condition in the account of the social network that the user is currently logged in is actively pushed to. The account of the user on other social networks.
  • the system may include: a first server 40 and a second server 50.
  • the first server 40 belongs to the first social network and the second server 50 belongs to the second social network.
  • the first server 40 is configured to search for other users that meet the conditions specified by the first user.
  • the second server 50 is configured to acquire other users found by the first server 40 according to the association relationship of the user identifiers of the same user in different social networks.
  • the user identification of the second social network and adding the user identification of the other user to the second social network to the specified list of the first user.
  • the first server belonging to the first social network searches for other users that meet the conditions specified by the first user, and the second server that belongs to the second social network according to the association relationship of the user identifiers of the same user in different social networks.
  • the interoperability between different social networks is realized, and the information of the specified conditions in the account of the social network that the user is currently logged into is actively pushed to the account of the user in other social networks, thereby improving the user experience of the social network.
  • the same user registers an account on different social networks.
  • the accounts of the same user in different social networks can be associated with each other.
  • the association relationship of the user identifiers of the same user in different social networks may be established, and the association relationship may be stored in the first server 10 and/or the second server 20, or may be stored in a physical/logical third party server. (For example, Converged Address Book (CAB)).
  • CAB Converged Address Book
  • the foregoing association relationship may be stored in a third-party server.
  • the system may further include: a third server 60 configured to store the same user on different social networks. The association of the user ID.
  • the first server may query the association relationship stored on the local or third server to obtain the user identifier of the other user in the second social network; or the second server may find the local or third server.
  • the stored association relationship is obtained, and the user identifier of the other user in the second social network is obtained.
  • the first server 40 is further configured to query the association relationship stored on the local or third server 60 to obtain other users in the second social network.
  • the user identifier is sent to the second server by the obtained other user in the second social network.
  • the second server obtains the user identifier of the other user in the second social network
  • the client 50 further configured to receive an identifier of another user that is sent by the first server 40 that meets the specified condition; and is receiving After the identifiers of the other users are determined, the user identifiers of the other users that are received are not the user identifiers of the second social network; the association relationship stored on the local or third server 60 is searched, and the user identifiers of the other users in the second social network are obtained.
  • the client may send a second request message to the first server, requesting to add other users of the first user on the first server that meet the specified conditions to the first user in the specified list on the second server.
  • the first server 40 is further configured to: the receiving client sends a second request message, where the request message requests to add another user of the first user on the first server 40 that meets the specified condition to the first user.
  • the client may perform timing setting/periodic setting on the first server in advance, and set the timing or periodic addition of other users on the first server that meet the specified conditions to the designation of the first user on the second server. List. Therefore, the first server 40 is further configured to: periodically or periodically add other users on the first server 40 that meet the specified conditions to the specified list of the first user on the second server 50 according to a preset of the client. .
  • an interoperability method of another social network is provided, which may be, but is not limited to, an account in a social network that is currently logged in by the user in the inter-operating system of the social network provided by the foregoing embodiment of the present invention.
  • the information specifying the condition is actively pushed to the account of the user on other social networks.
  • FIG. 8 is a flowchart of a method for interworking a social network according to an embodiment of the present invention. As shown in FIG. 8, the method may include the following steps (step S802-step S806): Step S802, the first server searches for the first Other users of a user-specified condition.
  • the client may send a second request message to the first server, requesting to add another user of the first user on the first server that meets the specified condition to the first user's designation on the second server. List.
  • the client performs timing setting/periodic setting on the first server in advance, and sets other users that meet the specified conditions on the first server periodically or periodically, to the specified list of the first user on the second server. in.
  • the first server Upon receiving the second request message sent by the client or according to a preset of the client, the first server searches for other users that satisfy the conditions specified by the first user.
  • the condition specified by the first user may include: a user whose predetermined attribute is a predetermined value, or a friend or blacklist user of the first user at the first server, and the like.
  • the specified list of the first user may include: a buddy list or a blacklist of the first user or other storage space specified by the first user.
  • the first server belongs to the first social network, and the second server belongs to the second social network.
  • the first server may query the association relationship stored on the local or third server to obtain the user identifier of the other user in the second social network; or the second server may find the local or third server.
  • the stored association relationship is obtained, and the user identifier of the other user in the second social network is obtained.
  • the second server acquires the user identifier of the other user found by the first server in the second social network, and may include the following.
  • Step S904 the first server sends the user identifier of the other user in the second social network to the second server.
  • the second server queries the association relationship stored on the local or the third server, as shown in FIG. 10, the second server obtains the user identifier of the other user that is found by the first server in the second social network, and may include the following.
  • steps step S1002 - step S1006:
  • Step S1002 The second server receives the identifier of the other user that is sent by the first server and satisfies the specified condition.
  • Step S1004 The second server determines that the received user identifier of the other user is not the user identifier of the second social network.
  • Step S1006 The second server searches for an association relationship stored on the local or third server, and acquires a user identifier of the other user in the second social network.
  • the association relationship of the user identifiers of the same user in different social networks may be stored in the second server and/or the first server, or may be stored in a physical or logical third server (for example, a converged address). In the book).
  • the association relationship is stored in the third server, so the first server or the second server may query the association relationship in the third server to obtain the first server.
  • the user ID of the other user found in the second social network may be stored in the third server, so the first server or the second server may query the association relationship in the third server to obtain the first server.
  • the user ID of the other user found in the second social network may be stored in the third server, so the first server or the second server may query the association relationship in the third server to obtain the first server.
  • Step S806 the second server adds the user identifier of the other user in the second social network to the specified list of the first user.
  • the first server belonging to the first social network searches for other users that meet the conditions specified by the first user, and the second server that belongs to the second social network according to the association relationship of the user identifiers of the same user in different social networks. Obtaining the user identifier of the other user found by the first server in the second social network, and adding the user identifier of the other user in the second social network to the specified list of the first user.
  • FIG. 11 is a schematic diagram of an inter-operating system of a social network according to Embodiment 1 of the present invention.
  • the system includes: a client 70, a first server 80, and a second server 90.
  • the client 70 is configured to send a first message to the first server 80.
  • the first server 80 is configured to manage the first message sent by the client 70, and generate a second message according to the first message, to the second server 90.
  • the client 70 sends a second message, and manages the third message sent by the second server 90, and generates a fourth message according to the third message, and sends a fourth message to the client 70;
  • the second server 90 is set to manage The second message sends a third message to the first server 80 or the client 70.
  • the second server 90 can be a single server or a physical/logical set of servers.
  • the foregoing management includes at least one of receiving, generating, converting, querying, obtaining, storing, forwarding, associating, and the like.
  • an interworking method of a social network is also provided, and interoperation between different social networks may be implemented in the system of the foregoing embodiment of the present invention.
  • FIG. 12 is a flowchart of a method for interworking a social network according to Embodiment 2 of the present invention.
  • the method includes the following steps S1202 to S1220.
  • the first message includes at least a user identity (ID); preferably, the first message may further include the following information or a subset of information: a user identifier ( US er id en tity), first name, Nickname, postal address, phone number, hobbies, friend preferences, religion, buddy list, political beliefs, past work experience, learning experience, SNs information that clients need to associate.
  • ID user identity
  • a user identifier US er id en tity
  • Step S1204 the first server sends a first response message to the client.
  • Step S1206 The first server manages the first message sent by the client, and generates a second message.
  • the second message is a management result message that the first server uses the first message as a condition.
  • Step S1208 The first server sends a second message to the client or the second server.
  • Step S1210 the client or the second server sends a second response message to the first server.
  • Step S1212 The second server manages the second message, generates a third message, and sends a third message to the client or the first server.
  • the third message is a management result message that the second server uses the second message as a condition. .
  • Step S1214 the client or the first server sends a third response message to the second server.
  • Step S1216 The first server manages the third message, and generates a fourth message.
  • the fourth message is a management result message that the first server uses the third message as a condition.
  • Step S1218 The first server sends a fourth message to the client.
  • Step S1220 (Optional), the client sends a fourth response message to the first server.
  • the foregoing management of the embodiment of the present invention includes at least one of the following: receiving, generating, converting, querying, acquiring, storing, forwarding, associating, and the like.
  • Embodiment 3 The embodiment of the present invention can solve the following problem: when a client registers an account with different social networks and wants to share data, synchronize data, or migrate data between accounts of two social networks, the client needs to associate two SN's account.
  • the client has its own independent user identity in SN1 and SN2, respectively SN1_ID1 and SN2JD1, and stores the associated account identity in the associated information table.
  • 13 is a flowchart of a method for establishing an association relationship according to Embodiment 3 of the present invention. As shown in FIG. 13, the method may include the following steps (Step S1302 - Step S1308): Step S1302, the client logs in to SN1 with SN1_ID1 (First Server), and carry the SN that needs to be associated
  • Step S1304 The SN1 generates an association request according to the message sent by the client, and forms a second message with the identity identifier (SN2JD1) to be associated, and sends the second message to the SN2.
  • the information carried in the second message is shown in Table 2. Table 2.
  • the second message association request needs to be associated with the identity SN2 ID1.
  • Step S1306, SN2 performs an association action, and stores the correspondence between the SN1 ID1 and the SN2 ID1 - the association information table (the association information table is as shown in Table 3 below), and the association is successful.
  • Message third message
  • the associated error message third message
  • SN2_IDx in the association information table represents SN2_IDx in SN2, which is associated with SNx_IDz in SNx; where, represents the omitted association; SN2_ID1 represents SN2_ID1 in SN2, which is associated with SNy_Ida and SNy_IDb in SNy, and with SM
  • the SN1_ID1 in the SN1_ID1 is associated; the left side is the ID in the SN, the right side is the associated ID and the social network, and the left and right sides are one-to-many relationships, that is, an ID in the SN can be associated with multiple SNs. ID.
  • Step S1308 After receiving the message of successful association, SN1 stores the correspondence relationship between SN1_ID1 and SN2_ID1 (the association information table is as shown in Table 4 below), and returns the association result information (fourth message) to the client. Table 4.
  • SNl_IDx in the association information table represents SNl_IDx in SN1, which is associated with SNz_IDx in SNz; where, represents the omitted association; SN1_ID1 represents SN1_ID1 in SN1, which is associated with SNaJDp and SNa_IDq in SNa, and with SN2
  • the SN2_ID1 is associated; the left side is the ID in the SN, the right side is the associated ID and the social network, and the left and right sides are one-to-many relationships, that is, an ID in the current SN can be associated with multiple SNs. ID.
  • the association information table may also be stored in a physical/logical third party server (such as a Converged Address Book, CAB) for interworking between social networks. use.
  • the associated information table stored in the third party server can be as shown in Table 5 below.
  • the first column in the associated information table indicates: The association related to the account User_x, that is, the SN1_IDx of the account User_x in SN1 is associated with SN2_IDy in SN2.
  • the second row in the table indicates that Account A's SN1_ID1 in SN1 is associated with SN2_ID1 in SN2, representing the ID associated in other social networks. table 5.
  • Embodiment 4 The embodiment of the present invention can solve the following problem:
  • the client has the user identity ID1 on the SN1, and only the associated user identity ID2 in the other SN (SN2), the client wants to add another SN (SN2) ) Users who have a common interest in themselves are friends to SN1.
  • the method includes the following steps: Step S1402: The client sends the friend preference information and/or the associated SN (SN2) (first message) to the SN1 server (first server).
  • the client logs in to SN1 with ID1 and specifies his or her own friends preferences.
  • Step S1404 The SN1 server queries the SN (SN2) associated with the client (for example, the query association information table), and sends the ID (ie, ID2) associated with the ID1 and/or the friend preference information (the second message) to the other SN.
  • Server (SN2) second server.
  • the other SNs (SN2) generate recommended friend information (third message) according to the friend preference information, and send it to SN1.
  • the ID in the recommended friend information is the ID in the other SN (SN2), that is, the social network in which the SN2 is located, and has the identity of the user recorded in the friend preference information.
  • the friend information is recommended, including at least the identity (ID) of the user.
  • Recommended friend information can also include the following information: name, nickname, postal address, phone number, other social network ID, hobbies, friend preferences, religious beliefs, political beliefs, past work experience, learning experience, etc.
  • Step S1408 If the IDs of the two social networks are the same, the SN1 sends the friend information directly to the client.
  • a third-party server such as a CAB
  • Step S1401 The client sends the friend preference information and/or the associated SN (SN1) (first message) to the SN2 server.
  • the client logs in to SN2 with ID2 and sends friend preferences to it.
  • the ID in the recommended friend information is the ID in the other SN (SN2), that is, the social network in which the SN2 is located, and has the identity of the user recorded in the friend preference information.
  • step S1405 the IDs of the two social networks are the same, and the SN1 saves the friend information.
  • the SN1 can directly send the friend information to the client.
  • the IDs of the two social networks are inconsistent, and the SN1 obtains the ID recorded in the social network where the SN1 is located and the recommended buddy information in the recommended buddy information, or obtains a matching ID by querying a third-party server (such as a CAB). If the query is successful, the matching ID is saved along with the information of the recommended friend.
  • the SN1 can send the information to the client (fourth message), otherwise the unrecommended prompt information is returned. After the client receives the friend information, it can be processed later.
  • Embodiment 5 The embodiment of the present invention can solve the following scenario: The client has an identity (ID1) in a social network (SN1), and the client registers a new identity (ID2) in another social network (SN2). ID1 and ID2 are associated, and the friend information in SN1 is added to the new social network (SN2) without adding one by one.
  • the method may include the following steps: Step S1502: A client accesses SN2 (first server), and specifies a source SN (SN1) to which friend information needs to be added.
  • Step S1504 The SN2 sends a request for acquiring a friend information (second message) to the source SN (SN1) (the second server), where the request carries the identity (ID2) of the social network to which the user belongs in the SN2.
  • the SN1 queries the association relationship between the identity identifiers of the same user on different social networks, and obtains the identity identifier (ID1 in this embodiment) that matches the ID2 in the social network to which the SN1 belongs, and the SN1 obtains the identity identifier saved in the server as ID1.
  • the friend information of the user, and the friend information is sent to the SN2.
  • the SN2 may first query the association relationship of the identity identifiers of the same user in different social networks, and obtain the identity identifier matching the ID2 in the social network to which the SN1 belongs. (ID1 in this embodiment), the ID1 is carried in the second message and sent to the SN1.
  • the SN1 After receiving the request, the SN1 obtains the friend information of the user whose identity is ID1 saved in the server, and sends the friend information. Give SN2.
  • the Friend information records the ID in the social network where the SN1 is located.
  • Step S1508 If the IDs of the two social networks are the same, the SN2 sends the friend information directly to the client.
  • Step S1510 If the IDs of the two social networks are different, the SN2 obtains the SN2 by querying a third-party server (such as a CAB) by querying the association relationship of the same user's identity of different social networks stored locally. The ID of the social network in which it matches the ID recorded in the received friend information.
  • a third-party server such as a CAB
  • Step S1501 The client accesses the SN1 (first server), and specifies that the friend information needs to be sent to the associated destination SN (SN2) (first message).
  • Step S1503, SN1 sends friend information (second message) to the destination SN (SN2) (second server).
  • step S1505 the IDs of the two social networks are the same, and the destination SN (SN2) saves the friend information.
  • the SN2 can directly send the friend information to the client.
  • the IDs of the two social networks are inconsistent, and the destination SN (SN2) obtains the association relationship between the identity identifiers of the same users stored in different social networks, and queries the third-party server (such as CAB) to obtain the social network in which the SN2 is located.
  • the ID of the ID recorded in the received friend information. If the query is successful, the matching ID is saved in association with the information of the recommended friend.
  • the SN2 may directly send the friend information to the client (fourth message), otherwise the query may not be returned. Recommended tips.
  • the present invention achieves the following technical effects:
  • the first server belonging to the first social network sends a first request message to the second server belonging to the second social network, requesting to acquire the same
  • the user in the second social network meets the specified condition information
  • the second server queries the user identifiers of the other users in the first social network
  • the first server acquires other users according to the association relationship of the user identifiers of the same user in different social networks.
  • the user identifier of the first social network is added to the specified list of the first user, and information for specifying conditions of the same user on other social networks is added to the account of the social network that the user is currently logged into.
  • the first server belonging to the first social network searches for other users that meet the conditions specified by the first user, and the second server belonging to the second social network obtains the first relationship according to the association relationship of the user identifiers of the same user in different social networks.
  • the user identification of the other users found by the server in the second social network, and the user identifiers of the other users in the second social network are added to the specified list of the first user.
  • the interoperability between different social networks is realized, and the information of the specified conditions in the account of the social network that the user is currently logged into is actively pushed to the account of the user in other social networks, thereby improving the user experience of the social network.
  • modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps are fabricated as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.
  • the above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

La présente invention concerne un procédé et un système d'interopérations de réseaux sociaux. Le procédé consiste en ce que : un premier serveur émet un premier message de demande à un second serveur, le premier message de demande comprenant un identifiant d'utilisateur d'un premier utilisateur et/ou une condition spécifiée par le premier utilisateur ; le second serveur recherche un autre utilisateur satisfaisant la condition spécifiée ; selon une relation d'association des identifiants d'utilisateur d'un même utilisateur dans différents réseaux sociaux, le premier serveur obtient l'identifiant d'utilisateur de l'autre utilisateur, trouvé par le second serveur, dans un premier réseau social, et ajoute l'identifiant d'utilisateur obtenu de l'autre utilisateur dans le premier réseau social à une liste spécifiée par le premier utilisateur, le premier serveur faisant partie du premier réseau social tandis que le second serveur fait partie d'un second réseau social. La présente invention permet de réaliser une interopération entre différents réseaux sociaux de sorte que des utilisateurs ayant des comptes dans différents réseaux sociaux puissent effectuer de manière pratique une interopération entre les comptes, améliorant de cette façon le confort d'utilisation des réseaux sociaux.
PCT/CN2012/071347 2011-12-12 2012-02-20 Procédé et système d'interopérations de réseaux sociaux WO2013086800A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201110411271.2 2011-12-12
CN201110411271.2A CN103166828B (zh) 2011-12-12 2011-12-12 社交网络的互操作方法及系统

Publications (1)

Publication Number Publication Date
WO2013086800A1 true WO2013086800A1 (fr) 2013-06-20

Family

ID=48589579

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/071347 WO2013086800A1 (fr) 2011-12-12 2012-02-20 Procédé et système d'interopérations de réseaux sociaux

Country Status (2)

Country Link
CN (1) CN103166828B (fr)
WO (1) WO2013086800A1 (fr)

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104348824B (zh) * 2013-08-09 2018-07-20 深圳市腾讯计算机系统有限公司 关联网络帐号的方法和系统
CN104378395B (zh) 2013-08-14 2019-02-05 华为技术有限公司 访问ott应用、服务器推送消息的方法及装置
CN104574192B (zh) * 2013-10-25 2021-01-15 华为技术有限公司 在多个社交网络中识别同一用户的方法及装置
US9589122B2 (en) 2013-11-19 2017-03-07 Tencent Technology (Shenzhen) Company Limited Operation processing method and device
CN104660557B (zh) * 2013-11-19 2018-11-02 腾讯科技（深圳）有限公司 操作处理方法和装置
WO2015149338A1 (fr) * 2014-04-03 2015-10-08 吉瑞高新科技股份有限公司 Procédé et système d'interaction d'informations pour cigarette électronique
CN105450498B (zh) * 2014-08-08 2018-09-28 华为技术有限公司 一种用户关系管理方法及装置
CN104866946B (zh) * 2015-04-03 2018-06-26 宁波亿拍客网络科技有限公司 一种不同系统用户账号共享的方法
CN106897602B (zh) * 2015-12-21 2021-06-11 北京奇虎科技有限公司 账号推荐方法和装置
CN107896235B (zh) * 2016-09-29 2021-01-29 腾讯科技（深圳）有限公司 信息推送方法、装置、网络接入设备、终端及社交服务器
CN108353019B (zh) * 2016-11-03 2021-06-22 华为技术有限公司 一种关联用户的方法、终端和服务器
CN108228303B (zh) * 2018-01-31 2022-04-12 阿里巴巴（中国）有限公司 关联账户的更新方法及装置
CN108494659A (zh) * 2018-02-07 2018-09-04 朱杨玉 一种不同社交软件间数据推送方法和系统
CN108965107B (zh) * 2018-06-22 2021-03-16 腾讯科技（深圳）有限公司 好友添加方法、装置、系统、客户端和服务器
CN109688227B (zh) * 2019-01-11 2021-02-02 腾讯科技（深圳）有限公司 信息推送方法
CN110599358B (zh) * 2019-07-10 2021-05-04 杭州师范大学钱江学院 一种基于概率因子图模型的跨社交网络用户身份关联方法

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101039284A (zh) * 2006-03-16 2007-09-19 腾讯科技（深圳）有限公司 一种向群组发送即时消息的方法
CN101656947A (zh) * 2009-09-28 2010-02-24 中国电信股份有限公司 跨异构网络业务共享建立方法、设备及系统
CN101981590A (zh) * 2008-03-31 2011-02-23 雅虎公司 利用社交网络访问受信任的用户生成的内容

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9697527B2 (en) * 2008-01-10 2017-07-04 International Business Machines Coproration Centralized social network response tracking
US9183513B2 (en) * 2008-05-27 2015-11-10 Intel Corporation Aggregration, standardization and extension of social networking contacts to enhance a television consumer experience
CN102195957B (zh) * 2010-03-19 2014-03-05 华为技术有限公司 一种资源共享方法、装置及系统

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101039284A (zh) * 2006-03-16 2007-09-19 腾讯科技（深圳）有限公司 一种向群组发送即时消息的方法
CN101981590A (zh) * 2008-03-31 2011-02-23 雅虎公司 利用社交网络访问受信任的用户生成的内容
CN101656947A (zh) * 2009-09-28 2010-02-24 中国电信股份有限公司 跨异构网络业务共享建立方法、设备及系统

Also Published As

Publication number Publication date
CN103166828A (zh) 2013-06-19
CN103166828B (zh) 2017-03-15

Similar Documents

Publication Publication Date Title
WO2013086800A1 (fr) Procédé et système d'interopérations de réseaux sociaux
US8954494B2 (en) Method and system for synchronizing operations of multiple groups
RU2495535C2 (ru) Система, способ и клиент для присоединения к группе
WO2009074037A1 (fr) Procédé, dispositif et système de communication instantanée
KR102079892B1 (ko) 비동기 메시징 시스템에서의 단일 계정에 대한 다수 프로파일의 관리
WO2014090081A1 (fr) Procédé pour devenir membre d'un groupe, procédé, client, serveur et système d'établissement de groupe
JP2012529703A (ja) ソーシャルネットワーク内で認証要求メッセージを送信するための方法および装置
CN112073295B (zh) 一种为第三方应用提供群组服务的方法及系统
AU2013397053B2 (en) Content sharing method and social synchronization apparatus
CN102801691A (zh) 联系人信息的获取方法及装置
TW201202957A (en) Automatically synchronizing new contacts across multiple social networking sites
WO2013026325A1 (fr) Procédé de recherche de personne, dispositif, et support de mémorisation
KR20090017629A (ko) 프레즌스 서버의 사용자 상태 원격 업데이트
WO2013053280A1 (fr) Procédé pour la mise à jour de carnet d'adresses et plate-forme de gestion de carnet d'adresses de groupe
US20130073629A1 (en) System and Method for Friend Recommendation in Social Network Service Network
WO2014012424A1 (fr) Procédé et système pour exécuter des communications, et support de stockage informatique
WO2013007084A1 (fr) Procédé de recherche de chemin de contact, système et serveur de recherche
KR100958936B1 (ko) 메신저에서 확장된 대화 상대 리스트 및 강화된 대화기능을 제공하기 위한 방법 및 컴퓨터 판독 가능한 기록매체
CN112073297B (zh) 一种为第三方应用提供社交应用服务的方法及服务端
CN105228024A (zh) 机顶盒用户交互方法
JP2015230532A (ja) Ｗｅｂ会議システム、Ｗｅｂ会議システムの主催者権限の委譲方法及びＷｅｂ会議システムプログラム
WO2012129832A1 (fr) Procédé et dispositif pour acquérir des informations de contact
WO2012155652A1 (fr) Procédé de télécommunication, élément filet et système de réseaux sociaux croisés
US20140244656A1 (en) Trans-community search method and apparatus
US20160295501A1 (en) Method for providing community service based on proximity

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12857020

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12857020

Country of ref document: EP

Kind code of ref document: A1