CN113961829B - Improved friend list generation method, device and equipment based on push-pull model - Google Patents
Improved friend list generation method, device and equipment based on push-pull model Download PDFInfo
- Publication number
- CN113961829B CN113961829B CN202111202722.1A CN202111202722A CN113961829B CN 113961829 B CN113961829 B CN 113961829B CN 202111202722 A CN202111202722 A CN 202111202722A CN 113961829 B CN113961829 B CN 113961829B
- Authority
- CN
- China
- Prior art keywords
- user
- users
- type
- inbox
- attention
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9538—Presentation of query results
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9536—Search customisation based on social or collaborative filtering
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Abstract
The invention discloses a friend list generation method, a friend list generation device and friend list generation equipment based on push-pull model improvement, aiming at the problem that the existing feed push-pull method has large data volume and high maintenance cost, a second type user (large F user), a second type user pool and related processing procedures are newly added on the basis of the feed push-pull model, only the second type user can maintain an inbox, and the data storage volume and the maintenance cost can be reduced; when the score is updated by the users (large V users) of the non-first type, the score is only pushed to all users of the second type which pay attention to the users, and the users of the non-second type which pay attention to the users are not pushed, so that the pushing interaction amount can be reduced; therefore, data processing pressure of the server is relieved, and good operation of the social platform network is guaranteed.
Description
Technical Field
The invention belongs to the technical field of feed information processing, and particularly relates to a method, a device and equipment for generating a friend list based on push-pull model improvement.
Background
Along with the wave of the mobile internet, the social network is rapidly developed, various social forms are bred, mobile phone APPs such as WeChat, microblog, entry headline and express become favorite applications of people, and the applications are developed based on feed stream technology.
The Feed flow is in a Feed + flow form as the name implies, the Feed is originally 'Feed', and the Feed flow is originally continuously put in a place. From the perspective of blood actual informatics, a feed of a feed stream refers to a single piece of information, which can be a friend circle, a microblog, a piece of information of today or a short video of a fast hand, the feed information continuously forms the feed stream, and a user can continuously see information concerned by the feed stream or information pushed according to a recommendation system.
Feed stream products are being pushed to the user's desire to see more and more so, increasing the number of users of the product and increasing the viscosity of the users. However, with the increasing number of users, how to quickly and efficiently distribute and push feed information according to the relationship between users is an urgent problem to be solved, for example, after one user sends out one piece of information, how to quickly and correctly display the previous information on the Timeline homepage of another concerned user has a very important influence on the product experience of the user, so that the push mode of feed stream information becomes a crucial factor that restricts a feed stream system.
Currently, the general feed push-pull model scheme issues feed information by the following steps, as shown in fig. 1:
1) Judging whether the user is a large V user or not; the large V users are users concerned by more than one person, such as users concerned by more than 1000 persons;
2) If the user is a large V user, storing feed information issued by the user into a large V buffer pool;
3) If the user is not a large V user, the feed information released by the user is batched and pushed to all inboxes of the users paying attention to the user.
The feed information is queried by the following steps, as shown in FIG. 2:
1) Each user maintains a query time, and the query time is updated to the current time after each query;
2) When a user inquires the dynamic state, pulling a feed list which is paid attention to between the inquiry time and the current time and is issued by a large V;
3) Storing the feed list data inquired in the last step into an inbox of the user;
4) And returning the data in the inbox of the user.
The method for pushing the feed information by adopting the feed push-pull model has the following defects:
1. each user maintains an inbox, increasing data storage and cost;
2. when the large V users do not release feeds, the feeds are pushed to all users paying attention to the users, and the pushing interaction amount is increased.
Disclosure of Invention
The invention aims to provide a method, a device and equipment for generating a friend list based on push-pull model improvement, which can reduce the feed data storage amount and the push interaction amount of the friend list, thereby relieving the data processing pressure of a server and ensuring the good operation of a social platform network.
In order to solve the problems, the technical scheme of the invention is as follows:
a friend list generation method based on push-pull model improvement comprises the following steps:
acquiring user data of a social platform, and classifying users into a first class of users and a second class of users according to the attention quantity; the first class of users are users concerned by multiple people, and the concerned number exceeds a first preset threshold value; the second type of users are users whose number of users concerned with others exceeds a second preset threshold value;
initializing user pool data and user inbox data of a second type of users;
when the user score is changed, judging whether the user is a first type user, if so, storing score change information in a buffer pool of the first type user; if not, pushing the score change information to an inbox of a second type of user concerning the user;
when a user inquires a friend list, judging whether the user is a second type user, if so, extracting change information of the first type user from a buffer pool of the first type user, storing the change information in an inbox of the user, and displaying inbox data; and if not, extracting a user list concerned by the user, sorting and displaying according to the user score.
According to an embodiment of the present invention, the initializing user pool data and user inbox data of the second type of user further includes:
extracting a second type user list in the social platform and storing the second type user list in a user pool of a second type user;
and creating an inbox of each second type user, acquiring a user list of the second type users concerning other people, acquiring corresponding user scores, and storing the users in the user list of the second type users concerning other people and the corresponding scores in the inbox of the corresponding second type users.
According to an embodiment of the present invention, the user rating change further comprises:
responding to a change request of a user score, judging whether the user is a first-class user, and if so, storing the uid and the score change time of the user in a buffer pool of the first-class user; if not, calling a user relationship service, extracting all user lists concerning the users, filtering out non-second-class users from the user lists, obtaining a target push list, and pushing the uid and the changed score of the users to an inbox of each user in the target push list.
According to an embodiment of the present invention, the querying the friend list by the user further includes:
responding to a request of a user for inquiring a friend list, judging whether the user is a second-class user, if so, extracting a change list of the first-class user concerned by the user between an inquiry timestamp and a current timestamp from a buffer pool of the first-class user, and storing a user uid and a corresponding score in the change list in an inbox of the user; returning the latest inbox data;
if not, the score of each user in the attention list of the user is inquired concurrently, and the user scores are displayed after being sorted.
According to one embodiment of the invention, when a user newly pays attention, responding to the attention operation of the user, acquiring the current number of users paying attention to others of the user, judging whether the user is a second type user, if yes, and if not, storing the uid of the user in the user pool of the second type user; creating an inbox of the user, and storing the user uid concerned by the user and the corresponding score in the inbox of the user;
and if the user is a second type user and belongs to the user pool of the second type user, storing the user uid which is newly concerned by the user and the corresponding score in the inbox of the user.
According to one embodiment of the invention, when a user cancels attention, responding to the attention canceling operation of the user, acquiring the current user number of other people concerned by the user, judging whether the user is a second type user, and if so, deleting the user information of canceling attention of the user from an inbox;
and if the user is not the second type of user and is in the user pool of the second type of user after the user cancels the attention, removing the user from the user pool of the second type of user, and deleting the inbox of the user.
A friend list generation device based on push-pull model improvement comprises:
the user classification module is used for acquiring user data of the social platform and classifying users into a first class of users and a second class of users according to the attention quantity; the first class of users are users concerned by multiple people, and the concerned number exceeds a first preset threshold value; the second type of users are users whose number of users concerned with others exceeds a second preset threshold value;
the initialization module is used for initializing the user pool data and the user inbox data of the second type of users;
the score change processing module is used for judging whether the user is a first type user or not when the score of the user is changed, and storing score change information into a buffer pool of the first type user if the user is the first type user; if not, pushing the score change information to an inbox of a second type of user concerning the user;
the list inquiry processing module is used for judging whether the user is a second type user or not when the user inquires a friend list, if so, extracting change information of the first type user from a buffer pool of the first type user, storing the change information in an inbox of the user, and displaying inbox data; and if not, extracting a user list concerned by the user, sorting and displaying according to the user score.
According to an embodiment of the invention, the improved friend list generation device based on the push-pull model further comprises a newly-added attention processing module and an attention canceling processing module;
the newly-added attention processing module is used for responding to the attention operation of a user when the user newly adds attention, acquiring the current number of users paying attention to other people of the user, judging whether the user is a second type user, and if the user is the second type user and the user does not belong to the user pool of the second type user, storing the uid of the user in the user pool of the second type user; creating an inbox of the user, and storing the user uid concerned by the user and the corresponding score in the inbox of the user; if the user is a second type user and belongs to a user pool of the second type user, storing a user uid which is newly concerned by the user and a corresponding score in an inbox of the user;
the attention canceling processing module is used for responding to attention canceling operation of a user when the user cancels attention, acquiring the current user number of other people concerned by the user, judging whether the user is a second type user, and deleting the user information of which the user cancels attention from an inbox if the user is the second type user; and if the user is not the second type user after the user cancels attention and is in the user pool of the second type user, removing the user from the user pool of the second type user, and deleting the inbox of the user.
A friend list generation device based on push-pull model improvement comprises:
a memory having instructions stored therein and a processor, the memory and the processor interconnected by a line;
the processor calls the instruction in the memory to realize the improved friend list generation method based on the push-pull model in the embodiment of the invention.
A computer-readable storage medium having a computer program stored thereon, where the computer program, when executed by a processor, implements a method for generating a friend list based on push-pull model improvement in an embodiment of the present invention.
Due to the adoption of the technical scheme, compared with the prior art, the invention has the following advantages and positive effects:
aiming at the problems that each user maintains an inbox, data storage amount and operation cost are increased, feed information is pushed to all concerned users, and pushing interaction amount is increased in the existing feed push-pull method, so that data processing pressure of a server is increased, normal operation of a social platform is not facilitated, users are divided into a first type of user and a second type of user, and user pool data and user inbox data of the second type of user are initialized; when the user score is changed, judging whether the user is a first type user, if so, storing score change information in a buffer pool of the first type user; if not, pushing the score change information to an inbox of a second type of user concerning the user; when a user inquires a friend list, judging whether the user is a second type user, if so, extracting change information of the first type user from a buffer pool of the first type user, storing the change information in an inbox of the user, and displaying inbox data; and if not, extracting a user list concerned by the user, sorting and displaying according to the user score. Therefore, only the second class of users can maintain the inbox, and the storage amount and the maintenance cost of data are reduced; and when the value of the non-first-class user is updated, only the feed information is pushed to the second-class user paying attention to the user, but not to the non-second-class user paying attention to the user, so that the pushing interaction amount of the feed information is reduced, the data processing pressure of a server is relieved, and the good operation of a social platform network is ensured.
Drawings
FIG. 1 is a flow chart of user publishing a feed in a prior art feed push-pull model;
FIG. 2 is a flow chart of a user's query of a feed in a conventional feed push-pull model;
FIG. 3 is a flow chart of a method for generating a friend list based on push-pull model improvement in an embodiment of the present invention;
FIG. 4 is a flow diagram for initializing a large F user pool and a large F user inbox according to an embodiment of the invention;
FIG. 5 is a diagram of a large F user pool storage architecture in one embodiment of the present invention;
FIG. 6 is a diagram of a user inbox storage structure in one embodiment of the invention;
FIG. 7 is a flow chart illustrating user score change according to an embodiment of the present invention;
FIG. 8 is a diagram of a large V buffer pool memory structure in an embodiment of the present invention;
FIG. 9 is a flowchart of a user query list in an embodiment of the invention;
FIG. 10 is a diagram of a user query time store architecture in accordance with an embodiment of the present invention;
FIG. 11 is a flowchart of a new user of interest according to an embodiment of the present invention;
FIG. 12 is a flow chart of canceling focused users in an embodiment of the invention;
FIG. 13 is a block diagram of a friend list generation apparatus based on push-pull model improvement in an embodiment of the present invention;
fig. 14 is a schematic diagram of a friend list generation device based on push-pull model improvement in an embodiment of the present invention.
Detailed Description
The method, the apparatus, and the device for generating a friend list based on push-pull model improvement according to the present invention are described in detail with reference to the accompanying drawings and the specific embodiments. The advantages and features of the present invention will become more apparent from the following description.
Example one
The embodiment provides a friend list generation method based on push-pull model improvement, which is used for solving the problems that each user maintains an inbox, the data storage capacity and the operation cost are increased, feed information is pushed to all concerned users, the push interaction amount is increased, the data processing pressure of a server is increased, and the normal operation of a social platform is not facilitated.
Before specifically introducing the friend list generation method, some technical terms are briefly described:
feed: is an information unit such as a friend circle status, a microblog, a consultation or a short video.
Feed stream: the information unit of the N publishers is transmitted to the M receivers through the attention relationship.
3. Attention is paid to: the user accepts the receipt of the dynamics of the person of interest.
4. Attention is paid to: the user's dynamics are pushed to the person of interest.
5. Concern relationship: the relationship between individuals in the system, which is a concern in the microblog, is a unidirectional flow.
6. Large V users: users who are concerned by more than one person, for example, users who are concerned by more than 1000 persons.
7. A large V buffer pool: storing all feed information released by large V users
8. Large F users: users who focus on more than a certain number of users, for example, users who focus on more than 100 people.
9. Large F user pool: a large F user list is stored.
10. A user inbox: for storing feed stream data.
11. Friend list: all users concerned by the users are sorted and displayed according to a certain rule, such as that the score is from large to small.
From the existing feed push-pull model scheme, that is, the feed information processing method shown in fig. 1 and 2, it can be seen that each user has an inbox, and when a non-large-volume user issues feed information, the feed information is pushed to all users paying attention to the user. In terms of data volume, a large storage space is inevitably required to be configured for maintaining the inbox for each user, and the data storage amount and the storage space are undoubtedly increased; in terms of data processing speed, it is inevitable that a piece of feed information needs to be repeatedly sent to all concerned users, which increases the amount and time of pushing interaction.
According to the improved friend list generation method based on the push-pull model, based on the feed push-pull model, the F users, the large F user pool and the related processing flow are newly increased, only the large F users can maintain the inbox, but not the large F users do not maintain the inbox, so that the data storage amount and the maintenance cost can be reduced; moreover, when the score is not updated by the large V user, the score is only pushed to all large F users paying attention to the large V user, and the score is not pushed to non-large F users paying attention to the large V user, so that the pushing interaction amount can be reduced; therefore, data processing pressure of the server is relieved, and good operation of the social platform network is guaranteed.
Specifically, please refer to fig. 3, the improved friend list generation method based on the push-pull model includes the following steps:
s1: acquiring user data of a social platform, and classifying users into a first class of users and a second class of users according to the attention quantity; the first class of users are users concerned by multiple people, and the concerned number exceeds a first preset threshold value; the second class of users are users whose users concern others, and the number of the users exceeds a second preset threshold;
s2: initializing user pool data and user inbox data of a second type of users;
s3: when the user score is changed, judging whether the user is a first type user, if so, storing score change information in a buffer pool of the first type user; if not, pushing the score change information to an inbox of a second type of user paying attention to the user;
s4: when a user inquires a friend list, judging whether the user is a second type user, if so, extracting change information of the first type user from a buffer pool of the first type user, storing the change information in an inbox of the user, and displaying inbox data; and if not, extracting a user list concerned by the user, sorting and displaying according to the user score.
In step S1, the server obtains user data from a social platform (such as microblog, weChat, tremble, fast hands, etc.), and classifies users into a first class of users and a second class of users according to the number of users concerned (including the number of users concerned and the number of users who actively concern others). The first class of users are users concerned by multiple people, the concerned number exceeds a first preset threshold (such as 1000, which can be determined according to the actual situation), and the users are represented as the first class of users by large-V users; the second type of users are users who pay attention to the fact that the number of the other users exceeds a second preset threshold (for example, 100, which may be determined according to practical situations), and the second type of users are represented by large F users.
In step S2, the user pool data and the user inbox data of the second type of user are initialized, that is, the large F user pool and the large F user inbox data are initialized. Please refer to fig. 4, which specifically includes the following steps:
the server extracts a large F user list in the social platform and stores the large F user list in a user pool of large F users;
and creating an inbox of each large F user, acquiring a user list of the large F users concerning other people, acquiring corresponding user scores, and storing the users in the user list of the large F users concerning other people and the corresponding scores in the inbox of the corresponding large F users.
In practical application, the method can be carried out in the following way:
inquiring a user list with the number of concerned users being more than 100, setting the user list as list1, and storing the users in the list1 into a large F user pool; the list1 is divided into 50 users as a batch, the users in the batch process in parallel, and the batch processes in series.
The inbox of each user in list1 is initialized. For example, a user A in list1 firstly obtains a list of concerned users of the user A, sets the list as list2, inquires the score of each user in list2, and stores the user in list2 and the corresponding score of the user in the inbox of the user A.
Wherein, please refer to fig. 5 for the large F user pool storage structure. The large F user pool uses a redis set, set structure to store data. Where the member is the uid of the user. See fig. 6 for a storage structure of the user inbox. The user inbox uses a redis ordered set and a sorted set structure to store data, wherein the member is the uid of the user, and the resource is the score of the user.
In step S3, when the score of the user is changed, judging whether the user is a large V user, if so, storing score change information in a buffer pool of the large V user; if not, pushing the score change information to an inbox of a large F user paying attention to the user.
Referring to fig. 7, for the server of the social platform, the step S3 can be expressed as follows:
the server responds to the change request of the user score, judges whether the user is a large V user, and stores the uid and the score change time of the user in a buffer pool of the large V user if the user is the large V user; if not, calling the user relationship service, extracting all user lists concerning the users, filtering out non-large F users from the user lists, obtaining a target push list, and pushing the uid and the changed score of the user to an inbox of each user in the target push list.
In practical application, the method can be carried out in the following way:
for example, updating the score of the user A, firstly judging whether the user A is a large V user, and if the user A is the large V user, storing the uid and the updating time of the user A into a large V buffer pool; if the user is not the large V user, calling the user relationship service, pulling the user list of all concerned users A, setting the user list as table 1, filtering data which are not in the large F user pool, setting the obtained user list as table 2, and pushing the uid and the changed score of the user A to the inbox of each user in the table 2.
Referring to fig. 8, the storage structure of the large V buffer pool uses a redis ordered set, and a received set structure stores data, where member is a user uid and resource is an update timestamp.
In step S4, when the user inquires a friend list, judging whether the user is a large F user, if so, extracting change information of the large V user from a buffer pool of the large V user, storing the change information in an inbox of the user, and displaying inbox data; and if not, extracting a user list concerned by the user, sorting and displaying according to the user score.
Referring to fig. 9, for the server of the social platform, the step S3 can be expressed as follows:
the server responds to a request of a user for inquiring a friend list, judges whether the user is a large F user, if so, extracts a change list of the large V user concerned by the user between an inquiry timestamp and a current timestamp from a buffer pool of the large V user, and stores a user uid and a corresponding score in the change list in an inbox of the user; returning the latest inbox data; if not, the score of each user in the attention list of the user is inquired concurrently, and the user scores are displayed after being sorted.
Wherein, the user inquires about the storage structure of the time, please refer to fig. 10. The user query time uses a redis character string and string structure to store data. Wherein, key is uid used by the user, and value is the time stamp of the user query.
In practical application, the method can be carried out in the following way:
firstly, judging whether the user is a large F user or not, if so, maintaining a query time stamp which is initially 0, and updating the query time to be the current time stamp after each query; pulling a user list of concerned large V user changes between the query timestamp and the current timestamp; inquiring user scores in the list, and putting the users uid and the user scores in the list into an inbox of the user; returning the latest inbox data; if the user is not the large F user, the score data of each user in the attention list of the user is inquired concurrently, and the score data is returned after the memory is sorted.
The method for generating the friend list based on the push-pull model improvement in the embodiment can process the processes of adding attention to the user and cancelling attention from the user, besides the user classification, initialization, user score updating and user friend list query.
Specifically, when a user newly pays attention, the server responds to the attention operation of the user, obtains the current number of users paying attention to other people of the user, judges whether the user is a large F user, and stores the uid of the user in a user pool of the large F user if the user is the large F user and the user does not belong to the user pool of the large F user; creating an inbox of the user, and storing the user uid concerned by the user and the corresponding score in the inbox of the user;
and if the user is the large F user and belongs to the user pool of the large F user, storing the user uid which is newly concerned by the user and the corresponding score in the inbox of the user.
In practical applications, please refer to fig. 11, which can be performed by the following steps:
for example, a user A pays attention to a user B, a server needs to obtain the number of users paid attention to by the user A at first, judge whether the users are large F users, if the users A are large F and are not in a large F user pool, store the users A into the large F user pool, obtain a user list paid attention to by the users A and a score of each user in the list, add an inbox of the users A, and store the user list and the score into the inbox of the users A. If user A is large F and in the large F user pool, the score of user B is obtained, and user B uid and the score are stored in the inbox of user A.
When the user cancels the attention, the server responds to the attention canceling operation of the user, obtains the current user number of other people concerned by the user, judges whether the user is a large F user, and deletes the user information of the user canceling the attention from the inbox if the user is the large F user;
and if the user is not the large F user and is in the user pool of the large F user after the user cancels the attention, removing the user from the user pool of the large F user, and deleting the inbox of the user.
In practical applications, please refer to fig. 12, which can be performed by the following steps:
for example, a user A cancels attention to a user B, a server firstly obtains the number of users concerned by the user A, judges whether the users are large F users, and deletes the uid and the score of the user B from an inbox of the user A if the users are large F users; if not, and user A is in the large F user pool, user A is removed from the large F user pool and user A's inbox is deleted.
Example two
The embodiment provides a friend list generation device based on push-pull model improvement, please refer to fig. 13, and the friend list generation device includes:
the user classification module 1 is used for acquiring user data of the social platform and classifying users into a first class of users and a second class of users according to the attention quantity; the first class of users are users concerned by multiple people, and the concerned number exceeds a first preset threshold value; the second class of users are users whose users concern others, and the number of the users exceeds a second preset threshold;
the initialization module 2 is used for initializing user pool data and user inbox data of a second type of users;
the score change processing module 3 is used for judging whether the user is a first type user when the score of the user is changed, and storing score change information in a buffer pool of the first type user if the user is the first type user; if not, pushing the score change information to an inbox of a second type of user concerning the user;
the list inquiry processing module 4 is used for judging whether the user is a second type user when the user inquires the friend list, if so, extracting the change information of the first type user from the buffer pool of the first type user, storing the change information in the inbox of the user, and displaying inbox data; if not, extracting a user list concerned by the user, sorting and displaying according to the user score;
the newly-added attention processing module 5 is used for responding to the attention operation of the user when the user newly adds attention, acquiring the current number of users paying attention to other people of the user, judging whether the user is a second type user, and if the user is the second type user and the user does not belong to the user pool of the second type user, storing the uid of the user in the user pool of the second type user; creating an inbox of the user, and storing the user uid concerned by the user and the corresponding score in the inbox of the user; if the user is a second-class user and belongs to a user pool of the second-class user, storing a user uid which is newly concerned by the user and a corresponding score in an inbox of the user;
the attention canceling processing module 6 is used for responding to the attention canceling operation of the user when the user cancels the attention, acquiring the current user number of the user paying attention to other people, judging whether the user is a second type user, and if so, deleting the user information of which the user cancels the attention from the inbox; and if the user is not the second type user after the user cancels the attention and is in the user pool of the second type user, removing the user from the user pool of the second type user, and deleting the inbox of the user.
The functions and implementation manners of the user classification module 1, the initialization module 2, the score change processing module 3, the list query processing module 4, the newly added attention processing module 5, and the attention cancellation processing module 6 are as described in the first embodiment, and are not described herein again.
EXAMPLE III
The embodiment provides a friend list generating device improved based on a push-pull model. Referring to fig. 14, the improved friend list generation apparatus 500 based on the push-pull model may have relatively large differences due to different configurations or performances, and may include one or more processors (CPUs) 510 (e.g., one or more processors) and a memory 520, one or more storage media 530 (e.g., one or more mass storage devices) storing applications 533 or data 532. Memory 520 and storage media 530 may be, among other things, transient or persistent storage. The program stored on the storage medium 530 may include one or more modules (not shown), each of which may include a series of instruction operations for the improved friend list generation apparatus 500 based on the push-pull model.
Further, the processor 510 may be configured to communicate with the storage medium 530, and execute a series of instruction operations in the storage medium 530 on the friend list generating apparatus 500 based on the push-pull model improvement.
The improved buddy list generation apparatus 500 based on a push-pull model may also include one or more power supplies 540, one or more wired or wireless network interfaces 550, one or more input-output interfaces 560, and/or one or more operating systems 531, such as Windows server, vista, and the like.
Those skilled in the art will appreciate that the illustrated improved buddy list generation device configuration based on push-pull model of fig. 14 does not constitute a limitation of the improved buddy list generation device based on push-pull model, and may include more or fewer components than illustrated, or some components in combination, or a different arrangement of components.
The present invention also provides a computer-readable storage medium, which may be a non-volatile computer-readable storage medium, and which may also be a volatile computer-readable storage medium. The computer-readable storage medium has stored therein instructions, which when executed on a computer, cause the computer to perform the steps of the improved friend list generation method based on a push-pull model in the first embodiment.
The modules in the second embodiment, if implemented in the form of software functional modules and sold or used as independent products, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present invention may be substantially or partially implemented in software, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described apparatuses and devices may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
The embodiments of the present invention have been described in detail with reference to the accompanying drawings, but the present invention is not limited to the above embodiments. Even if various changes are made to the present invention, it is still within the scope of the present invention if they fall within the scope of the claims of the present invention and their equivalents.
Claims (10)
1. A friend list generation method based on push-pull model improvement is characterized by comprising the following steps:
acquiring user data of a social platform, and classifying users into a first class of users and a second class of users according to the attention quantity; the first class of users are users concerned by multiple people, and the concerned number exceeds a first preset threshold value; the second type of users are users whose number of users concerned with others exceeds a second preset threshold value;
initializing user pool data and user inbox data of a second type of users;
when the user score is changed, judging whether the user is a first type user, if so, storing score change information in a buffer pool of the first type user; if not, pushing the score change information to an inbox of a second type of user concerning the user;
when a user inquires a friend list, judging whether the user is a second type user, if so, extracting change information of the first type user from a buffer pool of the first type user, storing the change information in an inbox of the user, and displaying inbox data; and if not, extracting a user list concerned by the user, sorting and displaying according to the user score.
2. The improved buddy list generation method based on push-pull model of claim 1, wherein said initializing user pool data and user inbox data for a second type of user further comprises:
extracting a second type user list in the social platform and storing the second type user list in a user pool of a second type user;
and creating an inbox of each second type user, acquiring a user list of the second type users concerning other people, acquiring corresponding user scores, and storing the users in the user list of the second type users concerning other people and the corresponding scores in the inbox of the corresponding second type users.
3. The improved buddy list generation method based on push-pull models of claim 1, wherein said user rating change further comprises:
responding to a change request of a user score, judging whether the user is a first-class user, and if so, storing the uid and the score change time of the user in a buffer pool of the first-class user; if not, calling a user relationship service, extracting all user lists concerning the users, filtering out non-second-class users from the user lists, obtaining a target pushing list, and pushing the uid and the changed score of the users to an inbox of each user in the target pushing list.
4. The improved buddy list generation method based on push-pull model as recited in claim 1, wherein said user querying a buddy list further comprises:
responding to a request of a user for inquiring a friend list, judging whether the user is a second-class user, if so, extracting a change list of the first-class user concerned by the user between the inquiry timestamp and the current timestamp from a buffer pool of the first-class user, and storing a user uid and a corresponding score in the change list in an inbox of the user; returning the latest inbox data;
if not, the score of each user in the attention list of the user is inquired concurrently, and the user scores are displayed after being sorted.
5. The improved friend list generation method based on the push-pull model as claimed in claim 1, wherein when a user newly pays attention, in response to an attention operation of the user, a current number of users paying attention to others of the user is obtained, whether the user is a second class user is judged, and if yes, and the user does not belong to the user pool of the second class user, the uid of the user is stored in the user pool of the second class user; creating an inbox of the user, and storing the user uid concerned by the user and the corresponding score in the inbox of the user;
and if the user is a second type user and belongs to the user pool of the second type user, storing the user uid which is newly concerned by the user and the corresponding score in the inbox of the user.
6. The improved friend list generation method based on the push-pull model as claimed in claim 1, wherein when a user cancels attention, in response to an attention canceling operation of the user, a current number of users who focus on others of the user is obtained, whether the user is a second-class user is judged, and if yes, information of the user who cancels attention of the user is deleted from an inbox;
and if the user is not the second type of user and is in the user pool of the second type of user after the user cancels the attention, removing the user from the user pool of the second type of user, and deleting the inbox of the user.
7. A friend list generation device based on push-pull model improvement is characterized by comprising:
the user classification module is used for acquiring user data of the social platform and classifying users into a first class of users and a second class of users according to the attention quantity; the first class of users are users concerned by multiple people, and the concerned number exceeds a first preset threshold value; the second type of users are users whose number of users concerned with others exceeds a second preset threshold value;
the initialization module is used for initializing the user pool data and the user inbox data of the second type of users;
the score change processing module is used for judging whether the user is a first type user or not when the score of the user is changed, and storing score change information into a buffer pool of the first type user if the user is the first type user; if not, pushing the score change information to an inbox of a second type of user concerning the user;
the list inquiry processing module is used for judging whether the user is a second type user or not when the user inquires a friend list, if so, extracting change information of the first type user from a buffer pool of the first type user, storing the change information in an inbox of the user, and displaying inbox data; and if not, extracting a user list concerned by the user, sorting and displaying according to the user score.
8. The improved friend list generation device based on the push-pull model as recited in claim 7, further comprising a new concern processing module and a cancel concern processing module;
the newly-added attention processing module is used for responding to the attention operation of a user when the user newly adds attention, acquiring the current number of users paying attention to other people of the user, judging whether the user is a second type user, and if the user is the second type user and the user does not belong to the user pool of the second type user, storing the uid of the user in the user pool of the second type user; creating an inbox of the user, and storing the user uid concerned by the user and the corresponding score in the inbox of the user; if the user is a second-class user and belongs to a user pool of the second-class user, storing a user uid which is newly concerned by the user and a corresponding score in an inbox of the user;
the attention canceling processing module is used for responding to attention canceling operation of a user when the user cancels attention, acquiring the current user number of other people concerned by the user, judging whether the user is a second type user, and deleting the user information of which the user cancels attention from an inbox if the user is the second type user; and if the user is not the second type of user and is in the user pool of the second type of user after the user cancels the attention, removing the user from the user pool of the second type of user, and deleting the inbox of the user.
9. A friend list generating device based on push-pull model improvement is characterized by comprising:
a memory having instructions stored therein and a processor, the memory and the processor interconnected by a line;
the processor invokes the instructions in the memory to implement the improved friend list generation method based on the push-pull model according to any one of claims 1-6.
10. A computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the improved buddy list generation method based on push-pull model according to any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111202722.1A CN113961829B (en) | 2021-10-15 | 2021-10-15 | Improved friend list generation method, device and equipment based on push-pull model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111202722.1A CN113961829B (en) | 2021-10-15 | 2021-10-15 | Improved friend list generation method, device and equipment based on push-pull model |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113961829A CN113961829A (en) | 2022-01-21 |
| CN113961829B true CN113961829B (en) | 2023-03-24 |
Family
ID=79463935
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111202722.1A Active CN113961829B (en) | 2021-10-15 | 2021-10-15 | Improved friend list generation method, device and equipment based on push-pull model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113961829B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103095684A (en) * | 2012-12-13 | 2013-05-08 | 微梦创科网络科技（中国）有限公司 | Method obtaining attention user aggregate information, device and system |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3012798B1 (en) * | 2014-10-22 | 2019-06-05 | Facebook, Inc. | Social scores for network elements |
| US10298535B2 (en) * | 2015-05-19 | 2019-05-21 | Facebook, Inc. | Civic issues platforms on online social networks |
| CN112861016A (en) * | 2020-12-11 | 2021-05-28 | 深圳市蟠桃树科技有限公司 | Data high-concurrency processing method of Feed stream system of healthy social platform |
| CN112883316A (en) * | 2021-03-02 | 2021-06-01 | 广州市百果园信息技术有限公司 | Data processing method and device, electronic equipment and storage medium |
-
2021
- 2021-10-15 CN CN202111202722.1A patent/CN113961829B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103095684A (en) * | 2012-12-13 | 2013-05-08 | 微梦创科网络科技（中国）有限公司 | Method obtaining attention user aggregate information, device and system |
Non-Patent Citations (2)
| Title |
|---|
| "USpam -- A User Centric Ontology Driven Spam Detection System";M. Shoaib等;《2015 48th Hawaii International Conference on System Sciences》;20150330;第1-4页 * |
| "基于 Agent 的电子商务交易平台中推拉模型的实现";杜军平等;《中南大学学报(自然科学版)》;20070831;第1052-1055页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113961829A (en) | 2022-01-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104933084B (en) | A kind of method, apparatus and equipment for obtaining answer information | |
| CN104951456B (en) | A kind of method, apparatus and equipment for obtaining answer information | |
| CN101197790B (en) | Method and device for acquiring latest dynamic information of users in instant communication | |
| US20170277740A1 (en) | Commanding and Task Completion through Self-messages | |
| US10885105B2 (en) | Image search based on message history | |
| US10038662B2 (en) | Automation of matching of short message tags to content | |
| US20160364453A1 (en) | Method, system and apparatus for managing contact data | |
| US10783201B2 (en) | Customized news alerts based on contacts | |
| WO2018188567A1 (en) | Server information pushing method and device, terminal information sending method and device, information pushing system and storage medium | |
| CN111314063A (en) | Big data information management method, system and device based on Internet of things | |
| CN111666280A (en) | Comment ordering method, device, equipment and computer storage medium | |
| CN115169906A (en) | Customer service distribution method and device, computer equipment and storage medium | |
| US9983940B1 (en) | Online account reset, rollback, and backup | |
| US20160275193A1 (en) | Socially driven feed of aggregated content in substantially real time | |
| KR101991609B1 (en) | Filtering content based on user mobile networks and data plans | |
| CN113961829B (en) | Improved friend list generation method, device and equipment based on push-pull model | |
| CN110019786B (en) | Topic sending method and topic list ordering method and device for network community | |
| US10771572B1 (en) | Method and system for implementing circle of trust in a social network | |
| US20180114279A1 (en) | Automatic Newsletter Creation | |
| JP2009509229A (en) | Message conversion system and method with enhanced context recognition | |
| CN115119021A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN113901316A (en) | Information pushing method and device, electronic equipment and storage medium | |
| US20090193038A1 (en) | Creation of context for communications based on previous interactions | |
| US9882991B2 (en) | URL issuing device, URL issuing method, and URL issuing program | |
| TWM615179U (en) | Customer Personal Asset Management Update System |
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 |