CN113329100B - Message pushing method, device and system - Google Patents

Message pushing method, device and system Download PDF

Info

Publication number
CN113329100B
CN113329100B CN202110739622.6A CN202110739622A CN113329100B CN 113329100 B CN113329100 B CN 113329100B CN 202110739622 A CN202110739622 A CN 202110739622A CN 113329100 B CN113329100 B CN 113329100B
Authority
CN
China
Prior art keywords
message
social
sharing
identifier
client
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.)
Active
Application number
CN202110739622.6A
Other languages
Chinese (zh)
Other versions
CN113329100A (en
Inventor
王文涛
肖鹏
肖仙敏
张中宝
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen Co Ltd
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 Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Priority to CN202110739622.6A priority Critical patent/CN113329100B/en
Publication of CN113329100A publication Critical patent/CN113329100A/en
Application granted granted Critical
Publication of CN113329100B publication Critical patent/CN113329100B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/55Push-based network services
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/52User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail for supporting social networking services
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/50Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate

Landscapes

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

Abstract

The invention discloses a message pushing method, a message pushing device and a message pushing system, and belongs to the field of computers. The invention is a divisional application of an invention patent application with the application number of 201710287477.6 and the name of 'message pushing method, device and system' which is filed on 27.04.7.2017. The method comprises the following steps: generating a sharing message; creating or selecting a designated social set, wherein the designated social set comprises at least two first-class identifiers, and the designated social set is visible to the social client corresponding to each first-class identifier; sending the sharing message and a set identifier of the specified social set to a server, wherein the set identifier is used for the server to send the sharing message and the set identifier to a second social client corresponding to the first type identifier; the problem that the server consumes more resources due to the fact that the server sends the sharing message to all second social contact clients with friend relationships with the first social contact client is solved; the resource of the server for sending the sharing message is saved.

Description

Message pushing method, device and system
The application is a divisional application of an invention patent application with the application number of 201710287477.6 and the name of 'message pushing method, device and system' filed on 27.04.2017.
Technical Field
The embodiment of the invention relates to the field of computers, in particular to a method, a device and a system for pushing messages.
Background
With the development of computer technology, some network-based social applications have appeared, which typically include a function of pushing shared messages. The sharing message refers to a message which can be viewed in the message sharing platform by other users.
In a typical sharing message pushing method, a first social client generates a sharing message and sends the sharing message to a server; the server pushes the sharing message to a second social client side, and the second social client side displays the sharing message. The first type of identification corresponding to the first social client and the second type of identification corresponding to the second social client have a friend relationship, wherein the friend relationship refers to a binding relationship pre-established between the first type of identification and the second type of identification.
When the first social client only needs to send the sharing message to a part of the second social clients, the server still sends the sharing message to all the second social clients, and therefore the problem that resources consumed when the server sends the sharing message to the rest of the second social clients are wasted is caused. Such as: the second social clients having friend relationships with the first social client are a, B, C, D, and E, and if the first social client only needs to send the sharing message to a, B, and C, and the server sends the sharing message to a, B, C, D, and E, the problem of wasting resources consumed when the server sends the sharing message to D and E may occur.
Disclosure of Invention
In order to solve the problem that resources are wasted because a server sends a sharing message to all second social clients in a scene that a first social client only needs to send the sharing message to part of the second social clients, the embodiment of the invention provides a message pushing method and a message pushing device. The technical scheme is as follows:
in a first aspect, a message pushing method is provided, where the method includes:
generating a sharing message, wherein the sharing message refers to a message which is published to a second social client by a first social client at least one publishing time, and each publishing event corresponds to the message at the publishing time;
creating or selecting the designated social set, wherein the designated social set comprises at least two first-class identifiers, the designated social set is visible to the social client corresponding to each first-class identifier, the social client corresponding to each first-class identifier has the authority of acquiring the shared message, and the social client corresponding to each first-class identifier comprises the first social client and the second social client;
and sending the sharing message and the set identifier of the specified social set to a server, wherein the set identifier is used for the server to determine the at least two first-class identifiers, and sending the sharing message and the set identifier to a second social client corresponding to the first-class identifiers.
In a second aspect, a message pushing method is provided, where the method includes:
receiving a sharing message and a set identifier sent by a first social client, wherein the sharing message refers to a message which is published to a second social client by the first social client at least one publishing time, and each publishing event corresponds to the message at the publishing time; the set identifier is an identifier of a designated social set created or selected by the first social client, the designated social set is visible to the social client corresponding to each first type identifier, the social client corresponding to each first type identifier has the authority to acquire the shared message, and the social client corresponding to the first type identifier comprises the first social client and the second social client;
determining at least two first type identifications according to the set identifications, wherein the at least two first type identifications belong to the specified social set;
and sending the sharing message and the set identification to a second social client corresponding to the first type identification.
In a third aspect, a message pushing method is provided, where the method includes:
receiving a sharing message and a set identifier pushed by a server, wherein the sharing message refers to a message which is published to a second social contact client by a first social contact client at least one publishing time, and each publishing event corresponds to the message at the publishing time; the set identifier is an identifier of a designated social set determined by the first social client, the designated social set comprises at least two first-class identifiers, the designated social set is visible to the social client corresponding to each first-class identifier, the social client corresponding to each first-class identifier has the authority of obtaining the sharing message, and the social client corresponding to each first-class identifier comprises the first social client and the second social client;
and displaying the sharing message and the set identification.
In a fourth aspect, a message pushing apparatus is provided, the apparatus including:
the generating module is used for generating a sharing message, wherein the sharing message refers to a message which is published by a first social client to a second social client at least one publishing time, and each publishing event corresponds to the message at the publishing time;
the creation selection module is used for creating or selecting the designated social set, the designated social set comprises at least two first-class identifiers, the designated social set is visible to the social client side corresponding to each first-class identifier, the social client side corresponding to each first-class identifier has the authority of obtaining the sharing message, and the social client side corresponding to the first-class identifier comprises the first social client side and the second social client side;
and the sending module is used for sending the sharing message and the set identification of the specified social set to a server, wherein the set identification is used for the server to determine the at least two first-class identifications and sending the sharing message and the set identification to a second social client corresponding to the first-class identification.
In a fifth aspect, a message pushing apparatus is provided, the apparatus including:
the system comprises a receiving module and a processing module, wherein the receiving module is used for receiving a sharing message and a set identifier sent by a first social client, the sharing message refers to a message which is published to a second social client by the first social client at least one publishing time, and each publishing event corresponds to the message at the publishing time; the set identifier is an identifier of a designated social set created or selected by the first social client, the designated social set is visible to the social client corresponding to each first type identifier, the social client corresponding to each first type identifier has the authority to acquire the shared message, and the social client corresponding to the first type identifier comprises the first social client and the second social client;
a determining module, configured to determine at least two first class identifiers according to the set identifier, where the at least two first class identifiers both belong to the specified social set;
and the sending module is used for sending the sharing message and the set identifier to a second social client corresponding to the first type identifier.
In a sixth aspect, a message pushing apparatus is provided, the apparatus includes:
the server comprises a receiving module and a collecting module, wherein the receiving module is used for receiving a sharing message and a set identifier pushed by the server, the sharing message refers to a message which is published to a second social contact client by a first social contact client at least one publishing time, and each publishing event corresponds to the message at the publishing time; the set identifier is an identifier of a designated social set determined by the first social client, the designated social set comprises at least two first-class identifiers, the designated social set is visible to the social client corresponding to each first-class identifier, the social client corresponding to each first-class identifier has the authority of obtaining the sharing message, and the social client corresponding to each first-class identifier comprises the first social client and the second social client;
and the display module is used for displaying the sharing message and the set identifier.
In a seventh aspect, a computer-readable storage medium is provided, where instructions are stored in the computer-readable storage medium, and when the instructions are executed on a first terminal, the instructions cause the first terminal to execute the message pushing method provided in the first aspect.
In an eighth aspect, a computer-readable storage medium is provided, which stores instructions that, when executed on a server, cause the server to execute the message pushing method provided in the second aspect.
In a ninth aspect, a computer-readable storage medium is provided, which stores instructions that, when executed on a second terminal, cause the second terminal to execute the message pushing method provided in the third aspect.
In a tenth aspect, a message push system is provided, the system comprising a first social client in a first terminal, a server and a second social client in a second terminal,
the first social client is the message pushing device provided by the fourth aspect;
the server is the message pushing device provided by the fifth aspect;
the second social client is the message pushing device provided in the sixth aspect.
The technical scheme provided by the embodiment of the invention has the following beneficial effects:
the method comprises the steps that a sharing message is sent to second social clients belonging to the same social set through a first social client, so that the first social client can select or create the social set comprising a part of second social clients when only the sharing message needs to be sent to the part of second social clients; the problem that the server consumes more resources due to the fact that the server sends the sharing message to all second social contact clients with friend relationships with the first social contact client is solved; because the server only needs to send the sharing message to the part of the second social clients, resources for sending the sharing message by the server are saved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a diagram illustrating one-to-one communication according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating a message storage structure for one-to-one communication according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating one-to-many communication according to one embodiment of the present invention;
FIG. 4 is a diagram illustrating a message storage structure for one-to-many communication according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of one-to-many sharing provided by an embodiment of the present invention;
fig. 6 is a schematic diagram of a message storage structure in one-to-many sharing according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of a message pushing system according to an embodiment of the present invention;
fig. 8 is a flowchart of a message pushing method according to an embodiment of the present invention;
FIG. 9 is a schematic diagram of a social collection provided by one embodiment of the present invention;
FIG. 10 is a schematic diagram of selecting a social set provided by an embodiment of the invention;
FIG. 11 is a schematic diagram of creating a social collection provided by an embodiment of the invention;
FIG. 12 is a diagram illustrating a display sharing message according to an embodiment of the present invention;
fig. 13 is a schematic diagram of displaying shared messages according to an embodiment of the present invention;
fig. 14 is a flowchart of a message pushing method according to another embodiment of the present invention;
FIG. 15 is a schematic diagram of a privilege setting provided by one embodiment of the present invention;
FIG. 16 is a schematic diagram of a privilege setting provided by one embodiment of the present invention;
FIG. 17 is a schematic diagram that illustrates determining a second class identifier, according to an embodiment of the invention;
FIG. 18 is a schematic diagram that illustrates determining a second class identifier, according to an embodiment of the invention;
FIG. 19A is a diagram of a message reply provided by one embodiment of the present invention;
FIG. 19B is a diagram illustrating a reply message, according to an embodiment of the present invention;
fig. 20 is a flowchart of a message pushing method according to an embodiment of the present invention;
fig. 21 is a flowchart of a message pushing method according to another embodiment of the present invention;
fig. 22 is a block diagram of a message pushing apparatus according to an embodiment of the present invention;
fig. 23 is a block diagram of a message pushing apparatus according to another embodiment of the present invention;
fig. 24 is a block diagram of a message pushing apparatus according to another embodiment of the present invention;
fig. 25 is a schematic structural diagram of a terminal according to an embodiment of the present invention;
fig. 26 is a schematic structural diagram of a server according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. The following description refers to the accompanying drawings in which the same 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 invention. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the invention, as detailed in the appended claims.
First, a number of terms related to embodiments of the present invention will be described.
The social client side comprises the following steps: refers to an application program that implements a communication function by transmitting messages.
Optionally, the social client has a real-time communication function and/or a function of sharing newsfeeds. The real-time communication function can be one-to-one real-time communication; alternatively, one-to-many real-time communication is also possible. The function of sharing newsfeeds is typically one-to-many sharing.
The one-to-one real-time communication means: one social client communicates by transmitting instant messaging messages in real-time with another social client. Each social client presents the instant messaging message in an instant messaging interface.
The instant message interface comprises at least one instant communication message which is ordered according to the sequence of the release time.
Instant messaging message: refers to a message transmitted in real time between different social clients through a network, the message including: at least one of text information, file information, audio information, and video information.
Optionally, the instant messaging message carries an identifier of a social client that sent the instant messaging message.
The identifier of the social client is a social account that logs in the social client, such as: the identifier of the social client is a mobile phone number, an identification number, an email address, a bank card number, a character string assigned by the server, a character string set by the user, and the like, which is not limited in this embodiment.
Referring to fig. 1, taking an example that a first social client sends an instant messaging message to a second social client, an instant messaging message 102, an identifier 101 of the first social client carried by the instant messaging message 102, and an identifier 103 of the second social client are displayed in an instant messaging interface 100. Optionally, an instant messaging message 104 replied by the second social client is also displayed in the instant messaging interface.
Under the condition shown in fig. 1, when the server receives an instant messaging message sent by the first social client to the second social client, the server generates a session identifier between the first social client and the second social client, and stores the instant messaging message according to the session identifier.
Optionally, the session identifier is composed of an identifier of the first social client and an identifier of the second social client; or the session identifier is generated by the server according to a random algorithm; alternatively, the session identifier is generated by the first social client according to a random algorithm, which is not limited in this embodiment.
Referring to the storage structure of the server for storing instant messaging messages shown in fig. 2, when the server receives a first instant messaging message 201 sent by a first social client to a second social client, a session identifier 202 is generated, and the first instant messaging message 201 is stored in a storage space corresponding to the session identifier 202.
Optionally, when the server receives the second, third, \ 8230and nth instant messaging messages 203 sent by the first social client and/or the second social client, each instant messaging message 203 is stored in the storage space corresponding to the session identifier 202 according to the sequence of the receiving time. Wherein n is an integer greater than 1.
One-to-many real-time communication means: one social client communicates by transmitting instant messaging messages in real time with at least two other social clients. That is, a first social client transmits instant communication messages in real time to at least two second social clients belonging to the same social set.
At this time, the instant messaging message sent by the first social client also carries the set identifier of the social set to which the instant messaging message belongs.
The social set comprises at least two first-class identifiers, and the social set is visible to the social client corresponding to each first-class identifier. That is, the server may notify each social client corresponding to the first type identifier to be added to the social set.
For a social set, the first type of identifier refers to an identifier belonging to the social set. The client corresponding to each first-class identifier refers to a social client logged in by the first-class identifier.
Optionally, the different first type identifiers correspond to the same social client.
Optionally, the set identifier is formed by a first type identifier of at least one social client; or the set identifier is generated by the server according to a random algorithm; alternatively, the set identifier is generated by the social client that creates the social set according to a random algorithm, which is not limited in this embodiment.
Referring to fig. 3, taking an example that a first social client sends an instant messaging message in a certain social set, a first type identifier 301 of the first social client, a set identifier 302 of the social set, and an instant messaging message 303 carried in the instant messaging message are displayed in an instant messaging interface 300. Optionally, the instant messaging message 304 replied by the second social client and the first type identifier 305 of the second social client carried by the instant messaging message 304 are also displayed in the instant messaging interface.
In the case shown in fig. 3, when the server receives the instant messaging message sent by the first social client to the social set to which the first social client belongs, the instant messaging message is stored according to the set identifier of the social set.
Referring to the storage structure of the server for storing the instant messaging message shown in fig. 4, when the server receives an instant messaging message 401 sent by a first social client to a second social client in a social set, the instant messaging message 401 carries a set identifier 402 of the social set, and the server stores the instant messaging message 401 in a storage space corresponding to the set identifier 402. And the first type identification of the first social client and the first type identification of the second social client both belong to the social set.
Optionally, when the server receives the second, third, \ 8230and nth instant messaging messages 403 sent by the first social client and/or the second social client, each instant messaging message is stored in the storage space corresponding to the set identifier 402 according to the sequence of the receiving time.
Because the storage spaces between instant messaging messages received by the server and originated from different social clients in the same social set are independent, when one instant messaging message is deleted, other instant messaging messages still exist.
Sharing one to many means: the first social client sends the sharing message to a server; when the at least one second social client requests the sharing message from the server, the server sends the sharing message to the at least one second social client. Each social client presents the shared message in a message sharing interface.
Optionally, the friend relationship chain corresponding to the first class identifier of the first social client includes at least one first class identifier of the second social client. The friend relation chain is formed by identifications pre-bound with the first type identification of the first social client.
Optionally, the first class identifier of the first social client and the first class identifier of the second social client belong to the same social set. The social client corresponding to each first type identifier in the same social set has the authority to acquire the sharing message published by the first social client, wherein the social client corresponding to the first type identifier comprises the first social client and the second social client.
Optionally, in the same social set, the first class identifier of the second social client and the first class identifier of the first social client have an association relationship; and/or the first class identification of the second social client does not have an association relation with the first class identification of the first social client.
The association relationship comprises at least one of a binding relationship between identifiers corresponding to different social clients, a subscription relationship between identifiers corresponding to different social clients, a distance between different social clients being smaller than a preset distance, and the identifiers corresponding to different social clients paying attention to the same information.
The binding relationship refers to the mutual attention among different social clients; the subscription relationship refers to the unilateral attention of one social client to another social client; focusing on the same information means that different social clients have a higher probability of requesting the same information.
The message sharing interface comprises at least one sharing message which is sorted according to the sequence of the release time. The at least one sharing message comprises a sharing message sent by the first social client and a sharing message sent by each second social client.
And (3) sharing the message: the method refers to messages published by a first social client to a second social client at least one publication time, and each publication event corresponds to the message at the publication time. The sharing message carries an identifier of the social client that sent the sharing message.
Optionally, when a shared message is shared by a first social client to a second social client belonging to the same social set, the shared message also needs to carry a set identifier of the social set.
The issuing event refers to an event which is established by the server after receiving the sharing message and corresponds to the sharing message. The publishing event is used for indicating at least one of a publishing time of the shared message, a source of the shared message and a storage location of the shared message.
Optionally, the sharing message is at least one of text information, file information, audio information, picture information, and video information.
Referring to fig. 5, taking an example that a first social client sends a sharing message to a second social client belonging to the same social set, a message sharing interface 500 includes a sharing message 501, an identifier 502 of the first social client carried in the sharing message 501, and a set identifier 503 carried in the sharing message 501.
Under the condition shown in fig. 5, when receiving a sharing message sent by a first social client, a server obtains a message identifier of the sharing message, and stores the sharing message according to the message identifier and a set identifier carried by the sharing message.
Optionally, the message identifier is generated by the server according to at least one of the publishing time of the shared message and the message content of the shared message; or the message identification is generated by the server according to a random algorithm; or the message identifier is generated by the first social client according to a random algorithm, which is not limited in this embodiment.
Referring to the storage structure of the server for storing the sharing message shown in fig. 6, when the server receives the sharing message 601 posted by the first social client, the server stores the sharing message 601 in the storage space corresponding to the set identifier 602 and the message identifier 603.
Optionally, after receiving the sharing message, the second social client generates a reply message for replying to the sharing message, and sends the reply message to the server; the server sends the reply message to the first social client and the other second social clients. Wherein the other second social clients refer to the second social clients except for sending the reply message.
The reply message includes a message identification of the shared message. And when the server receives the reply message of the sharing message, storing the reply message according to the message identifier of the sharing message.
Optionally, as shown in fig. 6, when the server receives a reply message 603 of the sharing message 601, the reply message 603 is stored in the storage space corresponding to the message identifier 602.
Since the reply message received by the server is stored according to the message identifier of the corresponding shared message, that is, the storage space of the reply message is associated with the storage space of the shared message, the reply message exists based on the existence of the corresponding shared message. That is, if the shared message in the server is deleted, the corresponding reply message is also deleted.
It should be noted that, as can be seen from the above description, the sharing messages in the same social set are different from the instant messaging messages in the same social set in the obtaining manner and the storing manner.
It should be added that the embodiment is described by taking one-to-many sharing as an example, and in actual implementation, in a specific scene, one-to-one sharing may also be implemented. Such as: the method comprises the following steps that in a scene that only one friend exists in a friend relation chain of a first social client side; or, in a scenario that only one friend having a right to view the shared message exists in the friend relationship chain of the first social client, the sharing is performed one-to-one.
Referring to fig. 7, a schematic structural diagram of a message pushing system according to an embodiment of the present invention is shown. The system includes a first terminal 710, a server 720, and a second terminal 730.
The first terminal 710 and the second terminal 730 may be a mobile phone, a tablet computer, an e-book reader, an MP3 (Moving Picture Experts Group Audio Layer III, motion Picture Experts Group Audio Layer 3) player, an MP4 (Moving Picture Experts Group Audio Layer IV, motion Picture Experts Group Audio Layer 4) player, a laptop computer, a desktop computer, and the like, which is not limited in this embodiment.
A first social client 711 is installed in the first terminal 710. The first social client 711 has the function of sending a sharing message 712. The shared message 712 is generated by the first social client 711 from the received input information.
Optionally, the input information is text information, picture information, video information, and the like received through the human-computer interaction interface 713; alternatively, the input information may be document information, picture information, video information, web page links, etc. from the third-party application 714, which is not limited in this embodiment.
The first terminal 710 establishes a communication connection with the server 720 by a wireless network manner or a wired network manner. The first social client 711 sends the shared message 712 to the server 720 through the communication connection.
The server 720 has a function of receiving and storing the sharing message 712.
Optionally, the server 720 is formed of at least one server. The at least one server is functionally divided into at least three layers, which are: an access layer 721, a logical layer 722, and a storage layer 723.
The access layer 721 is configured to receive the sharing message 712 sent by the first social client 711 in the first terminal 710, and forward the sharing message 712 to the logic layer 722.
Optionally, a server in the access stratum 721 that receives the sharing message 712 has a long connection with the first terminal 710.
And the logic layer 722 is configured to determine a sending object of the shared message 712 forwarded by the access layer 721, and forward the shared message to the storage layer 723.
Optionally, the logic layer 722 further has a function of identifying the shared message 712, and determining whether the shared message 712 is spam, fraud information, virus carried, or the like.
And a storage layer 723 for storing the shared message 712. When a first social client sends a shared message to a second social client belonging to the same social set, the storage structure of the shared message in the storage layer 723 is shown in fig. 6. When a first social client sends a shared message to a second social client in the friend relationship chain, the storage structure of the shared message in the storage layer 723 is similar to that of fig. 6, except that the set identifier of the social set does not need to be stored.
The server 720 establishes a communication connection with the second terminal 730 through a wireless network or a wired network.
The second terminal 730 has a second social client 731 installed therein, and the second social client 731 sends an information obtaining request to the server 720 through the communication connection, where the information obtaining request is used for requesting to obtain the sharing message 712.
Wherein the first social client 711 and the second social client 731 are the same social client. In this embodiment, the second social client 711 belongs to a friend relationship chain of the first social client 711, or the first social client 711 and the second social client 731 belong to the same social set.
The format of the message obtaining request is different from the format of the sharing message and the format of the instant messaging message, and usually, the message obtaining request carries the identifier of the second social client 731.
In this case, the server 720 further has a function of sharing the sharing message 712 to the second social client 731 according to the information acquisition request sent by the second social client 731.
Accordingly, the access layer 721, the logic layer 722, and the storage layer 723 also have the following functions:
the access layer 721 is configured to receive a message obtaining request sent by the second social client 731 in the second terminal 730, and forward the sharing message 712 to the logic layer 722.
The logic layer 722 is configured to obtain, according to the message obtaining request, the sharing message whose sending object includes the second social network side from the storage layer 723, send the sharing message to the access layer 721, and send the sharing message to the second social network side 731 by the access layer 721.
Optionally, after the logic layer 722 receives the sharing message 712 sent by the first social client 711, in order to enable the second social client 731 to know that there is a sharing message 712 sent by a certain first social client, before the second social client 731 sends an information acquisition request to the server 720, the push server in the logic layer 722 also sends an information notification to the access layer 721, where the information notification is used to notify the second social client that there is a sharing message 712 sent by a certain first social client; the access layer 721 transmits the information notification to at least one transmission object corresponding to the sharing message 712. At least one of the sending objects includes the second social client 731.
After receiving the information notification, the second social client 731 can know that the sharing message 712 is sent by the first social client.
Optionally, the information notification includes account information corresponding to the identification of the first social client, the account information including at least one of a user nickname and a user avatar.
Optionally, when the sharing message is sent by the first social client to a second social client in the same social set, the information notification includes set information corresponding to a set identifier of the social set, where the set information includes at least one of account information and a set name corresponding to at least one first type identifier in the social set.
Optionally, in order to increase the speed of obtaining the information notification and/or the shared message by the second social client 731, the logic layer 722 sends the information notification and/or the shared message to a server closer to the second terminal in the access layer 721, and the server closer to the second terminal sends the information notification and/or the shared message to the second social client 731.
It should be added that, in this embodiment, the access layer 721, the logic layer 722, and the storage layer 723 in the server 720 are respectively different servers, and a server for receiving a shared message, a server for sending an information notification, a server for receiving an information acquisition request, and respectively different servers in the logic layer 722 are taken as examples for description, and in actual implementation, the access layer 721, the logic layer 722, and the storage layer 723 may be implemented by the same server, and/or different servers in the logic layer 722 may also be implemented by the same server, which is not limited in this embodiment.
It should be added that, in this embodiment, only one sharing message 712 sent by one first terminal 710 is taken as an example for description, in actual implementation, the number of the first terminals 710 is at least one, the number of the sharing messages 712 sent by each first terminal 710 is at least one, and accordingly, the second social client 731 obtains all sharing messages 712 that are not obtained from the server 720.
Optionally, the wireless or wired networks described above use standard communication techniques and/or protocols. The Network is typically the Internet, but may be any Network including, but not limited to, a Local Area Network (LAN), a Metropolitan Area Network (MAN), a Wide Area Network (WAN), a mobile, wireline or wireless Network, a private Network, or any combination of virtual private networks. In some embodiments, data exchanged over a network is represented using techniques and/or formats including HyperText Mark-up Language (HTML), extensible Mark-up Language (XML), and the like. All or some of the links may also be encrypted using conventional encryption techniques such as Secure Socket Layer (SSL), transport Layer Security (TLS), virtual Private Network (VPN), internet Protocol Security (IPsec). In other embodiments, custom and/or dedicated data communication techniques may also be used in place of, or in addition to, the data communication techniques described above.
Referring to fig. 8, a flowchart of a message push method according to an embodiment of the present invention is shown. In this embodiment, the method is exemplified by being applied to the message push system shown in fig. 7, and the method may include the following steps:
step 801, a first social client generates a sharing message.
And the first social client generates a sharing message according to the received input information.
Optionally, the first social client adds a preset field to the received input information to generate a sharing message; or the first social client generates a sharing message according to the input information, the display mode and the preset field. The display modes include display order and/or display position of pictures, display templates of web page links, display sizes of characters and/or symbols, display templates of characters and/or symbols, and the like, which are not listed here.
The preset field is used for indicating the type of the shared message, so that when the server and/or the second social client receive the message, the type of the message is determined to be the shared message according to the preset field.
It should be added that the preset field in the shared message is different from the preset field in the other types of messages generated by the first social client, and schematically, the preset field in the shared message is different from the preset field in the instant messaging message.
At step 802, the first social client creates or selects a specified social set.
The designated social set comprises at least two first-class identifiers, the designated social set is visible to the social clients corresponding to the first-class identifiers, the social clients corresponding to the first-class identifiers have the authority of obtaining sharing messages, and the social clients corresponding to the first-class identifiers comprise first social clients and second social clients.
Optionally, an association relationship exists between at least one first class identifier in the specified social set and a first class identifier corresponding to the first social client, and/or an association relationship does not exist between at least one first class identifier in the specified social set and a first class identifier corresponding to the first social client.
Illustratively, referring to the specified social set 900 shown in FIG. 9, the specified social set 900 includes 6 first class identifications 901, 902, 903, 904, 905, and 906. The first type identifier 901 has an association relationship with the first type identifiers 902 and 903, the first type identifier 902 has an association relationship with the first type identifier 904, and the first type identifier 903 has an association relationship with the first type identifiers 905 and 906; the first type identifier 901 has no association relation with the first type identifiers 904, 905 and 906; the first type identifier 904 has no association with the first type identifiers 905 and 906; the first type identity 905 has no association with the first type identity 906.
Optionally, in the same designated social set, the kind of association relationship between different first class identifiers is the same, such as: the incidence relations among different first-class identifications are all binding relations; or, the kind of association relationship between different first type identifiers is different, such as: the association between the first type identifier 901 and the first type identifier 902 is a binding relationship, and the association between the first type identifier 901 and the first type identifier 903 is a subscription relationship.
The first social client selects a specified social set, including: a specified social set is selected from the at least one social set.
And the social set created by the first social client exists in the at least one social set, and/or the social set created by the second social client exists in the at least one social set.
The relevant introduction for each social set is the same as the relevant introduction for the specified social set.
The first social client selects a specified social set from the at least one social set, including: receiving a first display operation; displaying at least one social set according to the first display operation; and receiving a first selection operation, and determining the social set indicated by the first selection operation as a specified social set.
Optionally, the first display operation is a click operation, a long-press operation, a slide operation, a voice input operation, and the like, which is not limited in this embodiment.
Optionally, the first selection operation is a click operation, a long-press operation, a slide operation, a voice input operation, and the like, which is not limited in this embodiment.
Referring to the selection process of the designated social set shown in fig. 10, after the first social client generates the sharing message 1001, the first social client receives a first display operation acting on the sending option 1002; displaying at least one social set 1003 according to the first display operation; receiving a first selection operation; and determining the social set indicated by the first selection operation as a specified social set.
The first social client creates a specified social set, comprising: receiving a second display operation; displaying at least two first type identifications with association relation according to the second display operation; and receiving a second selection operation, and determining a set formed by the first type identification indicated by the second selection operation and the first type identification corresponding to the first social client as a specified social set.
Optionally, the second display operation is a click operation, a long-press operation, a slide operation, a voice input operation, and the like, which is not limited in this embodiment. The second display operation is the same as or different from the first display operation, which is not limited in this embodiment.
Optionally, the second selection operation is a click operation, a long-press operation, a slide operation, a voice input operation, and the like, which is not limited in this embodiment. The second selection operation is the same as or different from the first selection operation, which is not limited in this embodiment.
Referring to the creation process of the designated social set shown in fig. 11, after the first social client generates the sharing message 111, it receives a second display operation applied to the sending option 112; displaying at least one first type identifier 113 according to the second display operation; receiving a second selection operation; and determining the social set 114 formed by the first class identifiers 113 indicated by the second selection operation as the specified social set.
Optionally, after the first social client creates the social set, other social sets may also be determined as the designated social set, which is not limited in this embodiment. Such as: in fig. 11, after the first social client creates the social set 114, a third selection operation is received, and the social set indicated by the third selection operation is determined as the specified client.
In step 803, the first social client sends the sharing message and the set identifier of the specified social set to the server.
And the first social client encapsulates the sharing message and the set identification of the specified social set and sends the sharing message and the set identification to the server together.
Optionally, the set identifier of the specified social set is composed of at least two first-class identifiers included in the specified social set; or the set identification of the specified social set is generated by the server through a random algorithm; alternatively, the set identifier of the specified social set is generated by the social client that creates the specified social set through a random algorithm, which is not limited in this embodiment.
In step 804, the server receives the sharing message and the set identifier sent by the first social client.
And the server determines the type of the received message as the shared message according to the preset field in the shared message.
Step 805, the server determines at least two first class identifiers according to the set identifiers, and the at least two first class identifiers both belong to a specified social set.
When the set identifier consists of at least two first-class identifiers, the server analyzes the set identifier to obtain the at least two first-class identifiers; when the set identifier is generated by a random algorithm, the server determines at least two first-class identifiers corresponding to the received set identifier through a corresponding relation between the pre-stored set identifier and the at least two first-class identifiers.
In step 806, the server sends the sharing message and the set identifier to a second social client corresponding to the first type identifier.
After the server determines the first type identifiers corresponding to the set identifiers, the second social contact client corresponding to each first type identifier is determined to be a sending object of the sharing message, and the sharing message is sent to each second social contact client.
The server sends the sharing message and the set identifier to the second social client side together, so that the second social client side can determine that the sharing message is from the designated social set according to the set identifier, and the designated social set is visible to the second social client side.
In step 807, the second social client receives the server pushed sharing message and the set identifier.
And the second social client determines the type of the message as a sharing message according to the preset field in the received message.
Step 808, the second social client displays the shared message and the set identifier.
And after the second social client side determines that the sharing message is received, the sharing message and the set identification are displayed at the same time.
Optionally, the second social set determines at least two first type identifiers in the designated social set according to the set identifiers, and displays the at least two first type identifiers.
The second social client displays the shared message and the set identifier, including: displaying a message sharing interface corresponding to the set identifier, wherein the message sharing interface comprises at least one sharing message which is sequenced according to the sequence of the release time; displaying a sharing message in a message sharing interface; or displaying the sharing message and the set identifier in a message sharing interface; or displaying the sharing message, the set identifier and the first type identifier corresponding to the first social client in a message sharing interface.
In an example, the message sharing interface corresponding to the set identifier only displays the sharing message corresponding to the set identifier, and at this time, the message sharing interface corresponding to the set identifier includes the sharing message.
Optionally, the message sharing interface corresponding to the set identifier may further include the set identifier and a first type identifier of a first social client that is specified to send the sharing message in the social set, which is not limited in this embodiment.
At this time, the second social client displays a message sharing interface corresponding to the set identifier, including: displaying an information notification, wherein the information notification is used for indicating that a sharing message derived from a specified social set exists and comprises a set identifier of the specified social set; receiving a viewing operation; and displaying a message sharing interface corresponding to the set identification according to the set identification of the viewing operation instruction.
Optionally, the second social client displays the information notification before receiving the sharing message; or after receiving the sharing message, the embodiment does not limit this.
Referring to the schematic diagram of displaying a sharing message shown in fig. 12, the second social client displays an information notification 1201, where the information notification 1201 includes a set identifier; receiving a viewing operation, and displaying a message sharing interface 1202 corresponding to the set identifier according to the viewing operation; shared messages that originate from the specified social set identification 1203 are displayed in the message sharing interface 1202.
In another example, the message sharing interface corresponding to the set identifier displays the sharing message corresponding to the set identifier; sharing messages corresponding to other set identifications are also displayed; sharing messages sent by other social clients are also displayed. At this time, the message sharing interface corresponding to the set identifier includes the shared message, the set identifier corresponding to the shared message, and identifiers of other social clients that send the shared message.
Wherein the other set identifier refers to a set identifier received by the second social client except the set identifier of the specified social set; other social clients refer to social clients that do not send shared messages through a social collection.
Referring to the schematic diagram of fig. 13 showing shared messages, the second social client displays a message sharing interface 1302 corresponding to the set identifier 1301; the shared messages 1303 corresponding to the set identifiers 1301, the shared messages 1305 corresponding to the other set identifiers 1304, and the shared messages 1307 corresponding to the identifiers 1306 of the other social clients are displayed in the message sharing interface 1302.
Optionally, when the second social client does not receive the sharing message corresponding to the other set identifier, the sharing message corresponding to the other set identifier is not displayed; and/or when the second social client does not receive the sharing messages corresponding to the identifications of the other social clients, not displaying the sharing messages corresponding to the identifications of the other social clients.
Optionally, this embodiment takes the aggregate display (display in the same area) of the shared messages from the same social collection as an example for explanation, and in actual implementation, the shared messages from the same social collection may also be displayed in a dispersed manner, which is not limited in this embodiment.
It should be noted that, in this step, the way that the second social networking client displays the sharing message is also applicable to the first social networking client, which is not described herein again.
In summary, in the message pushing method provided in this embodiment, the first social client sends the sharing message to the second social clients belonging to the same social set, so that the first social client may select or create a social set including a part of the second social clients when only the sharing message needs to be sent to the part of the second social clients; the problem that the server consumes more resources due to the fact that the server sends the sharing message to all second social contact clients with friend relationships with the first social contact client is solved; because the server only needs to send the sharing message to the part of the second social clients, resources for sending the sharing message by the server are saved.
Optionally, after step 805 and before step 806, that is, after the server receives the sharing message, the server does not directly send the sharing message to the second social client, but sends a message notification to the second social client, where the message notification is used to indicate that the second social client has the sharing message derived from the specified social set; the second social client sends a message acquisition request to the server according to the message notification; the server performs step 806 upon receiving the message fetch request.
In this case, in a first example of step 808, when the second social client displays the message notification, the second social client does not yet receive the sharing message, but when receiving the viewing operation, the second social client generates a message obtaining request, and sends the message obtaining request to the server, so as to obtain the sharing message.
The message acquisition request carries a set identifier of the specified social set.
Wherein the message notification carries the set identifier. Optionally, the message notification further carries at least one of a type of the shared message, a number of the shared message, and a first type identifier of a first social client sending the shared message in the designated social set.
The process of the first social client creating the specified social set in step 802 is described below.
In one implementation mode, when the first social client sends the sharing message, the first social client sends at least two first-class identifiers determined according to the second selection operation to the server together; and the server generates a set identifier according to the at least two first-type identifiers and stores the set identifier and the sharing message.
In this implementation, the server does not send a sharing message at the first social client, and stores the set identifier of the specified social set, and the second social client does not determine to belong to the specified social set.
In another implementation manner, after determining at least two first-class identifiers according to a second selection operation, the first social client sends a set creation notification to the server; the server generates set identifications according to the at least two first-class identifications carried in the set creation notification, stores the set identifications, and sends the set creation notification to the second social client corresponding to each first-class identification.
In this implementation manner, no matter whether the first social client sends the sharing message or not, after the first social client creates the designated social set, the second social client can determine that the second social client belongs to the designated social set.
Optionally, in this way, the set creation notification received by the server further includes the set identification generated by the first social client.
Optionally, after receiving the at least two first type identifiers, the server generates a set identifier according to a random algorithm, and establishes a correspondence between the set identifier and the at least two first type identifiers; and when sending a set creation notification to the second social client, carrying the corresponding relationship in the set creation notification.
It should be added that, after the first social client creates the specified social set, at least one social client belonging to the specified social set has the authority to add other social clients to the specified social set.
The other social clients refer to social clients which have an association relationship with the social clients in the specified social set and do not belong to the specified social set.
Schematically, referring to fig. 9, it is assumed that the first class identifier corresponding to the first social client is 901, and at least two first class identifiers determined by the first social client according to the second selection operation are 901, 902, and 903.
For first class identifier 902, a second social client corresponding to first class identifier 902 has the authority to add the second social client corresponding to first class identifier 904 to the specified social set. First class identifier 902 and first class identifier 904 have an association relationship.
For the first type identifier 903, the second social client corresponding to the first type identifier 903 has the right to add the second social client corresponding to the first type identifiers 905 and 906 to the specified social set. First type identifier 903 and first type identifiers 904 and 906 have an association relationship.
Optionally, in each embodiment, each social client in the designated social set sets a sharing permission of a shared message from the designated social set, and each social client selectively shares the shared message from the designated social set to a third social client by setting the sharing permission, so that not only the second social client can obtain the shared message, but also the third social client can obtain the shared message, and the sharing range of the shared message is expanded.
The sharing authority is used for indicating whether a third social client side has the authority of obtaining the sharing message or not, a second type of identification corresponding to the third social client side is in an incidence relation with a first type of identification corresponding to the first social client side, and the second type of identification does not belong to a specified social set.
Optionally, the third social client corresponding to the second type identifier and the first social client corresponding to the first type identifier belong to the same social client.
Referring to fig. 14, a flowchart of a message pushing method according to another embodiment of the invention is shown based on the embodiment shown in fig. 8. In this embodiment, the method is exemplified by being applied to the message push system shown in fig. 7, and the method may include the following steps:
in step 1401, a first social client receives an authority setting operation.
The authority setting operation is at least one of a click operation, a long press operation, a slide operation, and a voice input operation.
In one example, the permission setting operation is used for uniformly setting sharing permissions of all social collections in the first social client.
The first social client side is provided with a first permission option for uniformly setting sharing permissions of all the social sets, and the first social client side sets the sharing permissions of all the social sets through permission setting operation acting on the first permission option.
Optionally, the first permission option is a virtual key displayed in the user interface by the first social client; or the first permission option is a physical key in a first terminal to which the first social client belongs.
Referring to fig. 15, a first permission option 1511 is displayed in the user interface of the first social client, and permission setting operation acting on the first permission option 1511 is received to set sharing permissions of all social collections.
In another example, the permission setting operation is used to set sharing permissions of each social set in the first social client, respectively.
The first social contact client side is provided with second permission options for setting sharing permission of each social contact set respectively, and the first social contact client side sets the sharing permission of the corresponding social contact set through permission setting operation acting on the second permission options.
Optionally, the second permission option is a virtual key displayed in the user interface by the first social client; or the second permission option is a physical key in the first terminal to which the first social client belongs.
Referring to fig. 16, a second permission option 1611 corresponding to each social set is displayed in the user interface of the first social client, and a permission setting operation acting on the second permission option corresponding to the social set 1612 is received to set the sharing permission of the social set 1612.
And 1402, the first social contact client sets the sharing authority of the first social contact client to the sharing message according to the authority setting operation.
Illustratively, in fig. 15, when the permission flag in the first permission option 1511 is on the left side of the first permission option 1511, the sharing permission indicates that the third social client has the permission to obtain the sharing message; when the permission flag in the first permission option 1511 is to the right of the first permission option 1511, the sharing permission indicates that the third social client does not have the permission to obtain the sharing message.
Illustratively, in fig. 16, when the permission flag in the second permission option 1611 is to the left of the second permission option 1611, the sharing permission indicates that the third social client has the permission to obtain the sharing message; when the permission flag in the second permission option 1611 is to the right of the second permission option 1611, the sharing permission indicates that the third social client does not have the permission to obtain the shared message.
Step 1403, the first social client sends the authority information corresponding to the sharing authority to the server.
And the first social client generates authority information according to the sharing authority, wherein the authority information is used for representing the meaning of the sharing authority. In this embodiment, the representation manner of the permission information is not limited, and schematically, a "1" indicates that the third social client has the permission to acquire the sharing message; "0" indicates that the third social client does not have permission to obtain the shared message.
Optionally, steps 1401-1403 are performed before step 803; alternatively, steps 1401-1403 are performed after step 803; alternatively, steps 1401-1403 are executed simultaneously with step 803, which is not limited in this embodiment.
After step 804, in step 1404, for each first class identifier belonging to the specified social collection, the server obtains permission information of the social client corresponding to the first class identifier.
Through steps 1401-1403, the server can receive the authority information corresponding to each first type identifier in the specified social collection, and after receiving the authority information corresponding to each first type identifier, the server stores the authority information respectively.
When the server receives the sharing message and the set identifier sent by the first social client, the server needs to determine which third social clients have the sharing permission to acquire the sharing message, and at the moment, the server acquires the sharing permission corresponding to each first type identifier in the specified social set from the prestored permission information.
Step 1405, when the sharing right indicates that the third social client has the right to acquire the sharing message, the server determines, for each first type identifier in the at least one first type identifier, a second type identifier having an association relationship with the first type identifier.
For each first type of identification, a second type of identification which has an association relation with the first type of identification is prestored in the server.
In an example, when the server determines that the sharing right corresponding to the first type identifier indicates that all the third social clients have the right to acquire the sharing message, the server reads the second type identifier corresponding to the first type identifier from the stored association relationship.
Referring to fig. 17, a designated social collection includes three first-class identifiers 1701, 1702 and 1703, and when the server 1700 receives a collection identifier 1704 of the designated social collection, the three first-class identifiers 1701, 1702 and 1703 corresponding to the collection identifier 1704 are read from the memory.
The server 1700 obtains the sharing right corresponding to the first type identifier 1701, and when the sharing right indicates that all the third social clients have the right to obtain the sharing message, reads all the second type identifiers 1705 from the association relationship corresponding to the first type identifier 1701.
The server 1700 obtains the sharing right corresponding to the first type identifier 1702, and reads all the second type identifiers 1706 from the association relationship corresponding to the first type identifier 1702 when the sharing right indicates that all the third social clients have the right to obtain the sharing message.
The server 1700 obtains the sharing right corresponding to the first type identifier 1703, and when the sharing right indicates that all the third social clients have the right to obtain the sharing message, reads all the second type identifiers 1707 from the association relationship corresponding to the first type identifier 1703.
In another example, when the server determines that the sharing permission corresponding to the first class identifier indicates that at least one third social client has the permission to obtain the sharing message, the second class identifier having the permission to obtain the sharing message is read from the association relationship stored in the server.
In this case, the sharing right carries at least one second type identifier, and the second type identifier read by the server is matched with the second type identifier carried in the sharing right.
Referring to fig. 18, the designated social set includes three first class identifiers 1801, 1802, and 1803, and when the server 1800 receives the set identifier 1804 of the designated social set, the three first class identifiers 1801, 1802, and 1803 corresponding to the set identifier 1804 are read.
The server 1800 obtains the sharing right corresponding to the first type identifier 1801, and when the sharing right indicates that the third social client corresponding to the second type identifiers 1805 and 1806 has the right to obtain the sharing message, reads the second type identifiers 1805 and 1806 from the association relationship corresponding to the first type identifier 1801.
The server 1800 obtains the sharing right corresponding to the first type identifier 1802, and when the sharing right indicates that the third social client corresponding to the second type identifier 1807 has the right to obtain the sharing message, reads all the second type identifiers 1807 from the association relationship corresponding to the first type identifier 1802.
The server 1800 obtains the sharing right corresponding to the first type identifier 1803, and when the sharing right indicates that the third social client corresponding to the second type identifier 1808 has the right to obtain the sharing message, reads all the second type identifiers 1808 from the association relationship corresponding to the first type identifier 1803.
In step 1406, the server sends the sharing message and the set identifier to a third social client corresponding to the second type identifier.
Accordingly, the third social client receives and displays the shared message and the set identifier.
The relevant description of the third social client sharing message and the set identifier is the same as that in 808, and is not repeated here.
Optionally, steps 1404-1406 are performed after step 806; alternatively, steps 1404-1406 are performed before step 806; alternatively, steps 1404-1406 are performed simultaneously with step 806, which is not limited in this embodiment.
Optionally, before step 1406, the server sends the information notification to the third social client, and when an information obtaining request sent by the third social client is received, step 1406 is executed again.
In summary, in the information push method provided in this embodiment, the shared message sent by the first social client is sent to the third social client, where an association relationship exists between the second type identifier corresponding to the third social client and at least one first type identifier in the specified social set to which the first social client belongs, so that not only the second social client corresponding to the at least one first type identifier can obtain the shared message, but also the second type identifier having an association relationship with the first type identifier can obtain the shared message, and a push range of the shared message is improved.
Optionally, the first social contact client and/or the second social contact client and/or the third social contact client that acquire the sharing message also receive a reply message to the sharing message, and send the reply message to the server, and the server sends the reply message to the first social contact client and the second social contact client that acquires the sharing message; or the server sends the reply message to the first social contact client, the second social contact client obtaining the sharing message, and the third social contact client obtaining the sharing message.
Optionally, the reply message includes a text, a picture, a video, an audio, a file, and the like, which is not limited in this embodiment.
The transmission mode of the reply message and the transmission mode of the shared message are exchanged only by the sender and the receiver, which is not described herein again in this embodiment.
In addition, as for a storage structure of the reply message in the server, refer to fig. 6, which is not described herein again.
The social client receives a reply message, comprising: and receiving a reply operation, and generating a reply message according to the reply operation.
The reply operation comprises at least one of a character input operation, a voice input operation, a click operation, a long press operation and a sliding operation.
Generating the reply message according to the reply operation comprises: generating a focus message according to the focus operation, generating a comment message according to the comment operation, generating a forwarding message according to the forwarding operation, and the like, which is not limited in this embodiment.
Referring to the schematic diagram of the social client side shown in fig. 19A for receiving the reply message, the social client side may be a first social client side, a second social client side, or a third social client side, which is not limited in this embodiment.
A reply option 1901 is displayed in a message sharing interface of the social client, a click operation acting on the reply option 1901 is received, and a message reply interface 1902 is displayed according to the click operation; receiving input information 1903 in the message reply interface 1902; when a send operation acting on the send option 1904 in the message reply interface 1902 is received, all input information 1903 is determined as reply information. Wherein the click operation, the sending operation and the input operation constitute a reply operation.
Optionally, when the social client displays the reply message, the social client displays the reply message below the shared message; or, the reply message is displayed by being covered on the sharing message.
Illustratively, the reply message is shown overlaid on the share message in the form of a predetermined animation. Such as: overlaying the concerned message on the sharing message in a preset animation mode for displaying; and overlaying the comment message and/or the forwarded message on the shared message in a preset animation mode for displaying and the like.
Wherein the predetermined animation includes, but is not limited to: at least one of the display time, the display position, the display template, the display track and the display size.
Such as: the display duration is 2s from the beginning of playing the reply message, the display position is above the display area for sharing the message, the display track slides to the upper left along a straight line from the upper right, the display template adds colors to the text information, and the display size is font two.
Optionally, the predetermined animations corresponding to different kinds of reply messages are different, such as: the predetermined animation corresponding to the comment message is different from the predetermined animation corresponding to the attention message.
Referring to fig. 19B, when presenting the attention message, the terminal overlays a heart 1907 on the shared message 1906, and presents the heart 1907 as a straight line for 5s, where the number of the heart 1907 represents the number of the attention messages. When the terminal displays the comment message and/or the forwarding message, the comment message and/or the forwarding message 1908 is slid from the upper right to the upper left (along the direction indicated by the arrow in the figure) of the shared message according to a straight line, and the sliding time is 2s.
It should be noted that, this embodiment is only described by taking the predetermined animation as an example, and the predetermined animation may also be set by a user in actual implementation, which is not limited in this embodiment. Such as: the user sets the display position, display template, display duration, display track, etc. of the comment message and/or the forward message 1908.
Optionally, the display mode may be displayed when the social client receives the reply message, for example: receiving comment messages and/or attention messages input by a user, and receiving comment messages and/or attention messages sent by other social clients; it can also be presented when the social client receives a viewing operation, such as: displaying when receiving an operation for viewing the sharing message; or, the operation for viewing the reply message is received and displayed, which is not limited in this embodiment.
It should be added that the message format of the reply message is different from the message format of the shared message, such as: the preset field carried by the reply message is different from the preset field of the sharing message.
The following describes a specific example of the message pushing method provided in the foregoing embodiments, where the shared message is video information in this example.
Referring to fig. 20, a flowchart of a message pushing method according to another embodiment of the present invention is shown. The embodiment is described by taking the method as an example applied to the first terminal 710 shown in fig. 7, and the method may include the following steps:
step 2001, the first social client starts a camera to shoot a video;
step 2002, the first social client processes the video to obtain a sharing message;
step 2003, the first social client creating a specified social set or selecting the specified social set;
in step 2004, the first social client posts the shared message to a second social client belonging to the specified social set.
Accordingly, referring to fig. 21, a flowchart of a message pushing method according to another embodiment of the present invention is shown. The embodiment is described by taking the method as an example applied to the first terminal 730 shown in fig. 7, and the method may include the following steps:
step 2101, the second social client receives a sharing message from the designated social set;
step 2102, the second social client displays the sharing message and a set identifier corresponding to the specified social set;
at step 2103, the second social client receives the reply message.
The following are embodiments of the apparatus of the present invention that may be used to perform embodiments of the method of the present invention. For details which are not disclosed in the embodiments of the apparatus of the present invention, reference is made to the embodiments of the method of the present invention.
Referring to fig. 22, a block diagram of a message pushing apparatus provided in an embodiment of the present invention is shown, where the apparatus has a function of executing the above method example, and the function may be implemented by hardware, or by hardware executing corresponding software. The apparatus may include: a generation module 2210, a creation selection module 2220, and a transmission module 2230.
A generation module 2210 for performing the above step 801;
a creation selection module 2220 for executing the above step 802;
a sending module 2230, configured to execute the step 803.
Reference may be made in detail to the method embodiment illustrated in fig. 8.
Optionally, a creating selection module 2220 includes: a selection unit and a creation unit.
A selecting unit, configured to select the specified social set from at least one social set, where a social set created by the first social client exists in the at least one social set, and/or a social set created by the second social client exists in the at least one social set;
a creating unit configured to create the specified social set;
and determining whether the specified social set has at least one first type identifier corresponding to the first social client or not, wherein at least one first type identifier in the specified social set has an association relation with the first type identifier corresponding to the first social client, and/or at least one first type identifier in the specified social set has no association relation with the first type identifier corresponding to the first social client.
Optionally, the apparatus further comprises: the device comprises an authority receiving module, an authority setting module and an information sending module.
A permission receiving module, configured to perform step 1401;
a permission setting module for executing step 1402;
an information sending module, configured to execute step 1403.
Optionally, the apparatus further comprises: the display device comprises a first display module and a second display module.
The first display module is used for displaying a message sharing interface corresponding to the set identifier, wherein the message sharing interface comprises at least one sharing message which is sorted according to the sequence of the release time;
the second display module is used for displaying the sharing message in the message sharing interface; or, displaying the sharing message and the set identifier in the message sharing interface; or displaying the sharing message, the set identifier and the first type identifier corresponding to the first social client in the message sharing interface.
Reference may be made in detail to the method embodiments illustrated in fig. 8 and 14.
Referring to fig. 23, a block diagram of a message pushing apparatus provided in an embodiment of the present invention is shown, where the apparatus has a function of executing the above method example, and the function may be implemented by hardware, or by hardware executing corresponding software. The apparatus may include: a receiving module 2310, a determining module 2320, and a sending module 2330.
A receiving module 2310 for performing step 804;
a determining module 2320 for performing step 805;
a sending module 2330 configured to execute step 806.
Reference may be made in detail to the method embodiment illustrated in fig. 8.
Optionally, the sending module includes: a receiving unit and a transmitting unit.
The receiving unit is used for receiving a message acquisition request sent by the second social client;
and the sending unit is used for sending the sharing message and the set identifier to the second social client according to the message acquisition request.
Optionally, the apparatus further comprises: the device comprises a first determining module and a first sending module.
A first determining module, configured to determine, for each of the at least one first class identifier, a second class identifier that has an association relationship with the first class identifier, where the second class identifier does not belong to the specified social set;
a first sending module, configured to execute step 1406.
Optionally, the apparatus further comprises: and an acquisition module.
An obtaining module configured to perform step 1404;
a first determining module, further configured to perform step 1405.
Reference may be made in relation to the method embodiment shown in fig. 8 and 14.
Referring to fig. 24, a block diagram of a message pushing apparatus provided in an embodiment of the present invention is shown, where the apparatus has a function of executing the above method example, and the function may be implemented by hardware, or by hardware executing corresponding software. The apparatus may include: a receiving module 2410 and a display module 2420.
A receiving module 2410, configured to perform step 807;
a displaying module 2420 for performing the step 808.
Reference may be made in detail to the method embodiment illustrated in fig. 8.
Optionally, a display module, comprising: a first display unit and a second display unit.
The first display unit is used for displaying a message sharing interface corresponding to the set identifier, wherein the message sharing interface comprises at least one sharing message which is sequenced according to the sequence of the release time;
the second display unit is used for displaying the sharing message in the message sharing interface; or, displaying the sharing message and the set identifier in the message sharing interface; or displaying the sharing message, the set identifier and the first type identifier corresponding to the first social client in the message sharing interface.
Reference may be made in detail to the method embodiments illustrated in fig. 8 and 14.
It should be noted that: in the above embodiment, when the device implements the functions thereof, only the division of the functional modules is illustrated, and in practical applications, the functions may be distributed by different functional modules according to needs, that is, the internal structure of the device may be divided into different functional modules to implement all or part of the functions described above. In addition, the apparatus and method embodiments provided by the above embodiments belong to the same concept, and specific implementation processes thereof are described in the method embodiments for details, which are not described herein again.
Referring to fig. 25, a schematic structural diagram of a terminal according to an embodiment of the present invention is shown. The terminal 2500 is used to implement the message pushing method provided in the above-described embodiment. Specifically, the method comprises the following steps:
terminal 2500 may include components such as RF (Radio Frequency) circuitry 2510, memory 2520 including one or more computer readable storage media, input unit 2530, display unit 2540, sensor 2550, audio circuitry 2560, wiFi (wireless fidelity) module 2570, processor 2580 including one or more processing cores, and power supply 2590. Those skilled in the art will appreciate that the terminal structure shown in fig. 25 is not intended to be limiting and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components. Wherein:
RF circuit 2510 may be configured to receive and transmit signals during a message transmission or call, and in particular, receive downlink messages from a base station and process the received downlink messages in one or more processors 2580; in addition, data relating to uplink is transmitted to the base station. In general, RF circuit 2510 includes, but is not limited to, an antenna, at least one Amplifier, a tuner, one or more oscillators, a Subscriber Identity Module (SIM) card, a transceiver, a coupler, an LNA (Low Noise Amplifier), a duplexer, and the like. In addition, RF circuitry 2510 may also communicate with networks and other devices via wireless communications. The wireless communication may use any communication standard or protocol, including but not limited to GSM (Global System for Mobile communications), GPRS (General Packet Radio Service), CDMA (Code Division Multiple Access), WCDMA (Wideband Code Division Multiple Access), LTE (Long Term Evolution), email, SMS (Short Messaging Service), and the like.
The memory 2520 may be used to store software programs and modules, and the processor 2580 executes various functional applications and data processing by operating the software programs and modules stored in the memory 2520. The memory 2520 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, application programs (such as a sound playing function, an image playing function, etc.) required for at least one function, and the like; the storage data area may store data (such as audio data, a phonebook, etc.) created according to the use of the terminal 2500, and the like. Further, the memory 2520 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid state storage device. Accordingly, the memory 2520 may also include a memory controller to provide the processor 2580 and the input unit 2530 access to the memory 2520.
The input unit 2530 may be used to receive input numeric or character information and generate keyboard, mouse, joystick, optical or trackball signal inputs related to user settings and function control. In particular, the input unit 2530 may include an image input device 2531 and other input devices 2532. The image input device 2531 may be a camera or may be a photo-scanning device. The input unit 2530 may include other input devices 2532 in addition to the image input device 2531. In particular, other input devices 2532 can include, but are not limited to, one or more of a physical keyboard, function keys (such as volume control keys, switch keys, etc.), a trackball, a mouse, a joystick, and the like.
The display unit 2540 may be used to display information input by or provided to the user and various graphical user interfaces of the terminal 2500, which may be made up of graphics, text, icons, video, and any combination thereof. The Display unit 2540 may include a Display panel 2541, and optionally, the Display panel 2541 may be configured in the form of an LCD (Liquid Crystal Display), an OLED (Organic Light-Emitting Diode), or the like.
Terminal 2500 can also include at least one sensor 2550, such as a light sensor, motion sensor, and other sensors. Specifically, the light sensor may include an ambient light sensor that adjusts the brightness of the display panel 2541 according to the brightness of ambient light, and a proximity sensor that turns off the display panel 2541 and/or backlight when the terminal 2500 is moved to the ear. As one of the motion sensors, the gravity acceleration sensor can detect the magnitude of acceleration in each direction (generally, three axes), can detect the magnitude and direction of gravity when the mobile phone is stationary, and can be used for applications of recognizing the posture of the mobile phone (such as horizontal and vertical screen switching, related games, magnetometer posture calibration), vibration recognition related functions (such as pedometer and tapping), and the like; as for other sensors such as a gyroscope, a barometer, a hygrometer, a thermometer, and an infrared sensor, which can be configured in the terminal 2500, detailed descriptions thereof are omitted.
Audio circuitry 2560, speakers 2561, and microphone 2562 may provide an audio interface between a user and terminal 2500. The audio circuit 2560 may transmit the electrical signal obtained by converting the received audio data to the speaker 2561, and convert the electrical signal into a sound signal by the speaker 2561 and output the sound signal; on the other hand, the microphone 2562 converts collected sound signals into electrical signals, which are received by the audio circuit 2560 and converted into audio data, which are then processed by the audio data output processor 2580 and then transmitted to, for example, another terminal via the RF circuit 2510, or output to the memory 2520 for further processing. The audio circuit 2560 may also include an ear-bud jack to provide peripheral headphones for communication with the terminal 2500.
WiFi belongs to short-distance wireless transmission technology, and the terminal 2500 can help the user send and receive e-mail, browse web pages, access streaming media, etc. through the WiFi module 2570, and it provides wireless broadband internet access for the user. Although fig. 25 shows WiFi module 2570, it is understood that it does not belong to the essential constitution of terminal 2500 and may be omitted entirely as needed within the scope not changing the essence of the invention.
Processor 2580 is the control center for terminal 2500, and interfaces and circuitry to interface various portions of the overall handset, and performs various functions and processes data for terminal 2500 by running or executing software programs and/or modules stored in memory 2520, as well as invoking data stored in memory 2520, thereby providing overall monitoring of the handset. Alternatively, processor 2580 may include one or more processing cores; preferably, the processor 2580 may integrate an application processor, which mainly handles operating systems, user interfaces, application programs, etc., and a modem processor, which mainly handles wireless communication. It will be appreciated that the modem processor described above may not be integrated into processor 2580.
Terminal 2500 also includes a power supply 2590 (e.g., a battery) that provides power to the various components, which are preferably logically connected to processor 2580 via a power management system, such that the functions of managing charging, discharging, and power consumption are performed via the power management system. Power supply 2590 may also include any component including one or more dc or ac power sources, recharging systems, power failure detection circuitry, power converters or inverters, power status indicators, and the like.
Although not shown, the terminal 2500 may further include a bluetooth module or the like, which is not described in detail herein.
In this embodiment, the terminal 2500 further includes a memory and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors. The one or more programs include instructions for performing the above-described methods.
Fig. 26 is a schematic structural diagram of a server according to an embodiment of the present invention. Server 2600 includes a Central Processing Unit (CPU) 2601, a system memory 2604 including a Random Access Memory (RAM) 2602 and a read-only memory (ROM) 2603, and a system bus 2605 connecting system memory 2604 and Central Processing Unit 2601. The server 2600 also includes a basic input/output system (I/O system) 2606, which facilitates transfer of information between devices within the computer, and a mass storage device 2607 for storing an operating system 2613, application programs 2614, and other program modules 2615.
The basic input/output system 2606 includes a display 2608 for displaying information and an input device 2609, such as a mouse, keyboard, etc., for user input of information. Wherein the display 2608 and input devices 2609 are connected to the central processing unit 2601 through an input/output controller 2610 connected to the system bus 2605. The basic input/output system 2606 may also include an input/output controller 2610 for receiving and processing input from a number of other devices, such as a keyboard, mouse, or electronic stylus. Similarly, the input/output controller 2610 also provides output to a display screen, a printer, or other type of output device.
The mass storage device 2607 is connected to the central processing unit 2601 through a mass storage controller (not shown) connected to the system bus 2605. The mass storage device 2607 and its associated computer-readable media provide non-volatile storage for the server 2600. That is, the mass storage device 2607 may include a computer readable medium (not shown) such as a hard disk or a Compact Disc Read-Only Memory (CD-ROM) drive.
Without loss of generality, the computer readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media include RAM, ROM, erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other solid state memory technologies, CD-ROM, digital Versatile Disks (DVD), or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage, or other magnetic storage devices. Of course, those skilled in the art will appreciate that the computer storage media is not limited to the foregoing. The system memory 2604 and mass storage device 2607 described above may collectively be referred to as memory.
The server 2600 may also operate as a remote computer connected to a network via a network, such as the internet, according to various embodiments of the invention. That is, the server 2600 may be connected to the network 2612 through the network interface unit 2611 connected to the system bus 2605, or the network interface unit 2611 may be used to connect to other types of networks or remote computer systems (not shown).
An embodiment of the present invention further provides a computer-readable storage medium, where the computer-readable storage medium may be a computer-readable storage medium contained in the memory in the foregoing embodiment; or it may be a separate computer-readable storage medium not incorporated in the terminal. The computer-readable storage medium stores one or more programs, and the one or more programs are used by one or more processors to execute the message push method.
An embodiment of the present invention further provides a computer-readable storage medium, where the computer-readable storage medium may be a computer-readable storage medium contained in the memory in the foregoing embodiment; or it may be a computer-readable storage medium that exists separately and is not assembled into a server. The computer-readable storage medium stores one or more programs, and the one or more programs are used by one or more processors to execute the message pushing method.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, where the program may be stored in a computer-readable storage medium, and the storage medium may be a read-only memory, a magnetic disk or an optical disk.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.

Claims (20)

1. A message pushing method, performed by a first social client, the method comprising:
generating a sharing message, wherein the sharing message refers to a message which is published to a second social client by a first social client at least one publishing time, and each publishing event corresponds to the message at the publishing time;
creating or selecting a designated social set, wherein the identifiers belonging to the designated social set are first class identifiers, the designated social set is visible to the social clients corresponding to the first class identifiers, the social clients corresponding to the first class identifiers have the authority of acquiring the sharing message, and the social clients corresponding to the first class identifiers comprise the first social clients and the second social clients;
sending the sharing message and the set identifier of the specified social set to a server, wherein the server is used for sending the sharing message and the set identifier to a second social client corresponding to the first type identifier, the second social client is used for displaying the sharing message on a message sharing interface corresponding to the set identifier, different set identifiers correspond to different message sharing interfaces, and a reply message of the sharing message is deleted along with deletion of the sharing message.
2. The method of claim 1, wherein the creating or selecting the designated social set comprises:
selecting the designated social set from at least one social set, wherein the social set created by the first social client exists in the at least one social set, and/or the social set created by the second social client exists in the at least one social set;
alternatively, the first and second electrodes may be,
creating the designated social collection; and the specified social set comprises at least one first type identifier and a first type identifier corresponding to the first social client, and/or the specified social set comprises at least one first type identifier and a first type identifier corresponding to the first social client.
3. The method of claim 2, wherein the association comprises: the social network service system comprises at least one of binding relations among identifications corresponding to different social client sides, subscription relations among identifications corresponding to different social client sides, distances among different social client sides are smaller than a preset distance, and the identifications corresponding to different social client sides pay attention to the same information.
4. The method of claim 2, wherein selecting the designated social set from at least one social set comprises:
responding to a first display operation, and displaying at least one social set according to the first display operation;
in response to a first selection operation, determining a social set indicated by the first selection operation as the specified social set.
5. The method of claim 2, wherein the creating the specified social set comprises:
responding to a second display operation, and displaying at least two first type identifications with association relation according to the second display operation;
and in response to receiving a second selection operation, determining a set formed by the first class identification indicated by the second selection operation and the first class identification corresponding to the first social client as the specified social set.
6. A method according to any of claims 1 to 3, characterized in that the method further comprises:
receiving authority setting operation;
setting sharing permission of the first social client to the sharing message according to the permission setting operation, wherein the sharing permission is used for indicating whether a third social client has permission to acquire the sharing message, a second type of identification corresponding to the third social client has an association relation with a first type of identification corresponding to the first social client, and the second type of identification does not belong to the specified social set;
and sending authority information corresponding to the sharing authority to the server, wherein the server is used for sending the sharing message and the set identifier to the third social contact client when the sharing authority corresponding to the authority information indicates that the third social contact client has the authority to obtain the sharing message.
7. The method of any of claims 1 to 3, further comprising:
displaying a message sharing interface corresponding to the set identifier, wherein the message sharing interface comprises at least one sharing message which is sorted according to the sequence of the release time;
displaying the sharing message in the message sharing interface; or, displaying the sharing message and the set identifier in the message sharing interface; or displaying the sharing message, the set identifier and the first type identifier corresponding to the first social client in the message sharing interface.
8. A message pushing method, the method being performed by a server, the method comprising:
receiving a sharing message and a set identifier sent by a first social client, wherein the sharing message refers to a message which is published to a second social client by the first social client at least one publishing time, and each publishing event corresponds to the message at the publishing time; the set identifier is an identifier of a designated social set created or selected by the first social client, the identifier belonging to the designated social set is a first-class identifier, the designated social set is visible to the social client corresponding to each first-class identifier, the social client corresponding to each first-class identifier has the authority to acquire the sharing message, and the social clients corresponding to the first-class identifiers comprise the first social client and the second social client;
and sending the sharing message and the set identifier to a second social client corresponding to the first type identifier, wherein the second social client is used for displaying the sharing message on a message sharing interface corresponding to the set identifier, different set identifiers correspond to different message sharing interfaces, and a reply message of the sharing message is deleted along with deletion of the sharing message.
9. The method of claim 8, wherein sending the sharing message and the set identifier to a second social client corresponding to the first type identifier comprises:
receiving a message acquisition request sent by the second social client;
and sending the sharing message and the set identifier to the second social client according to the message acquisition request.
10. The method of claim 8, further comprising:
and sending the sharing message and the set identification to a third social client corresponding to a second type identification, wherein the second type identification has an association relation with the first type identification, and the second type identification does not belong to the specified social set.
11. The method of claim 10, wherein before sending the shared message and the set identifier to a third social client corresponding to the second type identifier, the method further comprises:
for each first type of identification belonging to the appointed social set, acquiring authority information of a social client corresponding to the first type of identification, wherein a sharing authority corresponding to the authority information is used for indicating whether the third social client has the authority to acquire the sharing message;
and when the sharing authority indicates that the third social client side has the authority of acquiring the sharing message, triggering and executing the step of sending the sharing message and the set identifier to the third social client side corresponding to the second type identifier.
12. A message pushing method, characterized in that the method is executed by a second social client, the method comprising:
receiving a sharing message and a set identifier pushed by a server, wherein the sharing message is a message which is published to a second social contact client by a first social contact client at least one publishing time; the set identifier is an identifier of a designated social set created or selected by the first social client, the identifier belonging to the designated social set is a first-class identifier, the designated social set is visible to the social client corresponding to each first-class identifier, the social client corresponding to each first-class identifier has the authority to acquire the sharing message, and the social clients corresponding to the first-class identifiers comprise the first social client and the second social client;
and displaying the sharing message on a message sharing interface corresponding to the set identifier, wherein different set identifiers correspond to different message sharing interfaces, and the reply message of the sharing message is deleted along with deletion of the sharing message.
13. The method of claim 12, wherein displaying the shared message on a message sharing interface corresponding to the set identifier comprises:
displaying a message sharing interface corresponding to the set identifier, wherein the message sharing interface comprises at least one sharing message which is sorted according to the sequence of the release time;
displaying the sharing message in the message sharing interface; or, displaying the sharing message and the set identifier in the message sharing interface; or displaying the sharing message, the set identifier and the first type identifier corresponding to the first social client in the message sharing interface.
14. The method according to claim 13, wherein the displaying of the message sharing interface corresponding to the set identifier comprises:
displaying an information notification, wherein the information notification is used for indicating that a sharing message derived from the specified social set exists, and the information notification contains a set identifier of the specified social set;
and responding to a viewing operation, and displaying the message sharing interface corresponding to the set identification according to the set identification indicated by the viewing operation.
15. The method according to any one of claims 12 to 14, wherein after the sharing message is displayed on the message sharing interface corresponding to the set identifier, the method further comprises:
responding to click operation of a reply option in the message sharing interface, and displaying a message reply interface according to the click operation;
receiving input information in the message reply interface;
responding to the sending operation of a sending option in the message reply interface, and determining the input information as the reply message;
and displaying the reply message below the sharing message, or displaying the reply message on the sharing message in a covering manner.
16. A message push apparatus, the apparatus comprising:
the generating module is used for generating a sharing message, wherein the sharing message refers to a message which is published to a second social contact client by a first social contact client at least one publishing time, and each publishing event corresponds to the message at the publishing time;
the creating and selecting module is used for creating or selecting a specified social set, the identifiers belonging to the specified social set are first class identifiers, the specified social set is visible to the social client side corresponding to each first class identifier, the social client side corresponding to each first class identifier has the authority of obtaining the sharing message, and the social client side corresponding to the first class identifier comprises the first social client side and the second social client side;
the sending module is used for sending the sharing message and the set identification of the specified social set to a server, the server is used for sending the sharing message and the set identification to a second social client side corresponding to the first type identification, the second social client side is used for displaying the sharing message on a message sharing interface corresponding to the set identification, different set identifications correspond to different message sharing interfaces, and reply messages of the sharing message are deleted along with deletion of the sharing message.
17. A message push apparatus, the apparatus comprising:
the system comprises a receiving module, a collecting module and a sending module, wherein the receiving module is used for receiving a sharing message and a set identifier sent by a first social client, the sharing message refers to a message which is published by the first social client to a second social client at least one publishing time, and each publishing event corresponds to the message at the publishing time; the set identifier is an identifier of a designated social set created or selected by the first social client, the identifier belonging to the designated social set is a first class identifier, the designated social set is visible to the social client corresponding to each first class identifier, the social client corresponding to each first class identifier has the authority to acquire the sharing message, and the social client corresponding to the first class identifier comprises the first social client and the second social client;
the sending module is used for sending the sharing message and the set identifier to a second social client side corresponding to the first type identifier, the second social client side is used for displaying the sharing message on a message sharing interface corresponding to the set identifier, different set identifiers correspond to different message sharing interfaces, and a reply message of the sharing message is deleted along with deletion of the sharing message.
18. A message push apparatus, the apparatus comprising:
the server comprises a receiving module, a sending module and a receiving module, wherein the receiving module is used for receiving a sharing message and a set identifier pushed by the server, and the sharing message is a message which is published to a second social contact client by a first social contact client at least one publishing time; the set identifier is an identifier of a designated social set created or selected by the first social client, the identifier belonging to the designated social set is a first class identifier, the designated social set is visible to the social client corresponding to each first class identifier, the social client corresponding to each first class identifier has the authority to acquire the sharing message, and the social client corresponding to the first class identifier comprises the first social client and the second social client;
and the display module is used for displaying the shared message on the message sharing interface corresponding to the set identifier, wherein different set identifiers correspond to different message sharing interfaces, and the reply message of the shared message is deleted along with the deletion of the shared message.
19. A message push system, the system comprising: a first social client, a server and a second social client;
the first social client is the message pushing device of claim 16;
the server is the message pushing device according to claim 17;
the second social client is the message pushing device of claim 18.
20. A computer-readable storage medium, wherein the storage medium stores at least one instruction for execution by a processor to implement the message pushing method of any one of claims 1 to 7, or to implement the message pushing method of any one of claims 8 to 11, or to implement the message pushing method of any one of claims 12 to 15.
CN202110739622.6A 2017-04-27 2017-04-27 Message pushing method, device and system Active CN113329100B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110739622.6A CN113329100B (en) 2017-04-27 2017-04-27 Message pushing method, device and system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710287477.6A CN108809798B (en) 2017-04-27 2017-04-27 Message pushing method, device and system
CN202110739622.6A CN113329100B (en) 2017-04-27 2017-04-27 Message pushing method, device and system

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
CN201710287477.6A Division CN108809798B (en) 2017-04-27 2017-04-27 Message pushing method, device and system

Publications (2)

Publication Number Publication Date
CN113329100A CN113329100A (en) 2021-08-31
CN113329100B true CN113329100B (en) 2022-10-14

Family

ID=64070136

Family Applications (2)

Application Number Title Priority Date Filing Date
CN201710287477.6A Active CN108809798B (en) 2017-04-27 2017-04-27 Message pushing method, device and system
CN202110739622.6A Active CN113329100B (en) 2017-04-27 2017-04-27 Message pushing method, device and system

Family Applications Before (1)

Application Number Title Priority Date Filing Date
CN201710287477.6A Active CN108809798B (en) 2017-04-27 2017-04-27 Message pushing method, device and system

Country Status (1)

Country Link
CN (2) CN108809798B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111314210B (en) * 2020-02-13 2021-12-24 上海掌门科技有限公司 Method and equipment for social interaction
CN112162961B (en) * 2020-10-29 2024-04-19 腾讯科技(深圳)有限公司 Message processing method, device, computer equipment and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012178121A1 (en) * 2011-06-24 2012-12-27 Google Inc. Group conversation between a plurality of participants
CN104301315A (en) * 2014-09-30 2015-01-21 腾讯科技(深圳)有限公司 Method and device for limiting information access
CN104391629A (en) * 2014-08-08 2015-03-04 腾讯科技(深圳)有限公司 Method for sending message in orientation manner, method for displaying message, server and terminal
CN104410615A (en) * 2014-11-20 2015-03-11 北京奇虎科技有限公司 Method, client terminal, server and system for accessing shared data
CN105634760A (en) * 2015-12-29 2016-06-01 腾讯科技(深圳)有限公司 Method and apparatus for communication between official account and user

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130332856A1 (en) * 2012-06-10 2013-12-12 Apple Inc. Digital media receiver for sharing image streams
CN106302631B (en) * 2016-07-21 2019-04-26 三星电子(中国)研发中心 A kind of method and system of sharing contents

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012178121A1 (en) * 2011-06-24 2012-12-27 Google Inc. Group conversation between a plurality of participants
CN104391629A (en) * 2014-08-08 2015-03-04 腾讯科技(深圳)有限公司 Method for sending message in orientation manner, method for displaying message, server and terminal
CN104301315A (en) * 2014-09-30 2015-01-21 腾讯科技(深圳)有限公司 Method and device for limiting information access
CN104410615A (en) * 2014-11-20 2015-03-11 北京奇虎科技有限公司 Method, client terminal, server and system for accessing shared data
CN105634760A (en) * 2015-12-29 2016-06-01 腾讯科技(深圳)有限公司 Method and apparatus for communication between official account and user

Also Published As

Publication number Publication date
CN108809798B (en) 2021-06-11
CN108809798A (en) 2018-11-13
CN113329100A (en) 2021-08-31

Similar Documents

Publication Publication Date Title
CN105391803B (en) Message pushing method, device, equipment and computer readable storage medium
US10580092B2 (en) Resource transfer system and method
US10218657B2 (en) Method and system for providing private chat within a group chat
CN108306810B (en) Group building method, server and terminal
CN107172477B (en) Voting method and device
US20170230326A1 (en) Integrated Messaging
CN110035004B (en) User name card sharing method, friend adding method and related device
WO2017050068A1 (en) Interaction system and method, client, and background server
CN105025043B (en) Information sharing method, apparatus and system
JP6557741B2 (en) Picture combining method, terminal, and picture combining system
US11337060B2 (en) Electronic business card privacy protection system prevents displaying user account information
CN112087362B (en) Message forwarding method and device between clients and terminal
CN108206742B (en) Message sending method, device, server and system
WO2018205786A1 (en) Method, apparatus and device for sharing screen-recording video
CN108702602A (en) Share method, electronic equipment and the system of image
CN107154894B (en) Instant messaging information processing method, device, system and storage medium
CN109391476A (en) Internet phone-calling method, apparatus and system
TWI707237B (en) Method for transmitting information, method for displaying information, terminal, server, system and storage medium
CN111596821B (en) Message display method, device, computer equipment and storage medium
CN113329100B (en) Message pushing method, device and system
CN106161188B (en) Message sending method, message display method and device
CN114553612B (en) Data encryption and decryption method and device, storage medium and electronic equipment
CN109120654B (en) Information prompting method and device for server and storage medium
CN116684369A (en) Expression sharing method and device, storage medium and computer equipment
CN115712380A (en) Information processing method and device and computer readable storage medium

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
GR01 Patent grant
GR01 Patent grant