CN111274291B

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

Info

Publication number: CN111274291B
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: 2024-04-05
Anticipated expiration: 2040-01-20
Also published as: CN111274291A

Abstract

The invention discloses a query method, a 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; combining the user main key and all index data in the user access data into combined values, and combining the history main key and all history index data in the history access data into history values; sequencing all the combined values to obtain first sequencing data; sorting all the historical values to obtain second sorting data; removing the combined value consistent with the historical value from the first ordering data to obtain final data; the final data of the user main key and the history main key which are different are marked as new user data, and the final data of the user main key and the history main key which are the same are marked as active user data; and inputting a preset user access model, and receiving new user maintenance measures and active user maintenance measures. The invention realizes faster responsiveness of data extraction and faster timeliness of formulated 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 apparatus for querying data accessed by a user, a computer device, and a storage medium.

Background

Currently, with the development of big data technology in the computer field, during the application and processing of big data, the data volume (such as user access data) of service tables in a database increases sharply, and even the field data in each service table increases by more than one order of magnitude. In view of such huge introduction of new or updated data volume, analysis of difference data of a certain index at different time points often requires an extremely long analysis time. For example, in the prior art, the process of analyzing and comparing the difference index data in the access data of the new user and the active user needs to take a long time, sometimes even one day, and the process of extracting the difference index data is difficult to be carried out smoothly because of interruption, so that user maintenance measures cannot be formulated for the new user and the active user timely and accurately, and finally the user population of the part is lost, thereby producing adverse effects on the operation state of the user.

Disclosure of Invention

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

A method of querying data accessed by a user, comprising:

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 main key and at least one index data; the history access data comprises a history primary key and at least one history index data;

combining the user primary key and all the index data in each piece of user access data into a combined value corresponding to each piece of user access data, and simultaneously combining the history primary key and all the history index data in each piece of history access data into a history value corresponding to each piece of history access data;

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

removing the combined value which is completely consistent with the history value contained in the second ordering data from all the first ordering data, and recording the first ordering data after removing the combined value which is completely consistent with the history value contained in the second ordering data as final data;

Splitting the merged value in the final data into a user primary key and index data, splitting the history value in the second sorting data into a history primary key and history index data, marking the final data with different history primary keys of the user primary key after splitting and one history primary key of the history value contained in the second sorting data as new user data, and marking the final data with the same history primary key of the user primary key and one history value contained in the second sorting 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 user access to data, comprising:

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

A merging module, configured to merge the user 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 merge the history key and all the history index data in each of the history access data into a history value corresponding to each of the history 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;

the removing module is used for removing the combined value which is completely consistent with the history value contained in the second ordering data from all the first ordering data, and recording the first ordering data after the combined value which is completely consistent with the history value contained in the second ordering data is removed as final data;

the output module is used for splitting the combined value in the final data into a user main key and index data, splitting the history value in the second sorting data into a history main key and history index data, marking the final data with different history main keys of the user main key after splitting and one history value contained in the second sorting data as new user data, and marking the final data with the same history main key of the user main key after splitting and one history value contained 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 receiving 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-described method of querying user access data when the computer program is executed.

A computer readable storage medium storing a computer program which, when executed by a processor, implements the steps of the above-described user access data querying method.

According to the query method, the query device, the computer equipment and the storage medium for the user access data, the user access data containing the required index data at different time points are subjected to primary key and index data combination to generate the combined value and the historical value, the combined value and the historical value are subjected to the same preset sequencing rule to respectively obtain the first sequencing data and the second sequencing data, the first sequencing data and the first sequencing data are compared according to the preset comparison rule, the compared final data can be quickly obtained, the final data are split and new user data and active user data are extracted, the user data and the active user data are simultaneously input into the user access model to accept the new user maintenance measures and the active user maintenance measures output by the user access model, so that the access data of the new user and the active user can be quickly and accurately extracted, the user maintenance measures for attracting the new user and the active user group are jointly determined in the input model, the responsiveness of the extracted data is faster, and the user maintenance measures can be more quickly attracted by the user maintenance measures.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments of the present invention will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

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

FIG. 2 is a flow chart of a method for querying user access data in an embodiment of the invention;

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

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

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

FIG. 6 is a functional block diagram of a user access data querying device in accordance with an embodiment of the present invention;

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

Detailed Description

The following description of the embodiments of the present invention will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.

The query method of the user access data provided by the invention can be applied to an application environment as shown in fig. 1, wherein a client (computer equipment) communicates with a server through a network. Among them, clients (computer devices) include, but are not limited to, personal computers, notebook computers, smartphones, tablet computers, cameras, and portable wearable devices. The server may be implemented as a stand-alone server or as a server cluster composed of a plurality of servers.

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

s10, acquiring user access data of all users at a preset time point from a first database, and simultaneously 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 main key and at least one index data; the history access data includes a history primary key and at least one history index data.

It is understood that the preset time point may be set according to requirements, such as the first day of each month, 24 points of the current month 10 days, etc., the history time point is a time point before the preset time point, and is also set according to requirements, such as a time point of one month before the preset time point, a time point of one week before the preset time point, etc., 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 is continuously added to the first database along with the time, the user access data is relevant data in the user access process, the user access data includes the user primary key and at least one index data, the user primary key is a unique identification code of a user, one user primary key corresponds to a unique identification code of a user, the index data scientific research is set according to requirements, for example, the index data can be set as an access path index, an access positioning place index, an access interest index and the like, and meanwhile, historical access data which are acquired from a second database at the historical time point are stored, the second database is used for storing related access data of all users before the historical time point, the second database is updated continuously along with the time, the historical access data comprises the historical primary key and at least one historical index data, wherein the historical primary key is a unique identification code of the user in the historical access data, the user primary key associated with one user is the same as the historical primary key associated with the user, the setting of the history index data is consistent with the setting of the index data.

S20, combining the user main key and all index data in each piece of user access data into a combined value corresponding to each piece of user access data, and simultaneously combining the history main key and all history index data in each piece of history access data into a history value corresponding to each piece of history access data.

It is to be understood that the merging method of merging the user primary key in each piece of the user access data with all the index data to generate a merging value corresponding to each piece of the user access data one by one may be multiple, may be a direct merging method, may be a merging method of merging after inserting the user primary key and each piece of the index data sequentially by a fixed character, or may be a merging method of merging after inserting the user primary key and each piece of the index data sequentially by a different character, and preferably may be a merging method of merging after inserting the user primary key and each piece of the index data sequentially by a different character, because the user primary key and the index data may be easily distinguished by different characters. And similarly, merging the history primary key in each history access data with all the history index data to generate a history value corresponding to each history access data.

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

s201, acquiring a preset first merger and a preset second merger.

It is to be appreciated that the first merger may be set according to the requirement, for example, the first merger may be a special coincidence in an ASCII code table, such as "; "," | "," # ", etc., and the second merger may be set according to requirements, for example, the second merger may be a special coincidence in an ASCII code table, such as"; "," | "," # ", etc., wherein the second merger may or may not be the same as the first merger, e.g.: the first merger is set to "|", and the second merger is set to "; ".

S202, inserting the second merger after each index data in each user access data, and merging all the index data to generate index merging data corresponding to each user access data; and simultaneously, inserting the second merger after each historical index data in each historical access data, and merging all the historical index data to generate historical index merged data corresponding to each historical access data.

It is understood that the second merger is inserted after each of the index data in the user access data, and each of the index data is merged to generate the index merged data corresponding to the user access data, and at the same time, the second merger is inserted after each of the history index data in the history access data, and each of the history index data is merged to generate the history index merged data corresponding to the history access data, for example: the second merger is set to "; as shown in table 1, each index data of each user is combined into index combined data, and as shown in table 2, each history index data of each user is combined into history index combined data.

Table 1 index merge data example

User' s	Main key of user	Index data 1	Index data 2	Second merger	Index merge 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 historical index merge data example

User' s	History primary key	History index data 1	Historical index data 2	Second merger	Historical index merging 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 merging data corresponding to each user access data after the user main key in each user access data, and marking the user main key sequentially inserted with the first merger and the index merging data corresponding to each user access data as the merging value corresponding to each user access data; meanwhile, the first merger and the history index merging data corresponding to each history access data are sequentially inserted after the history primary key in each history access data, and the history primary key in which the first merger and the history index merging data corresponding to each history access data are sequentially inserted is marked as the history value.

It is understandable that 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 that, and the user primary key after the insertion of the index merge data corresponding to the user access data is marked as the merge value corresponding to the user access data, while 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 that, and the history primary key into which 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 merger is "|", in the examples of table 1 and table 2, the user primary key of each user is merged with the index merging data to generate a merged value, as shown in table 3, and the history primary key of each user is merged with the history index merging data to generate a history value, as shown in table 4.

Table 3 examples of combined values

Table 4 historical value examples

In this way, all the index data to be acquired are combined with the user primary key, so that whether the user primary key is different from the history primary key or whether the index data is different from the history index data can be determined only by one comparison, and each user primary key or each index data is not used for performing a traversal comparison determination.

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

Understandably, the ordering rule may be a positive-order dictionary ordering rule or a reverse-order dictionary ordering rule. And the dictionary ordering rule is a method for ordering each character based on ASCII code sequence of numbers and letters, all the combined values are ordered according to the ordering rule, namely dictionary ordering is carried out according to the dictionary value corresponding to each combined value, the first ordering data is obtained after ordering, and similarly, the second ordering data is obtained after ordering all the historical values. In this way, the combined value and the history value are sorted by using the dictionary sorting method, and the ASCII code size of each character is sorted, so that the size of the character string composed of a plurality of numbers and/or characters can be easily compared with the corresponding dictionary value.

And S40, removing the combined value which is completely consistent with the history value contained in the second ordering data from all the first ordering data, and recording the first ordering data after removing the combined value which is completely consistent with the history value contained in the second ordering data as final data.

Understandably, comparing all the first ordering data with all the second ordering data, removing the merged value in the first ordering data, which is completely consistent with the history value contained in the second ordering data, from the first ordering data, and then obtaining the difference data of the first ordering data and the second ordering data, and recording the removed first ordering data as final data.

In an embodiment, as shown in fig. 4, in the step S40, that is, the removing the merged value completely consistent with the history value included in the second sorted data from all the first sorted data, the recording the first sorted data after removing the merged value completely consistent 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 sequencing data as a comparison historical value, and marking a first combined value in the first sequencing data as a combined value to be compared; the comparison rule comprises a first rule, a second rule and a third rule.

Preferably, the ordering rule is a dictionary ordering rule of positive order or reverse order.

When the ordering rule is a positive-order dictionary ordering rule, the first rule is that the dictionary value corresponding to the comparison history 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 history 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 history value is smaller than the dictionary value corresponding to the combined value to be compared.

When the ordering rule is a dictionary ordering rule with a reverse order, the first rule is that the dictionary value corresponding to the comparison history 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 history 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 history value is larger than the dictionary value corresponding to the combined value to be compared.

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

S402, comparing the dictionary value corresponding to the comparison history value with the dictionary value corresponding to the combined value to be compared.

It is to be understood that, the dictionary values corresponding to the comparison history value and the merging value to be compared are compared, that is, the comparison history value in the second ordering data is compared with the merging value to be compared in the first ordering data each time, because the number of the history values of the second ordering data is always smaller than or equal to the merging value of the first ordering data, the comparison times can be reduced by comparing the comparison history values with the merging value to be compared, and each comparison history value is not required to be compared with each merging value to be compared by traversing one time, thus reducing the running time of the server and improving the efficiency.

S403, when the dictionary value corresponding to the comparison history value and the dictionary value corresponding to the merging value to be compared meet the first rule, marking the next history merging value of the sequence in the second ordering data after the comparison history value as the next comparison history value, simultaneously removing the merging value to be compared from the first ordering data, marking the merging value of the sequence in the first ordering data after the merging value to be compared as the next merging value to be compared, and comparing the dictionary value corresponding to the next comparison history value and the dictionary value corresponding to the next merging value to be compared.

It may be appreciated that when the sorting rule is a positive-order or reverse-order dictionary sorting rule and when the dictionary value corresponding to the comparison history value is equal to the dictionary value corresponding to the merging value to be compared, the next historical merging value of the sequence in the second sorting data after the comparison history value is marked as the next comparison history value, the merging value to be compared is removed from the first sorting data, the merging value of the sequence in the first sorting data after the merging value to be compared is marked as the next merging 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 merging value to be compared, that is, the step S402 is continuously executed. 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; ", comparing to obtain the first rule, and then combining the values of 1|abc; boy; "remove from first sorted data while setting the history value to" 1|abc; boy; "next history value" 2|opq; girl; "marked as a comparison history value, the combined value is" 1|abc; boy; the "next combined value" 2|def; girl; "mark as the combined value to be compared, continue comparing the historical value" 2|opq; girl; "combined with to be compared value" 2|def; girl; "alignment is performed".

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

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

Understandably, when the ordering rule is a positive-order dictionary ordering rule and when the dictionary value corresponding to the comparison history value is greater than the dictionary value corresponding to the combined value to be compared, marking the next combined value of the sequence in the first ordering data after the combined value to be compared as the next combined value to be compared, and comparing the dictionary value corresponding to the comparison history value with the dictionary value corresponding to the next combined value to be compared, namely, 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 comparison results in the second rule, the combined value is 2|def; girl; the "next merge value" 3|ghj; girl; "mark as the combined value to be compared, continue comparing the historical value" 2|opq; girl; "and to-be-compared combined value" 3|ghj; girl; "alignment is performed".

and S405, marking the next historical value of the sequence in the second sequencing data after the comparison historical value as the next comparison historical value when the dictionary value corresponding to the comparison historical value and the dictionary value corresponding to the combined value to be compared meet the third rule, and comparing the dictionary value corresponding to the next comparison historical value with the dictionary value corresponding to the combined value to be compared.

Understandably, when the ordering rule is a positive-order dictionary ordering rule and when the dictionary value corresponding to the comparison history value is smaller than the dictionary value corresponding to the combined value to be compared, the next history value of the sequence in the second ordering data after the comparison history value is marked as the next comparison history value, and the dictionary value corresponding to the next comparison history value is compared with the dictionary value corresponding to the combined 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 meets the third rule, the historical value is 2|opq; girl; "next history value" 3|ghl; boy; "mark as the combined value to be compared, continue comparing the historical value" 3|ghl; boy; "and to-be-compared combined value" 3|ghj; girl; "alignment is performed".

S406, after traversing all the historical values in the second ordering data, recording all the combined values remained in the current first ordering data as final data.

It can be appreciated that, in the traversing process, the steps S402, S403, S404 and S405 are executed according to the situation that the dictionary value corresponding to the comparison history value is compared with the dictionary value corresponding to the combined value to be compared, when all the history values in the second sorted data are traversed, that is, when the next history value in the sequence in the second sorted data after the comparison history value does not exist, that is, the current comparison history value is the last history value in the second sorted data, the combined value to be compared in the first sorted data and the combined value after the sequence of combined values to be compared are retained in the first sorted data, the comparison operation is not continuously executed, that is, the combined value after the sequence of combined values to be compared is not compared, and meanwhile, all the combined values remaining in the current first sorted data are recorded as final data. For example: comparison history value "3|ghl in Table 4; boy; "and the to-be-compared combined value in table 3" 3|ghj; girl; "comparing, conforming to a third rule, marking the next history value of the sequence in the second ordering data after the comparison history value as the next comparison history value, if the comparison history value is not present, then merging the current to-be-compared values of 3|ghj; girl; "and the combined value to be compared" 3|ghj; girl; the combined value "4|lmn" after the sequence of "is; boy; "without alignment operation, directly retained in the first ranking data, the final data is shown in table 5.

Table 5 final data exemplified

Merging values of final data
	2\|def；girl；
3\|ghj；girl；
	4\|lmn；boy；

Thus, since the number of the historical values of the second ranking data (the historical ranking data) is smaller than the number of the combined values of the first ranking data (the new ranking data), the number of comparison times can be reduced by comparing the historical values of the second ranking data with the combined values of the first ranking data, and each combined value is compared at most twice, sometimes even zero times by processing three cases (greater than, equal to and less than) of the dictionary value comparison corresponding to the two cases by three different rules. In the prior art, the comparison method is to output the difference data result of each first sorting data and each second sorting data after the combination value and the historical value of the second sorting data are subjected to one-to-one traversal comparison, and for the comparison times of large data, the comparison times in the prior art are far greater than those in the application, and the comparison method provided in the application greatly reduces the comparison times of two groups of data and obviously improves the comparison efficiency.

S50, splitting the combined value in the final data into a user main key and index data, splitting the history value in the second sorting data into a history main key and history index data, marking the final data with different history main keys of the user main key after splitting and one history value contained in the second sorting data as new user data, and marking the final data with the same history main key of the user main key after splitting and one history value contained in the second sorting data as active user data.

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

s501, acquiring positions of the first merger and the second merger in the merging value in each final data.

It is understood that the first merger in the merged value in each final data is searched for, and the position of the first merger corresponding to each merged value is obtained, and meanwhile, the second merger in the merged value in each final data is searched for, and the position of the second merger corresponding to each merged value is obtained, wherein one merged value corresponds to the position of one first merger, and one merged value corresponds to the position of at least one second merger.

S502, splitting each merged value into a user main key and index merged data at the position of the first merged symbol, and splitting each history value into a history main key and history index merged data at the position of the first merged symbol.

Understandably, each of the merged values is split into the user primary key and the index merged data at the position of the first merger, and simultaneously, each of the history values is split into the history primary key and the history index merged data, for example: the combined value of the final data, 2|def, shown in Table 5; girl; splitting the first merger into a user main key 2 and index merging data def at the position of the first merger; girl; ".

S503, splitting each index combination data into at least one index data at a position corresponding to the second merger, and splitting each history index combination data into at least one history index data at a position corresponding to the second merger.

It is understood that each of the index-merged data is split into at least one index data at a location corresponding to the second merger, while each of the history index-merged data is split into at least one history index data at a location corresponding to the second merger, for example: combining the indexes into data of def; girl; "at the second merger"; the position is split into a plurality of index data of def and girl.

Understandably, the user primary key of the combined value of the final data and the history primary key of the history value of the second sorted data are compared, and the final data after being split is marked as new user data by comparing the user primary key of the combined value of the final data and the history primary key of the history value of the second sorted data, and the final data after being split is marked as active user data by comparing the user primary key of the combined value of the final data and the history primary key of the history value of the second sorted data, which are inconsistent. For example: the combined value of the final data shown in table 5 is subjected to step S50 to obtain new user data shown in table 6 and active user data shown in table 7.

TABLE 6 New user data

Table 7 active user data

In an embodiment, after the step S50, that is, splitting the merged value in the final data into a user primary key and index data, marking the final data with the split user primary key different from a history primary key of one of the history values included in the second ranking data as new user data, and marking the final data with the split user primary key identical to a history primary key of one of the history values included in the second ranking data as active user data, 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 is conveniently and quickly extracted, the KV storage database is a database for providing Key value quick access, and the new user table can be accumulated new user data, so that the user can quickly access and quickly provide the 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 the user maintenance measures.

S60, 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.

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 offering coupons attractive to users, offering rewards integrated attractive to users, and the like.

Therefore, the generalization capability and the accuracy of the model can be improved by inputting the new user data and the active user data into the model at the same time, and the accurate extraction of the data of the new user and the active user as the model input sample data is realized so as to formulate the user maintenance measures of the user group.

According to the invention, the user access data containing the required index data at different time points are subjected to primary key and index data combination to generate a combined value and a historical value, the combined value and the historical value are subjected to the same preset sequencing rule to be sequenced to obtain first sequencing data and second sequencing data respectively, the first sequencing data and the first sequencing data are compared according to the preset comparison rule, the compared final data can be quickly obtained, the final data are split and new user data and active user data are extracted, the user data and the active user data are simultaneously input into a user access model to accept the new user maintenance measures and the active user maintenance measures output by the user access model, so that the access data of the new user and the active user can be quickly and accurately extracted, and the user maintenance measures for attracting the new user and the active user groups are commonly determined in the input model.

In an embodiment, a query device for user access data is provided, where the query device for user access data corresponds to the query method for user access data in the foregoing embodiment one by one. As shown in fig. 6, the query device for accessing data by the user includes an acquisition module 11, a combination module 12, a sorting module 13, a removal module 14, an output module 15 and an application module 16. The functional modules are described in detail as follows:

an obtaining module 11, configured to obtain user access data of all users at a preset time point from a first database, and obtain, from a second database, historical access data obtained at a historical time point before the preset time point; the user access data comprises a user main key and at least one index data; the history access data comprises a history primary key and at least one history index data;

a merging module 12, configured to merge the user 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 merge the history key and all the history index data in each of the history access data into a history value corresponding to each of the history access data;

The sorting module 13 is configured to sort all the merged values according to a preset sorting rule, so as 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, from all the first sorted data, the merged value that is completely consistent with the history value included in the second sorted data, and record, as final data, 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;

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

And the application module 16 is used for 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.

In one embodiment, the merge module 12 includes:

the first acquisition unit is used for acquiring a preset first merger and a preset second merger;

a first merging unit for inserting the second merger after each of the index data in each of the user access data, and merging all of the index data to generate index merged data corresponding to each of the user access data; meanwhile, inserting the second merger after each historical index data in each historical access data, and merging all the historical index data 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 sequentially inserted with 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 merging data corresponding to each history access data are sequentially inserted after the history primary key in each history access data, and the history primary key in which the first merger and the history index merging data corresponding to each history access data are sequentially inserted is marked as the history value.

In one embodiment, the removal module 14 includes:

the second acquisition unit is used for acquiring a comparison rule, marking the history value of the first one of the second ordering data as a comparison history value, and marking the combined value of the first one of the first ordering data as a combined value to be compared; the comparison rule comprises a first rule, a second rule and a third rule;

the corresponding comparison unit is used for comparing the dictionary value corresponding to the comparison history value with the dictionary value corresponding to the combined 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 to-be-compared combined value satisfy the first rule, mark a next one of the history combined values of the sequence in the second ordering data after the comparison history value as a next comparison history value, simultaneously remove the to-be-compared combined value from the first ordering data, mark the combined value of the sequence in the first ordering data after the to-be-compared combined value as a next to-be-compared combined value, and compare the dictionary value corresponding to the next comparison history value with the dictionary value corresponding to the next to-be-compared combined value;

And the traversing unit is used for recording all the combined values remained in the current first ordering data as final data after traversing all the historical values in the second ordering data.

In one embodiment, the removal module 14 further comprises:

and the second comparison unit is used for marking the next merging value of the sequence in the first sequencing data after the merging value to be compared as the next merging value to be compared when the dictionary value corresponding to the comparison historical value and the dictionary value corresponding to the merging value to be compared meet the second rule, and comparing the dictionary value corresponding to the comparison historical value and the dictionary value corresponding to the next merging value to be compared.

In one embodiment, the removal module 14 further comprises:

and the third comparison unit is used for marking the next historical value of the sequence in the second sequencing data after the comparison historical value as the next comparison historical value when the dictionary value corresponding to the comparison historical value and the dictionary value corresponding to the combined value to be compared meet the third rule, and comparing the dictionary value corresponding to the next comparison historical value with the dictionary value corresponding to the combined value to be compared.

In one embodiment, the output module 15 includes:

a third acquisition unit configured to acquire positions of the first and second mergers in the merged value in each of the final data;

the first splitting unit is used for splitting each merged value into user primary key and index merged data at the position of the first merger, and splitting each history value into history primary key and history index merged data at the position of the first merger;

and the second splitting unit is used for splitting each index combination data into at least one index data at a position corresponding to the second merger, and splitting each history index combination data into at least one history index data at a position 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.

The specific limitation of the query device for accessing data by the user can be referred to the limitation of the query method for accessing data by the user hereinabove, and will not be described herein. The various modules in the user access data query device described above may be implemented in whole or in part in software, hardware, and combinations thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above 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 includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program, when executed by a processor, implements a method for querying user access data.

In one embodiment, a computer device is provided that includes a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the method for querying user access data of the above embodiments when the computer program is executed.

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 method of querying user access data in the above embodiments.

Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in embodiments provided herein may include non-volatile and/or volatile memory. The nonvolatile 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), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.

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

The above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the 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 scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention, and are intended to be included in the scope of the present invention.

Claims

1. A method for querying access data by a user, comprising:

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;

said merging said user primary key and all said index data in each said user access data into a merged value corresponding to each said user access data, while merging said history primary key and all said history index data in each said history access data into a history value corresponding to each said history access data, comprising:

acquiring a preset first merger and a preset second merger;

inserting the second merger 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, inserting the second merger after each historical index data in each historical access data, and merging all the historical index data to generate historical index merged data corresponding to each historical access data;

Sequentially inserting the first merger and the index merging data corresponding to each of the user access data after the user primary key in each of the user access data, and marking the user primary key sequentially inserted with the first merger and the index merging 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 merging data corresponding to each history access data are sequentially inserted after the history primary key in each history access data, and the history primary key in which the first merger and the history index merging data corresponding to each history access data are sequentially inserted is marked as the history value;

the splitting the combined value in the final data into a user primary key and index data, and splitting the history value in the second ordering data into a history primary key and history index data, includes:

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

Splitting each merged value into user primary key and index merged data at the position of the first merger, and splitting each historical value into historical primary key and historical index merged data at the position of the first merger;

splitting each index combination data into at least one index data at a position corresponding to the second merger, and splitting each history index combination data into at least one history index data at a position corresponding to the second merger.

2. The method according to claim 1, wherein said removing the merged value that is completely identical to the history value included in the second sorted data from all the first sorted data, recording the first sorted data from which the merged value that is completely identical to the history value included in the second sorted data is removed as final data, includes:

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

Comparing the dictionary value corresponding to the comparison history value with the dictionary value corresponding to the combined value to be compared;

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

after traversing all the historical values in the second ordering data, recording all the combined values remained in the first ordering data as final data.

3. The method for querying the user access data according to claim 2, wherein after comparing the dictionary value corresponding to the comparison history value with the dictionary value corresponding to the combined value to be compared, further comprising:

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

4. The method for querying the user access data according to claim 2, wherein after comparing the dictionary value corresponding to the comparison history value with the dictionary value corresponding to the combined value to be compared, further comprising:

and when the dictionary value corresponding to the comparison historical value and the dictionary value corresponding to the merging value to be compared meet the third rule, marking the next historical value of the sequence in the second sequencing data after the comparison historical value as the next comparison historical value, and comparing the dictionary value corresponding to the next comparison historical value with the dictionary value corresponding to the merging value to be compared.

5. The method for querying user access data according to claim 1, wherein said splitting the combined value in the final data into a user primary key and index data, and splitting the history value in the second ranking data into a history primary key and a history index data, marking the final data after splitting, in which the user primary key is different from a history primary key of one of the history values contained in the second ranking data, as new user data, and marking the final data after splitting, in which the user primary key is identical to a history primary key of one of the history values contained in the second ranking data, as active user data, comprises:

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.

6. A query device for accessing data by a user, comprising:

the application module is used for 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;

The merging module comprises:

the first merging unit is used for inserting the second merger 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, inserting the second merger after each historical index data in each historical access data, and merging all the historical index data 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 sequentially inserted with 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 merging data corresponding to each history access data are sequentially inserted after the history primary key in each history access data, and the history primary key in which the first merger and the history index merging data corresponding to each history access data are sequentially inserted is marked as the history value;

The output module includes:

7. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements a method of querying for user access data according to any of claims 1 to 5 when executing the computer program.

8. A computer readable storage medium storing a computer program, characterized in that the computer program, when executed by a processor, implements a method of querying for access to data by a user according to any of claims 1 to 5.