CN111274291A

CN111274291A - Query method, device, equipment and medium for user access data

Info

Publication number: CN111274291A
Application number: CN202010064701.7A
Authority: CN
Inventors: 郑金伟
Original assignee: Ping An Life Insurance Company of China Ltd
Current assignee: Ping An Life Insurance Company of China Ltd
Priority date: 2020-01-20
Filing date: 2020-01-20
Publication date: 2020-06-12
Anticipated expiration: 2040-01-20
Also published as: CN111274291B

Abstract

The invention discloses a query method, a query device, equipment and a medium for user access data, wherein the method comprises the following steps: acquiring user access data and acquired historical access data; merging the user main keys and all index data in each user access data into each merged value, and merging the historical main keys and all historical index data in each historical access data into each historical value; sorting all the combined values to obtain first sorting data; sorting all the historical values to obtain second sorting data; removing the merged value consistent with the historical value from the first sequencing data to obtain final data; marking final data with different user main keys and historical main keys as new user data, and marking final data with the same user main keys and historical main keys as active user data; and inputting a preset user access model, and accepting new user maintenance measures and active user maintenance measures. The invention realizes faster response of data extraction and faster timeliness of the established user maintenance measures.

Description

Query method, device, equipment and medium for user access data

Technical Field

The present invention relates to the field of data query, and in particular, to a method and an apparatus for querying user access data, a computer device, and a storage medium.

Background

At present, with the development of big data technology in the computer field, in the process of big data application and processing, the data volume (such as user access data) of the business table in the database is increased sharply, and even the field data in each business table is increased by more than one order of magnitude. In the face of such huge introduction of new or updated data volume, analyzing the difference data of a certain index at different time points usually requires extremely long analysis time. For example, in the prior art, the difference index data in the access data of the new user and the active user is extracted from the user data, the analysis and comparison processes all consume a long time, sometimes even one day, and the interruption in the process will cause the completion of the previous work, so that the process of extracting the difference index data is difficult to be smoothly performed, and further, the user maintenance measures cannot be made for the new user and the active user in time and accurately, and finally, the user group in the part is lost, thereby causing adverse effects on the user operation state.

Disclosure of Invention

The invention provides a query method and device for user access data, computer equipment and a storage medium, which realize faster response of data extraction and quicker timeliness of established user maintenance measures, and can attract more users more quickly through the user maintenance measures.

A query method for a user to access data comprises the following steps:

acquiring user access data of all users at a preset time point from a first database, and acquiring historical access data acquired at a historical time point before the preset time point from a second database; the user access data comprises a user primary key and at least one index data; the historical access data comprises a historical primary key and at least one historical index data;

merging the user primary key and all the index data in each user access data into a merged value corresponding to each user access data, and simultaneously merging the historical primary key and all the historical index data in each historical access data into a historical value corresponding to each historical access data;

sorting all the combined values according to a preset sorting rule to obtain first sorting data; sorting all the historical values according to the sorting rule to obtain second sorting data;

removing the merged value which is completely consistent with the historical value contained in the second sorting data from all the first sorting data, and recording the first sorting data after removing the merged value which is completely consistent with the historical value contained in the second sorting data as final data;

splitting the merged value in the final data into a user primary key and index data, splitting the historical value in the second sequencing data into a historical primary key and historical index data, marking the final data with the user primary key after splitting different from the historical primary key of one historical value in the second sequencing data as new user data, and marking the final data with the user primary key after splitting same as the historical primary key of one historical value in the second sequencing data as active user data;

and inputting the new user data and the active user data into a preset user access model, and receiving new user maintenance measures and active user maintenance measures output by the user access model.

A query device for a user to access data, comprising:

the acquisition module is used for acquiring user access data of all users at a preset time point from a first database, and acquiring historical access data acquired at a historical time point before the preset time point from a second database; the user access data comprises a user primary key and at least one index data; the historical access data comprises a historical primary key and at least one historical index data;

a merging module, configured to merge the user primary key and all the index data in each user access data into a merged value corresponding to each user access data, and simultaneously merge the historical primary key and all the historical index data in each historical access data into a historical value corresponding to each historical access data;

the sorting module is used for sorting all the combined values according to a preset sorting rule to obtain first sorting data; sorting all the historical values according to the sorting rule to obtain second sorting data;

a removing module, configured to remove the merged value that is completely consistent with the history value included in the second sorted data from all the first sorted data, and record the first sorted data from which the merged value that is completely consistent with the history value included in the second sorted data is removed as final data;

an output module, configured to split the merged value in final data into a user primary key and index data, split the history value in the second sorting data into a history primary key and history index data, mark the final data in which the split user primary key is different from the history primary key of one history value included in the second sorting data as new user data, and mark the final data in which the split user primary key is the same as the history primary key of one history value included in the second sorting data as active user data;

and the application module is used for inputting the new user data and the active user data into a preset user access model and accepting new user maintenance measures and active user maintenance measures output by the user access model.

A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, the processor implementing the steps of the above-mentioned user access data querying method when executing the computer program.

A computer-readable storage medium, in which a computer program is stored, which computer program, when being executed by a processor, carries out the above-mentioned steps of the user-access-data query method.

The invention provides a query method, a device, computer equipment and a storage medium of user access data, which merge the main key and the index data of the user access data containing required index data at different time points to generate a merged value and a historical value, sort the merged value and the historical value by the same preset sorting rule to respectively obtain a first sorting data and a second sorting data, compare the first sorting data with the first sorting data according to the preset comparison rule, can quickly obtain the compared final data, split the final data, extract new user data and active user data, simultaneously input the user data and the active user data to a user access model to receive new user maintenance measures and active user maintenance measures output by the user access model, therefore, the access data of the new user and the active user can be extracted quickly and accurately, and meanwhile, the user maintenance measures for attracting the new user and the active user groups are determined jointly in the input model, so that the data extraction response is faster, the timeliness of the established user maintenance measures is faster, and more users can be attracted more quickly through the user maintenance measures.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive labor.

FIG. 1 is a diagram illustrating an application environment of a query method for a user to access data according to an embodiment of the present invention;

FIG. 2 is a flow chart of a query method for a user to access data in one embodiment of the invention;

FIG. 3 is a flowchart of step S20 of a query method for a user to access data according to an embodiment of the present invention;

FIG. 4 is a flowchart of step S40 of a query method for a user to access data according to an embodiment of the present invention;

FIG. 5 is a flowchart of step S50 of a query method for a user to access data according to an embodiment of the invention;

FIG. 6 is a schematic block diagram of a query device for a user to access data in one embodiment of the present invention;

FIG. 7 is a schematic diagram of a computer device in an embodiment of the invention.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

The query method for user access data provided by the invention can be applied to the application environment shown in fig. 1, wherein a client (computer device) communicates with a server through a network. The client (computer device) includes, but is not limited to, various personal computers, notebook computers, smart phones, tablet computers, cameras, and portable wearable devices. The server may be implemented as a stand-alone server or as a server cluster consisting of a plurality of servers.

In an embodiment, as shown in fig. 2, a method for querying user access data is provided, which mainly includes the following steps S10-S60:

s10, obtaining user access data of all users at a preset time point from the first database, and obtaining historical access data obtained at a historical time point before the preset time point from the second database; the user access data comprises a user primary key and at least one index data; the historical access data includes historical primary keys and at least one historical index data.

Understandably, the preset time point can be set according to requirements, such as the first day of each month, 24 points of the current month 10 and the like, the historical time point is a time point before the preset time point, and also set according to requirements, such as a time point one month before the preset time point, a time point one week before the preset time point and the like, user access data of all users at the preset time point is obtained from a first database, the first database is used for storing relevant access data of all users before the preset time point, new data can be continuously added to the first database along with the passage of time, the user access data is relevant data in the user access process, the user access data comprises the user main key and at least one index data, and the user main key is a unique identification code of the user, one user main key corresponds to the unique identification code of one user, the index data is set according to the requirement, for example, the index data can be set as an access path index, an access location index, an access interest index and the like, and historical access data acquired at the historical time point from a second database, wherein the second database is used for storing relevant access data of all users before the historical time point and storing the relevant access data, the second database is continuously updated, the historical access data comprises the historical primary key and at least one piece of historical index data, the history main key is a unique identification code of a user in history access data, the user main key associated with one user is the same as the history main key associated with the user, and the setting of the history index data is consistent with that of the index data.

S20, merging the user primary key and all the index data in each of the user access data into a merged value corresponding to each of the user access data, and merging the historical primary key and all the historical index data in each of the historical access data into a historical value corresponding to each of the historical access data.

Understandably, the user primary key in each user access data is merged with all the index data to generate a merged value corresponding to each user access data one by one, wherein, the merging mode can be various, can be a merging mode of direct merging, and can also be a merging mode of merging after the user main key is inserted in sequence through fixed characters and after each index data, or may be a combination mode in which the user's primary key is sequentially inserted by different characters and then combined with each index data, preferably, the merging mode may be a merging mode in which merging is performed after the user's primary key is inserted in sequence through different characters and after each index data, since it is easy to distinguish the user's primary key and the index data by different characters. Similarly, the history primary key in each piece of history access data is merged with all the history index data to generate a history value corresponding to each piece of history access data.

In one embodiment, as shown in fig. 3, the step S20, namely, the merging the user primary key and all the index data in each of the user access data into a merged value corresponding to each of the user access data, and simultaneously merging the historical primary key and all the historical index data in each of the historical access data into a historical value corresponding to each of the historical access data, includes:

s201, acquiring a preset first merging symbol and a preset second merging symbol.

Understandably, the first merge symbol may be set according to requirements, for example, the first merge symbol may be a special match in the ASCII code table, such as "; "," | "," # ", etc. and a second merger can be set according to the requirement, for example, the second merger can be a special coincidence in an ASCII code table, for example,; "," | "," # ", etc., wherein the second merge may or may not be the same as the first merge, such as: the first merger is set to "|", the second merger is set to ""; ".

S202, inserting the second merging characters after each index data in each user access data, and merging all the index data to generate index merged data corresponding to each user access data; meanwhile, the second merger is inserted after each historical index data in each historical access data, and all the historical index data are merged and merged to generate the historical index merged data corresponding to each historical access data.

Understandably, the second merge symbol is inserted after each index data in the user access data, and each index data is merged to generate the index merged data corresponding to the user access data, and meanwhile, the second merge symbol is inserted after each history index data in the history access data, and each history index data is merged to generate the history index merged data corresponding to the history access data, for example: the second merge sign is set to "; ", as shown in table 1, each index data of each user is merged into index merged data, and as shown in table 2, each historical index data of each user is merged into historical index merged data.

Table 1 index merge data example

User' s	User's main key	Index data 1	Index data 2	Second merge sign	Index merging data
						User 1	1	abc	boy	；	abc；boy；
User 2	2	def	girl	；	def；girl；
						User 3	3	ghj	girl	；	ghj；girl；
User 4	4	lmn	boy	；	lmn；boy；

Table 2 example of historical index merging data

User' s	History main key	Historical index data 1	Historical index data 2	Second merge sign	Historical index merged data
						User 1	1	abc	boy	；	abc；boy；
User 2	2	opq	girl	；	opq；girl；
						User 3	3	ghl	boy	；	ghl；boy；

S203, sequentially inserting the first merger and the index merged data corresponding to each user access data after the user primary key in each user access data, and marking the user primary key sequentially inserted into the first merger and the index merged data corresponding to each user access data as the merged value corresponding to each user access data; meanwhile, the first merger and the history index merged data corresponding to each of the history access data are sequentially inserted after the history primary key in each of the history access data, and the history primary key sequentially inserted into the first merger and the history index merged data corresponding to each of the history access data is marked as the history value.

Understandably, the first merge symbol is inserted after the user primary key in each of the user access data, the index merge data corresponding to the user access data is inserted after the first merge symbol, and the user primary key after the index merge data corresponding to the user access data is inserted is marked as the merge value corresponding to the user access data, meanwhile, the first merge symbol is inserted after the history primary key in each of the history access data, the history index merge data corresponding to the history access data is inserted after the history primary key in each of the history access data, and the history primary key after the history index merge data corresponding to the history access data is inserted is marked as the history value corresponding to the history access data, for example: the first merge symbol is "|", and merging is performed in the examples of table 1 and table 2, as shown in table 3, the user primary key of each user is merged with the index merging data to generate a merged value, and as shown in table 4, the history primary key of each user is merged with the history index merging data to generate a history value.

Table 3 examples of combined values

TABLE 4 historical value examples

Therefore, all the index data required to be acquired are merged with the user primary key, so that whether the user primary key is different from the historical primary key or whether the index data is different from the historical index data can be determined only by once comparison, and the user primary key or the index data does not need to be traversed and compared one by one to determine.

S30, sorting all the merged values according to a preset sorting rule to obtain first sorting data; and sequencing all the historical values according to the sequencing rule to obtain second sequencing data.

Understandably, the sorting rule may be a dictionary sorting rule in a forward order, and may also be a dictionary sorting rule in a reverse order. The dictionary sorting rule is used for sorting each character by an ASCII code sequential arrangement method based on numbers and letters, all the combined values are sorted according to the sorting rule, namely dictionary sorting is carried out according to the dictionary value corresponding to each combined value, the first sorting data is obtained after sorting, and similarly, all the historical values are sorted to obtain the second sorting data. In this way, since the combined value and the history value are sorted by the dictionary sorting method, the size of the character string composed of a plurality of numbers and/or characters can be easily compared with the corresponding dictionary value because the size of the ASCII code of each character is sorted.

S40, removing the merged value completely matching the history value included in the second sorted data from all the first sorted data, and recording the first sorted data from which the merged value completely matching the history value included in the second sorted data is removed as final data.

Understandably, all the first sorting data and all the second sorting data are compared, the merged value which is completely consistent with the historical value contained in the second sorting data in the first sorting data is removed from the first sorting data, then the difference data of the first sorting data and the second sorting data is obtained, and the removed first sorting data is recorded as final data.

In an embodiment, as shown in fig. 4, the step S40, namely, the removing the merged value that completely coincides with the history value included in the second sorted data from all the first sorted data, and recording the first sorted data after removing the merged value that completely coincides with the history value included in the second sorted data as final data includes:

s401, acquiring a comparison rule, marking a first historical value in the second sorting data as a comparison historical value, and marking a first combined value in the first sorting data as a combined value to be compared; the comparison rule comprises a first rule, a second rule and a third rule.

Preferably, the sorting rule is a dictionary sorting rule in a forward order or a reverse order.

When the sorting rule is a dictionary sorting rule of a positive sequence, the first rule is that the dictionary value corresponding to the comparison historical value is equal to the dictionary value corresponding to the combined value to be compared, the second rule is that the dictionary value corresponding to the comparison historical value is larger than the dictionary value corresponding to the combined value to be compared, and the third rule is that the dictionary value corresponding to the comparison historical value is smaller than the dictionary value corresponding to the combined value to be compared.

When the sorting rule is a dictionary sorting rule in a reverse order, the first rule is that the dictionary value corresponding to the comparison historical value is equal to the dictionary value corresponding to the combined value to be compared, the second rule is that the dictionary value corresponding to the comparison historical value is smaller than the dictionary value corresponding to the combined value to be compared, and the third rule is that the dictionary value corresponding to the comparison historical value is larger than the dictionary value corresponding to the combined value to be compared.

The first history value refers to the history value with the first sequence in the second sorting data, and the first combined value refers to the combined value with the first sequence in the first sorting data. For example: the first one of the combined values in table 3 is "1 | abc; boy; "marked as a merged value to be compared, the first of the history values in table 4 is" 1| abc; boy; "flag is a comparison history value.

S402, comparing the dictionary value corresponding to the comparison historical value with the dictionary value corresponding to the merging value to be compared.

Understandably, the dictionary values corresponding to the comparison historical values and the merged values to be compared are respectively compared in size, that is, the comparison historical values in the second sorting data are compared with the merged values to be compared in the first sorting data each time, because the number of the historical values of the second sorting data is always smaller than or equal to the merged value of the first sorting data, the comparison times can be reduced by comparing the merged values to be compared through the comparison historical values, and the running time of the server is reduced without traversing and comparing each comparison historical value with each merged value to be compared, thereby improving the efficiency.

S403, when the dictionary value corresponding to the comparison history value and the dictionary value corresponding to the merged value to be compared satisfy the first rule, marking a next history merged value after the comparison history value of the sequence in the second sorted data as a next comparison history value, removing the merged value to be compared from the first sorted data, marking the merged value after the merged value to be compared of the sequence in the first sorted data as a next merged value to be compared, and comparing the dictionary value corresponding to the next comparison history value with the dictionary value corresponding to the next merged value to be compared.

Understandably, when the sort rule is a forward or reverse dictionary sort rule, and when the dictionary value corresponding to the comparison history value is equal to the dictionary value corresponding to the merged value to be compared, the next history merged value of the sequence in the second sort data after the comparison history value is marked as a next comparison history value, and at the same time, the merged value to be compared is removed from the first sort data, and the merged value of the sequence in the first sort data after the merged value to be compared is marked as a next merged value to be compared, and the dictionary value corresponding to the next comparison history value is compared with the dictionary value corresponding to the next merged value to be compared, that is, the step S402 is continuously performed. For example: the comparison history value in table 4 is "1 | abc; boy; ", the combined value to be compared in table 3 is" 1| abc; boy; if the result of comparison meets the first rule, the combined value is '1 | abc'; boy; "remove from first sorted data while keeping the history value" 1| abc; boy; "next historical value" 2| opq; girl; "flag as compare history value, merge value as" 1| abc; boy; "next combined value of" 2| def; girl; "mark as the merged value to be compared, continue to compare the historical value" 2| opq; girl; "and the combined value to be compared" 2| def; girl; "make an alignment.

In an embodiment, after the step S402, that is, comparing the dictionary value corresponding to the comparison history value with the dictionary value corresponding to the merged value to be compared, the method further includes:

s404, when the dictionary value corresponding to the comparison history value and the dictionary value corresponding to the merged value to be compared satisfy the second rule, marking a next merged value of the sequence in the first sorting data after the merged value to be compared as a next merged value to be compared, and comparing the dictionary value corresponding to the comparison history value with the dictionary value corresponding to the next merged value to be compared.

Understandably, when the sorting rule is a dictionary sorting rule in a positive order and the dictionary value corresponding to the comparison history value is greater than the dictionary value corresponding to the merged value to be compared, marking the next merged value of the sequence in the first sorting data after the merged value to be compared as a next merged value to be compared, and comparing the dictionary value corresponding to the comparison history value with the dictionary value corresponding to the next merged value to be compared, that is, continuing to execute the step S402. For example: the comparison history value in table 4 is "2 | opq; girl; ", the combined value to be compared in table 3 is" 2| def; girl; if the result of comparison is in accordance with the second rule, the combined value is' 2| def; girl; "next combined value" 3| ghj; girl; "mark as the merged value to be compared, continue to compare the historical value" 2| opq; girl; "and-to-be-compared combined value" 3| ghj; girl; "make an alignment.

s405, when the dictionary value corresponding to the comparison history value and the dictionary value corresponding to the merged value to be compared satisfy the third rule, mark a next history value of the sequence in the second sorted data after the comparison history value as a next comparison history value, and compare the dictionary value corresponding to the next comparison history value with the dictionary value corresponding to the merged value to be compared.

Understandably, when the sorting rule is a dictionary sorting rule in a positive order and the dictionary value corresponding to the comparison history value is smaller than the dictionary value corresponding to the merged value to be compared, the next history value of the sequence in the second sorting data after the comparison history value is marked as a next comparison history value, and the dictionary value corresponding to the next comparison history value is compared with the dictionary value corresponding to the merged value to be compared, that is, the step S402 is continuously executed. For example: the comparison history value in table 4 is "2 | opq; girl; ", the combined value to be compared in table 3 is" 3| ghj; girl; if the comparison result shows that the third rule is met, the historical value is' 2| opq; girl; "next historical value" 3| ghl; boy; "mark as the merged value to be compared, continue to compare the historical value" 3| ghl; boy; "and-to-be-compared combined value" 3| ghj; girl; "make an alignment.

S406, after all the historical values in the second sorting data are traversed, all the residual merged values in the first sorting data are recorded as final data.

Understandably, in the traversal process, the steps S402, S403, S404 and S405 are executed according to the comparison between the dictionary value corresponding to the history value and the dictionary value corresponding to the merged value to be compared, and after all the history values in the second sorting data are traversed, i.e. when the next history value following the comparison history value for the sequence in the second sorted data does not exist, that is, the current comparison history value is the last history value in the second sorting data, the merged value to be compared and the merged value after the merged value sequence to be compared in the first sorting data are kept in the first sorting data without continuously executing the comparison operation, that is, the comparison operation is not performed on the merged value after the merged value sequence to be compared, and all the merged values remaining in the current first ranking data are recorded as final data. For example: a comparison history value "3 | ghl in table 4; boy; "and the combined value to be compared in table 3" 3| ghj; girl; "comparing, according to a third rule, marking a next history value of the sequence in the second sorting data after the comparison history value as a next comparison history value, if the comparison history value does not exist, then merging the current value to be compared into a merged value" 3| ghj; girl; "and the combined value to be compared" 3| ghj; girl; "a combined value after the sequence" 4| lmn; boy; "not performing the comparison operation, but directly remaining in the first sorting data, the final data is shown in table 5.

Final data as exemplified in table 5

Merged value of final data
	2\|def；girl；
3\|ghj；girl；
	4\|lmn；boy；

In this way, since the number of the history values of the second sorting data (the history sorting data) is smaller than the number of the merged values of the first sorting data (the new sorting data), the number of comparison times can be reduced by comparing the history values of the second sorting data with the merged values of the first sorting data, and then, by processing three different rules for three cases (greater than, equal to, less than) of dictionary value comparison corresponding to the two, each merged value is compared at most twice, sometimes even zero times. In the prior art, the comparison method is that the merged value of each first sorting data and the historical value of the second sorting data are traversed and compared one by one, and then the difference data result of the merged value and the historical value is output.

S50, splitting the merged value in the final data into a primary user key and index data, splitting the historical value in the second sorted data into a primary historical key and historical index data, marking the final data in which the primary user key after splitting is different from the primary historical key of one historical value included in the second sorted data as new user data, and marking the final data in which the primary user key after splitting is the same as the primary historical key of one historical value included in the second sorted data as active user data.

In an embodiment, as shown in fig. 5, the splitting the merged value in the final data into the user primary key and the index data and splitting the historical value in the second sorted data into the historical primary key and the historical index data in step S50 includes:

s501, obtaining the positions of the first merge symbol and the second merge symbol in the merged value in each of the final data.

Understandably, the first merge symbol in the merged value in each of the final data is searched, and the position of the first merge symbol corresponding to each of the merged values is obtained, and meanwhile, the second merge symbol in the merged value in each of the final data is searched, and the position of the second merge symbol corresponding to each of the merged values is obtained, where one of the merged values corresponds to the position of one of the first merge symbols, and one of the merged values corresponds to the position of at least one of the second merge symbols.

S502, splitting each merged value into user primary key and index merged data at the position of the first merger, and simultaneously splitting each historical value into historical primary key and historical index merged data at the position of the first merger.

Understandably, each of the merged values is split into the user primary key and the index merged data at the location of the first merge, while each of the historical values is split into the historical primary key and the historical index merged data, such as: the combined value "2 | def of the final data shown in table 5; girl; "split into a user primary key" 2 "and index merging data" def at the position of the first merger "|"; girl; ".

S503, splitting each indicator merged data into at least one indicator data at a location corresponding to the second merge, and splitting each historical indicator merged data into at least one historical indicator data at a location corresponding to the second merge.

Understandably, each of the index merged data is split into at least one index data at a location corresponding to the second merge, while each of the historical index merged data is split into at least one historical index data at a location corresponding to the second merge, such as: merging the index into data of 'def'; girl; "at the second merge"; the "position is split into several pieces of index data" def "," girl ".

Understandably, the user primary key of the merged value of the final data is compared with the history primary key of the history value of the second sorting data, the comparison may be performed by the method of the steps S401 to S406, the final data after the splitting is marked as new user data when the user primary key of the merged value of the final data is completely consistent with the history primary key of the history value of the second sorting data, and the final data after the splitting is marked as active user data when the user primary key of the merged value of the final data is inconsistent with the history primary key of the history value of the second sorting data. For example: the merged value of the final data shown in table 5 results in the new user data shown in table 6 and the active user data shown in table 7 after step S50.

TABLE 6 New user data

Table 7 active user data

In an embodiment, after the step S50, namely splitting the merged value in the final data into a primary user key and index data, marking the final data after splitting with the primary user key different from the primary historical key of one of the historical values included in the second sorted data as new user data, and marking the final data after splitting with the primary user key same as the primary historical key of one of the historical values included in the second sorted data as active user data, the method includes:

s504, storing the new user data into a new user table of a preset KV storage database, and storing the active user data into an active user table of the preset KV storage database.

Understandably, the new user data is stored in a new user table of a preset KV storage database (Key-value database), so that the new user data can be conveniently and quickly extracted, the KV storage database is a database providing Key value quick access, the new user table can be accumulated new user data, and thus, the new user data can be quickly accessed and quickly provided to a new user feedback model, and the new user feedback model is a model trained according to the attraction number of the new user after the new user accepts user maintenance measures.

And S60, inputting the new user data and the active user data into a preset user access model, and accepting the new user maintenance measures and the active user maintenance measures output by the user access model.

Understandably, the new user data comparison data and the active user data are input into a preset user access model, and new user maintenance measures of a new user group and active user maintenance measures of an active user group are determined according to the user access model, so that corresponding user maintenance measures are made according to different user groups, and the new user maintenance measures and the active user maintenance measures, such as providing a coupon attracting users, providing reward points attracting users and the like.

Therefore, the generalization capability and the accuracy of the model can be improved by simultaneously inputting the new user data and the active user data into the model, and the data of the new user and the active user can be accurately extracted to be used as the model input sample data to formulate the user maintenance measures of the user group.

The invention combines the main key and the index data of the user access data containing the required index data at different time points to generate a combined value and a historical value, sequences the combined value and the historical value by the same preset sequencing rule to respectively obtain first sequencing data and second sequencing data, compares the first sequencing data with the first sequencing data according to the preset comparison rule to quickly obtain the compared final data, splits the final data and extracts new user data and active user data, simultaneously inputs the user data and the active user data into the user access model to accept the new user maintenance measures and the active user maintenance measures output by the user access model, thereby quickly and accurately extracting the access data of the new user and the active user, and simultaneously determines the user maintenance measures for attracting new users and active user groups in the input model, therefore, the responsiveness of data extraction is faster, the timeliness of the established user maintenance measures is faster, and more users can be attracted faster through the user maintenance measures.

In an embodiment, a query device for user access data is provided, and the query device for user access data corresponds to the query method for user access data in the above embodiments one to one. As shown in fig. 6, the query device for the user to access data includes an obtaining module 11, a merging module 12, a sorting module 13, a removing module 14, an outputting module 15 and an applying module 16. The functional modules are explained in detail as follows:

the acquisition module 11 is configured to acquire user access data of all users at a preset time point from a first database, and acquire historical access data acquired at a historical time point before the preset time point from a second database; the user access data comprises a user primary key and at least one index data; the historical access data comprises a historical primary key and at least one historical index data;

a merging module 12, configured to merge the user primary key and all the index data in each user access data into a merged value corresponding to each user access data, and at the same time merge the historical primary key and all the historical index data in each historical access data into a historical value corresponding to each historical access data;

a sorting module 13, configured to sort all the merged values according to a preset sorting rule to obtain first sorting data; sorting all the historical values according to the sorting rule to obtain second sorting data;

a removing module 14, configured to remove the merged value that is completely consistent with the history value included in the second sorted data from all the first sorted data, and record the first sorted data from which the merged value that is completely consistent with the history value included in the second sorted data is removed as final data;

an output module 15, configured to split the merged value in the final data into a user primary key and index data, split the historical value in the second sorting data into a historical primary key and historical index data, mark the final data in which the split user primary key is different from the historical primary key of one historical value included in the second sorting data as new user data, and mark the final data in which the split user primary key is the same as the historical primary key of one historical value included in the second sorting data as active user data;

and the application module 16 is configured to input the new user data and the active user data into a preset user access model, and accept a new user maintenance measure and an active user maintenance measure output by the user access model.

In one embodiment, the merge module 12 includes:

the device comprises a first obtaining unit, a second obtaining unit and a control unit, wherein the first obtaining unit is used for obtaining a preset first merging symbol and a preset second merging symbol;

a first merging unit configured to insert the second merge after each of the index data in each of the user access data, and merge all of the index data to generate index merged data corresponding to each of the user access data; meanwhile, after each historical index data in each historical access data is inserted into the second merge symbol, all the historical index data are merged and merged to generate historical index merged data corresponding to each historical access data;

a second merging unit configured to sequentially insert the first merger and the index merged data corresponding to each of the user access data after the user primary key in each of the user access data, and mark the user primary key, which is sequentially inserted into the first merger and the index merged data corresponding to each of the user access data, as the merged value corresponding to each of the user access data; meanwhile, the first merger and the history index merged data corresponding to each of the history access data are sequentially inserted after the history primary key in each of the history access data, and the history primary key sequentially inserted into the first merger and the history index merged data corresponding to each of the history access data is marked as the history value.

In one embodiment, the removal module 14 includes:

a second obtaining unit, configured to obtain a comparison rule, mark a first history value in the second sorting data as a comparison history value, and mark a first merged value in the first sorting data as a merged value to be compared; wherein the comparison rule comprises a first rule, a second rule and a third rule;

a corresponding comparison unit, configured to compare a dictionary value corresponding to the comparison history value with a dictionary value corresponding to the merged value to be compared;

a first comparing unit, configured to, when the dictionary value corresponding to the comparison history value and the dictionary value corresponding to the merged value to be compared satisfy the first rule, mark a next history merged value after the comparison history value of the sequence in the second sorted data as a next comparison history value, remove the merged value to be compared from the first sorted data, mark the merged value after the merged value to be compared of the sequence in the first sorted data as a next merged value to be compared, and compare the dictionary value corresponding to the next comparison history value and the dictionary value corresponding to the next merged value to be compared;

and the traversing unit is used for recording all the residual merged values in the current first sorting data as final data after traversing all the historical values in the second sorting data.

In one embodiment, the removal module 14 further comprises:

a second comparing unit, configured to mark, when the dictionary value corresponding to the comparison history value and the dictionary value corresponding to the merged value to be compared satisfy the second rule, a next merged value of the sequence in the first sorting data after the merged value to be compared as a next merged value to be compared, and compare the dictionary value corresponding to the comparison history value and the dictionary value corresponding to the next merged value to be compared.

In one embodiment, the removal module 14 further comprises:

a third comparing unit, configured to mark a next history value of the sequence in the second sorting data after the comparison history value as a next comparison history value when the dictionary value corresponding to the comparison history value and the dictionary value corresponding to the merged value to be compared satisfy the third rule, and compare the dictionary value corresponding to the next comparison history value and the dictionary value corresponding to the merged value to be compared.

In one embodiment, the output module 15 includes:

a third obtaining unit configured to obtain positions of the first merge symbol and the second merge symbol in the merged value in each of the final data;

a first splitting unit, configured to split each merged value into a user primary key and index merged data at the location of the first merger, and simultaneously split each historical value into a history primary key and history index merged data at the location of the first merger;

a second splitting unit, configured to split each indicator merged data into at least one indicator data at a location corresponding to the second merger, and split each historical indicator merged data into at least one historical indicator data at a location corresponding to the second merger.

In one embodiment, the output module 15 further includes:

and the storage unit is used for storing the new user data into a new user table of a preset KV storage database and storing the active user data into an active user table of the preset KV storage database.

For specific limitations of the querying device for the user to access the data, reference may be made to the above limitations of the querying method for the user to access the data, and details are not described here. The modules in the query device for the user to access the data can be wholly or partially implemented by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

In one embodiment, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 7. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a query method for user access to data.

In one embodiment, a computer device is provided, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the computer program, the processor implements the query method for the user to access the data in the above embodiments.

In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored, which, when executed by a processor, implements the querying method for user access data in the above embodiments.

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, databases, or other media used in embodiments provided herein may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions.

The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.

Claims

1. A query method for a user to access data is characterized by comprising the following steps:

2. The method for querying user access data according to claim 1, wherein said merging the user primary key and all the index data in each of the user access data into a merged value corresponding to each of the user access data, and simultaneously merging the historical primary key and all the historical index data in each of the historical access data into a historical value corresponding to each of the historical access data comprises:

acquiring a preset first merging character and a preset second merging character;

inserting the second merge symbol after each index data in each user access data, and merging all the index data to generate index merged data corresponding to each user access data; meanwhile, after each historical index data in each historical access data is inserted into the second merge symbol, all the historical index data are merged and merged to generate historical index merged data corresponding to each historical access data;

sequentially inserting the first merger and the index merged data corresponding to each user access data after the user primary key in each user access data, and marking the user primary key sequentially inserted into the first merger and the index merged data corresponding to each user access data as the merged value corresponding to each user access data; meanwhile, the first merger and the history index merged data corresponding to each of the history access data are sequentially inserted after the history primary key in each of the history access data, and the history primary key sequentially inserted into the first merger and the history index merged data corresponding to each of the history access data is marked as the history value.

3. The query method for user access data according to claim 1, wherein said removing the merged value completely consistent with the history value contained in the second sorted data from all the first sorted data, and recording the first sorted data from which the merged value completely consistent with the history value contained in the second sorted data is removed as final data, comprises:

obtaining a comparison rule, marking a first historical value in the second sorting data as a comparison historical value, and marking a first combined value in the first sorting data as a combined value to be compared; wherein the comparison rule comprises a first rule, a second rule and a third rule;

comparing the dictionary value corresponding to the comparison historical value with the dictionary value corresponding to the merging value to be compared;

when the dictionary value corresponding to the comparison history value and the dictionary value corresponding to the merged value to be compared satisfy the first rule, marking the next historical merged value of the sequence in the second sorting data after the comparison history value as the next comparison history value, simultaneously removing the merged value to be compared from the first sorting data, marking the merged value of the sequence in the first sorting data after the merged value to be compared as the next merged value to be compared, and comparing the dictionary value corresponding to the next comparison history value with the dictionary value corresponding to the next merged value to be compared;

and after traversing all the historical values in the second sorting data, recording all the residual merged values in the current first sorting data as final data.

4. The method as claimed in claim 3, wherein after comparing the dictionary value corresponding to the history comparison value with the dictionary value corresponding to the merged value to be compared, the method further comprises:

when the dictionary value corresponding to the comparison history value and the dictionary value corresponding to the merged value to be compared meet the second rule, marking the merged value next to the merged value to be compared of the sequence in the first sequencing data as the next merged value to be compared, and comparing the dictionary value corresponding to the comparison history value with the dictionary value corresponding to the next merged value to be compared.

5. The method as claimed in claim 3, wherein after comparing the dictionary value corresponding to the history comparison value with the dictionary value corresponding to the merged value to be compared, the method further comprises:

when the dictionary value corresponding to the comparison history value and the dictionary value corresponding to the merged value to be compared satisfy the third rule, marking the next history value of the sequence in the second sorting data after the comparison history value as the next comparison history value, and comparing the dictionary value corresponding to the next comparison history value with the dictionary value corresponding to the merged value to be compared.

6. The method for querying user access data according to claim 1, wherein the splitting the merged value in the final data into a user primary key and indicator data and splitting the historical value in the second sorted data into a historical primary key and historical indicator data comprises:

obtaining the positions of the first merger and the second merger in the merged value in each of the final data;

splitting each of the merged values into user primary key and indicator merged data at the location of the first merge while splitting each of the historical values into historical primary key and historical indicator merged data at the location of the first merge;

splitting each of the metric-consolidated data into at least one metric data at a location corresponding to the second merge, while splitting each of the historical metric-consolidated data into at least one historical metric data at a location corresponding to the second merge.

7. The method for querying user access data according to claim 1, wherein the splitting the merged value in the final data into a user primary key and index data and splitting the historical value in the second sorted data into a historical primary key and historical index data, marking the final data after splitting with the user primary key different from the historical primary key of one of the historical values included in the second sorted data as new user data, and marking the final data after splitting with the user primary key same as the historical primary key of one of the historical values included in the second sorted data as active user data comprises:

and storing the new user data into a new user table of a preset KV storage database, and storing the active user data into an active user table of the preset KV storage database.

8. An apparatus for querying user access data, comprising:

9. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements a query method for user access data according to any one of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, implements a method for querying a user for access to data according to any one of claims 1 to 7.