Data processing method and device, electronic equipment and storage medium

Abstract

The embodiment of the invention provides a data processing method and device, electronic equipment and a storage medium, and the data processing method comprises the steps: determining an ordered data chain corresponding to to-be-processed data, the to-be-processed data being data associated with media contents, and the ordered data chain being used for indicating the media contents arranged in an ordered manner; determining the existence condition of the ordered data chain through the bitmap corresponding to the to-be-processed data; and processing the to-be-processed data based on the existence condition of the ordered data chain. According to the method, the existence condition of the ordered data chain is indicated through the bitmap, so that the ordered data chain table is managed through the bitmap, the existence condition of the ordered data chain corresponding to the to-be-processed data is conveniently determined on the basis of the bitmap when the to-be-processed data is processed, and then the to-be-processed data is processed on the basis of the existence condition. The problem that the query flow is large when the data of the cache layer is directly queried is solved, the existence condition of the ordered data chain is indicated through the bitmap, the query flow is reduced, and the computing power of data processing is reduced.

Description

Technical Field

[0001] The embodiments of the present disclosure relate to data processing technology, and more particularly to a data processing method, device, electronic device, and storage medium. Background Art

[0002] An ordered list is a data structure that is ordered and has no duplicate elements. In the case of an ordered list, data is stored in the cache in a zset structure. When querying data, it is necessary to query data in multiple zset structures and then return the query results.

[0003] However, there is currently a lack of management of the data stored in the cache, which results in a large query flow when processing the data (such as storing or reading), increasing the computing power of data processing. Summary of the invention

[0004] The present disclosure provides a data processing method, device, electronic device and storage medium, which reduce the query flow for data processing and reduce the computing power of data processing.

[0005] In a first aspect, an embodiment of the present disclosure provides a data processing method, including:

[0006] Determining an ordered data chain corresponding to the data to be processed, wherein the data to be processed is data associated with the media content, and the ordered data chain is used to indicate the media content arranged in an ordered manner;

[0007] Determining the existence of the ordered data chain through the bitmap corresponding to the data to be processed;

[0008] The data to be processed is processed based on the existence of the ordered data chain.

[0009] In a second aspect, an embodiment of the present disclosure further provides a data processing device, including:

[0010] A first determination module, configured to determine an ordered data chain corresponding to the data to be processed, wherein the data to be processed is data associated with the media content, and the ordered data chain is used to indicate the media content arranged in an ordered manner;

[0011] A second determination module, used to determine the existence of the ordered data chain through the bitmap corresponding to the data to be processed;

[0012] A processing module is used to process the data to be processed based on the existence of the ordered data chain.

[0013] In a third aspect, an embodiment of the present disclosure further provides an electronic device, the electronic device comprising:

[0014] one or more processing devices;

[0015] a storage device for storing one or more programs,

[0016] When the one or more programs are executed by the one or more processing devices, the one or more processing devices implement the data processing method provided by the present disclosure.

[0017] In a fourth aspect, an embodiment of the present disclosure further provides a storage medium containing computer executable instructions, which, when executed by a computer processor, are used to execute the data processing method provided by the present disclosure.

[0018] The disclosed embodiments, by determining the ordered data chain corresponding to the data to be processed, the data to be processed is data associated with media content, and the ordered data chain is used to indicate media content arranged in an ordered manner; through the bitmap corresponding to the data to be processed, the existence of the ordered data chain is determined; and the data to be processed is processed based on the existence of the ordered data chain. The disclosed embodiments indicate the existence of the ordered data chain through a bitmap, thereby realizing the management of the ordered data chain list through the bitmap, so that when processing the data to be processed, the existence of the ordered data chain corresponding to the data to be processed is determined based on the bitmap, and then the data to be processed is processed based on the existence. The technical problem of large query traffic when directly querying the data in the cache layer is solved, and the existence of the ordered data chain is indicated by a bitmap, which reduces the query traffic and the computing power of data processing. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the accompanying drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and the originals and elements are not necessarily drawn to scale.

[0020] Figure 1a is a flowchart of a data processing method provided by an embodiment of the present disclosure;

[0021] Figure 1b It is a schematic diagram of the correspondence between a bitmap and an ordered data chain provided by an embodiment of the present disclosure;

[0022] Figure 2 It is a flowchart of a data processing method provided by an embodiment of the present disclosure;

[0023] Figure 3 is a schematic diagram of a data update process provided by an embodiment of the present disclosure;

[0024] Figure 4 is a schematic diagram of a data reading process provided by an embodiment of the present disclosure;

[0025] Figure 5 is a structural schematic diagram of a data processing device provided by an embodiment of the present disclosure;

[0026] Figure 6 It is a structural schematic diagram of an electronic device provided by an embodiment of the present disclosure. DETAILED DESCRIPTION

[0027] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0028] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.

[0029] The term "including" and its variations used herein are open inclusions, i.e., "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.

[0030] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0031] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0032] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0033] In the scenario of ordered lists, in order to support flexible data filtering capabilities, the user's full data will be split into multiple zset structures according to data categories and stored in the memory database (this part of data is cached data). Therefore, when querying the user's list, it is necessary to query and merge the data of multiple zset structures, and then return the results to the user. The advantage of storing multiple zset data under the user in the cache is that the process is simple, all write and read operations can be completed in the cache, and there is no dependence on other storage. The disadvantage is also obvious. All zset data under the user is in the cache, and cold data that is not frequently accessed is also in the cache. It is impossible to eliminate cold data through the eviction strategy, resulting in serious waste of cache resources. As the overall data grows, the waste of cache resources becomes more and more serious, and the amount of data processing is increased.

[0034] In order to achieve data management, the present disclosure provides a data processing method. Figure 1a It is a flow chart of a data processing method provided by an embodiment of the present disclosure. The embodiment of the present disclosure is applicable to situations where data is processed. The method can be executed by a data processing device, which can be implemented in the form of software and / or hardware. Optionally, it can be implemented by an electronic device, which can be a mobile terminal, a PC or a server, etc.

[0035] like Figure 1a As shown, the method includes:

[0036] S110: Determine the ordered data chain corresponding to the data to be processed.

[0037] The data to be processed can be considered as data to be processed, and different data to be processed correspond to different processing methods. The data to be processed is data associated with media content. For example, the data to be processed can be media content to be stored; for example, the data to be processed can be a query request for reading media content; for example, the data to be processed can be media content to be reviewed; for example, the media content to be processed can be media content to be analyzed. Media content can refer to content that can convey information. Media content can include audio and at least one media resource or media content can include at least one media resource. Media resources can include images, text and / or videos. An ordered data chain is used to indicate media content arranged in an ordered manner. An ordered data chain can be an empty data chain, or an ordered data chain can include multiple media content arranged in order. This embodiment does not limit the sorting method, such as sorting by time, sorting by the number of visits to the media content in the application, and sorting by where the media content is operated in the application.

[0038] In one embodiment, multiple media contents are displayed in a media content display page. The media contents can be divided into multiple ordered data chains according to data categories, and different ordered data chains correspond to different data categories. Data categories can be information that characterizes the categories of data, and the classification of categories is not limited here. For example, according to the subject matter of the media content, the ordered data chains may include ordered data chains related to virtual reality and ordered data chains related to augmented reality; for example, according to the form of the media content, the ordered data chains may include ordered data chains displayed in the form of pictures and ordered data chains displayed in the form of videos; for example, according to the degree of publicity of the media content, the ordered data chains may include public ordered data chains and private ordered data chains.

[0039] The application scenarios of the present disclosure are not limited, as long as they are scenarios for processing data to be processed, such as scenarios for accessing media content, scenarios for reviewing media content, and scenarios for analyzing media content.

[0040] In the process of analyzing the data to be processed, this operation determines the ordered data chain corresponding to the data to be processed. The ordered data chain is a data chain associated with the data to be processed. The association method can be related to the processing method of the data to be processed. For example, if the data to be processed is media content with a changed state, the ordered data chain corresponding to the data to be processed can be an ordered data chain that includes or will include the data to be processed. If the data to be processed is newly added media content, the ordered data chain corresponding to the data to be processed can be an ordered data chain that will include the data to be processed. The data category of the data chain to be processed matches that of the ordered data chain, if the data categories of the two are the same. For example, if the data to be processed is deleted media content, the ordered data chain corresponding to the data to be processed is an ordered data chain that includes the data to be processed. For example, if the data to be processed is media content with a changed visibility, the ordered data chain corresponding to the data to be processed is an ordered data chain corresponding to the changed state, such as an ordered data chain corresponding to a visible state.

[0041] In the present disclosure, the data to be processed can be associated with the ordered data chain based on the data category. Data of different data categories can correspond to different ordered data chains. This operation can determine the corresponding ordered data chain based on the data category of the data to be processed.

[0042] S120: Determine the existence of the ordered data chain through the bitmap corresponding to the data to be processed.

[0043] In this embodiment, the existence of the ordered data chain may be indicated by a bitmap. The existence may indicate the existence of the ordered data chain, such as the existence in the cache.

[0044] In this embodiment, the corresponding bitmap can be determined based on the user to which the data to be processed belongs, and one user can correspond to at least one bitmap. When one user corresponds to multiple bitmaps, different bitmaps can be corresponding to different scenarios.

[0045] The bitmap corresponding to the data to be processed may be a bitmap used to indicate the existence of an ordered data chain corresponding to the data to be processed.

[0046] After determining the ordered data chain corresponding to the data to be processed, this operation can determine the existence of the ordered data chain corresponding to the data chain to be processed through the bitmap corresponding to the data to be processed. For example, the existence of the ordered data chain can be determined through the bits in the bitmap. Different ordered data chains can correspond to different bits in the bitmap. One bit in the bitmap can be used to indicate the existence of an ordered data chain.

[0047] When the data to be processed corresponds to multiple ordered data chains, the bit position corresponding to each ordered data chain in the bitmap may be determined, and the existence of the ordered data chain may be determined by analyzing the corresponding bit positions.

[0048] S130: Process the data to be processed based on the existence of the ordered data chain.

[0049] Different data to be processed correspond to different processing strategies. This operation can be combined with the existence of the ordered data chain when processing the data to be processed. Different data to be processed have different processing strategies in combination with the existence. For example, when the data to be processed is a query request for querying media content, the location of reading the media content can be determined in combination with the existence of the ordered data chain. For another example, when the data to be processed is media content to be updated, it can be determined based on the existence of the ordered data chain whether to read the ordered data chain from the source layer to complete the processing of the data to be processed.

[0050] In the present disclosure, data can be stored in the back-source layer and the cache layer. The back-source layer stores more data than the cache layer. The cache layer can store sorted media content and identification information corresponding to the media content. The back-source layer can serve as a basic guarantee, and the data stored is more than the data stored in the back-source layer. Data that cannot be queried in the cache layer can be queried from the back-source layer. Data stored in the cache layer can be called hot data.

[0051] The technical solution of the disclosed embodiment indicates the existence of an ordered data chain through a bitmap, and realizes the management of an ordered data chain table through a bitmap, so that when processing the data to be processed, the existence of the ordered data chain corresponding to the data to be processed is determined based on the bitmap, and then the data to be processed is processed based on the existence. The technical problem of large query traffic when directly querying the data in the cache layer is solved, and the existence of the ordered data chain is indicated by a bitmap, which reduces the query traffic and the computing power of data processing.

[0052] Based on the above embodiment, a variant embodiment of the above embodiment is proposed. It should be noted that in order to make the description concise, only the differences from the above embodiment are described in the variant embodiment.

[0053] In one embodiment, determining the ordered data chain corresponding to the data to be processed includes:

[0054] In the case where the data to be processed is media content with a status update, determining an ordered data chain matching the data category of the processed data;

[0055] In the case where the data to be processed is a query request for querying media content, the existence of a bitmap corresponding to the data to be processed is determined, and when the existence of the corresponding bitmap indicates that there is a bitmap corresponding to the data to be processed, an ordered data chain matching the data category queried by the data to be processed is determined.

[0056] The state update can be considered as a change in the state of existence or non-existence, or a change in the visible state. For example, the state changes from existence to non-existence, which corresponds to the scene where the media content is deleted; another example is the state changes from non-existence to existence, which corresponds to the scene where the media content is newly added; another example is the state changes from visible to invisible; another example is the state changes from invisible to visible.

[0057] When the data to be processed is media content, the state of the media content change can be used as the data category to match the ordered data chain.

[0058] In one example, the application can be divided into two ordered data chains according to whether the media content is visible to other users in the application, one ordered data chain includes visible media content, and the other ordered data chain includes invisible media content. When the state of the media content changes from visible to invisible, the ordered data chain corresponding to the data to be processed can be the ordered data chain including the media content in the invisible state.

[0059] The query request for querying media content may be a request for querying media content within an application, such as querying media content whose status is invisible.

[0060] When determining the ordered data chain of the data to be processed in the query scenario, it is possible to first determine whether there is a bitmap of the corresponding processed data, that is, to determine the existence of the bitmap corresponding to the data to be processed. When there is no bitmap corresponding to the data to be processed, it can be indicated that there is no ordered data chain associated with the data to be processed, and the operation can be terminated; when there is a bitmap corresponding to the data to be processed, an ordered data chain matching the data category queried by the data to be processed can be determined and determined as the ordered data chain corresponding to the data to be processed.

[0061] In one embodiment, determining the existence of the ordered data chain through the bitmap corresponding to the data to be processed includes:

[0062] The existence of the ordered data chain is determined by taking the value of the bit corresponding to the ordered data chain in the bitmap corresponding to the data to be processed.

[0063] When determining the existence of an ordered data chain, this embodiment can determine the bit corresponding to the ordered data chain in the bitmap corresponding to the data to be processed, and determine the existence of the ordered data chain by analyzing the value of the bit. Different bit values ​​can correspond to different existence conditions, such as when the value is 1, the corresponding existence condition is existence. When the value is 0, the corresponding existence condition is non-existence.

[0064] Figure 1b is a schematic diagram of the corresponding relationship between a bitmap and an ordered data chain provided by an embodiment of the present disclosure, see Figure 1b , different bits in the bitmap correspond to different ordered data chains, namely zset. When the bit value is 1, it indicates that there is a corresponding ordered data chain. Figure 1b There are 5 ordered data chains, namely ordered data chain 1, ordered data chain 2, ordered data chain 3, ordered data chain 4 and ordered data chain 5. The corresponding bit in the bitmap is 1, and the remaining bits in the bitmap are 0. Different bits in the bitmap can be represented by the offset from the high bit in the bitmap. The bit value of 0 indicates that there is no corresponding ordered data chain.

[0065] Figure 2 : is a flow chart of a data processing method provided by an embodiment of the present disclosure. This embodiment concretizes the operation of processing the data to be processed on the basis of the above embodiment. The data processing method in this embodiment includes the following operations:

[0066] S210: Determine the ordered data chain corresponding to the data to be processed.

[0067] S220: Determine the existence of the ordered data chain through the bitmap corresponding to the data to be processed.

[0068] S230: When the existence status of the ordered data chain indicates that the ordered data chain exists, determine the existence status of the ordered data chain in the cache.

[0069] In the case where it is determined through the bitmap that there is an ordered data chain, this operation can further determine whether the ordered data chain exists in the cache to determine the location of processing the data to be processed.

[0070] S240: Process the data to be processed based on the existence of the ordered data chain in the cache.

[0071] When the ordered data chain exists in the memory, the ordered data chain can be considered as hot data, and the data to be processed can be directly processed based on the ordered data chain in the cache. When the ordered data chain does not exist in the cache, the ordered data chain can be read from the back-source layer and then updated.

[0072] The data processing method provided in this embodiment, when determining that an ordered data chain exists, further determines the existence of the ordered data chain in the cache, so as to obtain the ordered data chain and implement the update of the ordered data chain.

[0073] Since the data in the ordered data chain will be deleted from the cached ordered data chain when the access volume is low, this operation can increase the judgment of whether it is in the cache to reduce the traffic of querying the cache when it is not in the cache.

[0074] In this embodiment, the access volume of the data included in the ordered data chain in the cache is greater than the set threshold, so as to avoid cold data occupying the cache. Cold data can be considered as media content with access volume less than or equal to the set threshold, that is, with low access volume.

[0075] In one embodiment, the processing of the to-be-processed data based on the existence of the ordered data chain in the cache includes:

[0076] In a case where the existence of the ordered data chain in the cache indicates that the ordered data chain exists in the cache, the ordered data chain is updated by a script with atomic update capability.

[0077] In the case where an ordered data chain exists in the cache, this embodiment updates the ordered data chain through a script with atomic capabilities, thereby ensuring the atomicity and correctness of the data.

[0078] The script with atomic capability can be a Lua script. When updating the ordered data chain based on the script with atomic update capability, it can be updated based on the processing strategy of the data to be processed. For example, when deleting the data to be processed, the data to be processed can be deleted from the ordered data chain. When adding new data to be processed, the data to be processed can be added to the ordered data chain.

[0079] In one embodiment, updating the ordered data chain by a script having atomic update capability includes:

[0080] When the state of the data to be processed indicates that the data to be processed is added or changed data, adding the data to be processed to the ordered data chain by a script with atomic update capability;

[0081] When the state of the data to be processed indicates that the data to be processed is deleted data, the data to be processed is deleted from the ordered data chain by a script with atomic update capability.

[0082] The added data may be media content newly added in the application, and the changed data may be media content whose status has changed in the application, such as media content whose visible status has changed.

[0083] In this embodiment, the orderliness of the ordered data chain can be maintained when adding data to be processed, such as updating the ordered data chain after sorting the existing media content and data to be processed in the ordered data chain.

[0084] The deleted data may be data deleted in the application. After deleting the pending data, the data in the ordered data chain may be updated and sorted.

[0085] In one embodiment, the data processing method further includes:

[0086] Updating the remaining ordered data chains, wherein the remaining ordered data chains are ordered data chains associated with the bitmap corresponding to the data to be processed, except for the ordered data chain corresponding to the data to be processed;

[0087] Updating the bitmap corresponding to the data to be processed;

[0088] Update the data in the source layer corresponding to the data to be processed.

[0089] The bitmap corresponding to the data to be processed may be a bitmap of the user dimension, and the bitmap indicates the existence of all ordered data chains corresponding to the user. Updating the remaining ordered data chains indicates the correctness of the contents associated with the data to be processed in the remaining ordered data chains.

[0090] In one example, the data to be processed is media content that changes from a visible state to an invisible state. Updating the ordered data chain corresponding to the data to be processed may be to add the data to be processed to the ordered data chain corresponding to the visible state. Updating the remaining ordered data chains may be considered to be to delete the data to be processed from the remaining ordered data chains.

[0091] In one example, when the data to be processed is newly added data, updating the ordered data chain corresponding to the data to be processed may be inserting the data to be processed into the ordered data chain corresponding to the data to be processed, and when updating the remaining ordered data chains, the remaining ordered data chains may not be changed.

[0092] In one example, when the data to be processed is deleted data, updating the ordered data chain corresponding to the data to be processed may be to delete the data to be processed from the ordered data chain corresponding to the data to be processed, and when updating the remaining ordered data chains, the remaining ordered data chains may not be changed.

[0093] Updating the bitmap can be considered as updating the value of the bit in the bitmap. When updating, it can be determined whether the ordered data chain corresponding to the bitmap still contains data. If the ordered data chain is empty, the corresponding bit of the bitmap can be set to zero. A bit of 0 indicates that there is no ordered data chain corresponding to the data type of the bit.

[0094] After the state of the data to be processed is changed, the content related to the data to be processed in the source layer can be updated to ensure the correctness of the content associated with the data to be processed in the source layer.

[0095] In one embodiment, the number of ordered data chains corresponding to the data to be processed is at least one, and each ordered data chain corresponds to the existence of the ordered data chain in the cache;

[0096] The processing of the to-be-processed data based on the existence of the ordered data chain in the cache includes:

[0097] If the existence status of all ordered data chains corresponding to the data to be processed indicates that the corresponding ordered data chains are in the cache, then all the ordered data chains are read from the cache and returned; otherwise, all the ordered data chains are read from the back-source layer, loaded into the cache and returned.

[0098] In the case where the data to be processed is a query, this embodiment can determine whether to read the ordered data chain corresponding to the data to be processed from the cache according to the existence of the ordered data chain in the cache.

[0099] When all ordered data chains to be queried are in the cache, all ordered data chains can be read from the cache and returned. If ordered data chains are displayed, when there are multiple ordered data chains, the ordered data chains can be merged, and the merging means is not limited, and the ordered data chains can be merged in order.

[0100] If some of the ordered data chains required for query are not in the cache, all the ordered data chains required for query are directly read from the back-source layer and loaded into the cache. The loaded ordered data chains may be only those that are not in the cache.

[0101] In one embodiment, the access amount of the media content indicated by the ordered data chain is greater than a set threshold. The access amount of the media content indicated by the ordered data chain is greater than the set threshold to avoid cold data occupying the cache. The ordered data chain can indicate the media content through the media content application, that is, the ordered data chain can include the media content. The ordered data chain can also include identification information of the media content.

[0102] The present disclosure is described exemplarily below. The data processing method provided by the present disclosure can be considered as a bitmap-based, i.e., a bitmap-based, single-user, multi-zset atomic access scheme for cache data that supports an eviction strategy. While ensuring the data correctness and consistency of the overall read and write process, it does not affect the overall performance of the cache layer, thereby achieving the purpose of saving cache resources.

[0103] In the scenario of filtering and sorting, the single-user multi-zset data access solution lacks the management of multi-zset data (i.e., ordered data chain) under the user. Therefore, the existence of zset data depends on its actual existence in the cache, resulting in the inability to evict data in the cache based on the hotness or coldness of the data, leading to a large waste of cache resources. Moreover, as time goes by, the overall amount of data in the cache will also increase, leading to further waste of cache resources.

[0104] The present invention manages the existence of the user's zset set (i.e., all the user's ordered data chains) by introducing a bitmap data structure into the cache; and ensures the atomicity and correctness of the two processes of the existence and writing of the zset data in the redis cache through Lua script writing.

[0105] This disclosure supports the cold zset data chain eviction of user redis cache data, which greatly saves redis cache resources. The bitmap records the actual data existence of zset data, which greatly reduces the query traffic of the cache layer.

[0106] Figure 3 is a schematic diagram of a data update process provided by an embodiment of the present disclosure; Figure 3 The process of updating media content is shown. Media content updating includes adding new media content, deleting media content, and changing the state of media content, such as changing from visible to invisible.

[0107] See also Figure 3 , media content update includes the following operations:

[0108] a. Update media content. Determine whether the ordered data chain corresponding to the media content is in the cache. If so, update the ordered data chain. If not, load the ordered data chain from the back-source storage, merge the currently updated media content, and complete the cache update.

[0109] When a user's media content is updated, the ordered data chain corresponding to the media content will be calculated. First, determine the existence of the ordered data chain in the cache storage (that is, whether the ordered data is in the cache: determine the existence of the ordered data chain by taking the value of the bit corresponding to the ordered data chain in the bitmap corresponding to the data to be processed, and when the existence of the ordered data chain indicates the existence of the ordered data chain, determine the existence of the ordered data chain in the cache; process the data to be processed based on the existence of the ordered data chain in the cache). If it exists, update this ordered data, such as updating it through Lua script atoms to prevent the ordered data chain from being evicted / expired in the cache before the update. The steps included in the Lua script atom include determining whether the ordered data chain corresponding to the media content is in the cache, and if so, update this ordered data chain; if it does not exist in the cache (it may be evicted, expired or no data). Load the corresponding ordered data chain from the back-to-source storage, merge the currently updated media content, and complete the cache update. After merging the loaded ordered data chain with the currently updated media content (such as storing the currently updated media content in the ordered data chain), update the cache;

[0110] b. Update other ordered data chains Update the other ordered data chains under the user. The change of the user's media content status will cause the media content to switch from one ordered data chain to another, such as from the ordered data chain corresponding to the invisible state to the ordered data chain corresponding to the visible state. Therefore, this step requires the updated media content to be removed from the original ordered data chain. The original ordered data chain is the zset data chain where the media content is located before the update.

[0111] c. Update the bitmap, that is, update the bitmap corresponding to the data to be processed

[0112] Update the state of the bit corresponding to the ordered data chain in the bitmap (that is, update the state of the ordered data chain corresponding to the bitmap). By updating the state of the ordered data chain corresponding to the bitmap, it indicates the actual existence of data in multiple ordered data chains under the user. For example, if there are 5 ordered data chains under the user, the corresponding 5 bits on the bitmap will be set to 1, indicating that there is actually data in the corresponding ordered data chain; when the user deletes all the data under the corresponding ordered data chain, the corresponding bit will be updated to 0. Figure 1b As shown, after all the data under ordered data chain 1 is deleted, the bit corresponding to ordered data chain 1 will be updated to 0. Figure 1b The correspondence between the ordered data chains and the bits is shown by arrows.

[0113] d. Update the back-source storage, that is, update the data in the back-source layer corresponding to the data to be processed

[0114] Update the corresponding data in the source storage to ensure the correctness of the data in the source storage, thus completing the update process.

[0115] Figure 4 is a schematic diagram of a data reading process provided by an embodiment of the present disclosure; see Figure 4 , the data reading process is as follows:

[0116] a. Read data and determine whether the bitmap exists

[0117] When a user queries data, the existence of the bitmap data in the user dimension will be determined first (that is, whether the bitmap corresponding to the user exists). If there is no bitmap data corresponding to the user, it indicates that there is no ordered data chain, and the query request can be terminated directly; if there is bitmap data corresponding to the user, it indicates that there is an ordered data chain. That is, when the data to be processed is a query request for querying media content, the existence of the bitmap corresponding to the data to be processed is determined. When the existence of the corresponding bitmap indicates that there is a bitmap corresponding to the data to be processed, it indicates that there is an ordered data chain.

[0118] b. Get the ordered data chain to be queried, and query the existence of the ordered data chain to be queried in the bitmap. Query the existence of the ordered data chain to be queried in the bitmap in the cache. Determine whether all the ordered data chains are in the cache. If so, merge the ordered data chains queried in the cache to obtain the query result; if not, load the required ordered data chain into the cache at the back-to-source layer, and query the back-to-source layer data.

[0119] After determining that the bitmap exists, the ordered data chain that needs to be queried corresponding to the query request can be determined. Determine whether there is an ordered data chain that needs to be queried in the bitmap. After determining that there is an ordered data chain that needs to be queried through the bitmap, the existence of the ordered data chain in the bitmap can be queried in the cache. In the case where all ordered data chains are in the cache, merge the ordered data chains to obtain the query results, such as merging the ordered data chains found in the cache in order. The zset chain is not entirely in the cache. Load the relevant ordered data chains from the back-to-source layer to the cache so that the ordered data chains can be obtained in the cache later. This query of the data in the back-to-source layer obtains the ordered data chain that needs to be queried this time.

[0120] Specifically, according to the user's query request, all ordered data chains that need to be queried are calculated (that is, the ordered data chains that match the data category queried by the data to be processed are determined), and then the corresponding bit in the bitmap is queried to see whether the queried ordered data chain exists (that is, the existence of the ordered data chain is determined by the value of the bit corresponding to the ordered data chain in the bitmap corresponding to the data to be processed). If all are found, the data is queried from the cache; otherwise, the ordered data chain is queried from the source layer, and the queried ordered data chain is loaded into the cache. Subsequently, only the ordered data chain with the corresponding bit in the bitmap being 1 needs to be queried in the cache.

[0121] i. If all ordered data chains corresponding to the query request are in the cache, the ordered data chain results of the cache query are merged and returned (i.e., if the existence of all ordered data chains corresponding to the data to be processed indicates that the corresponding ordered data chains are in the cache, all ordered data chains are read from the cache and returned).

[0122] ii. If the ordered data chains corresponding to the query request are not all in the cache, it is necessary to asynchronously load the ordered data chains that are not in the cache from the back-source layer or asynchronously load all the ordered data chains required for this query, so that subsequent queries in the cache can be hit. This query can directly obtain the results from the back-source layer and return them (that is, read all the ordered data chains from the back-source layer, load all the ordered data chains into the cache and return all the ordered data chains).

[0123] Figure 5 is a schematic diagram of the structure of a data processing device provided by an embodiment of the present disclosure, such as Figure 5 As shown, the device comprises:

[0124] A first determination module 510, configured to determine an ordered data chain corresponding to the data to be processed, wherein the data to be processed is data associated with the media content, and the ordered data chain is used to indicate the media content arranged in an ordered manner;

[0125] A second determination module 520 is used to determine the existence of the ordered data chain through the bitmap corresponding to the data to be processed;

[0126] The processing module 530 is used to process the data to be processed based on the existence of the ordered data chain.

[0127] The technical solution provided by the embodiment of the present disclosure indicates the existence of the ordered data chain through a bitmap, and realizes the management of the ordered data chain table through the bitmap, so that when processing the data to be processed, the existence of the ordered data chain corresponding to the data to be processed is determined based on the bitmap, and then the data to be processed is processed based on the existence. The technical problem of large query traffic when directly querying the data in the cache layer is solved, and the existence of the ordered data chain is indicated by the bitmap, which reduces the query traffic and the computing power of data processing.

[0128] The data processing device provided in the embodiments of the present disclosure can execute the data processing method provided in any embodiment of the present disclosure, and has the corresponding functional modules and beneficial effects of the execution method.

[0129] In one embodiment, the first determining module 510 is specifically configured to:

[0130] In the case where the data to be processed is media content with a status update, determining an ordered data chain matching the data category of the processed data;

[0131] In the case where the data to be processed is a query request for querying media content, the existence of a bitmap corresponding to the data to be processed is determined, and when the existence of the corresponding bitmap indicates that there is a bitmap corresponding to the data to be processed, an ordered data chain matching the data category queried by the data to be processed is determined.

[0132] In one embodiment, the second determining module 520 is specifically configured to:

[0133] The existence of the ordered data chain is determined by taking the value of the bit corresponding to the ordered data chain in the bitmap corresponding to the data to be processed.

[0134] In one embodiment, the processing module 530 includes:

[0135] a determining unit, configured to determine the existence of the ordered data chain in a cache if the existence of the ordered data chain indicates that the ordered data chain exists;

[0136] A processing unit is used to process the data to be processed based on the existence of the ordered data chain in the cache.

[0137] In one embodiment, the processing unit is specifically configured to:

[0138] In a case where the existence of the ordered data chain in the cache indicates that the ordered data chain exists in the cache, the ordered data chain is updated by a script with atomic update capability.

[0139] In one embodiment, the processing unit updates the ordered data chain through a script with atomic update capability, including:

[0140] When the state of the data to be processed indicates that the data to be processed is added or changed data, adding the data to be processed to the ordered data chain by a script with atomic update capability;

[0141] When the state of the data to be processed indicates that the data to be processed is deleted data, the data to be processed is deleted from the ordered data chain by a script with atomic update capability.

[0142] In one embodiment, the data processing device further includes: an updating module, configured to:

[0143] Updating the remaining ordered data chains, wherein the remaining ordered data chains are ordered data chains associated with the bitmap corresponding to the data to be processed, except for the ordered data chain corresponding to the data to be processed;

[0144] Updating the bitmap corresponding to the data to be processed;

[0145] Update the data in the source layer corresponding to the data to be processed.

[0146] In one embodiment, the number of ordered data chains corresponding to the data to be processed is at least one, and each ordered data chain corresponds to the existence of the ordered data chain in the cache;

[0147] The processing unit is specifically used to read all the ordered data chains corresponding to the data to be processed from the cache and return all the ordered data chains if the existence status of all the ordered data chains corresponding to the data to be processed indicates that the corresponding ordered data chains are in the cache; otherwise, read all the ordered data chains from the back-source layer, load all the ordered data chains into the cache and return all the ordered data chains.

[0148] In one embodiment, the access volume of the media content indicated by the ordered data chain is greater than a set threshold.

[0149] It is worth noting that the various units and modules included in the above-mentioned device are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the protection scope of the embodiments of the present disclosure.

[0150] Figure 6 Schematic diagram of the structure of an electronic device provided by an embodiment of the present disclosure. Figure 6 , which shows an electronic device (eg, Figure 6A schematic diagram of the structure of a terminal device or server) 500.

[0151] The electronic device 500 includes:

[0152] One or more processing devices 501;

[0153] The storage device 508 is used to store one or more programs.

[0154] When the one or more programs are executed by the one or more processing devices 501 , the one or more processing devices 501 implement the data processing method provided by the present disclosure.

[0155] The terminal devices in the embodiments of the present disclosure may include but are not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., as well as fixed terminals such as digital TVs, desktop computers, etc. Figure 6 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0156] like Figure 6 As shown, the electronic device 500 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 501, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage device 508 into a random access memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the electronic device 500 are also stored. The processing device 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An edit / output (I / O) interface 505 is also connected to the bus 504.

[0157] Typically, the following devices may be connected to the I / O interface 505: an input device 506 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 507 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 508 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 509. The communication device 509 may allow the electronic device 500 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 6 The electronic device 500 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead.

[0158] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device 509, or installed from a storage device 508, or installed from a ROM 502. When the computer program is executed by the processing device 501, the above-mentioned functions defined in the method of the embodiment of the present disclosure are executed.

[0159] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0160] The electronic device provided by the embodiment of the present disclosure and the data processing method provided by the above embodiment belong to the same inventive concept. The technical details not fully described in this embodiment can be referred to the above embodiment, and this embodiment has the same beneficial effects as the above embodiment.

[0161] The embodiments of the present disclosure provide a computer storage medium on which a computer program is stored. When the program is executed by a processor, the data processing method provided by the above embodiments is implemented.

[0162] It should be noted that the computer-readable medium mentioned above in the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination of the two.

[0163] The computer storage medium may be a storage medium of computer executable instructions, which, when executed by a computer processor, are used to perform the methods provided by the present disclosure.

[0164] Computer readable storage media may be, for example, but not limited to: electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or components, or any combination thereof. More specific examples of computer readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer readable storage medium may be any tangible medium containing or storing a program that may be used by or in conjunction with an instruction execution system, device or device. In the present disclosure, a computer readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, in which a computer readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium other than a computer readable storage medium, which may send, propagate, or transmit a program used by or in conjunction with an instruction execution system, device, or device. The program code embodied on the computer readable medium may be transmitted using any appropriate medium, including but not limited to: wire, optical cable, RF (radio frequency), etc., or any suitable combination of the foregoing.

[0165] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0166] The computer-readable medium may be included in the electronic device, or may exist independently without being incorporated into the electronic device.

[0167] The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device:

[0168] The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: determines an ordered data chain corresponding to the data to be processed, wherein the data to be processed is data associated with media content, and the ordered data chain is used to indicate media content arranged in an ordered manner; determines the existence of the ordered data chain through a bitmap corresponding to the data to be processed; and processes the data to be processed based on the existence of the ordered data chain.

[0169] Computer program code for performing the operations of the present disclosure may be written in one or more programming languages ​​or combinations thereof, including, but not limited to, object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0170] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0171] The modules or units involved in the embodiments described in the present disclosure may be implemented by software or hardware. The name of a module or unit does not limit the unit itself in some cases. For example, the first determination module may also be described as an "ordered data chain determination module."

[0172] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chip (SOCs), complex programmable logic devices (CPLDs), and the like.

[0173] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0174] According to one or more embodiments of the present disclosure, [Example 1] provides a data processing method, including:

[0175] Determining an ordered data chain corresponding to the data to be processed, wherein the data to be processed is data associated with the media content, and the ordered data chain is used to indicate the media content arranged in an ordered manner;

[0176] Determining the existence of the ordered data chain through the bitmap corresponding to the data to be processed;

[0177] The data to be processed is processed based on the existence of the ordered data chain.

[0178] According to one or more embodiments of the present disclosure, [Example 2] provides the method described in Example 1, wherein determining the ordered data chain corresponding to the data to be processed includes:

[0179] In the case where the data to be processed is media content with a status update, determining an ordered data chain matching the data category of the processed data;

[0180] In the case where the data to be processed is a query request for querying media content, the existence of a bitmap corresponding to the data to be processed is determined, and when the existence of the corresponding bitmap indicates that there is a bitmap corresponding to the data to be processed, an ordered data chain matching the data category queried by the data to be processed is determined.

[0181] According to one or more embodiments of the present disclosure, [Example 3] provides the method described in Example 1, wherein determining the existence of the ordered data chain through the bitmap corresponding to the data to be processed includes:

[0182] The existence of the ordered data chain is determined by taking the value of the bit corresponding to the ordered data chain in the bitmap corresponding to the data to be processed.

[0183] According to one or more embodiments of the present disclosure, [Example 4] provides the method described in Example 1, wherein processing the data to be processed based on the existence of the ordered data chain includes:

[0184] In a case where the existence of the ordered data chain indicates that the ordered data chain exists, determining the existence of the ordered data chain in the cache;

[0185] The to-be-processed data is processed based on the existence of the ordered data chain in the cache.

[0186] According to one or more embodiments of the present disclosure, [Example 5] provides the method described in Example 4, wherein processing the data to be processed based on the existence of the ordered data chain in the cache includes:

[0187] In a case where the existence of the ordered data chain in the cache indicates that the ordered data chain exists in the cache, the ordered data chain is updated by a script with atomic update capability.

[0188] According to one or more embodiments of the present disclosure, [Example 6] provides the method described in Example 5, wherein updating the ordered data chain by using a script with atomic update capability includes:

[0189] When the state of the data to be processed indicates that the data to be processed is added or changed data, adding the data to be processed to the ordered data chain by a script with atomic update capability;

[0190] When the state of the data to be processed indicates that the data to be processed is deleted data, the data to be processed is deleted from the ordered data chain by a script with atomic update capability.

[0191] According to one or more embodiments of the present disclosure, [Example 7] provides the method described in Example 5, further comprising:

[0192] Updating the remaining ordered data chains, wherein the remaining ordered data chains are ordered data chains associated with the bitmap corresponding to the data to be processed, except for the ordered data chain corresponding to the data to be processed;

[0193] Updating the bitmap corresponding to the data to be processed;

[0194] Update the data in the source layer corresponding to the data to be processed.

[0195] According to one or more embodiments of the present disclosure, [Example 8] provides the method described in Example 4, wherein the number of ordered data chains corresponding to the data to be processed is at least one, and each ordered data chain corresponds to the existence of the ordered data chain in the cache;

[0196] The processing of the to-be-processed data based on the existence of the ordered data chain in the cache includes:

[0197] If the existence status of all ordered data chains corresponding to the data to be processed indicates that the corresponding ordered data chains are in the cache, then all the ordered data chains are read from the cache and returned; otherwise, all the ordered data chains are read from the back-source layer, loaded into the cache and returned.

[0198] According to one or more embodiments of the present disclosure, [Example 9] provides the method described in Example 1, wherein the access volume of the media content indicated by the ordered data chain is greater than a set threshold.

[0199] According to one or more embodiments of the present disclosure, [Example 10] provides a data processing device, including:

[0200] A first determination module, configured to determine an ordered data chain corresponding to the data to be processed, wherein the data to be processed is data associated with the media content, and the ordered data chain is used to indicate the media content arranged in an ordered manner;

[0201] A second determination module, used to determine the existence of the ordered data chain through the bitmap corresponding to the data to be processed;

[0202] A processing module is used to process the data to be processed based on the existence of the ordered data chain.

[0203] According to one or more embodiments of the present disclosure, [Example 11] provides an electronic device, the electronic device comprising:

[0204] one or more processing devices;

[0205] a storage device for storing one or more programs,

[0206] When the one or more programs are executed by the one or more processing devices, the one or more processing devices implement the data processing method as described in any one of Examples 1-9.

[0207] According to one or more embodiments of the present disclosure, [Example 12] provides a storage medium containing computer executable instructions, which are used to execute the data processing method described in any one of Examples 1-9 when executed by a computer processor.

[0208] The above description is only a preferred embodiment of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of disclosure involved in the present disclosure is not limited to the technical solutions formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosed concept. For example, the above features are replaced with the technical features with similar functions disclosed in the present disclosure (but not limited to) by each other to form a technical solution.

[0209] In addition, although each operation is described in a specific order, this should not be understood as requiring these operations to be performed in the specific order shown or in a sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details are included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single embodiment in combination. On the contrary, the various features described in the context of a single embodiment can also be implemented in multiple embodiments individually or in any suitable sub-combination mode.

[0210] Although the subject matter has been described in language specific to structural features and / or methodological logical actions, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. On the contrary, the specific features and actions described above are merely example forms of implementing the claims.

Claims

1. A data processing method, characterized in that: include: Determining an ordered data chain corresponding to the data to be processed, wherein the data to be processed is data associated with the media content, and the ordered data chain is used to indicate the media content arranged in an ordered manner; Determining the existence of the ordered data chain through the bitmap corresponding to the data to be processed; The data to be processed is processed based on the existence of the ordered data chain.

2. The method according to claim 1, characterized in that The step of determining the ordered data chain corresponding to the data to be processed includes: In the case where the data to be processed is media content with a status update, determining an ordered data chain matching the data category of the processed data; In the case where the data to be processed is a query request for querying media content, the existence of a bitmap corresponding to the data to be processed is determined, and when the existence of the corresponding bitmap indicates that there is a bitmap corresponding to the data to be processed, an ordered data chain matching the data category queried by the data to be processed is determined.

3. The method according to claim 1, characterized in that Determining the existence of the ordered data chain through the bitmap corresponding to the data to be processed includes: The existence of the ordered data chain is determined by taking the value of the bit corresponding to the ordered data chain in the bitmap corresponding to the data to be processed.

4. The method according to claim 1, characterized in that: The processing of the data to be processed based on the existence of the ordered data chain includes: In a case where the existence of the ordered data chain indicates that the ordered data chain exists, determining the existence of the ordered data chain in the cache; The to-be-processed data is processed based on the existence of the ordered data chain in the cache.

5. The method according to claim 4, characterized in that The processing of the to-be-processed data based on the existence of the ordered data chain in the cache includes: In a case where the existence of the ordered data chain in the cache indicates that the ordered data chain exists in the cache, the ordered data chain is updated by a script with atomic update capability.

6. The method according to claim 5, characterized in that The updating of the ordered data chain by a script having atomic update capability comprises: When the state of the data to be processed indicates that the data to be processed is added or changed data, adding the data to be processed to the ordered data chain by a script with atomic update capability; When the state of the data to be processed indicates that the data to be processed is deleted data, the data to be processed is deleted from the ordered data chain by a script with atomic update capability.

7. The method according to claim 5, characterized in that Also includes: Updating the remaining ordered data chains, wherein the remaining ordered data chains are the ordered data chains associated with the bitmap corresponding to the data to be processed, except the ordered data chain corresponding to the data to be processed; Updating the bitmap corresponding to the data to be processed; Update the data in the source layer corresponding to the data to be processed.

8. The method according to claim 4, characterized in that The number of ordered data chains corresponding to the data to be processed is at least one, and each ordered data chain corresponds to the existence of the ordered data chain in the cache; The processing of the to-be-processed data based on the existence of the ordered data chain in the cache includes: If the existence status of all ordered data chains corresponding to the data to be processed indicates that the corresponding ordered data chains are in the cache, then all the ordered data chains are read from the cache and returned; otherwise, all the ordered data chains are read from the back-source layer, loaded into the cache and returned.

9. The method according to claim 1, characterized in that: The access volume of the media content indicated by the ordered data chain is greater than a set threshold.

10. A data processing device, characterized in that: include: A first determination module, configured to determine an ordered data chain corresponding to the data to be processed, wherein the data to be processed is data associated with the media content, and the ordered data chain is used to indicate the media content arranged in an ordered manner; A second determination module, used to determine the existence of the ordered data chain through the bitmap corresponding to the data to be processed; A processing module is used to process the data to be processed based on the existence of the ordered data chain.

11. An electronic device, characterized in that: The electronic device comprises: one or more processing devices; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processing devices, the one or more processing devices implement the data processing method according to any one of claims 1 to 9.

12. A storage medium comprising computer executable instructions, wherein the computer executable instructions are used to perform the data processing method according to any one of claims 1 to 9 when executed by a computer processor.

Images