Information processing method and device

Abstract

The invention discloses an information processing method and device, and the method comprises the steps: setting a folding window for a first user, enabling the folding window to be used for counting the dynamic quantity released by the first user in a time period corresponding to the folding window, obtaining the dynamic quantity released by the first user in the folding window from a first storage space after the end time of the folding window is up, and storing the dynamic quantity in the folding window; and judging whether the dynamic quantity is not less than a first threshold value, and if so, indicating that the dynamic published in the folding window needs to be folded. If yes, all the dynamic states released in the folding window are sorted according to the release time from late to early, a target information flow is obtained, and the target information flow serves as a folding record to be stored in the second storage space. And finally, deleting each piece of dynamic related information included in the target information flow recorded in the first storage space to prevent repeated counting in the next folding window, and releasing the storage space at the same time.

Description

Technical Field

[0001] The present application relates to the field of computer processing technology, and in particular to an information processing method and device. Background Art

[0002] In the Follow Stream service, the page dynamic data that users see are displayed in reverse order of the dynamics posted by the users they follow. The Follow Stream is a dynamic information stream of people, brands or organizations that a person follows on social media or other websites. Generally speaking, this information includes the latest published articles, pictures, videos, status updates, etc.

[0003] However, if someone a user follows frequently posts updates within a certain period of time, multiple consecutive pages of updates by that publisher will appear when the user is using the app, creating noise and causing a certain amount of visual interference to the user. Summary of the invention

[0004] In view of this, an embodiment of the present application provides an information processing method and device to achieve information noise reduction through folding processing.

[0005] To solve the above problems, the technical solutions provided in the embodiments of the present application are as follows:

[0006] In a first aspect of the present application, an information processing method is provided, which is applied to a server and includes:

[0007] In response to the current time being the end time of the folding window, acquiring, from the first storage space, the number of dynamics published by the first user from the start time to the end time of the folding window;

[0008] If the number of dynamics is not less than the first threshold, sorting the dynamics in the number of dynamics in order of release time from latest to earliest to obtain a target information flow;

[0009] storing the target information flow as a folding record in a second storage space, where the second storage space is used to record one or more folding records corresponding to the first user;

[0010] The dynamic related information included in the target information flow is deleted from the first storage space.

[0011] In a second aspect of the present application, an information processing device is provided, which is applied to a server, including:

[0012] an acquisition unit, configured to acquire, in response to the current time being the end time of the folding window, the number of dynamics published by the first user from the start time to the end time of the folding window from the first storage space;

[0013] A processing unit, configured to, if the number of dynamics is not less than a first threshold, sort the dynamics in the number of dynamics in order of release time from latest to earliest, to obtain a target information flow;

[0014] a storage unit, used to store the target information flow as a folding record in a second storage space, wherein the second storage space is used to record one or more folding records corresponding to the first user;

[0015] The processing unit is further configured to delete the dynamic related information included in the target information flow from the first storage space.

[0016] In a third aspect of the embodiments of the present application, an electronic device is provided, including: a processor, a memory;

[0017] The memory is used to store computer-readable instructions or computer programs;

[0018] The processor is used to read the computer-readable instructions or the computer program so that the electronic device implements the information processing method described in the first aspect.

[0019] In a fourth aspect of the present application, a computer-readable storage medium is provided, wherein instructions are stored in the computer-readable storage medium. When the instructions are executed on a device, the device executes the information processing method described in the first aspect.

[0020] In a fifth aspect of the present application, a computer program product is provided. When the computer program product is run on a computer, the computer executes the information processing method described in the first aspect.

[0021] It can be seen that the embodiments of the present application have the following beneficial effects:

[0022] In the present application, a folding window is set for the first user, and the folding window is used to indicate the number of dynamics published by the first user within the time corresponding to the folding window. After the end time of the folding window is reached, the number of dynamics published by the first user in the folding window is obtained from the first storage space, and it is determined whether the number of dynamics is not less than the first threshold. If so, it indicates that the dynamics published in the folding window need to be folded. Then all the dynamics published in the folding window are sorted in order from late to early when they are published, and the target information flow is obtained, and the target information flow is stored as a folding record in the second storage space. Finally, the relevant information of each dynamic included in the target information flow recorded in the first storage space is deleted to prevent repeated counting in the next folding window, and the storage space is released at the same time.

[0023] That is, through the technical solution provided by the present application, dynamic noise reduction is achieved through folding processing. Moreover, for dynamics that need to be folded, after the folding processing, only the dynamics that meet the folding requirements will be recorded in the second storage space, and no dirty data will be generated. At the same time, expired dynamics in the first storage space are cleared in a timely manner to reduce the storage space occupied. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] Figure 1 Store dynamic diagrams for the original server;

[0025] Figure 2 A flow chart of an information processing method provided in an embodiment of the present application;

[0026] Figure 3a A schematic diagram of a folding window provided in an embodiment of the present application;

[0027] Figure 3b A server-side storage dynamic diagram provided in an embodiment of the present application;

[0028] Figure 4 A flowchart of another information processing method provided in an embodiment of the present application;

[0029] Figure 5 A schematic diagram of displaying folding records provided in an embodiment of the present application;

[0030] Figure 6 A structural diagram of an information processing device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0031] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, the embodiments of the present application are further described in detail below in conjunction with the accompanying drawings and specific implementation methods.

[0032] At present, in order to achieve message noise reduction, the message is folded. Figure 1 As shown, the MySQL database storage layer has two tables: the dynamic table (feed_info) is used to store the dynamics posted by users, and the extended table (feed_extra) is used to record the dynamics folded by users. The basic process of posting dynamics (feed) is as follows:

[0033] (1) Every time a user posts a feed, it is first recorded in the dynamic table, that is, his / her outbox. Subsequent queries to his / her personal homepage are directly queries to his / her outbox. For example, the feed_id, user_id, posting time feed_time, etc. are recorded.

[0034] (2) Next, the feed will be written into the extended table again to mark the folding dynamics. By default, the feed dynamics are not folded when written. For example, record feed_id, user_id, release time update_time, set_id, set_status, etc. Among them, set_id: the folding batch id to which the current feed belongs; set_status: used to mark whether the current feed is folded, where 0 means not folded, 1- means folding the head, and 2- means folding the non-head.

[0035] (3) Use complex SQL to calculate whether certain folding conditions are met in the extended table. If the folding conditions are not met, no processing is performed; if the folding conditions are met, all feed sets that meet the folding conditions are processed, and the folded header and non-header need to be identified. Specifically, if the number of feeds posted by a user within 30 minutes is greater than 10, the feed sets to be folded are sorted in reverse order by posting time, the first one is used as the folded header of the feed, and the others are used as the folded non-header of the feed, and then the extended table is updated to identify the status of each feed in these feed sets, that is, folded header, folded non-header, or not folded.

[0036] The basic process of reading feed is as follows:

[0037] (1) The user reads the feed stream, and 10 items are read by default;

[0038] (2) Based on a certain feed information, the extended table is queried to determine the folding status of the feed. If it is in the unfolded state, the dynamic is distributed normally; if it is in the folded head, the dynamic is also distributed normally; if it is in the folded non-head state, the feed is filtered and hidden, ensuring that the folded head is visible in the feed stream, and the folded non-head feed is hidden and invisible.

[0039] (3) Determine whether the number of items displayed to the user meets 10. If not, retry to compensate and query the feed stream. This is because the request may be hidden due to the folding non-header filter, resulting in the page not meeting 10 items.

[0040] The inventors have found through research that the original implementation scheme has the following defects:

[0041] (1) The existing technology uses the method of storing feeds first and then folding feed calculations, which results in a large amount of dirty data in the database. That is, regardless of whether the folding is satisfied, the data will be recorded in the database first, and then the calculation of whether the folding is satisfied will be started. During this period, records that do not meet the folding requirements will also be stored, resulting in a large waste of database space.

[0042] (2) The existing technology uses complex SQL calculations at the database level. When users frequently post feed updates, complex SQL calculations are performed for each posting, which puts a lot of pressure on the database and causes poor folding performance.

[0043] (3) The original technology cannot meet the requirements of dynamically adjusting the folding rules because it uses fixed, hard-coded SQL. Each modification requires modifying the SQL and republishing it, which makes the overall process inefficient.

[0044] To solve the above problems, this application proposes a dynamic folding mechanism based on a fixed time window to fold the "noise dynamics". Specifically,

[0045] A folding window is configured for each user, and the total number of dynamics posted by the user in this folding window is counted. If the total number meets a certain threshold, the dynamics will be folded. Dynamics that do not meet the folding rules will be expired and cleared in the next folding window, reducing useless data from occupying additional storage space.

[0046] The technical terms involved in this application are explained below.

[0047] (1) Noise updates: In the video follow-up stream, if someone that the user follows posts updates too frequently within a certain period of time (for example, posting more than 10 updates in a row within 30 minutes), a large number of “noise updates” will appear when the user is using the video.

[0048] (2) Feed: A post by a user is called a feed. Multiple feeds constitute a feed stream.

[0049] (3) Outbox: The location where dynamic messages posted by users are stored. It can be a MySQL database table or other storage media.

[0050] (4) Inbox: A collection of feeds published by all the people the user follows, i.e., a feed stream, which can be a MySQL database table or other storage media.

[0051] (5) Folding header: When a user posts more than 10 updates in a row within 30 minutes, the updates will be folded into one update for display. The update that is exposed is called the folding header corresponding to the feed stream.

[0052] (6) Time cursor: This application is based on a timeline feed stream. Each time a client requests, it will carry a time cursor for paging. The time cursor can be understood as a timestamp, represented by lastId. It uses timestamps or other time-related sorting fields as cursors to perform efficient paging operations in data sets. Different "pages" of data are obtained through the time cursor, and the data blocks returned for each request are based on the previous and next positions of the cursor.

[0053] In this application, the time cursor may refer to the publishing time of the last feed in the last requested feed stream, or the current time.

[0054] The technical solution provided by this application will be described below in conjunction with the accompanying drawings.

[0055] See also Figure 2 , which is a flow chart of an information processing method provided by an embodiment of the present application, such as Figure 2 As shown, the method is applied to the server, including:

[0056] S201: In response to the current time being the end time of the folding window, obtaining from a first storage space the number of dynamics published by a first user from the start time to the end time of the folding window.

[0057] In the present application, a folding window can be maintained for each publisher, and the durations corresponding to the folding windows of different publishers can be the same or different. The server counts the number of dynamics of all dynamics published by the first user within the duration corresponding to the folding window. Specifically, the server records the number of dynamics published by the first user within the duration corresponding to the folding window in the first storage space. The first storage space is used to count the number of dynamics published by the first user within a preset duration.

[0058] Specifically, in actual applications, in response to the first user publishing a dynamic using the client, the client will send a write request to the server, and the write request includes the user ID of the first user, the dynamic posted, the publishing time and other related information. After receiving the write request, the server records the relevant information of the dynamic in the third storage space. That is, the server records the relevant information of the dynamic to the inbox corresponding to the first user (i.e., the third storage space), and the first user can subsequently view his outbox through the personal homepage of the client. In addition, the server will also record the dynamic ID and publishing time of the dynamic in the first storage space corresponding to the first user.

[0059] S202: If the number of dynamics is not less than the first threshold, the dynamics are sorted in order of release time from latest to earliest to obtain a target information flow.

[0060] S203: Store the target information flow as a fold record in the second storage space.

[0061] After obtaining the number of dynamics published by the first user in the corresponding folding window, it is determined whether the number of dynamics meets the folding condition, that is, whether the number of dynamics is not less than the first threshold. If not, it indicates that the folding condition is not met and the folding operation is not performed; if yes, it indicates that the folding condition is met, and all dynamics published in the folding window are sorted in order from the latest to the earliest according to the publishing time to obtain the target information flow. Among them, the target information flow includes all dynamics sorted in order from the latest to the earliest according to the publishing time (dynamics published within the duration corresponding to the folding window).

[0062] For example Figure 3a The schematic diagram of the folding window shown in the figure has a duration of 30 minutes, and the first threshold is 10 for illustration. After the statistics of the first folding window are completed, it is determined whether the number of dynamics counted by the folding counter within 30 minutes exceeds 10. If exceeded, dynamic folding is performed; if not, the expired dynamics are cleared, and the folding counter is reset to zero so that it can be recounted in the next folding window. In this embodiment, the server can update the duration corresponding to the folding window and / or the specific size of the first threshold to adapt to the current application scenario and meet different needs.

[0063] After obtaining the target information flow, the target information flow is stored as a folding record in the second storage space. That is, only the folded dynamics are stored in the second storage space, and the second storage space is used to record one or more folding records corresponding to the first user. Different folding records correspond to different folding identifiers, and a unique folding record is determined by the folding identifier.

[0064] When a folded record (including multiple dynamics) is displayed to the user, usually only one dynamic in the folded record is displayed, and the others are hidden. In order to determine which dynamic should be displayed, it is necessary to identify the folded headers and folded non-headers of the multiple dynamics that are folded. Therefore, after obtaining the target information stream, the server assigns a folding identifier to the target information stream, uses the first dynamic in the target information stream as the folding header, and the other dynamics as the folding non-headers; the folding information of the target information stream is stored in the second storage space, and the folding information includes the folding identifier, the user identifier of the first user, the dynamic identifier of the folding header, and the set of folded dynamic identifiers.

[0065] In this embodiment, when pushing the dynamics posted by the first user to the second user, the dynamics to be pushed are usually read from the outbox corresponding to the first user. When the dynamics to be pushed are folded, it is necessary to determine whether the dynamics to be pushed are expanded and displayed on the client. Based on the fact that a dynamic posted by the second user is folded, the folding mark corresponding to the dynamic is recorded in the third storage space, so that when pushing to the user, it is determined in the second storage space whether the dynamic has a folded head according to the folding mark corresponding to the dynamic. The second user is a follower of the dynamic posted by the first user.

[0066] S204: Delete the dynamic related information included in the target information flow from the first storage space.

[0067] After processing the dynamics posted by the first user in a folding window, the relevant information of the dynamics posted in the folding window recorded in the first storage space is cleared to avoid repeated statistics in the next folding window.

[0068] In addition, for dynamics that do not meet the requirements of folding, the server will also delete from the first storage space the relevant information of the dynamics posted by the first user recorded in the time period corresponding to the folding window, thereby reducing the storage space occupied by useless data.

[0069] For example, Figure 3b The server storage diagram shown in FIG. 1 shows a storage structure in which MySQL includes three storage spaces: the feed_info table, i.e., the third storage space, is used to store dynamics posted by users; the feed_fold table, i.e., the second storage space, is used to store fold records; and Redis, i.e., the first storage space, is used to count the number of dynamics posted in the fold window and perform fold calculations. The specific implementation process includes:

[0070] (1) Each time the first user publishes a feed, the server first records the relevant information of the feed into the feed_info table, i.e., the first user's outbox.

[0071] (2) Secondly, the server will write the feed into the Redis cache Zset ordered set for quantity statistics. After writing is completed, the server determines whether the number of feeds counted in the current folding window meets the folding rules. If so, execute step (3); if not, execute step (4).

[0072] (3) Fold the feed set in the folding window. Specifically, sort the feed set to be folded in reverse order according to the release time, and use the first feed after sorting as the folding head and the other feeds as the folding non-headers. Then write the folding record into the feed_fold table, which records the folding identifier id, the first user identifier user_id, the folding cycle (the release time of the first feed and the release time of the last feed), the dynamic identifier feed_id of the folding head, and the feed set feed_list corresponding to the folding record. At the same time, the folding identifier corresponding to the folded feed is recorded in the feed_info table.

[0073] After the folding process is completed, clear the relevant information of the folded feed in the Redis cache to prevent duplicate counting.

[0074] (4) Clean up the feeds in the folding window that do not meet the folding rules to reduce the storage space occupied by useless data.

[0075] It can be seen from the above scheme that compared with the original technology, this application has the following technical advantages:

[0076] First, it avoids space waste. The present application adopts the method of calculating folding first and then storing, that is, only the dynamics of satisfying folding will be recorded in the second storage space, and no dirty data will be generated, which greatly reduces the usage of database space.

[0077] Secondly, the folding performance is improved. This application uses memory computing folding to replace the original database-level complex SQL calculation logic.

[0078] Finally, it has the ability to dynamically adjust folding rules. This application avoids fixed SQL calculations and uses memory for folding calculations, which enables the folding rules to be adjusted in real time, so that folding can be performed according to the latest folding rules.

[0079] The above embodiment describes how to perform folding after a user posts a dynamic. When other users request to display the folded dynamic, how to display it will be described below with reference to the accompanying drawings.

[0080] See also Figure 4 , which is a flow chart of an information processing method provided by an embodiment of the present application, such as Figure 4 As shown, the method includes:

[0081] S401: The server receives a read request sent by the client, where the read request includes a user identifier and a time cursor of a second user.

[0082] The client refers to the client used by the second user; the time cursor refers to the publishing time of the last feed in the feed stream returned by the server in response to the last read request sent by the client, which is used to filter the dynamics to be displayed.

[0083] In this embodiment, the user opens the client, and after the corresponding page of the client triggers a corresponding operation, the client sends a read request to the server. The triggering operation may include a refresh operation of the first screen, an upward or downward slide operation.

[0084] S402: Determine the user ID of the concerned first user based on the user ID of the second user.

[0085] S403: For each first user, obtain target dynamics from a third storage space corresponding to the first user according to the time cursor.

[0086] That is, after receiving the read request, the server will obtain all first users followed by the second user. Specifically, the server needs to query the follow service to obtain the user set of the first users followed by the second user, which includes the user ID of each first user followed.

[0087] For each first user, all dynamics posted are read from the outbox corresponding to the first user according to the time cursor, all dynamics are sorted in chronological order, and then the target dynamics to be pushed are filtered out from the sorted dynamics using the time cursor.

[0088] S404: Determine the dynamic folding state of the target, and determine the content to be sent to the client according to the dynamic folding state of the target.

[0089] After filtering out the target dynamics, it is necessary to determine whether the target dynamics are folded, so as to determine the content to be sent to the client according to the folding state.

[0090] It can be seen from the above embodiment that if a certain dynamic is folded, the corresponding folding mark will be recorded in the third storage space for the dynamic. Based on this, when the server reads the target dynamic from the third storage space, it checks whether the target dynamic has a folding mark. If it does, it indicates that the target dynamic is folded; if it does not, it indicates that the target dynamic is not folded.

[0091] If the target dynamic has a folding mark, determine whether the target dynamic is a folding head in the second storage space according to the folding mark. Specifically, obtain the dynamic mark of the folding head in the corresponding folding record according to the folding mark, and determine whether the dynamic mark is consistent with the dynamic mark of the target dynamic. If they are consistent, it indicates that the target dynamic is a folding head; if they are inconsistent, it indicates that the target dynamic is a folding non-head.

[0092] If the target dynamic is a folded header or the folding state of the target dynamic is non-folded, the target dynamic is directly sent to the client so that the client displays the target dynamic.

[0093] If the target dynamic is a folded non-header, since the target dynamic will not be displayed on the client, an instruction to hide the target dynamic is sent to the client. In this case, after displaying the folded head, the client can display a "view more" control so that the second user can trigger the client to display the folded non-header dynamic through the control.

[0094] For example, Figure 5 The client display schematic diagram shown in the figure shows that in this scenario, the second user's first user includes "I am Zhang San" and "I am Li Si". For "I am Zhang San", it is determined that the dynamics to be displayed are folded, so the second user's client only displays the dynamic with the folded head "Train in the coldest days of winter and the hottest days of summer, come on, come on!!!". The second user clicks the "View more dynamics of Ta" button, and the client displays the dynamics corresponding to the folded non-head.

[0095] Since the number of feeds that can be presented on the display pages of different clients is different, before pushing to the client, the server determines whether the total number of target dynamics of all first users currently determined meets the number required for display. If the total number of target dynamics corresponding to all first users is less than the second threshold, the time cursor is updated to obtain an updated time cursor; for each first user, the target dynamics are read from the third storage space corresponding to the first user according to the updated time cursor and the operation of determining the folding state of the target dynamics is performed until the total number of target dynamics of all first users is determined to be not less than the second threshold. That is, more target dynamics are read by updating the time cursor to meet the required number of display items.

[0096] It should be noted that if the target dynamic quantity read after an update operation still does not meet the display requirements, the time cursor can be continuously updated until the display requirements are met. The updated time cursor corresponds to a time earlier than the time cursor before the update.

[0097] In this embodiment, a folded record only displays the folded header, so when determining whether the total number of target dynamics corresponding to all first users followed by the second user is less than the second threshold, the folded record is only counted as one dynamic.

[0098] That is, this application processes the updates posted by a person followed by the second user within a certain period of time into one collapsed record through a folding mechanism. When the collapsed record is displayed to the user, only one update will be displayed. By providing a "view more updates" function, the user can view all collapsed updates, thereby achieving message noise reduction.

[0099] Based on the above method embodiment, an embodiment of the present application provides an information processing device, which will be described below in conjunction with the accompanying drawings.

[0100] See also Figure 6 , which is a structural diagram of an information processing device provided in an embodiment of the present application, such as Figure 6 As shown, the device 600 includes: an acquisition unit 601, a processing unit 602, and a storage unit 603.

[0101] An acquisition unit 601 is configured to acquire, in response to the current time being the end time of the folding window, the number of dynamics published by the first user from the start time to the end time of the folding window from the first storage space;

[0102] The processing unit 602 is configured to, if the number of dynamics is not less than a first threshold, sort the dynamics in the number of dynamics in order of release time from the latest to the earliest, to obtain a target information flow;

[0103] A storage unit 603, configured to store the target information flow as a folding record in a second storage space, wherein the second storage space is used to record one or more folding records corresponding to the first user;

[0104] The processing unit 602 is further configured to delete the dynamic related information included in the target information flow from the first storage space.

[0105] In some embodiments, the storage unit 603 is specifically used to obtain a folding identifier and a folding header based on the target information flow, where the folding header refers to the first dynamic item included in the target information flow; and store the folding information of the target information flow in the second storage space, where the folding information includes the folding identifier, the user identifier of the first user, the dynamic identifier of the folding header, and a set of folded dynamic identifiers.

[0106] In some implementations, the processing unit 602 is further configured to delete, from the first storage space, information related to the dynamics posted by the first user recorded within a time period corresponding to the folding window if the number of dynamics is less than the first threshold.

[0107] In some embodiments, the apparatus further comprises: a receiving unit;

[0108] The receiving unit is further configured to receive a write request sent by a client, wherein the write request includes a user ID of the first user, a published dynamic, and a publishing time, and the client is a client corresponding to the first user;

[0109] The storage unit 603 is further used to record the dynamic related information in a third storage space, and the third storage space is used to store the dynamic related information published by the first user;

[0110] The storage unit 603 is further configured to record the dynamic identifier and publishing time of the dynamic event in the first storage space corresponding to the first user.

[0111] In some implementations, the storage unit 603 is further configured to record a folding mark corresponding to the dynamic state in the third storage space if the dynamic state is folded.

[0112] In some embodiments, the apparatus further comprises: a receiving unit;

[0113] The receiving unit is further configured to receive a read request sent by a client, wherein the read request includes a user identifier and a time cursor of a second user, and the client is a client corresponding to the second user;

[0114] The processing unit 602 is also used to determine the user identifier of the first user of concern based on the user identifier of the second user; for each first user, obtain the target dynamics from the third storage space corresponding to the first user according to the time cursor; determine the folding state of the target dynamics, and determine the content to be sent to the client according to the folding state of the target dynamics.

[0115] In some embodiments, the processing unit 602 is specifically used to determine that the folding state of the target dynamic is folded if the folding identifier corresponding to the target dynamic is recorded in the third storage space; determine whether the target dynamic is a folded head based on the folding identifier in the second storage space; if the folding identifier corresponding to the target dynamic is not recorded in the third storage space, determine that the folding state of the target dynamic is non-folded.

[0116] In some embodiments, the processing unit 602 is specifically used to send the target dynamic to the client if the folding state of the target dynamic is non-folded or the folding state of the target dynamic is folded and the target dynamic is a folded head; if the folding state of the target dynamic is folded and the target dynamic is a folded non-head, send an instruction to hide the target dynamic to the client.

[0117] In some embodiments, the processing unit 602 is also used to update the time cursor to obtain an updated time cursor if the total number of target dynamics corresponding to all first users followed by the determined second user is less than a second threshold, and the updated time cursor is earlier than the time cursor, and the second threshold is determined by the display page size of the client; based on each first user, read the target dynamics from the third storage space corresponding to the first user according to the updated time cursor and perform an operation to determine the folding state of the target dynamics until the total number of target dynamics corresponding to all first users followed by the determined second user is not less than the second threshold.

[0118] In some implementations, the processing unit 602 is further configured to update the duration corresponding to the folding window and / or the first threshold.

[0119] It should be noted that the information execution process of each unit in the above-mentioned device and other contents can be specifically referred to the description in the method embodiment shown in the above-mentioned application, and will not be repeated here.

[0120] In addition, an embodiment of the present application provides an electronic device, including: a processor, a memory;

[0121] The memory is used to store computer-readable instructions or computer programs;

[0122] The processor is used to read the computer-readable instructions or the computer program so that the device implements the information processing method.

[0123] An embodiment of the present application provides a computer-readable storage medium, including instructions or computer programs, which, when executed on a computer, enable the computer to execute the above-mentioned information processing method.

[0124] It should be noted that the various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments, and the same or similar parts between the various embodiments can be referred to each other. For the system or device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can be referred to the method part description.

[0125] It should be understood that in the present application, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the objects associated before and after are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0126] It should also be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0127] The steps of the method or algorithm described in conjunction with the embodiments disclosed herein may be implemented directly using hardware, a software module executed by a processor, or a combination of the two. The software module may be placed in a random access memory (RAM), a memory, a read-only memory (ROM), an electrically programmable ROM, an electrically erasable programmable ROM, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.

[0128] The above description of the disclosed embodiments enables those skilled in the art to implement or use the present application. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present application will not be limited to the embodiments shown herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. An information processing method, characterized in that: The method is applied to the server, and includes: In response to the current time being the end time of the folding window, acquiring, from the first storage space, the number of dynamics published by the first user from the start time to the end time of the folding window; If the number of dynamics is not less than the first threshold, sorting the dynamics in the number of dynamics in order of release time from latest to earliest to obtain a target information flow; storing the target information flow as a folding record in a second storage space, where the second storage space is used to record one or more folding records corresponding to the first user; The dynamic related information included in the target information flow is deleted from the first storage space.

2. The method according to claim 1, characterized in that The step of storing the target information flow as a fold record in the second storage space includes: Acquire a folding mark and a folding header according to the target information flow, wherein the folding header refers to the first dynamic included in the target information flow; The folding information of the target information flow is stored in the second storage space, the folding information including the folding identifier, the user identifier of the first user, the dynamic identifier of the folding header, and the folded dynamic identifier set.

3. The method according to claim 1 or 2, characterized in that: The method further comprises: If the number of dynamics is less than the first threshold, deleting, from the first storage space, information related to the dynamics posted by the first user recorded in the time period corresponding to the folding window; and / or, Update the duration corresponding to the folding window and / or the first threshold.

4. The method according to claim 1, characterized in that: The method further comprises: receiving a write request sent by a client, the write request including the user ID of the first user, the posted dynamics, and the posting time, the client being a client corresponding to the first user; Recording the dynamic related information in a third storage space, where the third storage space is used to store the dynamic related information published by the first user; The dynamic identifier and publishing time of the dynamic event are recorded in a first storage space corresponding to the first user.

5. The method according to claim 4, characterized in that The method further comprises: If the dynamic is folded, a folding mark corresponding to the dynamic is recorded in the third storage space.

6. The method according to claim 1, characterized in that The method further comprises: receiving a read request sent by a client, wherein the read request includes a user identifier and a time cursor of a second user, and the client is a client corresponding to the second user; Determine the user identifier of the concerned first user based on the user identifier of the second user; For each first user, obtaining target dynamics from a third storage space corresponding to the first user according to the time cursor; The folding state of the target dynamics is determined, and the content to be sent to the client is determined according to the folding state of the target dynamics.

7. The method according to claim 6, characterized in that Determining the dynamic folding state of the target includes: If the folding mark corresponding to the target dynamic is recorded in the third storage space, determining that the folding state of the target dynamic is folded; determining in the second storage space whether the target dynamic is a folded head based on the folding mark; If the folding mark corresponding to the target dynamic is not recorded in the third storage space, it is determined that the folding state of the target dynamic is non-folding.

8. The method according to claim 6 or 7, characterized in that: The determining of the content to be sent to the client according to the dynamic folding state of the target includes: If the folding state of the target dynamic is not folded or the folding state of the target dynamic is folded and the target dynamic is a folded head, sending the target dynamic to the client; If the folding state of the target dynamic is folded and the target dynamic is a folded non-header, an instruction to hide the target dynamic is sent to the client.

9. The method according to claim 6, characterized in that The method further comprises: If the determined total number of target dynamics corresponding to all first users followed by the second user is less than a second threshold, updating the time cursor to obtain an updated time cursor, the updated time cursor being earlier than the time cursor, and the second threshold is determined by a display page size of the client; Based on each first user, the target dynamics are read from the third storage space corresponding to the first user according to the updated time cursor and an operation of determining the folding state of the target dynamics is performed, until the total number of target dynamics corresponding to all first users followed by the second user is determined to be not less than the second threshold.

10. An information processing device, characterized in that: The device is applied to a server, and includes: an acquisition unit, configured to acquire, in response to the current time being the end time of the folding window, the number of dynamics published by the first user from the start time to the end time of the folding window from the first storage space; A processing unit, configured to, if the number of dynamics is not less than a first threshold, sort the dynamics in the number of dynamics in order of release time from latest to earliest, to obtain a target information flow; a storage unit, used to store the target information flow as a folding record in a second storage space, wherein the second storage space is used to record one or more folding records corresponding to the first user; The processing unit is further configured to delete the dynamic related information included in the target information flow from the first storage space.

Images