CN112667916A - Information pushing method, social server and machine-readable storage medium - Google Patents
Information pushing method, social server and machine-readable storage medium Download PDFInfo
- Publication number
- CN112667916A CN112667916A CN201910944291.2A CN201910944291A CN112667916A CN 112667916 A CN112667916 A CN 112667916A CN 201910944291 A CN201910944291 A CN 201910944291A CN 112667916 A CN112667916 A CN 112667916A
- Authority
- CN
- China
- Prior art keywords
- social
- users
- target user
- social information
- target
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 53
- 230000008569 process Effects 0.000 description 19
- 230000006854 communication Effects 0.000 description 10
- 238000004891 communication Methods 0.000 description 9
- 238000012545 processing Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000007499 fusion processing Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Abstract
The embodiment of the application provides an information pushing method, a social server and a machine-readable storage medium, wherein the method comprises the following steps: after the L users successfully establish the friend relationship, at least one target user which sends social information in a specified social space is obtained from the L users; l is greater than 1; and for each target user, pushing at least one piece of social information sent by the target user in the specified social space to other users except the target user in the L users, wherein the social information sent by the target user in the specified social space is used for knowing the target user. To enable efficient instant messaging between users.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to an information pushing method, a social server, and a machine-readable storage medium.
Background
With the development of computer and network technologies, users can establish a friend relationship through instant messaging application to interact with each other. There are many applications of instant messaging, such as microblog, wechat, etc., and the application is not limited in particular.
However, when a friend relationship is established through an instant messaging application, users do not necessarily know each other, and it is difficult to immediately develop effective topic communication, which affects instant messaging between users.
Disclosure of Invention
The application provides an information pushing method, a social server and a machine-readable storage medium, so as to realize effective instant messaging among users.
In order to achieve the above purpose, the present application provides the following technical solutions:
in a first aspect, an embodiment of the present application provides an information pushing method, which is applied to a social server, and includes:
after the L users successfully establish the friend relationship, at least one target user which sends social information in a specified social space is obtained from the L users; l is greater than 1;
and for each target user, pushing at least one piece of social information sent by the target user in the specified social space to other users except the target user in the L users, wherein the social information sent by the target user in the specified social space is used for knowing the target user.
As an embodiment, the pushing, to the other users than the target user in the L users, at least one piece of social information sent by the target user in the specified social space includes:
sending danger prompt information to other users except the target user in the L users;
and after the danger prompt information is successfully sent, pushing at least one piece of social information sent by the target user in the specified social space to other users except the target user in the L users.
As an embodiment, the pushing, to the other users than the target user in the L users, at least one piece of social information sent by the target user in the specified social space includes:
and when detecting that the target user communicates with at least one other user except the target user in the L users, pushing at least one piece of social information sent by the target user in the specified social space to the at least one other user except the target user in the L users.
As an embodiment, the pushing, to the other users than the target user in the L users, at least one piece of social information sent by the target user in the specified social space includes:
and detecting whether the target user sends at least one piece of social information in the specified social space after establishing the friend relationship, and pushing at least one piece of social information sent by the target user in the specified social space to other users except the target user in the L users.
As an embodiment, the pushing, to the other users than the target user in the L users, at least one piece of social information sent by the target user in the specified social space includes:
generating target social information according to at least one piece of social information sent by the target user in the specified social space;
and pushing the target social information to other users except the target user in the L users.
As an embodiment, the generating target social information according to at least one piece of social information sent by the target user in the specified social space includes:
acquiring all social information sent by a target user in the specified social space within a preset time period;
and generating N pieces of target social information according to all the obtained social information, wherein N is more than or equal to 1.
As an embodiment, the generating N pieces of target social information according to all the obtained social information includes:
selecting N pieces of social information meeting set conditions from all the obtained social information;
determining the selected N social messages as the N target social messages.
As an embodiment, the selecting N pieces of social information satisfying a set condition from all the obtained social information includes:
selecting N pieces of social information closest to the current time from all the obtained social information according to the time sequence; alternatively, the first and second electrodes may be,
and selecting N pieces of social information which is closest to the current time and is customized for the target user from all the obtained social information according to the time sequence.
As an embodiment, the generating N pieces of target social information according to all the obtained social information includes:
dividing all the obtained social information into N groups, wherein the number of the social information included in each group is less than or equal to M, and M is greater than 1;
fusing the social information of each group to obtain fused social information corresponding to each group;
and determining the N groups of corresponding fused social information as the N target social information.
As an embodiment, the pushing the target social information to the other users except the target user in the L users includes:
for each user except the target user in the L users, checking whether the user communicates with the target user through a private chat window;
if so, pushing the target social information to the user through the private chat window;
and if not, pushing the target social information through a group chat window containing the L users.
As an embodiment, the pushing the target social information to the other users except the target user in the L users includes:
for each user except the target user in the L users, checking whether the user communicates with the target user through a private chat window;
if so, pushing the target social information to the user through the private chat window;
and if not, triggering to establish a private chat window between the user and the target user, and pushing the target social information through the established private chat window.
As an embodiment, the pushing the target social information to the other users of the L users except the target user further includes:
pushing the user attribute information of the target user to other users except the target user in the L users, wherein the user attribute information at least comprises: the nickname and signature information of the target user.
As an embodiment, the specified social space is a set friend circle or friend circle.
As an embodiment, the social information is at least one of a picture, a text, and a video.
In a second aspect, an embodiment of the present application provides a social server, including: one or more processors; a machine-readable storage medium for storing one or more computer-readable instructions which, when executed by one or more processors, cause the one or more processors to implement any of the information pushing method steps of the first aspect described above.
In a third aspect, an embodiment of the present application provides a machine-readable storage medium, where a program is stored, and when the program is executed by a processor, the method implements any of the steps of the information pushing method in the first aspect.
According to the embodiment, when the friend relationship is established between the users, the social server pushes the social information of other users establishing the friend relationship with the users to the users, so that the users can know the friends based on the pushed social information, and the effective instant communication between the users is realized.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic diagram of a system architecture according to an embodiment of the present application;
fig. 2 is an implementation flow of an information recommendation method shown in an embodiment of the present application;
FIG. 3 is a flowchart illustrating an implementation of step 202 according to an embodiment of the present application;
FIG. 4 is a flowchart illustrating an implementation of step 202 according to an embodiment of the present application;
FIG. 5 is a flowchart illustrating an implementation of step 401 according to an embodiment of the present application;
FIG. 6 is a flowchart illustrating an implementation of step 502 according to an embodiment of the present application;
FIG. 7 is a flowchart illustrating an implementation of step 502 according to an embodiment of the present application;
FIG. 8 is a flowchart illustrating an implementation of step 402 according to an embodiment of the present application;
FIG. 9 is a flowchart illustrating an implementation of step 402 according to an embodiment of the present application;
fig. 10 is a schematic structural diagram of an information pushing apparatus according to an embodiment of the present application;
fig. 11 is a hardware structural diagram of a social server according to an embodiment of the present disclosure.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.
The terminology used in the embodiments of the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the embodiments of the present application. As used in the examples of this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It should be understood that although the terms first, second, third, etc. may be used in the embodiments of the present application to describe various information, the information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, the negotiation information may also be referred to as second information, and similarly, the second information may also be referred to as negotiation information without departing from the scope of the embodiments of the present application. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
Referring to fig. 1, a system architecture diagram is shown for the embodiment of the present application.
As shown in FIG. 1, system architecture 100 may include devices 101, network 102, devices 103-105. Network 102 is a medium for providing communication links between devices 101, 103-105. Network 102 may include various connection types, such as wired, wireless links, or fiber optic cables.
In practice, a device may provide a respective network service by installing a respective client application or server application. After the device has installed the client application, it may be embodied as a client in network communications. Accordingly, after the server application is installed, it may be embodied as a server in network communications.
For example, in FIG. 1, the device 101 may be referred to as a server, and the devices 103-105 may be referred to as clients. The devices 103-105 may each have an instant messaging application installed so that users using the devices 103-105 can conduct instant messaging.
It will be understood that the number of networks and devices in fig. 1 is merely illustrative. The system architecture 100 may include any number of networks and devices, as desired for an implementation.
Referring to fig. 2, an implementation flow of an information recommendation method shown in the embodiment of the present application is shown. The process applies to a social server. In one example, the social server may be the device 101 shown in fig. 1.
As shown in fig. 2, the process may include the following steps:
in step 201, after the L users successfully establish the friend relationship, the social server obtains at least one target user who has sent social information in a specified social space from the L users.
The social server receives a request sent by a user for requesting to add a friend. Here, the party that transmits the request is referred to as the requesting party, and the party that requests is referred to as the requested party. The social server forwards the request sent by the requesting party to the requested party. And if the requested party agrees to add the friend, replying the message of agreeing to add the friend. And the social server confirms that the requesting party and the requested party successfully establish the friend relationship based on the received friend adding agreement message of the requested party.
Once the L users successfully establish the friend relationship, the users can perform instant messaging with each other.
In one example, L may be 2. And when the L is 2, indicating that 2 users successfully establish the friend relationship. For example, Zhang three and Li four can establish a friend relationship by adding friends to each other. It should be noted that, for convenience of description, when L is 2, 2 users can successfully establish a friend relationship to be recorded as a private chat friend relationship. And the window for instant messaging between the 2 users may be referred to as a private chat window.
In another example, L may be greater than 2. And when the L is larger than 2, the friend relationship is successfully established by a plurality of users. For example, Zhang three, Li four and Wang five can establish friend relationship by joining the same group. It should be noted that, for convenience of description, when L is greater than 2, a plurality of users successfully establishing a friend relationship may be recorded as a group chat friend relationship. And the window for instant messaging between the plurality of users may be referred to as a group chat window.
After determining that the L users successfully establish the friend relationship, the social server detects whether a user (hereinafter referred to as a target user) who has sent social information in a specified social space exists in the L users. And acquiring at least one target user which sends social information in the designated social space in the L users.
For example, if the social server determines that the third Zhang and the fourth Li have successfully established the friend relationship, it is detected whether the third Zhang and the fourth Li have sent social information in the specified social space. In one example, if Zhang III is detected to send social information, Zhang III is determined to be a target user; and if the detected LiIV also sends the social information, determining that the LiIV is also the target user. In another example, if Zhang III is detected to send social information, Zhang III is determined to be the target user; and if the fourth plum is detected not to send the social information, determining that the fourth plum is not the target user.
As one embodiment, the designated social space may be a friend circle or a friend circle.
As an example, the social information may be customized social information sent by the target user in a specified social space, or forwarded social information of interest to the target user. The target user can be known through the social information sent by the target user.
As one example, the social information may be at least one of a picture, text, video, and the like.
In step 202, the social server pushes, for each target user, at least one piece of social information sent by the target user in a specified social space to other users except the target user in the L users.
As described above, the target user is a user who has sent social information among the L users. At least one target user exists in the L users.
The social server performs the following processing for each target user: and pushing at least one piece of social information sent by the target user to other users except the target user in the L users.
For example, a friend relationship has been established between zhang san and lie si, and the social server determines that zhang san and lie si are both target users. And aiming at Zhang III as a target user, the social server pushes at least one piece of social information sent by Zhang III to Li IV. And aiming at the fourth Li as a target user, the social server pushes at least one piece of social information sent by the fourth Li to the third Li. Therefore, Zhang III and Li IV can know the other side according to the social information of the other side, and the two sides can effectively communicate in real time.
So far, the description of the flow shown in fig. 2 is completed.
As can be seen from the flow shown in fig. 2, in this embodiment, when a friend relationship is initially established between users, the social server pushes social information of other users who establish a friend relationship with the users, so that the users can know about friends based on the pushed social information, thereby implementing effective instant messaging between users.
In one embodiment, referring to fig. 3, a flow of implementing step 202 is shown for an embodiment of the present application.
As shown in fig. 3, the process may include the following steps:
in step 301, the social server sends danger prompt information to other users except the target user among the L users.
After the social server detects that the L users establish the friend relationship, in order to reduce the security risk, the social server sends danger prompt information to other users except the target user in the L users.
The danger prompt information is used for reminding the user of possible risks, cautions and the like in the instant communication process. For example, the danger prompting message may be: please not reveal important information such as your mobile phone number, bank card and the like in chatting; accost to strangers to keep caution and not easily accept stranger's meeting invitation ".
Step 302, after the social server successfully sends the danger prompt information, the social server pushes at least one piece of social information sent by the target user in the designated social space to other users except the target user in the L users.
The flow shown in fig. 3 is completed.
As can be seen from the flow shown in fig. 3, in this embodiment, after determining that L users have successfully established a friend relationship and have successfully pushed danger-prompting information, the social server pushes social information of the target user to other users who have established a friend relationship with the target user. So that other users can safely and effectively communicate with the target user in real time based on the received danger prompt information and the social information of the target user.
In an embodiment, in step 202, the process of the social server pushing, to other users than the target user in the L users, at least one piece of social information sent by the target user in the specified social space may specifically be: and the social server detects that the target user is communicated with at least one other user except the target user in the L users, and pushes at least one piece of social information sent by the target user in the designated social space to the at least one other user except the target user in the L users.
Here, in an actual application scenario, a friend relationship is established between users, but instant messaging is not performed. For such a situation, if the social information is pushed immediately, the meaning is not great. Therefore, in the embodiment, the social server pushes the social information of the target user to other users in the process of instant messaging between the target user and other users, so as to ensure the validity of pushing the social information.
In an embodiment, in step 202, the process of the social server pushing, to other users than the target user in the L users, at least one piece of social information sent by the target user in the specified social space may specifically be: the social server detects whether the target user sends at least one piece of social information in the specified social space after the target user establishes the friend relationship, and pushes the at least one piece of social information sent by the target user in the specified social space to other users except the target user in the L users.
Here, it should be noted that in this embodiment, after the target user establishes the friend relationship, the social server detects social information sent by the target user. And the social information sent by the target user is timely pushed to other users establishing friend relationships with the target user. And other users can carry out timely and effective instant communication with the target user based on the latest social information of the target user.
In one embodiment, referring to fig. 4, a flow of implementing step 202 is shown for an embodiment of the present application.
As shown in fig. 4, the process may include the following steps:
step 401, the social server generates target social information according to at least one piece of social information sent by the target user in the specified social space.
After the social server determines the target user through step 201, at least one piece of social information sent by the target user may be obtained from the specified social space.
And the social server generates target social information of the target user according to the acquired at least one piece of social information of the target user. Here, the target social information is named for convenience of description only and is not limited.
The process of generating the target social information by the social server is described below, and is not repeated here.
In step 402, the social server pushes the target social information to other users of the L users except the target user.
In this embodiment, the target social information is social information that is finally determined by the social server and pushed to other users.
The flow shown in fig. 4 is completed.
As can be seen from the flow shown in fig. 4, in this embodiment, the social server needs to process at least one piece of social information sent by the target user to obtain the target social information. And sending the target social information to other users establishing friend relationships with the target user. So that other users can perform instant communication with the target user based on the processed target social information.
In one embodiment, referring to fig. 5, an implementation flow of step 401 is shown in an embodiment of the present application.
As shown in fig. 5, the process may include the following steps:
step 501, a social server acquires all social information sent by a target user in a specified social space within a preset time period.
The social information sent by the target user in the designated social space may be many and the amount of information is large. If the social server obtains all the social information sent by the target user, the processing performance of the social server is affected. For this reason, in this embodiment, the social server obtains the social information sent by the target user in the specified social space within the preset time period.
As an example, the preset time period is generally a period of time from the current time. Such as within the last week. To reduce the processing pressure of the social server.
Step 502, the social server generates N target social messages according to all the obtained social messages.
Here, N is 1 or more. The specific value of N can be set according to actual requirements. This is not a limitation of the present application.
After acquiring all the social information sent by the target user within the preset time period through step 501, the social server processes the social information to obtain N target social information.
The process of generating N pieces of target social information by the social server is described below, and is not described here again.
The flow shown in fig. 5 is completed.
As can be seen from the flow shown in fig. 5, in this embodiment, the social server narrows down the selection range of the social information by obtaining the social information sent by the target user within the preset time period. The target social information is determined based on the social information with the reduced range, so that the processing pressure of the social server can be effectively reduced, and meanwhile, the pushing efficiency of the target social information can be improved.
In one embodiment, referring to fig. 6, a flow of implementing step 502 is shown for an embodiment of the present application.
As shown in fig. 6, the process may include the following steps:
in step 601, the social server selects N pieces of social information satisfying a set condition from all the acquired social information.
As mentioned above, the social server has obtained all social information sent by the target user within a preset time period (e.g., within the last week) through step 501. However, the social information obtained may still be much. For this reason, in the present embodiment, the social server further processes the social information obtained through step 501.
As an embodiment, in this step, the social server may select, according to the chronological order, N pieces of social information closest to the current time from all the social information acquired in step 501. The N pieces of social information closest to the current time can better reflect the latest state of the target user.
As another embodiment, in this step, the social server may select, according to the chronological order, N pieces of social information that are closest to the current time and are customized for the target user from all the social information acquired in step 501. As previously described, the social information sent by the target user includes customized social information and forwarded social information of other users. In this example, the customized social information of the target user is prioritized, so that the self-state of the target user can be more reflected.
In step 602, the social server determines the selected N social information as N target social information.
In this embodiment, the social server directly takes the selected N pieces of social information as the N pieces of target social information.
The flow shown in fig. 6 is completed.
As can be seen from the flow shown in fig. 6, in this embodiment, the social server further filters the obtained social information of the target user, and directly sends the selected social information as the target social information to other users who establish a friend relationship with the target user.
In one embodiment, referring to fig. 7, an implementation flow of a step 502 is shown in an embodiment of the present application.
As shown in fig. 7, the process may include the following steps:
in step 701, the social server divides all the obtained social information into N groups, and the number of the social information included in each group is less than or equal to M.
As described above, the amount of social information of the target user obtained by the social server through step 501 is still large. For this reason, in this embodiment, the social server needs to process the social information acquired in step 501.
In this step, the social server divides all the social information acquired in step 501 into N groups, and the number of the social information included in each group is less than or equal to M. Wherein M is greater than 1. The specific value of M may be set according to actual needs, which is not limited in this application.
Step 702, the social server fuses the social information of each group to obtain fused social information corresponding to each group.
As mentioned above, the social information may be at least one of pictures, texts, and videos. In this embodiment, the converged social information may be any combination of pictures, texts, and videos.
As an embodiment, the social server fusing the social information of each group may include: and compressing the social information of each group to reduce the size of the fused social information. And the consumption of network bandwidth in the subsequent pushing process is reduced.
Step 703, the social server determines the N groups of corresponding merged social information as N target social information.
That is, in this embodiment, the social server takes the merged social information as the target social information.
Because the social server determines the target social information based on the fused social information, the target social information contains more information of the target user, and the state of the target user can be more comprehensively embodied.
The flow shown in fig. 7 is completed.
As can be seen from the flow shown in fig. 7, in this embodiment, the social server performs fusion processing on the social information, so that other users who establish a friend relationship with the target user can obtain more information of the target user, the knowledge of the target user is deepened, and more effective instant messaging between the users is further achieved.
In one embodiment, referring to fig. 8, an implementation flow of a step 402 is shown for an embodiment of the present application.
As shown in fig. 8, the process may include the following steps:
in step 801, the social server checks, for each user other than the target user among the L users, whether the user communicates with the target user through a private chat window.
After the social server generates the target social information of the target user through step 401, it needs to determine how to present the target social information to other users who establish a friend relationship with the target user.
For this reason, in this embodiment, the social server performs the following processing for each user who establishes a friend relationship with the target user: it is determined whether the user and the target user communicate through a private chat window. That is, it is determined whether a private chat buddy relationship has been established between the user and the target user.
Step 802, if yes, the social server pushes the target social information to the user through the private chat window.
If not, the social server pushes the target social information through a group chat window containing L users.
If no private chat friend relationship is established between the user and the target user, at least a group chat friend relationship is established between the user and the target user, and therefore, target social information can be pushed through a group chat window containing L users.
The flow shown in fig. 8 is completed.
As can be seen from the flow shown in fig. 8, in this example, the social server preferentially pushes the target social information through the private chat window. And when the private chat window is not established between the users, pushing the target social information through the group chat window between the users. The method and the device have the advantages that the attention of the users to the target social information is improved through accurate pushing as much as possible, and more effective instant messaging among the users is achieved.
In one embodiment, referring to fig. 9, a flow of implementing step 402 is shown for an embodiment of the present application.
As shown in fig. 9, the process may include the following steps:
in step 901, the social server checks, for each user other than the target user among the L users, whether the user communicates with the target user through a private chat window.
As mentioned above, after the social server generates the target social information of the target user through step 401, it needs to determine how to present the target social information to other users who establish a friend relationship with the target user.
For this reason, in this embodiment, the social server performs the following processing for each user who establishes a friend relationship with the target user: it is determined whether the user and the target user communicate through a private chat window. That is, it is determined whether a private chat buddy relationship has been established between the user and the target user.
If so, the social server pushes the target social information to the user through the private chat window in step 902.
Step 903, if not, the social server triggers to establish a private chat window between the user and the target user, and pushes target social information through the established private chat window.
In this embodiment, if a private chat friend relationship is not established between the user and the target user, the social server triggers establishment of a private chat window between the user and the target user, and pushes target social information through the established private chat window.
The flow shown in fig. 9 is completed.
As can be seen from the flow shown in fig. 9, in this embodiment, no matter the users have private chat and friend relationships, or have group chat and friend relationships, the social server triggers the users to establish a private chat window. And pushing target social information through the private chat window. Because the attention of the user to the private chat window is higher than that of the group chat window, the target social information is pushed through the private chat window, the user can be reminded of knowing about the trends of friends accurately and timely, and more effective instant messaging is achieved.
In one embodiment, in step 402, the pushing, by the social server, the target social information to the other users of the L users except the target user further includes: and the social server pushes the user attribute information of the target user to other users except the target user in the L users. The user attribute information at least includes: the nickname and signature information of the target user. Therefore, other users establishing friend relationship with the target user can obtain more related information of the target user, and more effective instant messaging is realized.
In order to describe the method provided by the embodiment of the present application, the following describes the apparatus provided by the embodiment of the present application:
referring to fig. 10, a schematic structural diagram of an apparatus provided in an embodiment of the present application is shown. The device includes: an acquisition unit 1001 and a push unit 1002, wherein:
an obtaining unit 1001, configured to obtain, from L users, at least one target user who has sent social information in a specified social space after the L users successfully establish a friend relationship; l is greater than 1;
the pushing unit 1002 is configured to, for each target user, push at least one piece of social information sent by the target user in the specified social space to other users than the target user in the L users, where the social information sent by the target user in the specified social space is used for knowing the target user.
As an embodiment, the pushing unit 1002 pushes, to other users in the L users except the target user, at least one piece of social information sent by the target user in the specified social space, including:
sending danger prompt information to other users except the target user in the L users;
and after the danger prompt information is successfully sent, pushing at least one piece of social information sent by the target user in the specified social space to other users except the target user in the L users.
As an embodiment, the pushing unit 1002 pushes, to other users in the L users except the target user, at least one piece of social information sent by the target user in the specified social space, including:
and when detecting that the target user communicates with at least one other user except the target user in the L users, pushing at least one piece of social information sent by the target user in the specified social space to the at least one other user except the target user in the L users.
As an embodiment, the pushing unit 1002 pushes, to other users in the L users except the target user, at least one piece of social information sent by the target user in the specified social space, including:
and detecting whether the target user sends at least one piece of social information in the specified social space after establishing the friend relationship, and pushing at least one piece of social information sent by the target user in the specified social space to other users except the target user in the L users.
As an embodiment, the pushing unit 1002 pushes, to other users in the L users except the target user, at least one piece of social information sent by the target user in the specified social space, including:
generating target social information according to at least one piece of social information sent by the target user in the specified social space;
and pushing the target social information to other users except the target user in the L users.
As an embodiment, the pushing unit 1002 generates the target social information according to at least one piece of social information sent by the target user in the specified social space, including:
acquiring all social information sent by a target user in the specified social space within a preset time period;
and generating N pieces of target social information according to all the obtained social information, wherein N is more than or equal to 1.
As an embodiment, the pushing unit 1002 generates N pieces of target social information according to all the obtained social information, including:
selecting N pieces of social information meeting set conditions from all the obtained social information;
determining the selected N social messages as the N target social messages.
As an embodiment, the pushing unit 1002 selects N pieces of social information satisfying a set condition from all the obtained social information, including:
selecting N pieces of social information closest to the current time from all the obtained social information according to the time sequence; alternatively, the first and second electrodes may be,
and selecting N pieces of social information which is closest to the current time and is customized for the target user from all the obtained social information according to the time sequence.
As an embodiment, the pushing unit 1002 generates N pieces of target social information according to all the obtained social information, including:
dividing all the obtained social information into N groups, wherein the number of the social information included in each group is less than or equal to M, and M is greater than 1;
fusing the social information of each group to obtain fused social information corresponding to each group;
and determining the N groups of corresponding fused social information as the N target social information.
As an embodiment, the pushing unit 1002 pushes the target social information to other users in the L users except the target user, including:
for each user except the target user in the L users, checking whether the user communicates with the target user through a private chat window;
if so, pushing the target social information to the user through the private chat window;
and if not, pushing the target social information through a group chat window containing the L users.
As an embodiment, the pushing unit 1002 pushes the target social information to other users in the L users except the target user, including:
for each user except the target user in the L users, checking whether the user communicates with the target user through a private chat window;
if so, pushing the target social information to the user through the private chat window;
and if not, triggering to establish a private chat window between the user and the target user, and pushing the target social information through the established private chat window.
As an embodiment, the pushing unit 1002 pushes the target social information to other users in the L users except the target user, further including:
pushing the user attribute information of the target user to other users except the target user in the L users, wherein the user attribute information at least comprises: the nickname and signature information of the target user.
As an embodiment, the specified social space is a set friend circle or friend circle.
As an embodiment, the social information is at least one of a picture, a text, and a video.
The description of the apparatus shown in fig. 10 is thus completed. In the embodiment, when the friend relationship is established between the users, the social server pushes the social information of other users establishing the friend relationship with the users, so that the users can know the friends based on the pushed social information, and the effective instant communication between the users is realized.
The following describes a social server provided in an embodiment of the present application:
the social server includes: one or more processors; a machine-readable storage medium storing one or more computer-readable instructions which, when executed by one or more processors, cause the one or more processors to implement the method of the above-described embodiments of the present application.
Referring to fig. 11, a hardware structure example of a social server provided in an embodiment of the present application is shown. The social server may include a processor 1101, a machine-readable storage medium 1102 having machine-executable instructions stored thereon. The processor 1101 and the machine-readable storage medium 1102 may communicate via a system bus 1103. Also, the processor 1101 may execute the information push method described above by reading and executing machine executable instructions corresponding to the information push logic in the machine readable storage medium 1102.
The machine-readable storage medium 1102 referred to herein may be any electronic, magnetic, optical, or other physical storage device that can contain or store information such as executable instructions, data, and the like. For example, the machine-readable storage medium 1102 may include at least one of the following: volatile memory, non-volatile memory, other types of storage media. The volatile Memory may be a Random Access Memory (RAM), and the nonvolatile Memory may be a flash Memory, a storage drive (e.g., a hard disk drive), a solid state disk, and a storage disk (e.g., a compact disk, a DVD).
Embodiments of the present application also provide a machine-readable storage medium, such as machine-readable storage medium 1102 in fig. 11, comprising machine-executable instructions, which are executable by processor 1101 in a social server to implement the information pushing method described above.
To this end, the description of the social server shown in fig. 11 is completed.
The above description is only a preferred embodiment of the present application, and should not be taken as limiting the present application, and any modifications, equivalents, improvements, etc. made within the spirit and principle of the present application shall be included in the scope of the present application.
Claims (16)
1. An information pushing method is applied to a social server and comprises the following steps:
after the L users successfully establish the friend relationship, at least one target user which sends social information in a specified social space is obtained from the L users; l is greater than 1;
and for each target user, pushing at least one piece of social information sent by the target user in the specified social space to other users except the target user in the L users, wherein the social information sent by the target user in the specified social space is used for knowing the target user.
2. The method of claim 1, wherein pushing at least one piece of social information sent by the target user within the specified social space to the other users of the L users other than the target user comprises:
sending danger prompt information to other users except the target user in the L users;
and after the danger prompt information is successfully sent, pushing at least one piece of social information sent by the target user in the specified social space to other users except the target user in the L users.
3. The method of claim 1, wherein pushing at least one piece of social information sent by the target user within the specified social space to the other users of the L users other than the target user comprises:
and when detecting that the target user communicates with at least one other user except the target user in the L users, pushing at least one piece of social information sent by the target user in the specified social space to the at least one other user except the target user in the L users.
4. The method of claim 1, wherein pushing at least one piece of social information sent by the target user within the specified social space to the other users of the L users other than the target user comprises:
and detecting whether the target user sends at least one piece of social information in the specified social space after establishing the friend relationship, and pushing at least one piece of social information sent by the target user in the specified social space to other users except the target user in the L users.
5. The method of any one of claims 2 to 4, wherein the pushing of the at least one piece of social information sent by the target user in the designated social space to the other users of the L users except the target user comprises:
generating target social information according to at least one piece of social information sent by the target user in the specified social space;
and pushing the target social information to other users except the target user in the L users.
6. The method of claim 5, wherein generating the target social information based on at least one piece of social information sent by the target user in the specified social space comprises:
acquiring all social information sent by a target user in the specified social space within a preset time period;
and generating N pieces of target social information according to all the obtained social information, wherein N is more than or equal to 1.
7. The method of claim 6, wherein the generating N target social messages according to all the obtained social messages comprises:
selecting N pieces of social information meeting set conditions from all the obtained social information;
determining the selected N social messages as the N target social messages.
8. The method of claim 7, wherein the selecting N pieces of social information satisfying a set condition from all the obtained social information comprises:
selecting N pieces of social information closest to the current time from all the obtained social information according to the time sequence; alternatively, the first and second electrodes may be,
and selecting N pieces of social information which is closest to the current time and is customized for the target user from all the obtained social information according to the time sequence.
9. The method of claim 6, wherein the generating N target social messages according to all the obtained social messages comprises:
dividing all the obtained social information into N groups, wherein the number of the social information included in each group is less than or equal to M, and M is greater than 1;
fusing the social information of each group to obtain fused social information corresponding to each group;
and determining the N groups of corresponding fused social information as the N target social information.
10. The method of claim 5, wherein said pushing the target social information to the other users of the L users other than the target user comprises:
for each user except the target user in the L users, checking whether the user communicates with the target user through a private chat window;
if so, pushing the target social information to the user through the private chat window;
and if not, pushing the target social information through a group chat window containing the L users.
11. The method of claim 5, wherein said pushing the target social information to the other users of the L users other than the target user comprises:
for each user except the target user in the L users, checking whether the user communicates with the target user through a private chat window;
if so, pushing the target social information to the user through the private chat window;
and if not, triggering to establish a private chat window between the user and the target user, and pushing the target social information through the established private chat window.
12. The method of claim 5, wherein pushing the target social information to the other users of the L users other than the target user further comprises:
pushing the user attribute information of the target user to other users except the target user in the L users, wherein the user attribute information at least comprises: the nickname and signature information of the target user.
13. The method of any of claims 1 to 4, 6 to 12, wherein:
the designated social space is a set friend circle or friend circle.
14. The method of any of claims 1 to 4, 6 to 12, wherein: :
the social information is at least one of pictures, characters and videos.
15. A social server, comprising:
one or more processors;
a machine-readable storage medium to store one or more computer-readable instructions,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-14.
16. A machine readable storage medium, having stored thereon a program which, when executed by a processor, carries out the method of any one of claims 1-14.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910944291.2A CN112667916A (en) | 2019-09-30 | 2019-09-30 | Information pushing method, social server and machine-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910944291.2A CN112667916A (en) | 2019-09-30 | 2019-09-30 | Information pushing method, social server and machine-readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112667916A true CN112667916A (en) | 2021-04-16 |
Family
ID=75399844
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910944291.2A Pending CN112667916A (en) | 2019-09-30 | 2019-09-30 | Information pushing method, social server and machine-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112667916A (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101626398A (en) * | 2009-08-11 | 2010-01-13 | 腾讯数码（天津）有限公司 | Method for obtaining friend dynamic and system |
| WO2010072120A1 (en) * | 2008-12-24 | 2010-07-01 | 腾讯科技（深圳）有限公司 | Method, server, instant messaging client and system of instant messaging |
| CN103812753A (en) * | 2012-11-07 | 2014-05-21 | 腾讯科技（深圳）有限公司 | Social network interaction method and application platform |
| CN104202318A (en) * | 2014-08-22 | 2014-12-10 | 北京奇虎科技有限公司 | Method, client and system for keeping away a phishing behavior |
| CN104243275A (en) * | 2013-06-19 | 2014-12-24 | 腾讯科技（深圳）有限公司 | Social information pushing method and system |
| CN104660495A (en) * | 2015-01-28 | 2015-05-27 | 腾讯科技（深圳）有限公司 | Information processing method, client and server |
| CN104836727A (en) * | 2015-05-12 | 2015-08-12 | 湖南简成信息技术有限公司 | Exercise social communication control method based on instant communication |
| CN107908451A (en) * | 2017-11-14 | 2018-04-13 | 珠海市魅族科技有限公司 | A kind of method for information display and equipment |
| CN108540377A (en) * | 2018-04-09 | 2018-09-14 | 青岛海信移动通信技术股份有限公司 | Information processing method, equipment and the storage medium of social networking application |
| CN110138848A (en) * | 2019-04-30 | 2019-08-16 | 上海掌门科技有限公司 | A kind of release information method for pushing and equipment |
-
2019
- 2019-09-30 CN CN201910944291.2A patent/CN112667916A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010072120A1 (en) * | 2008-12-24 | 2010-07-01 | 腾讯科技（深圳）有限公司 | Method, server, instant messaging client and system of instant messaging |
| CN101626398A (en) * | 2009-08-11 | 2010-01-13 | 腾讯数码（天津）有限公司 | Method for obtaining friend dynamic and system |
| CN103812753A (en) * | 2012-11-07 | 2014-05-21 | 腾讯科技（深圳）有限公司 | Social network interaction method and application platform |
| CN104243275A (en) * | 2013-06-19 | 2014-12-24 | 腾讯科技（深圳）有限公司 | Social information pushing method and system |
| CN104202318A (en) * | 2014-08-22 | 2014-12-10 | 北京奇虎科技有限公司 | Method, client and system for keeping away a phishing behavior |
| CN104660495A (en) * | 2015-01-28 | 2015-05-27 | 腾讯科技（深圳）有限公司 | Information processing method, client and server |
| CN104836727A (en) * | 2015-05-12 | 2015-08-12 | 湖南简成信息技术有限公司 | Exercise social communication control method based on instant communication |
| CN107908451A (en) * | 2017-11-14 | 2018-04-13 | 珠海市魅族科技有限公司 | A kind of method for information display and equipment |
| CN108540377A (en) * | 2018-04-09 | 2018-09-14 | 青岛海信移动通信技术股份有限公司 | Information processing method, equipment and the storage medium of social networking application |
| CN110138848A (en) * | 2019-04-30 | 2019-08-16 | 上海掌门科技有限公司 | A kind of release information method for pushing and equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7422834B2 (en) | Servers, programs and information processing methods | |
| JP6577477B2 (en) | Synchronization of unread messages in instant communication | |
| JP6322683B2 (en) | Reference notification method and apparatus | |
| US10771271B2 (en) | Methods and devices for adding new member to group through barcode scanning | |
| US8954494B2 (en) | Method and system for synchronizing operations of multiple groups | |
| US9166987B2 (en) | Preventing identity fraud for instant messaging | |
| CA2892650C (en) | Methods and devices for adding new member to group through barcode scanning | |
| WO2019072197A1 (en) | Red packet distribution method, device, and medium | |
| US9083693B2 (en) | Managing private information in instant messaging | |
| EP2983120A1 (en) | Transfer information processing method and device | |
| CN109729005B (en) | Message processing method and device, computer equipment and storage medium | |
| EP3028437B1 (en) | Messaging api over http protocol to establish context for data exchange | |
| KR102079892B1 (en) | Management of multiple profiles for a single account in an asynchronous messaging system | |
| CN107294832B (en) | Method and device for adding friends | |
| JP6169568B2 (en) | System and method for passive communication service | |
| JP2017531239A (en) | DOI (Digital Object Unique Identifier) Processing Method and Device for Interaction Information | |
| KR20180017084A (en) | Transaction processing method and system | |
| US20160277570A1 (en) | Facilitating controlled electronic communication | |
| CN111770011B (en) | Risk prompting method and device, electronic equipment and computer readable storage medium | |
| US20110191427A1 (en) | Communication method adapted for users using multiple communication facilities | |
| US20210019705A1 (en) | Method and apparatus for sharing data across groups | |
| WO2013185482A1 (en) | Method and device for sharing electronic calendar | |
| CN112667916A (en) | Information pushing method, social server and machine-readable storage medium | |
| CN104717121A (en) | Business card exchanging method and system | |
| US9843548B2 (en) | System and method of user-to-machine and machine-to-machine communication through instant messaging |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210416 |