CN116228305A - Data verification method, device, computer equipment and storage medium - Google Patents
Data verification method, device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN116228305A CN116228305A CN202211680696.8A CN202211680696A CN116228305A CN 116228305 A CN116228305 A CN 116228305A CN 202211680696 A CN202211680696 A CN 202211680696A CN 116228305 A CN116228305 A CN 116228305A
- Authority
- CN
- China
- Prior art keywords
- activity
- verification
- rule tree
- active
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000013524 data verification Methods 0.000 title claims abstract description 83
- 238000000034 method Methods 0.000 title claims abstract description 55
- 230000000694 effects Effects 0.000 claims abstract description 371
- 238000012795 verification Methods 0.000 claims abstract description 134
- 230000000875 corresponding effect Effects 0.000 claims abstract description 104
- 238000004590 computer program Methods 0.000 claims abstract description 26
- 230000008676 import Effects 0.000 claims description 30
- 238000012545 processing Methods 0.000 claims description 6
- 230000008569 process Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 3
- 238000012217 deletion Methods 0.000 description 3
- 230000037430 deletion Effects 0.000 description 3
- 238000013475 authorization Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- OKTJSMMVPCPJKN-UHFFFAOYSA-N Carbon Chemical compound [C] OKTJSMMVPCPJKN-UHFFFAOYSA-N 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 229910021389 graphene Inorganic materials 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24564—Applying rules; Deductive queries
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Finance (AREA)
- Data Mining & Analysis (AREA)
- Strategic Management (AREA)
- General Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Computational Linguistics (AREA)
- Game Theory and Decision Science (AREA)
- Marketing (AREA)
- Economics (AREA)
- Software Systems (AREA)
- Debugging And Monitoring (AREA)
Abstract
The present application relates to a data verification method, apparatus, computer device, storage medium and computer program product. The method comprises the following steps: and receiving an activity participation request, wherein the activity participation request carries activity identification information and activity basic information, acquiring a corresponding activity verification rule tree according to the activity identification information, wherein the activity verification rule tree comprises a plurality of rule tree branches, sequentially carrying out data verification on the activity basic information according to activity verification rules in nodes of each rule tree branch, and carrying out data verification on the activity basic information according to the activity verification rules in nodes of the next rule tree branch if the activity basic information does not meet the activity verification rules of the current node until an activity result corresponding to the activity basic information is matched, wherein the activity verification rule tree is generated based on activity verification tag configuration data and service demand data. By adopting the method, repeated data verification operation is avoided, and the verification rate is greatly improved.
Description
Technical Field
The present invention relates to the field of big data technology, and in particular, to a data verification method, apparatus, computer device, storage medium, and computer program product.
Background
With the vigorous development of internet technology and electronic commerce platforms, online marketing activities become one of the most commonly used marketing popularization modes. The operation direction is gradually developed towards refined operation, and the refined operation represents that more data need to be distinguished, and correspondingly, more data need to be configured.
At present, taking an online activity invitation as an example, when a user participates in an activity, a server side does not know whether the user accords with the participation condition of the activity and which activity rewards should be matched finally, so the server side traverses the data tag rules of all rewards by the dimension of the rewards, and each user checks the data tags of all the rewards under the activity when participating in the activity. Thus, the system verification process is too long, and there are a large number of problems of repeated verification of data tags. Therefore, the current active verification scheme has the problem of repeatedly verifying the data tag, so that the server needs to execute repeated data verification operations for a plurality of times, and the data verification rate is seriously affected.
It can be seen that there is a need to provide a scheme that can reduce duplicate checks and increase the data check rate.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a data verification method, apparatus, computer device, computer readable storage medium, and computer program product that can reduce duplicate verification and increase the data verification rate.
In a first aspect, the present application provides a data verification method. The method comprises the following steps:
receiving an activity participation request, wherein the activity participation request carries activity identification information and activity basic information;
acquiring a corresponding activity check rule tree according to the activity identification information, wherein the activity check rule tree comprises a plurality of rule tree branches;
sequentially carrying out data verification on the activity basic information according to the activity verification rules in the nodes of each rule tree branch;
if the activity basic information does not meet the activity verification rule of the current node, carrying out data verification on the activity basic information according to the activity verification rule in the node of the branch of the next rule tree until an activity result corresponding to the activity basic information is matched;
wherein the active verification rule tree is generated based on the active verification tag configuration data and the business requirement data.
In one embodiment, the active check rule tree is derived based on the following:
Responding to the data tag import message, and extracting an active tag carried by the data tag import message;
responding to the active prize import message, extracting an active prize label carried by the active prize import message and a score range corresponding to the active prize label, wherein the active prize label and the score range are determined based on the service demand data;
generating a plurality of rule tree branches based on the activity label;
and obtaining the average score of each rule tree branch, and matching the corresponding active prize label for each rule tree branch based on the average score of each rule tree branch and the score range corresponding to the active prize label to obtain the active rule tree.
In one embodiment, generating a plurality of rule tree branches based on the activity label includes:
recursively traversing the active tags;
generating nodes corresponding to the active tags based on tag value option data in each active tag;
and combining the nodes to obtain a plurality of rule tree branches.
In one embodiment, obtaining the corresponding activity verification rule tree according to the activity identification information includes:
according to the activity identification information, searching the identification information of the rule tree root node corresponding to the activity identification information;
And obtaining a corresponding active check rule tree according to the identification information of the root node of the rule tree.
In one embodiment, after sequentially performing data verification on the activity basic information according to the rule tree branches, the method further includes:
if the activity basic information meets the activity verification rule in the current node and the next node is the prize data, judging that the activity result corresponding to the activity basic information is a winning prize.
In one embodiment, before acquiring the corresponding activity verification rule tree according to the activity identification information, the method further includes:
performing validity check on the activity basic information;
according to the activity identification information, the obtaining of the corresponding activity verification rule tree comprises the following steps:
and if the activity basic information passes the validity check, acquiring a corresponding activity check rule tree according to the activity identification information.
In a second aspect, the present application further provides a data verification apparatus. The device comprises:
the request receiving module is used for receiving an activity participation request, wherein the activity participation request carries activity identification information and activity basic information;
the rule tree acquisition module is used for acquiring a corresponding activity check rule tree according to the activity identification information, wherein the activity check rule tree comprises a plurality of rule tree branches;
The data verification module is used for sequentially verifying the data of the activity basic information according to the activity verification rules in the nodes of each rule tree branch;
the activity result matching module is used for carrying out data verification on the activity basic information according to the activity verification rule in the node of the next rule tree branch if the activity basic information does not meet the activity verification rule of the current node until an activity result corresponding to the activity basic information is matched;
wherein the active verification rule tree is generated based on the active verification tag configuration data and the business requirement data.
In a third aspect, the present application also provides a computer device. The computer device comprises a memory storing a computer program and a processor which when executing the computer program performs the steps of:
receiving an activity participation request, wherein the activity participation request carries activity identification information and activity basic information;
acquiring a corresponding activity check rule tree according to the activity identification information, wherein the activity check rule tree comprises a plurality of rule tree branches;
sequentially carrying out data verification on the activity basic information according to the activity verification rules in the nodes of each rule tree branch;
If the activity basic information does not meet the activity verification rule of the current node, carrying out data verification on the activity basic information according to the activity verification rule in the node of the branch of the next rule tree until an activity result corresponding to the activity basic information is matched;
wherein the active verification rule tree is generated based on the active verification tag configuration data and the business requirement data.
In a fourth aspect, the present application also provides a computer-readable storage medium. The computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of:
receiving an activity participation request, wherein the activity participation request carries activity identification information and activity basic information;
acquiring a corresponding activity check rule tree according to the activity identification information, wherein the activity check rule tree comprises a plurality of rule tree branches;
sequentially carrying out data verification on the activity basic information according to the activity verification rules in the nodes of each rule tree branch;
if the activity basic information does not meet the activity verification rule of the current node, carrying out data verification on the activity basic information according to the activity verification rule in the node of the branch of the next rule tree until an activity result corresponding to the activity basic information is matched;
Wherein the active verification rule tree is generated based on the active verification tag configuration data and the business requirement data.
In a fifth aspect, the present application also provides a computer program product. The computer program product comprises a computer program which, when executed by a processor, implements the steps of:
receiving an activity participation request, wherein the activity participation request carries activity identification information and activity basic information;
acquiring a corresponding activity check rule tree according to the activity identification information, wherein the activity check rule tree comprises a plurality of rule tree branches;
sequentially carrying out data verification on the activity basic information according to the activity verification rules in the nodes of each rule tree branch;
if the activity basic information does not meet the activity verification rule of the current node, carrying out data verification on the activity basic information according to the activity verification rule in the node of the branch of the next rule tree until an activity result corresponding to the activity basic information is matched;
wherein the active verification rule tree is generated based on the active verification tag configuration data and the business requirement data.
The data verification method, the device, the computer equipment, the storage medium and the computer program product are used for receiving an activity participation request, wherein the activity participation request carries activity identification information and activity basic information, then, a corresponding activity verification rule tree is obtained according to the activity identification information, wherein the activity verification rule tree is generated based on activity verification tag configuration data and business requirement data, then, the activity basic information is subjected to data verification according to the activity verification rules in the nodes of all rule tree branches in sequence, and if the activity basic information does not meet the activity verification rules in the current node, the activity basic information is subjected to data verification according to the next rule tree branch until an activity result corresponding to the activity basic information is matched. According to the data verification scheme, the active verification rule tree meeting the service requirements can be automatically generated according to the service requirement data and the active verification tag configuration data, in the verification process, the active basic information of the user is not verified by the dimension of the rewards, but is verified by the active verification rule tree, if the active basic information does not meet the active verification rule in the current node, the active basic information is verified according to the next rule tree branch, so that one data verification rule is verified only once, repeated data verification operation is avoided, and the verification rate is greatly improved.
Drawings
FIG. 1 is an application environment diagram of a data verification method in one embodiment;
FIG. 2 is a flow chart of a data verification method in one embodiment;
FIG. 3 is a flow diagram of the active verification rule Tree generation step in one embodiment;
FIG. 4 is a flowchart illustrating a data verification method according to another embodiment;
FIG. 5 is a flow chart of a data verification method according to yet another embodiment;
FIG. 6 is a block diagram of a data verification device in one embodiment;
FIG. 7 is a block diagram of a data verification device in another embodiment;
fig. 8 is an internal structural diagram of a computer device in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.
The data verification method provided by the embodiment of the application can be applied to an application environment shown in fig. 1. Wherein the terminal 102 communicates with the server 104 via a network. The data storage system may store data that the server 104 needs to process. The data storage system may be integrated on the server 104 or may be located on a cloud or other network server. Specifically, the user may send an activity participation request carrying activity identification information and activity basic information of the user to the server 104 through the terminal 102, the server 104 receives the activity participation request, and the activity participation request carries the activity identification information and the activity basic information, obtains a corresponding activity check rule tree according to the activity identification information, and sequentially performs data check on the activity basic information according to the activity check rule in the node of each rule tree branch, and if the activity basic information does not meet the activity check rule of the current node, performs data check on the activity basic information according to the activity check rule in the node of the next rule tree branch until an activity result corresponding to the activity basic information is matched, where the activity check rule tree is generated based on the activity check tag configuration data and the service requirement data. The terminal 102 may be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, internet of things devices, and portable wearable devices, where the internet of things devices may be smart speakers, smart televisions, smart air conditioners, smart vehicle devices, and the like. The portable wearable device may be a smart watch, smart bracelet, headset, or the like. The server 104 may be implemented as a stand-alone server or as a server cluster of multiple servers.
In one embodiment, as shown in fig. 2, a data verification method is provided, and the method is applied to the server 104 in fig. 1 for illustration, and includes the following steps:
step S202, an activity participation request is received, wherein the activity participation request carries activity identification information and activity basic information.
The activity identification information includes an activity number and an activity name. In this embodiment, activity identification information is exemplified by activity id (identity). The activity base information includes basic attribute information of the user, user tag data, and related information of participation activities of the user. Wherein, the user basic attribute information comprises occupation, income level and the like. The activity basic information of the user is obtained through user authorization. The user tag data may include blacklisted users and whitelisted users. In practical application, the user may click on an active link and send an active participation request to the server 104, where the active participation request carries an activity id and activity basic information.
Step S204, according to the activity identification information, a corresponding activity check rule tree is obtained, the activity check rule tree comprises a plurality of nodes, and the activity check rule tree is generated based on the activity check tag configuration data and the service demand data.
In practical application, a developer aims at the problem that a large number of repeated checks exist in a system, a function for automatically generating data tag check rules is added, the developer can configure an active check tag according to service requirements by using the function, and the server 104 can automatically generate an active check rule tree meeting the service requirements according to the configuration data of the active check tag configured by the developer according to the service requirements. Specifically, the active check rule tree includes a plurality of rule tree branches, each rule tree branch includes a plurality of nodes, each node includes rule body data, and specifically, the rule body data includes information such as node id, previous node id, next check node id, tag coding, check rule body, creation time, update time, deletion identifier, and the like.
In a specific implementation, after the server 104 receives the activity participation request, after obtaining the information acquisition authorization of the user, activity identification information and activity basic information in the activity participation request may be extracted. And then searching in a preset database according to the activity identification information to obtain a corresponding activity verification rule tree.
Step S206, data verification is carried out on the activity basic information according to the activity verification rules in the nodes of each rule tree branch in sequence.
In this embodiment, the activity result includes a winning and a losing, if the activity result is a winning, a payoff process is required, and if the activity result is a losing, a losing message is pushed to the user terminal. In the foregoing embodiment, after the active verification rule tree is obtained, data verification may be performed on the active basic information according to the active verification rule tree, where the data verification refers to verifying whether the active basic information meets the verification rule in each node. Specifically, the data verification may be performed on the activity basic information sequentially according to the activity verification rules in the nodes of each rule tree branch.
Step S208, if the activity basic information does not meet the activity verification rule in the current node, performing data verification on the activity basic information according to the activity verification rule in the next branch until the activity result corresponding to the activity basic information is matched, until the activity result corresponding to the activity basic information is matched.
In the specific data verification process, the method can start from the root node of the active verification rule tree, verify the active basic information according to the verification rules in the verification rule body in the nodes in sequence according to the data flow direction of the branches of the rule tree, and if the active basic information does not meet the active verification rules in the current node, exit the method to obtain the next node, and verify the active basic information according to the active verification rules in the next node; if the activity basic information meets the activity verification rule in the current node, judging whether the activity basic information meets the activity verification rule of the next node or not until an activity result corresponding to the activity basic information is matched.
In the data verification method, an activity participation request is received, the activity participation request carries activity identification information and activity basic information, then a corresponding activity verification rule tree is obtained according to the activity identification information, wherein the activity verification rule tree is generated based on activity verification tag configuration data and business requirement data, then the activity basic information is subjected to data verification according to the activity verification rules in the nodes of all rule tree branches in sequence, and if the activity basic information does not meet the activity verification rules in the current node, the activity basic information is subjected to data verification according to the next rule tree branch until an activity result corresponding to the activity basic information is matched. According to the data verification scheme, the active verification rule tree meeting the service requirements can be automatically generated according to the service requirement data and the active verification tag configuration data, in the verification process, the active basic information of the user is not verified by the dimension of the rewards, but is verified by the active verification rule tree, if the active basic information does not meet the active verification rule in the current node, the active basic information is verified according to the next rule tree branch, so that one data verification rule is verified only once, repeated data verification operation is avoided, and the verification rate is greatly improved.
As shown in FIG. 3, in one embodiment, the active check rule tree is derived based on the following:
step S100, responding to the data tag import message, and extracting the active tag carried by the data tag import message.
Step S200, in response to the active prize import message, extracting an active prize label carried by the active prize import message and a score range corresponding to the active prize label, wherein the active prize label and the score range are determined based on the service demand data.
Step S300, generating a plurality of rule tree branches based on the activity label.
Step S400, obtaining the average score of each rule tree branch, and matching the corresponding active prize label for each rule tree branch based on the average score of each rule tree branch and the score range corresponding to the active prize label to obtain the active rule tree.
In practical application, a developer configures an activity verification tag on an activity configuration interface and sets a corresponding score range. Specifically, the activity label includes an activity level, a risk level, and a black-and-white list of the user. The active grade is divided into high, medium and low, the score corresponding to the high of the active grade is 10 scores, the score corresponding to the medium of the active grade is 5 scores, and the score corresponding to the low of the active grade is 1 score. The risk class is classified into low, medium and high, the score set corresponding to the risk class of "high" is 10 points, the risk class of "medium" is 5 points, the score set corresponding to the risk class of "low" is 1 point. Black and white names include black lists and white lists. The activity prize data includes prizes and corresponding score settings for the prizes. For example, the score of the corresponding setting of the prize "basketball shoes" is 1-2, the score of the corresponding setting of the prize "mobile phone" is 3-9, and the score of the corresponding setting of the prize "notebook" is 10.
In practical application, the generation mode of the active verification rule tree may be: the developer inputs the active data tag in the data tag rule configuration interface of the terminal 102, then clicks the data tag import operation, the terminal 102 generates a data tag import message, and sends the data tag import message to the server 104, and the server 104 responds to the data tag import message to extract the active tag carried by the data tag import message. Then, the developer inputs the active prize data and sets a corresponding score for each prize in the prize data configuration interface, clicks the active prize import operation, generates an active prize import message by the terminal 102, sends the active prize import message to the server 104, and the server 104 responds to the active prize import message to extract an active prize label and a corresponding score range carried by the active prize import message. And generating a plurality of rule tree branches according to the imported active data labels and the score ranges and a preset rule tree data structure, calculating the score of each rule tree branch, wherein the score can be an average score, and matching corresponding active rewards for each rule tree branch according to the score ranges set by each active rewards to obtain an active verification rule tree. For example, if the average score of the rule tree branch a is 8, according to the score range set by the active prize, the rule tree branch a may set the corresponding active prize as "mobile phone", and use the active prize "mobile phone" as the last node of the rule tree branch a, so far, the active verification rule tree is generated. In this embodiment, by setting a score for each active prize, calculating an average score of each rule tree branch, and matching corresponding active prize data for each rule tree branch, it is possible to generate a matched active verification rule tree according to service requirements.
In one embodiment, step S300 includes: and recursively traversing the active tags, generating nodes corresponding to the active tags based on tag value option data in each active tag, and combining the nodes to obtain a plurality of rule tree branches.
The tag value option data of the active tag refers to the value of each active tag input by the user. Specifically, the active tag body data structure includes a tag unique identifier, a tag name, a creation time, an update time, a deletion identifier, and the like. The tag value option data structure includes a tag value option unique identifier, a code value of the tag, a score of the tag value, a description of the value, creation time, update time, delete identifier, and the like. In specific implementation, the process of generating the rule tree branches may be: according to the imported active labels, recursively traversing each active label, then generating nodes corresponding to the active labels based on label value option data in each active label, and then generating each rule tree branch possibly existing according to a preset permutation and combination algorithm to obtain a complete active verification rule tree. In this embodiment, all rule tree branches that may exist are generated by combining nodes, so that the generated rule tree branches are more comprehensive and rich, and the active check rule tree can flexibly cope with more complex service scenarios.
As shown in fig. 4, in one embodiment, step S204 includes: step S224, according to the activity identification information, the identification information of the rule tree root node corresponding to the activity identification information is searched, and according to the identification information of the rule tree root node, a corresponding activity check rule tree is obtained, and the activity check rule tree is generated based on the activity check tag configuration data and the service demand data.
The rule tree root node refers to the root node of the active check rule tree. The identification information of the root node of the rule tree may be a root node id or a root node number. In practical applications, since the types of activities may be rich and varied, a corresponding activity verification rule tree may be created for each type of activity. The association relation between the activities and the activity check rule tree can be established in advance by a developer, so that the corresponding activity check rule tree can be directly searched for according to the activity identification information. Specifically, each category of activity data structure may include an activity unique identifier, activity identification information such as an activity id, a rule root node id, a creation time, an update time, a deletion identifier, and the like. Therefore, in the implementation, the rule tree root node id corresponding to the activity id can be found according to the activity id, and then the activity check rule tree corresponding to the rule tree root node id can be found according to the rule tree root node id. In this embodiment, an association relationship between an activity and an activity verification rule tree is pre-established, so that when an activity participation request is received, a corresponding activity verification rule tree can be quickly found according to activity identification information in the activity participation request.
As shown in fig. 4, in one embodiment, after sequentially performing data verification on the activity basic information according to the rule tree branches, the method further includes:
step S210, if the activity basic information meets the activity verification rule in the current node and the next node is the prize data, determining that the activity result corresponding to the activity basic information is a winning.
In practical application, the activity prize data may be used as the last node in the rule tree branches, so as to ensure that the activity basic information meets all activity verification rules and ensure accurate prize delivery. In the specific implementation, the data verification is performed on the activity basic information according to the rule tree branches, that is, if the activity basic information meets the activity verification rule in the current node, the verification is performed according to the verification rule in the next node, after multiple times of verification, if the activity basic information meets the activity verification rule in the current node, and the next node is the prize data, the user is judged to win, the activity result corresponding to the activity basic information is winning, and meanwhile, a prize-drawing message can be sent to a prize-drawing module, so that the prize-drawing module sends a prize-drawing notification message to the user terminal, and correspondingly sends a prize-drawing processing message to the corresponding prize distribution module, so as to execute the prize-drawing operation. If the activity basic information does not meet the activity verification rule in the current node, exiting, traversing the next rule tree branch, verifying the activity basic information according to the rule tree branch, and if the activity basic information does not meet the activity verification rule in the current node and the current node is the last node, judging that the user is not winning, and meanwhile, pushing a non-winning message to the user terminal, wherein the activity result corresponding to the activity basic information is not winning. In this embodiment, the active prize data is used as the last node in the rule tree branch, and the active basic information is doubly checked by the active check rule in the node and the active prize data in the end node, so that accurate prize delivery can be ensured.
As shown in fig. 5, in one embodiment, before step S204, the method further includes: step S203, performing validity check on the activity basic information, step S204 includes: step S244, if the activity basic information passes the validity check, a corresponding activity check rule tree is obtained according to the activity identification information.
As described in the above embodiment, since the activity base information includes multidimensional information, validity check may be performed on the activity base information before the activity check rule tree is obtained, specifically, validity check including space logic check, standard code check, extended attribute check, etc. may be performed on the activity base information, if the activity base information passes the validity check, the corresponding activity check rule tree is obtained according to the activity id according to the activity identification information, and if the activity base information does not pass the validity check, a data exception message is pushed to the user terminal, so that the user terminal corrects in time. In this embodiment, by performing data validity check on the activity basic information, orderly performance of data activity verification can be ensured.
For a clearer description of the data verification method provided in the present application, the following description is made with reference to fig. 5 and a specific embodiment, where the specific embodiment may include the following:
Step S202, an activity participation request is received, wherein the activity participation request carries activity identification information and activity basic information.
Step S203, validity check is carried out on the activity basic information.
Step S224, if the activity basic information passes the validity check, the corresponding activity check rule tree is obtained according to the activity identification information. Specifically, the identification information of the rule tree root node corresponding to the active identification information can be found according to the active identification information, and the corresponding active verification rule tree can be obtained according to the identification information of the rule tree root node.
Wherein the activity check rule tree is obtained based on the following manner: and responding to the data tag import message, and extracting the active tag carried by the data tag import message. And responding to the active prize import message, extracting an active prize label carried by the active prize import message and a score range corresponding to the active prize label, wherein the active prize label and the score range are determined based on the service demand data. Based on the activity label, a plurality of rule tree branches are generated.
And obtaining the average score of each rule tree branch, and matching the corresponding active prize label for each rule tree branch based on the average score of each rule tree branch and the score range corresponding to the active prize label 5 to obtain the active rule tree.
Step S206, data verification is carried out on the activity basic information according to the activity verification rules in the nodes of each rule tree branch in sequence.
Step S208, if the activity basic information does not meet the activity verification rule in the current node, performing data verification on the activity basic information according to the activity verification rule in the next 0 branch until the activity result corresponding to the activity basic information is matched, until the activity result corresponding to the activity basic information is matched.
Step S210, if the activity basic information meets the activity verification rule in the current node and the next node is the prize data, determining that the activity result corresponding to the activity basic information is a winning.
It should be understood that, although the steps in the flowcharts related to the embodiments described above are shown in order as indicated by the arrow 5, these steps are not necessarily performed in order as indicated by the arrow. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in the flowcharts described in connection with the various embodiments described above may comprise a plurality of steps or stages, which are not necessarily required
The order of execution of 0 of these steps or phases is not necessarily sequential, but may be performed by turns or alternately with other steps or at least a portion of steps or phases among other steps, performed at the same time, but may be performed at different times.
Based on the same inventive concept, the embodiment of the application also provides a data verification device for realizing the above related data verification method. Implementation scheme for solving problems provided by device and method
The implementation schemes described in the method are similar, so the specific limitation in embodiment 5 of one or more data verification apparatuses provided below can be referred to above for limitation of the data verification method, and will not be repeated here.
In one embodiment, as shown in fig. 6, there is provided a data verification apparatus, including: a request receiving module 510, a rule tree obtaining module 520, a data checking module 530, and an activity result matching module 540, wherein:
the request receiving module 510 is configured to receive an activity participation request, where the activity participation request carries activity identification information and activity basic information.
The rule tree obtaining module 520 is configured to obtain a corresponding activity check rule tree according to the activity identification information, where the activity check rule tree includes a plurality of rule tree branches.
The data verification module 530 is configured to perform data verification on the activity basic information sequentially according to the activity verification rules in the nodes of each rule tree branch.
And the activity result matching module 540 is configured to, if the activity basic information does not meet the activity verification rule of the current node, perform data verification on the activity basic information according to the activity verification rule in the node of the next rule tree branch until an activity result corresponding to the activity basic information is matched.
Wherein the active verification rule tree is generated based on the active verification tag configuration data and the business requirement data.
In the data verification device, the request receiving module receives an activity participation request, the activity participation request carries activity identification information and activity basic information, and then the rule tree acquisition module acquires a corresponding activity verification rule tree according to the activity identification information, wherein the activity verification rule tree is generated based on the activity verification tag configuration data and the service demand data. And the data verification module performs data verification on the activity basic information according to the activity verification rules in the nodes of each rule tree branch in sequence, and performs data verification on the activity basic information according to the next rule tree branch if the activity basic information does not meet the activity verification rules in the current node until an activity result corresponding to the activity basic information is matched. According to the data verification scheme, the active verification rule tree meeting the service requirements can be automatically generated according to the service requirement data and the active verification tag configuration data, in the verification process, the active basic information of the user is not verified by the dimension of the rewards, but is verified by the active verification rule tree, if the active basic information does not meet the active verification rule in the current node, the active basic information is verified according to the next rule tree branch, so that one data verification rule is verified only once, repeated data verification operation is avoided, and the verification rate is greatly improved.
As shown in fig. 7, in one embodiment, the apparatus further includes a rule tree construction module 550, configured to respond to the data tag import message, extract an active tag carried by the data tag import message, respond to the active prize import message, extract an active prize tag carried by the active prize import message and a score range corresponding to the active prize tag, determine the active prize tag and the score range based on the service requirement data, generate a plurality of rule tree branches based on the active tag, obtain an average score of each rule tree branch, and match the corresponding active prize tag for each rule tree branch based on the average score of each rule tree branch and the score range corresponding to the active prize tag, so as to obtain an active rule tree.
In one embodiment, the rule tree construction module 550 is further configured to recursively traverse the active labels, generate nodes corresponding to the active labels based on label value option data in each active label, and combine the nodes to obtain a plurality of rule tree branches.
In one embodiment, the rule tree obtaining module 520 is further configured to find, according to the activity identification information, identification information of a rule tree root node corresponding to the activity identification information, and obtain, according to the identification information of the rule tree root node, a corresponding activity check rule tree.
In one embodiment, the activity result matching module 540 is further configured to determine that the activity result corresponding to the activity base information is a prize if the activity base information satisfies the activity verification rule in the current node and the next node is the prize data.
As shown in FIG. 7, in one embodiment, the apparatus further comprises a validity check module 560 for validity checking of the activity base information;
the rule tree acquisition module 520 is further configured to acquire a corresponding activity verification rule tree according to the activity identification information if the activity basic information passes the validity check.
The modules in the data verification device can be implemented in whole or in part by software, hardware and a combination 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, and the internal structure of which may be as shown in fig. 8. The computer device includes a processor, a memory, an Input/Output interface (I/O) and a communication interface. The processor, the memory and the input/output interface are connected through a system bus, and the communication interface is connected to the system bus through the input/output interface. 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 database of the computer device is used for storing data such as activity basic information, activity labels, activity check rule trees and the like. The input/output interface of the computer device is used to exchange information between the processor and the external device. The communication 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 data verification method.
It will be appreciated by those skilled in the art that the structure shown in fig. 8 is merely a block diagram of some of the structures associated with the present application and is not limiting of the computer device to which the present application may be applied, and that a particular computer device may include more or fewer components than shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is provided that includes a memory having a computer program stored therein and a processor that implements the steps of the data verification method described above when the computer program is executed.
In one embodiment, a computer readable storage medium is provided having a computer program stored thereon, which when executed by a processor implements the steps of the data verification method described above.
In one embodiment, a computer program product is provided comprising a computer program which, when executed by a processor, implements the steps of the data verification method described above.
It should be noted that, the user information (including, but not limited to, user equipment information, user personal information, etc.) and the data (including, but not limited to, data for analysis, stored data, presented data, etc.) referred to in the present application are information and data authorized by the user or sufficiently authorized by each party, and the collection, use and processing of the related data are required to comply with the related laws and regulations and standards of the related countries and regions.
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, database, or other medium used in the various embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high density embedded nonvolatile Memory, resistive random access Memory (ReRAM), magnetic random access Memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric Memory (Ferroelectric Random Access Memory, FRAM), phase change Memory (Phase Change Memory, PCM), graphene Memory, and the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, and the like. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like. The databases referred to in the various embodiments provided herein may include at least one of relational databases and non-relational databases. The non-relational database may include, but is not limited to, a blockchain-based distributed database, and the like. The processors referred to in the embodiments provided herein may be general purpose processors, central processing units, graphics processors, digital signal processors, programmable logic units, quantum computing-based data processing logic units, etc., without being limited thereto.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples only represent a few embodiments of the present application, which are described in more detail and are not to be construed as limiting the scope of the present application. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made without departing from the spirit of the present application, which would be within the scope of the present application. Accordingly, the scope of protection of the present application shall be subject to the appended claims.
Claims (10)
1. A method of data verification, the method comprising:
receiving an activity participation request, wherein the activity participation request carries activity identification information and activity basic information;
acquiring a corresponding activity check rule tree according to the activity identification information, wherein the activity check rule tree comprises a plurality of rule tree branches;
sequentially carrying out data verification on the activity basic information according to activity verification rules in the nodes of each rule tree branch;
If the activity basic information does not meet the activity verification rule of the current node, carrying out data verification on the activity basic information according to the activity verification rule in the node of the next rule tree branch until an activity result corresponding to the activity basic information is matched;
wherein the active verification rule tree is generated based on the active verification tag configuration data and the business requirement data.
2. The method of claim 1, wherein the active check rule tree is generated based on:
responding to a data tag import message, and extracting an active tag carried by the data tag import message;
responding to an active prize import message, extracting an active prize label carried by the active prize import message and a score range corresponding to the active prize label, wherein the active prize label and the score range are determined based on service demand data;
generating a plurality of rule tree branches based on the activity label;
obtaining average scores of all the rule tree branches, and matching corresponding active prize labels for all the rule tree branches based on the average scores of all the rule tree branches and the score ranges corresponding to the active prize labels to obtain an active rule tree.
3. The method of claim 2, wherein generating a plurality of rule tree branches based on the activity label comprises:
recursively traversing the active tags;
generating nodes corresponding to the active tags based on tag value option data in each active tag;
and combining the nodes to obtain a plurality of rule tree branches.
4. The method of claim 1, wherein the obtaining a corresponding activity verification rule tree from the activity identification information comprises:
searching the identification information of the rule tree root node corresponding to the activity identification information according to the activity identification information;
and acquiring a corresponding activity check rule tree according to the identification information of the rule tree root node.
5. The method according to any one of claims 1 to 4, wherein after said sequentially performing data verification on said activity base information according to said rule tree branches, said method further comprises:
and if the activity basic information meets the activity verification rule in the current node and the next node is the prize data, judging that the activity result corresponding to the activity basic information is a winning prize.
6. The method according to any one of claims 1 to 4, wherein before the obtaining the corresponding activity verification rule tree according to the activity identification information, the method further comprises:
performing validity check on the activity basic information;
the step of obtaining the corresponding activity verification rule tree according to the activity identification information comprises the following steps:
and when the activity basic information passes the validity check, acquiring a corresponding activity check rule tree according to the activity identification information.
7. A data verification device, the device comprising:
the system comprises a request receiving module, a request processing module and a request processing module, wherein the request receiving module is used for receiving an activity participation request, and the activity participation request carries activity identification information and activity basic information;
the rule tree acquisition module is used for acquiring a corresponding activity check rule tree according to the activity identification information, wherein the activity check rule tree comprises a plurality of rule tree branches;
the data verification module is used for sequentially verifying the data of the activity basic information according to the activity verification rules in the nodes of each rule tree branch;
the activity result matching module is used for carrying out data verification on the activity basic information according to the activity verification rule in the node of the next rule tree branch if the activity basic information does not meet the activity verification rule of the current node until an activity result corresponding to the activity basic information is matched;
Wherein the active verification rule tree is generated based on the active verification tag configuration data and the business requirement data.
8. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 6 when the computer program is executed.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 6.
10. A computer program product comprising a computer program, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211680696.8A CN116228305A (en) | 2022-12-27 | 2022-12-27 | Data verification method, device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211680696.8A CN116228305A (en) | 2022-12-27 | 2022-12-27 | Data verification method, device, computer equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116228305A true CN116228305A (en) | 2023-06-06 |
Family
ID=86579536
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211680696.8A Pending CN116228305A (en) | 2022-12-27 | 2022-12-27 | Data verification method, device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116228305A (en) |
-
2022
- 2022-12-27 CN CN202211680696.8A patent/CN116228305A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Serafino et al. | True scale-free networks hidden by finite size effects | |
| CN111339436B (en) | Data identification method, device, equipment and readable storage medium | |
| CN105894028B (en) | User identification method and device | |
| CN110674247A (en) | Barrage information intercepting method and device, storage medium and equipment | |
| CN112084179B (en) | Data processing method, device, equipment and storage medium | |
| CN111124883A (en) | Test case library introduction method, system and equipment based on tree form | |
| CN114490673B (en) | Data information processing method and device, electronic equipment and storage medium | |
| CN113448876B (en) | Service testing method, device, computer equipment and storage medium | |
| CN116228305A (en) | Data verification method, device, computer equipment and storage medium | |
| CN114461606A (en) | Data storage method and device, computer equipment and storage medium | |
| CN113468037A (en) | Data quality evaluation method, device, medium and electronic equipment | |
| CN112528189A (en) | Data-based component packaging method and device, computer equipment and storage medium | |
| CN111966919A (en) | Event message processing method, device and equipment | |
| CN110879835A (en) | Data processing method, device and equipment based on block chain and readable storage medium | |
| CN117610815A (en) | Resource quota data processing method, device, computer equipment and storage medium | |
| CN116881164A (en) | Verification and correction method, device and equipment for test data in financial information system | |
| CN117033591A (en) | Problem solving method, device, computer equipment and storage medium | |
| CN115629958A (en) | Universal field level automatic checking method and device for different service interfaces | |
| CN116166879A (en) | Sharing service processing method, device, computer equipment and storage medium | |
| CN114186963A (en) | Service data processing method and device, computer equipment and storage medium | |
| CN117278625A (en) | Message conversion method, device, computer equipment and storage medium | |
| CN117952748A (en) | Smart contract processing method, smart contract processing device, smart contract processing apparatus, smart contract processing device, smart contract processing program product, and smart contract processing program product | |
| CN114240683A (en) | Group creation method, group creation device, computer equipment and storage medium | |
| CN117453561A (en) | Test script calling method, device, computer equipment and storage medium | |
| CN113780413A (en) | Group risk identification method and device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Country or region after: China Address after: 518000 Room 201, building A, No. 1, Qian Wan Road, Qianhai Shenzhen Hong Kong cooperation zone, Shenzhen, Guangdong (Shenzhen Qianhai business secretary Co., Ltd.) Applicant after: Zhaolian Consumer Finance Co.,Ltd. Address before: 518000 Room 201, building A, No. 1, Qian Wan Road, Qianhai Shenzhen Hong Kong cooperation zone, Shenzhen, Guangdong (Shenzhen Qianhai business secretary Co., Ltd.) Applicant before: MERCHANTS UNION CONSUMER FINANCE Co.,Ltd. Country or region before: China |