User information storage method and device, storage medium and computer program product
By generating and compressing bitmaps to record the user's APP usage, the problem of large storage space overhead when storing massive data is solved, and more efficient data processing and system performance improvement is achieved.
Patent Information
- Application Number
- CN202411874316.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-17
- Publication Date
- 2025-05-06
AI Technical Summary
The prior art cannot effectively reduce the overhead of storage space when storing massive data, resulting in a decrease in computing efficiency and system performance.
By obtaining the user's APP information, it is determined whether the corresponding bitmap exists. If it does not exist, a bitmap is generated based on the mapping relationship, and the bitmap is compressed to store the mapping relationship between the compressed bitmap and the user identification information.
Record the user's APP usage through a bitmap, reduce the overhead of storage space, and further reduce the overhead of storage space by compressing the bitmap, so that a larger amount of data can be processed under the same resource conditions, thereby improving system performance.
Smart Images
Figure CN119938989A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of big data edge computing technology, and in particular to a user information storage method, device, storage medium and computer program product. Background Art
[0002] In recent years, with the rapid development of Internet technology, the amount of data generated by various industries has shown an explosive growth trend. Reasonable use of this data can help various industries make analytical decisions and improve production efficiency; for example, by analyzing the portraits of users' frequently used apps, product push and travel method recommendations can be made. What follows is the problem of storage resource consumption and statistical analysis efficiency of massive data. How to analyze as much data as possible with as little storage and computing resources as possible has been studied by many industry personnel.
[0003] However, the current method of storing massive data does not reduce the storage space overhead, resulting in a significant decrease in computing efficiency and thus reducing system performance. Summary of the invention
[0004] The embodiments of the present application provide a user information storage method, device, storage medium and computer program product, which can reduce storage space overhead and improve system performance.
[0005] The technical solution of the embodiment of the present application is implemented as follows:
[0006] In a first aspect, an embodiment of the present application provides a method for storing user information, the method comprising:
[0007] Obtaining a first APP corresponding to one or more first users, and determining whether a first bitmap corresponding to the first APP currently exists; wherein the first APP includes one or more APPs;
[0008] In the case where it is determined that the first bitmap does not exist, generating the first bitmap based on a first mapping relationship and the first APP; wherein the first mapping relationship is used to characterize a mapping relationship between a second APP and a first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP;
[0009] The first bitmap is compressed, and a second mapping relationship between the compressed first bitmap and the identification information of the first user is stored.
[0010] In a second aspect, an embodiment of the present application provides a user information storage device, the user information storage device comprising: an acquisition unit, a judgment unit, a generation unit, a compression unit and a storage unit; wherein,
[0011] The acquisition unit is configured to acquire a first APP corresponding to one or more first users; wherein the first APP includes one or more APPs;
[0012] The determining unit is used to determine whether there is a first bitmap corresponding to the first APP currently;
[0013] The generating unit is configured to generate the first bitmap based on a first mapping relationship and the first APP when it is determined that the first bitmap does not exist; wherein the first mapping relationship is used to characterize a mapping relationship between a second APP and a first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP;
[0014] The compression unit is used to compress the first bitmap;
[0015] The storage unit is used to store the second mapping relationship between the compressed first bitmap and the identification information of the first user.
[0016] In a third aspect, an embodiment of the present application provides a user information storage device, the user information storage device comprising: a processor and a memory; wherein:
[0017] The memory is used to store a computer program that can be run on the processor;
[0018] The processor is used to execute the user information storage method as described above when running the computer program.
[0019] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program code is stored. When the computer program code is executed by a computer, the user information storage method as described above is implemented.
[0020] In a fifth aspect, an embodiment of the present application provides a computer program product, including a computer program, which, when executed by a processor, implements the user information storage method as described above.
[0021] The embodiments of the present application provide a user information storage method, device, storage medium and computer program product, the method comprising: obtaining a first APP corresponding to one or more first users, and determining whether there is a first bitmap corresponding to the first APP; wherein the first APP includes one or more APPs; if it is determined that there is no first bitmap, generating a first bitmap based on a first mapping relationship and the first APP; wherein the first mapping relationship is used to characterize a mapping relationship between a second APP and a first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP; compressing the first bitmap, and storing a second mapping relationship between the compressed first bitmap and the identification information of the first user. It can be seen that after obtaining the first APP corresponding to one or more first users, it can be determined whether there is a first bitmap corresponding to the first APP. If there is no first bitmap, the first bitmap can be generated based on the first mapping relationship and the first APP, that is, the embodiment of the present application can record the first APP used by the first user in the form of a first bitmap, thereby greatly reducing the storage space overhead; then the first bitmap can be compressed, and the second mapping relationship between the compressed first bitmap and the identification information of the first user can be stored, that is, the embodiment of the present application can compress the first bitmap, thereby further reducing the storage space overhead, so that a larger amount of data can be processed under the same resource conditions, thereby improving system performance. BRIEF DESCRIPTION OF THE DRAWINGS
[0022] Figure 1 Schematic diagram of the user information storage method proposed in the embodiment of the present application Figure 1 ;
[0023] Figure 2 Schematic diagram of the user information storage method proposed in the embodiment of the present application Figure 2 ;
[0024] Figure 3 This is a schematic diagram of the statistical analysis of the user APP portrait bitmap proposed in the embodiment of the present application;
[0025] Figure 4 A schematic diagram of the compressed APP data restoration and statistical analysis process proposed in the embodiment of the present application;
[0026] Figure 5 Schematic diagram of the user information storage method proposed in the embodiment of the present application Figure 3 ;
[0027] Figure 6 This is a schematic diagram of an example of an APP preference portrait proposed in an embodiment of the present application;
[0028] Figure 7This is a schematic diagram of the process of generating a user APP portrait bitmap for the first time proposed in an embodiment of the present application;
[0029] Figure 8 A schematic diagram of the incremental update process of the user APP portrait bitmap proposed in the embodiment of the present application;
[0030] Fig. 9 The structure diagram of the user information storage device proposed in the embodiment of the present application is as follows: Figure 1 ;
[0031] Fig.10 The structure diagram of the user information storage device proposed in the embodiment of the present application is as follows: Figure 2 . DETAILED DESCRIPTION
[0032] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. It is understood that the specific embodiments described herein are only used to explain the related applications, rather than to limit the applications. It should also be noted that, for ease of description, only the parts related to the related applications are shown in the drawings.
[0033] In recent years, with the rapid development of Internet technology, the amount of data generated by various industries has shown an explosive growth trend. Reasonable use of this data can help various industries make analytical decisions and improve production efficiency. For example, by analyzing the portraits of users' frequently used apps, product push and travel method recommendations can be made. What follows is the problem of storage resource consumption and statistical analysis efficiency of massive data. How to analyze as much data as possible with as little storage and computing resources as possible has been studied by many industry personnel.
[0034] However, the current method of storing massive data does not reduce the storage space overhead, resulting in a significant decrease in computing efficiency and thus reducing system performance.
[0035] In order to solve the problem that the current data storage method fails to reduce the storage space overhead and reduces the system performance, the embodiments of the present application provide a user information storage method, device, storage medium and computer program product, the method comprising: obtaining a first APP corresponding to one or more first users, and determining whether there is a first bitmap corresponding to the first APP; wherein the first APP includes one or more APPs; when it is determined that there is no first bitmap, generating a first bitmap based on the first mapping relationship and the first APP; wherein the first mapping relationship is used to characterize the mapping relationship between the second APP and the first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP; compressing the first bitmap, and storing the second mapping relationship between the compressed first bitmap and the identification information of the first user. It can be seen that after obtaining the first APP corresponding to one or more first users, it can be determined whether there is a first bitmap corresponding to the first APP. If there is no first bitmap, the first bitmap can be generated based on the first mapping relationship and the first APP, that is, the embodiment of the present application can record the first APP used by the first user in the form of a first bitmap, thereby greatly reducing the storage space overhead; then the first bitmap can be compressed, and the second mapping relationship between the compressed first bitmap and the identification information of the first user can be stored, that is, the embodiment of the present application can compress the first bitmap, thereby further reducing the storage space overhead, so that a larger amount of data can be processed under the same resource conditions, thereby improving system performance.
[0036] The technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application.
[0037] The present application embodiment provides a method for storing user information. Figure 1 Schematic diagram of the user information storage method proposed in the embodiment of the present application Figure 1 ,like Figure 1 As shown, the user information storage method may include the following steps:
[0038] Step 101: Obtain a first APP corresponding to one or more first users, and determine whether there is a first bitmap corresponding to the first APP; wherein the first APP includes one or more APPs.
[0039] In an embodiment of the present application, the user information storage device may obtain a first APP corresponding to one or more first users, and determine whether there is a first bitmap corresponding to the first APP.
[0040] It should be noted that, in the embodiments of the present application, the number of first users may be one or more, and the present application does not specifically limit the number of first users.
[0041] It should be noted that, in the embodiments of the present application, the first APP includes one or more APPs, and the present application does not specifically limit the number and types of APPs included in the first APP.
[0042] Exemplarily, in the embodiment of the present application, assuming that there are currently 500 first users, the number and type of APPs included in the first APP used by each first user may be different or the same.
[0043] It should be noted that, in the embodiments of the present application, a bitmap is a special data structure that can store values based on continuous binary bits, and the present application does not specifically limit the size of the bitmap.
[0044] Step 102: When it is determined that the first bitmap does not exist, generate the first bitmap based on the first mapping relationship and the first APP; wherein the first mapping relationship is used to characterize the mapping relationship between the second APP and the first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP.
[0045] In an embodiment of the present application, after obtaining the first APP corresponding to one or more first users and determining whether there is a first bitmap corresponding to the first APP, the user information storage device can generate a first bitmap based on the first mapping relationship and the first APP if it is determined that there is no first bitmap.
[0046] It should be noted that, in the embodiments of the present application, the first preset time period can be an arbitrarily set time period, for example, it can be from November 2020 to November 2024. The present application does not specifically limit the setting of the first preset time period.
[0047] It should be noted that, in the embodiments of the present application, the second APP may include all APPs within the first preset time period, and the present application does not specifically limit the number and type of APPs included in the second APP.
[0048] It should be noted that, in the embodiments of the present application, Figure 2 Schematic diagram of the user information storage method proposed in the embodiment of the present application Figure 2 ,like Figure 2 As shown, before the user information storage device generates the first bitmap based on the first mapping relationship and the first APP, that is, before step 102, it can also include the following steps:
[0049] Step 104: Obtain the second APP and determine the first information corresponding to each APP in the second APP; wherein the first information includes flow information and / or usage count information.
[0050] It should be noted that, in an embodiment of the present application, when acquiring the second APP, the user information storage device can first acquire the first initial APP data based on a first preset time period; then the first initial APP data can be subjected to a first preset processing to obtain the processed APP data; wherein the processed APP data includes at least the second APP.
[0051] Exemplarily, in an embodiment of the present application, the first initial APP data may be original APP portrait data, as shown in Table 1 below.
[0052] Table 1
[0053]
[0054]
[0055] It should be noted that, in the embodiments of the present application, the first preset processing may include extraction, transformation and loading (Extract-Transform-Load, ETL), and the present application does not specifically limit the processing method included in the first preset processing.
[0056] Step 105: Generate a first mapping relationship based on the flow information and / or the usage count information.
[0057] It should be noted that in an embodiment of the present application, when the user information storage device generates a first mapping relationship based on traffic information and / or usage count information, it can first determine the traffic information and usage count information corresponding to each APP in the second APP, and then generate the first mapping relationship based on the traffic information and / or usage count information.
[0058] Illustratively, in an embodiment of the present application, the user information storage device can calculate the comprehensive ranking of the traffic sum and the number of uses of each APP in the second APP by the following formula (1), and then generate a corresponding bitmap index for each APP in the second APP based on the comprehensive ranking. For example, the bitmap index corresponding to the APP with the first comprehensive ranking can be 1, and the bitmap index corresponding to the APP with the second comprehensive ranking can be 2, and so on. The bitmap index corresponding to each APP is determined in turn, so that a mapping relationship between the second APP and the first bitmap index can be generated.
[0059]
[0060] Among them, rank flowsum ≥1, rank usecoumt≥1, rank flowsum Indicates the traffic and rank of the APP usecoumt Indicates the number of times the APP is used and the greater the traffic and the number of times, the higher the ranking. flowsum ≤1, rank usecoumt If ≤1, the data is considered abnormal.
[0061] It should be noted that, in an embodiment of the present application, after the user information storage device generates the first mapping relationship based on the traffic information and / or the usage count information, it can generate a first bitmap based on the first mapping relationship and the first APP.
[0062] It should be noted that, in the embodiment of the present application, when the user information storage device generates the first bitmap for the first APP based on the first mapping, the user information storage device may query the second APP for the first target APP that is the same as the first APP, and determine the target bitmap index corresponding to the first target APP based on the first mapping relationship;
[0063] The first bitmap may then be generated based on the target bitmap index.
[0064] Exemplarily, in an embodiment of the present application, assuming that the APPs used by the first APP corresponding to the first user include 3 APPs, the first target APP that is the same as the 3 APPs can be queried in the second APP, and then the target bitmap indexes corresponding to the first target APP can be determined based on the first mapping relationship to be index 2, index 8, and index 9, respectively. Then, the positions corresponding to index 2, index 8, and index 9 can be set to 1, and the other index positions can be set to 0, then the first bitmap corresponding to the first user can be obtained. If there are multiple first users, the same method can be used to obtain the first bitmaps corresponding to multiple first users.
[0065] That is to say, in the embodiment of the present application, by performing bitmap processing on the APP data of one or more users, the APPs used by the first user can be stored in the first bitmap, thereby greatly reducing the storage space overhead.
[0066] Step 103: compress the first bitmap, and store the second mapping relationship between the compressed first bitmap and the identification information of the first user.
[0067] In an embodiment of the present application, when the user information storage device determines that the first bitmap does not exist, it generates a first bitmap based on the first mapping relationship and the first APP, and then compresses the first bitmap and stores the second mapping relationship between the compressed first bitmap and the identification information of the first user.
[0068] It should be noted that, in an embodiment of the present application, the user information storage device can store the second information corresponding to the first bitmap into a preset database; wherein the second information at least includes leading zero information; and the leading zero information corresponding to the first bitmap can also be removed to obtain a compressed first bitmap.
[0069] It should be noted that, in the embodiments of the present application, the preset database may include a MySQL database, and the present application does not specifically limit the type of the preset database.
[0070] That is to say, in an embodiment of the present application, the user information storage device can remove all leading zeros of the obtained user bit map, make the highest bit start from 1, and record the number of leading zeros and store it in a preset database to achieve a data compression effect, that is, the embodiment of the present application can perform compression based on the first bit map, which can further greatly reduce the storage space overhead.
[0071] It should be noted that, in an embodiment of the present application, the user information storage device can store and process the second mapping relationship between the compressed first bitmap and the identification information of the first user. Assuming that there are 1,000 first users and each first user has a corresponding first bitmap, the compressed first bitmap can be associated with the corresponding first user's identification information, thereby obtaining the second mapping relationship, which is convenient for subsequent querying the corresponding compressed bitmap based on the user identification.
[0072] It should be noted that, in an embodiment of the present application, when it is determined that the first bitmap exists, the user information storage device can obtain a third APP based on a second preset time period; wherein the third APP includes all APPs within the second preset time period; a third mapping relationship is generated based on the third information corresponding to the third APP; and the first bitmap is updated based on the third mapping relationship; wherein the third mapping relationship represents the mapping relationship between each APP in the third APP and the second bitmap index, and the third information includes traffic information and / or usage count information.
[0073] It should be noted that, in the embodiments of the present application, the second preset time period may be any time period, which is different from the first preset time period, and the present application does not specifically limit the setting of the second preset time period.
[0074] It should be noted that, in the embodiment of the present application, the third APP includes all APPs within the second preset time period, and the present application does not specifically limit the number of APPs and APP types included in the third APP.
[0075] It should be noted that, in the embodiment of the present application, the specific process of the user information storage device generating the third mapping relationship based on the traffic information and / or usage count information corresponding to the third APP is the same as the process of generating the first mapping relationship based on the above formula (1).
[0076] Further, in an embodiment of the present application, when the user information storage device updates the first map based on the third mapping relationship, the third APP can be matched with the second APP to obtain a first matching result; wherein the first matching result includes a fourth APP and a fifth APP, the fourth APP contains only APPs in the second APP, and the fifth APP contains only APPs in the third APP; and then the first map can be updated based on the fourth APP, the fifth APP and the third mapping relationship.
[0077] Exemplarily, in an embodiment of the present application, the fourth APP includes only APPs belonging to the second APP, and the fifth APP includes only APPs belonging to the third APP; that is, the fourth APP includes an APP set for deletion, and the fifth APP includes an APP set for new additions. Before updating the first bitmap based on the fourth APP, the fifth APP and the third mapping relationship, it can be determined whether the update cost is greater than a preset threshold. If it is less than the preset threshold, the first bitmap can be updated. If it is greater than or equal to the preset threshold, the bitmap can be reconstructed. For example, if the sum of the numbers of the fourth APP and the fifth APP is less than the preset threshold, it is determined that the first bitmap can be updated. If the sum of the numbers of the fourth APP and the fifth APP is greater than or equal to the preset threshold, the bitmap can be reconstructed.
[0078] It should be noted that, in an embodiment of the present application, when the user information storage device updates the first bitmap based on the fourth APP, the fifth APP and the third mapping relationship, it can transform the first bitmap to obtain a first data structure; wherein the first data structure at least includes a bitmap index corresponding to the first APP; when the first data structure includes a bitmap index corresponding to the fourth APP, the bitmap index corresponding to the fourth APP can then be deleted, and the bitmap index corresponding to the APP retained in the first data structure can be updated based on the third mapping relationship to obtain an updated first data structure; and then the bitmap index corresponding to the fifth APP can be added to the updated first data structure to obtain a second data structure.
[0079] It should be noted that, in the embodiments of the present application, the first data structure may include a mini-heap, and the present application does not specifically limit the structure type included in the first data structure.
[0080] It should be noted that in an embodiment of the present application, after the user information storage device adds the bitmap index corresponding to the fifth APP to the updated first data structure to obtain the second data structure, the second data structure can be converted into a second bitmap, and the leading zero information corresponding to the second bitmap can be stored in a preset database; then the second bitmap can be compressed, and the fourth mapping relationship between the compressed second bitmap and the identification information of the first user can be stored.
[0081] That is to say, in an embodiment of the present application, the user information storage device can determine whether the update cost of the bitmap is greater than a preset threshold. If it is less than the preset threshold, the first bitmap can be updated. If it is greater than or equal to the preset threshold, the bitmap can be reconstructed. That is, an embodiment of the present application proposes a bitmap update strategy. When the user's APP usage habits do not change much, incremental updates are more efficient than regenerating the user's APP bitmap.
[0082] Furthermore, in an embodiment of the present application, after obtaining the compressed bitmap, the user information storage device can perform statistical analysis of APP portraits of people in each region on this new data structure.
[0083] It should be noted that, in the embodiments of the present application, Figure 3 This is a schematic diagram of reading the user APP portrait bitmap statistical analysis proposed in the embodiment of the present application, such as Figure 3 As shown, the user information storage device can obtain the identification information of the second user in the preset area; wherein the second user includes one or more users; then the second mapping relationship can be associated with the identification information of the second user to obtain a compressed first bitmap corresponding to the identification information of the second user; or, the fourth mapping relationship can be associated with the identification information of the second user to obtain a compressed second bitmap corresponding to the identification information of the second user; and then the first matrix can be generated based on the identification information of the second user and the decompressed first bitmap; or, the first matrix can be generated based on the identification information of the second user and the decompressed second bitmap; thereby, the second target APP can be determined based on the first matrix, and the number of users corresponding to the second target APP can be determined, and finally the APP statistical results of each area can be stored in the final result table; wherein the second target APP includes the top K APPs ranked by activity, and K is a positive integer.
[0084] It should be noted that, in the embodiments of the present application, the first matrix may be a 0-1 matrix, and the present application does not specifically limit the type of the first matrix.
[0085] It should be noted that in an embodiment of the present application, when the user information storage device generates the first matrix based on the identification information of the second user and the decompressed first bitmap, it can generate a 0-1 matrix with the second user identification as rows and the decompressed first bitmap as columns.
[0086] For example, in the embodiments of the present application, Figure 4 This is a schematic diagram of the compressed APP data restoration and statistical analysis process proposed in the embodiment of the present application, such as Figure 4 As shown, the user information storage device can read from the MySQL database to obtain the leading zero information corresponding to the first bitmap; or, read the leading zero information corresponding to the second bitmap from the MySQL database; then the compressed first bitmap can be decompressed by the leading zero information corresponding to the first bitmap to obtain the decompressed first bitmap; or, the compressed second bitmap can be decompressed to the decompressed second bitmap by the leading zero information corresponding to the second bitmap, and then the second mapping relationship can be associated with the identification information of the second user to obtain the compressed first bitmap corresponding to the identification information of the second user; or, the fourth mapping relationship can be associated with the identification information of the second user to obtain the compressed second bitmap corresponding to the identification information of the second user; and then a 0-1 matrix can be generated with the identification of the second user as the row and the decompressed first bitmap as the column; or, a 0-1 matrix can be generated based on the identification of the second user as the row and the decompressed second bitmap as the column; thereby, K popular APPs can be intercepted according to demand based on the 0-1 matrix, and the number of users corresponding to the K popular APPs can be determined.
[0087] That is to say, in an embodiment of the present application, the user information storage device can determine the top K APPs in terms of activity based on the first matrix, and determine the number of users corresponding to the top K APPs in terms of activity. That is, the embodiment of the present application can flexibly select popular APPs for truncated statistics when counting APP information, and there is no need to output the statistical results of the number of people of all APPs, thereby reducing the amount of data in the final result.
[0088] To summarize, the user information storage device can first obtain the first initial APP data based on the first preset time period; the first initial APP data can be subjected to the first preset processing to obtain the processed APP data; wherein the processed APP data includes at least the second APP, and then the flow information and usage frequency information corresponding to each APP in the second APP can be determined, and then the first mapping relationship can be generated based on the flow information and / or usage frequency information. After obtaining the first APP corresponding to one or more first users, it can be determined whether there is a first bitmap corresponding to the first APP. When it is determined that there is no first bitmap, a first bitmap is generated based on the first mapping relationship and the first APP. That is, the embodiment of the present application can perform bitmap processing on the APP data of one or more users, so as to store the APPs used by the first user through the first bitmap, thereby greatly reducing the storage space opening. Pin, and the user information storage device can remove all leading zeros of the obtained user bitmap, so that the highest bit starts from 1, to achieve a data compression effect, that is, the embodiment of the present application can perform compression on the basis of the first bitmap, which can further greatly reduce the storage space overhead; when it is determined that the first bitmap exists, the user information storage device can obtain the third APP based on the second preset time period, and then generate a third mapping relationship based on the third information corresponding to the third APP; and update the first bitmap based on the third mapping relationship, that is, the embodiment of the present application proposes a bitmap update strategy, and when the user APP usage habits do not change much, incremental update is more efficient than regenerating the user APP bitmap; the user information storage device can also flexibly select popular APPs for truncation statistics when counting APP information, and there is no need to output the population statistics results of the full amount of APPs, thereby reducing the data volume of the final result.
[0089] An embodiment of the present application provides a user information storage method, the method comprising: obtaining a first APP corresponding to one or more first users, and determining whether there is a first bitmap corresponding to the first APP; wherein the first APP includes one or more APPs; if it is determined that there is no first bitmap, generating a first bitmap based on a first mapping relationship and the first APP; wherein the first mapping relationship is used to characterize a mapping relationship between a second APP and a first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP; compressing the first bitmap, and storing a second mapping relationship between the compressed first bitmap and the identification information of the first user. It can be seen that after obtaining the first APP corresponding to one or more first users, it can be determined whether there is a first bitmap corresponding to the first APP. If there is no first bitmap, the first bitmap can be generated based on the first mapping relationship and the first APP, that is, the embodiment of the present application can record the first APP used by the first user in the form of a first bitmap, thereby greatly reducing the storage space overhead; then the first bitmap can be compressed, and the second mapping relationship between the compressed first bitmap and the identification information of the first user can be stored, that is, the embodiment of the present application can compress the first bitmap, thereby further reducing the storage space overhead, so that a larger amount of data can be processed under the same resource conditions, thereby improving system performance.
[0090] Based on the above embodiment, another embodiment of the present application provides a user information storage method. Figure 5 Schematic diagram of the user information storage method proposed in the embodiment of the present application Figure 3 ,like Figure 5As shown, the user information storage method may include the following steps: 1. Obtaining the original APP data set (i.e., the first initial APP data); 2. Generating a mapping relationship (i.e., a first mapping relationship) between a bitmap index and a full APP name according to the APP (i.e., the second APP) traffic and the number of times used and storing it in a database; 3. After obtaining the first APP corresponding to one or more first users, it may be determined whether it is the first time to generate the first bitmap corresponding to the first user; 4. If it is the first time to construct a user bitmap, a user bitmap (i.e., a first bitmap) is generated according to the mapping relationship (i.e., the first mapping relationship) generated in step 2 and the APP (i.e., the first APP) used by each user; 5. If it is not the first time to construct a user bitmap, the APP bitmap (i.e., the first bitmap) is updated; 6. The leading 0 information of the user APP bitmap is stored in the database, the APP bitmap of each user is compressed, and the mapping relationship (i.e., the second mapping relationship) between the compressed APP bitmap of each user (i.e., the compressed first bitmap) and the user identification (identification information of the first user) of each user is stored in a distributed file system (Hadoop Distributed File System, HDFS).
[0091] It should be noted that, in an embodiment of the present application, if it is not the first time to construct a user bitmap, the user information storage device may include the following steps when updating the APP bitmap (i.e., the first bitmap): 1. Obtain the original APP data set (i.e., the third APP) of the new account period, and generate a mapping relationship (i.e., the third mapping relationship) between the new bitmap index and the full APP name according to the APP (i.e., the third APP) traffic and the number of times it is used, and store it in the database; 2. Set an experience cost threshold (i.e., the preset threshold), and if the update cost is greater than the threshold, choose to rebuild, otherwise go to step 3; 3. Respectively find the APP (i.e., the fifth APP) for which the new mapping relationship exists but the old mapping relationship does not exist, and the APP set (i.e., the fourth APP) for which the new mapping relationship does not exist but the old mapping relationship exists (for deletion); 4. For each user's existing bitmap, construct a small top heap (first data structure), remove the deleted APP set (i.e., the fourth APP) from the top heap, and the remaining node index numbers remain unchanged. Then, according to the old mapping relationship (i.e., the first mapping relationship), find the APP retained in the bitmap, and update it with the index in the new mapping relationship (i.e., the third mapping relationship). Finally, add the newly added APP set (i.e., the fifth APP) to the end of the heap; 5. Update the small top heap obtained in step 4 according to the heap sorting algorithm to obtain a new small top heap (i.e., the second data structure); 6. Convert the small top heap (i.e., the second data structure) into a user bitmap (i.e., the second bitmap); 7. The leading 0 information of the user APP bitmap is stored in the database; 8. The mapping relationship (fourth mapping relationship) between each user's compressed APP bitmap (i.e., the compressed second bitmap) and the user identification (i.e., the identification information of the first user) is stored in the distributed file system.
[0092] It should be noted that, in the embodiment of the present application, the third APP includes all APPs within the second preset time period, and the present application does not specifically limit the number of APPs and APP types included in the third APP.
[0093] It should be noted that, in an embodiment of the present application, when the user information storage device updates the first map based on the third mapping relationship, the third APP can be matched with the second APP to obtain a first matching result; wherein the first matching result includes the fourth APP and the fifth APP, the fourth APP contains only APPs in the second APP, and the fifth APP contains only APPs in the third APP; and then the first map can be updated based on the fourth APP, the fifth APP and the third mapping relationship.
[0094] Exemplarily, in an embodiment of the present application, the fourth APP includes only APPs belonging to the second APP, and the fifth APP includes only APPs belonging to the third APP; that is, the fourth APP includes an APP set for deletion, and the fifth APP includes an APP set for new additions. Before updating the first bitmap based on the fourth APP, the fifth APP and the third mapping relationship, it can be determined whether the update cost is greater than a preset threshold. If it is less than the preset threshold, the first bitmap can be updated. If it is greater than or equal to the preset threshold, the bitmap can be reconstructed. For example, if the sum of the numbers of the fourth APP and the fifth APP is less than the preset threshold, it is determined that the first bitmap can be updated. If the sum of the numbers of the fourth APP and the fifth APP is greater than or equal to the preset threshold, the bitmap can be reconstructed.
[0095] That is to say, in an embodiment of the present application, the user information storage device can determine whether the update cost of the bitmap is greater than a preset threshold. If it is less than the preset threshold, the first bitmap can be updated. If it is greater than or equal to the preset threshold, the bitmap can be reconstructed. That is, an embodiment of the present application proposes a bitmap update strategy. When the user's APP usage habits do not change much, incremental updates are more efficient than regenerating the user's APP bitmap.
[0096] It should be noted that, in an embodiment of the present application, the restoration and analysis process of compressed APP information may include the following steps: 1. The user information storage device obtains user information in each area that needs to be statistically analyzed, and associates the user information with the mapping relationship (the second mapping relationship or the fourth mapping relationship) in the distributed file system to obtain the APP preferences of users in each area; 2. The user information storage device decompresses the user APP bitmap according to the leading zero information of the database, generates a 0-1 matrix with users as rows and APPs as columns, performs bit operations to count the number of users of each APP, and intercepts it according to the top number of users; 3. Restore the specific APP represented by the 01 bitmap of the APP from the index information maintained by mysql.
[0097] For example, in the embodiment of the present application, the following takes the compression storage and statistical analysis scenario of the national user APP portrait data (ie, the first initial APP data) as an example. The first initial APP data is shown in Table 1 above. Figure 6 This is a schematic diagram of an example of an APP preference portrait proposed in an embodiment of the present application, such as Figure 6 As shown, multiple APP preference data are included.
[0098] It should be noted that in the embodiment of the present application, the original APP portrait data (i.e., the first initial APP data) is semi-structured and inevitably contains dirty data, which needs to be processed into business-usable data through ETL. The specific steps are as follows: 1. Read each user and their APP data by partition, and filter out dirty data such as user ID, APP null or traffic, and usage count NaN (not a number); 2. Aggregate the processed data by APP name, count the traffic and usage count of each APP, and perform comprehensive sorting according to the above formula (1); 3. Figure 7 This is a schematic diagram of the process of generating a user APP portrait bitmap for the first time proposed in the embodiment of the present application, such as Figure 7 As shown, it is determined whether it is the first time to generate a user bitmap. If so, a user bitmap is constructed according to the APP used by the current user and the full APP, and a mapping relationship between the bitmap index and the full APP (i.e., the first mapping relationship) is generated and stored in the database; if it is not the first time to generate a user bitmap, Figure 8 This is a schematic diagram of the incremental update process of the user APP portrait bitmap proposed in the embodiment of the present application, such as Figure 8 As shown, incremental updates are performed according to the APP bitmap update algorithm. When the overall number of APPs does not change much and the user's app usage habits do not change much, the cost of incremental updates will be significantly less than rebuilding the bitmap; 4. All leading 0s of the obtained user bitmap are removed, so that the highest bit starts from 1, and the number of leading 0s is recorded and stored in the database to achieve data compression effect; 5. The mapping relationship between the user ID and the compressed bitmap (i.e., the second mapping relationship) is stored in HDFS to replace the original user ID-APP data mapping.
[0099] Furthermore, in an embodiment of the present application, after obtaining the compressed bitmap, the user information storage device can perform statistical analysis on the APP portraits of the population in each area on this new data structure. The specific steps may include: 1. Obtaining detailed information of the population in each area, and extracting the user identifier (i.e., the identification information of the second user); 2. Reading all user identifiers and APP compressed bitmap mapping information (i.e., the second mapping relationship or the fourth mapping relationship) from HDFS, and associating them with the user identifier (i.e., the identification information of the second user) in each area; 3. Reading the leading zero information corresponding to each user identifier from the database, and decompressing the user APP bitmap; 4. Generate a 0-1 matrix (i.e., the first matrix) with the user identifier as the row and the APP as the column (i.e., the first bitmap after decompression or the second bitmap after decompression), and intercepting the top popular APPs (i.e., the second target APPs) as needed for bit operations, and counting the number of users of each APP; 5. Store the APP statistical results of each area in the final result table, as shown in the specific schematic diagram. Figure 3 shown.
[0100] For example, in the embodiments of the present application, Figure 4 As shown, the user information storage device can read from the MySQL database to obtain the leading zero information corresponding to the first bitmap; or, read the leading zero information corresponding to the second bitmap from the MySQL database; then the compressed first bitmap can be decompressed by the leading zero information corresponding to the first bitmap to obtain the decompressed first bitmap; or, the compressed second bitmap can be decompressed to the decompressed second bitmap by the leading zero information corresponding to the second bitmap, and then the second mapping relationship can be associated with the identification information of the second user to obtain the compressed first bitmap corresponding to the identification information of the second user; or, the fourth mapping relationship can be associated with the identification information of the second user to obtain the compressed second bitmap corresponding to the identification information of the second user; and then a 0-1 matrix can be generated with the identification of the second user as the row and the decompressed first bitmap as the column; or, a 0-1 matrix can be generated based on the identification of the second user as the row and the decompressed second bitmap as the column; thereby, K popular APPs can be intercepted according to demand based on the 0-1 matrix, and the number of users corresponding to the K popular APPs can be determined.
[0101] That is to say, in an embodiment of the present application, the user information storage device can determine the top K APPs in terms of activity based on the first matrix, and determine the number of users corresponding to the top K APPs in terms of activity. That is, the embodiment of the present application can flexibly select popular APPs for truncated statistics when counting APP information, and there is no need to output the statistical results of the number of people of all APPs, thereby reducing the amount of data in the final result.
[0102] To summarize, the user information storage device can first obtain the first initial APP data based on the first preset time period; the first initial APP data can be subjected to the first preset processing to obtain the processed APP data; wherein the processed APP data includes at least the second APP, and then the flow information and usage frequency information corresponding to each APP in the second APP can be determined, and then the first mapping relationship can be generated based on the flow information and / or usage frequency information. After obtaining the first APP corresponding to one or more first users, it can be determined whether there is a first bitmap corresponding to the first APP. When it is determined that there is no first bitmap, a first bitmap is generated based on the first mapping relationship and the first APP. That is, the embodiment of the present application can perform bitmap processing on the APP data of one or more users, so as to store the APPs used by the first user through the first bitmap, thereby greatly reducing the storage space opening. Pin, and the user information storage device can remove all leading zeros of the obtained user bitmap, so that the highest bit starts from 1, to achieve a data compression effect, that is, the embodiment of the present application can perform compression on the basis of the first bitmap, which can further greatly reduce the storage space overhead; when it is determined that the first bitmap exists, the user information storage device can obtain the third APP based on the second preset time period, and then generate a third mapping relationship based on the third information corresponding to the third APP; and update the first bitmap based on the third mapping relationship, that is, the embodiment of the present application proposes a bitmap update strategy, and when the user APP usage habits do not change much, incremental update is more efficient than regenerating the user APP bitmap; the user information storage device can also flexibly select popular APPs for truncation statistics when counting APP information, and there is no need to output the population statistics results of the full amount of APPs, thereby reducing the data volume of the final result.
[0103] An embodiment of the present application provides a user information storage method, the method comprising: obtaining a first APP corresponding to one or more first users, and determining whether there is a first bitmap corresponding to the first APP; wherein the first APP includes one or more APPs; if it is determined that there is no first bitmap, generating a first bitmap based on a first mapping relationship and the first APP; wherein the first mapping relationship is used to characterize a mapping relationship between a second APP and a first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP; compressing the first bitmap, and storing a second mapping relationship between the compressed first bitmap and the identification information of the first user. It can be seen that after obtaining the first APP corresponding to one or more first users, it can be determined whether there is a first bitmap corresponding to the first APP. If there is no first bitmap, the first bitmap can be generated based on the first mapping relationship and the first APP, that is, the embodiment of the present application can record the first APP used by the first user in the form of a first bitmap, thereby greatly reducing the storage space overhead; then the first bitmap can be compressed, and the second mapping relationship between the compressed first bitmap and the identification information of the first user can be stored, that is, the embodiment of the present application can compress the first bitmap, thereby further reducing the storage space overhead, so that a larger amount of data can be processed under the same resource conditions, thereby improving system performance.
[0104] Based on the above embodiments, the present application provides a user information storage device. Fig. 9 Schematic diagram of the structure of the user information storage device Figure 1 ,like Fig. 9 As shown, the device 10 includes: an acquisition unit 11, a judgment unit 12, a generation unit 13, a compression unit 14 and a storage unit 15; wherein,
[0105] The acquisition unit 11 is configured to acquire a first APP corresponding to one or more first users; wherein the first APP includes one or more APPs;
[0106] The determining unit 12 is used to determine whether there is a first bitmap corresponding to the first APP currently;
[0107] The generating unit 13 is configured to generate the first bitmap based on the first mapping relationship and the first APP when it is determined that the first bitmap does not exist; wherein the first mapping relationship is used to characterize the mapping relationship between the second APP and the first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP;
[0108] The compression unit 14 is used to compress the first bitmap;
[0109] The storage unit 15 is used to store the second mapping relationship between the compressed first bitmap and the identification information of the first user.
[0110] In the embodiments of the present application, further, Fig.10 Schematic diagram of the structure of the user information storage device Figure 2 ,like Fig.10 As shown, the user information storage device 10 proposed in the embodiment of the present application may also include a processor 16 and a memory 17 storing executable instructions of the processor 16. Furthermore, the device 10 may also include a communication interface 18 and a bus 19 for connecting the processor 16, the memory 17 and the communication interface 18.
[0111] In the embodiment of the present application, the processor 16 can be at least one of an Application Specific Integrated Circuit (ASIC), a Digital Signal Processor (DSP), a Digital Signal Processing Device (DSPD), a Programmable Logic Device (PLD), a Field Programmable Gate Array (FPGA), a Central Processing Unit (CPU), a controller, a microcontroller, and a microprocessor. It can be understood that for different devices, the electronic device used to implement the above-mentioned processor function can also be other, and the embodiment of the present application is not specifically limited. The device 10 can also include a memory 17, which can be connected to the processor 16, wherein the memory 17 is used to store executable program code, the program code includes computer operation instructions, and the memory 17 may include a high-speed RAM memory, and may also include a non-volatile memory, for example, at least two disk memories.
[0112] In the embodiment of the present application, the bus 19 is used to connect the communication interface 18, the processor 16 and the memory 17, and the mutual communication between these devices.
[0113] In the embodiment of the present application, the memory 17 is used to store instructions and data.
[0114] Further, in an embodiment of the present application, the above-mentioned processor 16 is used to obtain a first APP corresponding to one or more first users, and determine whether there is a first bitmap corresponding to the first APP; wherein, the first APP includes one or more APPs; when it is determined that the first bitmap does not exist, the first bitmap is generated based on the first mapping relationship and the first APP; wherein, the first mapping relationship is used to characterize the mapping relationship between the second APP and the first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP; the first bitmap is compressed, and the second mapping relationship between the compressed first bitmap and the identification information of the first user is stored.
[0115] In practical applications, the memory 17 may be a volatile memory, such as a random access memory (RAM); or a non-volatile memory, such as a read-only memory (ROM), a flash memory, a hard disk drive (HDD) or a solid-state drive (SSD); or a combination of the above types of memory, and provide instructions and data to the processor 16.
[0116] An embodiment of the present application provides a user information storage device, which obtains a first APP corresponding to one or more first users, and determines whether there is a first bitmap corresponding to the first APP; wherein the first APP includes one or more APPs; when it is determined that there is no first bitmap, a first bitmap is generated based on a first mapping relationship and the first APP; wherein the first mapping relationship is used to characterize a mapping relationship between a second APP and a first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP; the first bitmap is compressed, and the second mapping relationship between the compressed first bitmap and the identification information of the first user is stored. It can be seen that after obtaining the first APP corresponding to one or more first users, it can be determined whether there is a first bitmap corresponding to the first APP. If there is no first bitmap, the first bitmap can be generated based on the first mapping relationship and the first APP, that is, the embodiment of the present application can record the first APP used by the first user in the form of a first bitmap, thereby greatly reducing the storage space overhead; then the first bitmap can be compressed, and the second mapping relationship between the compressed first bitmap and the identification information of the first user can be stored, that is, the embodiment of the present application can compress the first bitmap, thereby further reducing the storage space overhead, so that a larger amount of data can be processed under the same resource conditions, thereby improving system performance.
[0117] An embodiment of the present application provides a computer-readable storage medium having a program stored thereon, and when the program is executed by a processor, the user information storage method as described above is implemented.
[0118] Specifically, the program instructions corresponding to a user information storage method in this embodiment can be stored on a storage medium such as a CD, a hard disk, a USB flash drive, etc. When the program instructions corresponding to a user information storage method in the storage medium are read or executed by an electronic device, the following steps are included:
[0119] Obtaining a first APP corresponding to one or more first users, and determining whether a first bitmap corresponding to the first APP currently exists; wherein the first APP includes one or more APPs;
[0120] In the case where it is determined that the first bitmap does not exist, generating the first bitmap based on a first mapping relationship and the first APP; wherein the first mapping relationship is used to characterize a mapping relationship between a second APP and a first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP;
[0121] The first bitmap is compressed, and a second mapping relationship between the compressed first bitmap and the identification information of the first user is stored.
[0122] The embodiment of the present application further provides a computer program product, including a computer program, which can be executed by the processor 16 of the user information storage device 10 to complete the steps of any of the aforementioned methods.
[0123] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of hardware embodiments, software embodiments, or embodiments in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) that contain computer-usable program code.
[0124] The present application is described with reference to implementation flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the process in the flowchart. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0125] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device, which is implemented in the implementation flow diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0126] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operation steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for executing the steps in the flowchart. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0127] The above description is only a preferred embodiment of the present application and is not intended to limit the protection scope of the present application.
Claims
1. A user information storage method, characterized in that: The method comprises: Obtaining one or more first application programs APP corresponding to the first user, and determining whether there is a first bitmap corresponding to the first APP currently; wherein the first APP includes one or more APPs; In the case where it is determined that the first bitmap does not exist, generating the first bitmap based on a first mapping relationship and the first APP; wherein the first mapping relationship is used to characterize a mapping relationship between a second APP and a first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP; The first bitmap is compressed, and a second mapping relationship between the compressed first bitmap and the identification information of the first user is stored.
2. The method according to claim 1, characterized in that Before generating the first bitmap based on the first mapping relationship and the first APP, the method further includes: Obtain the second APP, and determine the first information corresponding to each APP in the second APP; wherein the first information includes flow information and / or usage count information; The first mapping relationship is generated based on the flow information and / or the usage count information.
3. The method according to claim 2, characterized in that The generating the first bitmap based on the first mapping relationship and the first APP includes: Searching the second APP for a first target APP that is the same as the first APP, and determining a target bitmap index corresponding to the first target APP based on the first mapping relationship; The first bitmap is generated based on the target bitmap index.
4. The method according to claim 3, characterized in that The method further comprises: storing the second information corresponding to the first bitmap in a preset database; wherein the second information at least includes leading zero information; Leading zero information corresponding to the first bitmap is removed to obtain the compressed first bitmap.
5. The method according to claim 1 or 2, characterized in that: The method further comprises: Acquire first initial APP data based on the first preset time period; The first initial APP data is subjected to a first preset processing to obtain processed APP data; wherein the processed APP data at least includes the second APP.
6. The method according to claim 1, characterized in that The method further comprises: In the case where it is determined that the first bitmap exists, acquiring a third APP based on a second preset time period; wherein the third APP includes all APPs within the second preset time period; A third mapping relationship is generated based on the third information corresponding to the third APP; and the first bitmap is updated based on the third mapping relationship; wherein the third mapping relationship represents the mapping relationship between each APP in the third APP and the second bitmap index, and the third information includes traffic information and / or usage count information.
7. The method according to claim 6, characterized in that The updating process of the first bitmap based on the third mapping relationship includes: Matching the third APP with the second APP to obtain a first matching result; wherein the first matching result includes a fourth APP and a fifth APP, the fourth APP includes only APPs in the second APP, and the fifth APP includes only APPs in the third APP; The first bitmap is updated based on the fourth APP, the fifth APP and the third mapping relationship.
8. The method according to claim 7, characterized in that The updating process of the first bitmap based on the fourth APP, the fifth APP and the third mapping relationship includes: Performing conversion processing on the first bitmap to obtain a first data structure; wherein the first data structure at least includes a bitmap index corresponding to the first APP; In the case where the first data structure includes the bitmap index corresponding to the fourth APP, the bitmap index corresponding to the fourth APP is deleted, and the bitmap index corresponding to the APP retained in the first data structure is updated based on the third mapping relationship to obtain an updated first data structure; The bitmap index corresponding to the fifth APP is added to the updated first data structure to obtain a second data structure.
9. The method according to claim 8, characterized in that The method further comprises: Converting the second data structure into a second bitmap, and storing leading zero information corresponding to the second bitmap into a preset database; The second bitmap is compressed, and a fourth mapping relationship between the compressed second bitmap and the identification information of the first user is stored.
10. The method according to claim 1 or 9, characterized in that: The method further comprises: Obtain identification information of a second user in a preset area; wherein the second user includes one or more users; Associating the second mapping relationship with the identification information of the second user to obtain a compressed first bitmap corresponding to the identification information of the second user; or associating the fourth mapping relationship with the identification information of the second user to obtain a compressed second bitmap corresponding to the identification information of the second user; Generate a first matrix based on the identification information of the second user and the decompressed first bitmap; or generate the first matrix based on the identification information of the second user and the decompressed second bitmap; A second target APP is determined based on the first matrix, and the number of users corresponding to the second target APP is determined; wherein the second target APP includes the top K APPs in terms of activity, and K is a positive integer.
11. The method according to claim 10, characterized in that The method further comprises: Reading the leading zero information corresponding to the first bitmap from a preset database; or reading the leading zero information corresponding to the second bitmap from the preset database; The compressed first bitmap is decompressed using the leading zero information corresponding to the first bitmap to obtain the decompressed first bitmap; or the compressed second bitmap is decompressed using the leading zero information corresponding to the second bitmap to obtain the decompressed second bitmap.
12. A user information storage device, characterized in that: The user information storage device comprises: an acquisition unit, a judgment unit, a generation unit, a compression unit and a storage unit; wherein, The acquisition unit is configured to acquire a first APP corresponding to one or more first users; wherein the first APP includes one or more APPs; The determining unit is used to determine whether there is a first bitmap corresponding to the first APP currently; The generating unit is configured to generate the first bitmap based on a first mapping relationship and the first APP when it is determined that the first bitmap does not exist; wherein the first mapping relationship is used to characterize a mapping relationship between a second APP and a first bitmap index, the second APP includes all APPs within a first preset time period, and the second APP includes the first APP; The compression unit is used to compress the first bitmap; The storage unit is used to store the second mapping relationship between the compressed first bitmap and the identification information of the first user.
13. A user information storage device, characterized in that: The user information storage device comprises: a processor and a memory; wherein, The memory is used to store a computer program that can be run on the processor; The processor is configured to execute the method according to any one of claims 1 to 11 when running the computer program.
14. A computer-readable storage medium, characterized in that: The storage medium stores computer program codes, and when the computer program codes are executed by a computer, the method according to any one of claims 1 to 11 is executed.
15. A computer program product comprising a computer program, characterized in that The computer program implements the method according to any one of claims 1-11 when executed by a processor.