CN115034792A - Low-coupling transaction early warning method and system based on message queue - Google Patents

Low-coupling transaction early warning method and system based on message queue Download PDF

Info

Publication number
CN115034792A
CN115034792A CN202210605011.7A CN202210605011A CN115034792A CN 115034792 A CN115034792 A CN 115034792A CN 202210605011 A CN202210605011 A CN 202210605011A CN 115034792 A CN115034792 A CN 115034792A
Authority
CN
China
Prior art keywords
transaction
checking
request
message queue
early warning
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
Application number
CN202210605011.7A
Other languages
Chinese (zh)
Inventor
谢金鑫
马鸿军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
CITIC Aibank Corp Ltd
Original Assignee
CITIC Aibank Corp Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by CITIC Aibank Corp Ltd filed Critical CITIC Aibank Corp Ltd
Priority to CN202210605011.7A priority Critical patent/CN115034792A/en
Publication of CN115034792A publication Critical patent/CN115034792A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/40Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G06Q20/401Transaction verification
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28Databases characterised by their database models, e.g. relational or object models
    • G06F16/283Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/54Interprogram communication
    • G06F9/546Message passing systems or structures, e.g. queues
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Commerce
    • G06Q30/018Certifying business or products
    • G06Q30/0185Product, service or business identity fraud
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Accounting & Taxation (AREA)
  • General Physics & Mathematics (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • Databases & Information Systems (AREA)
  • General Business, Economics & Management (AREA)
  • Economics (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Data Mining & Analysis (AREA)
  • Technology Law (AREA)
  • Computer Security & Cryptography (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Abstract

The invention relates to a low-coupling transaction early warning method and a system based on a message queue, which are characterized in that request items transmitted by the message queue are respectively checked after a preset transaction checking flow set is matched and split, services are decoupled by using the message queue, transaction amounts of marketing, transfer and payment are verified and respectively early warned by distinguishing the services, the problem of transaction amount errors caused by system reasons or operation reasons can be avoided to a certain extent, a high-performance low-coupling early warning mechanism is realized, and the fund safety is favorably ensured.

Description

Low-coupling transaction early warning method and system based on message queue
Technical Field
The invention relates to the technical field of online payment early warning and payment data processing, in particular to a low-coupling transaction early warning method and system based on a message queue.
Background
Electronic payment has been widely applied to various aspects of social production, and both retail terminal business for terminal consumers and large-amount transaction items for producers rely on flow work of an electronic payment system to provide convenient payment experience.
In order to ensure the fluency and stability of the electronic payment process, the request needs to be necessarily verified in the payment request execution process of the system. The existing payment system usually directly receives a call request from a front-end channel to perform necessary verification measures such as check of a receiver and the like, but at present, no more accurate method exists for judging and identifying the transaction amount without influencing the payment process too much. For example, for the problem that the coupon design is wrong due to misoperation in the process of promotion, and the like, which results in large fund loss, effective control cannot be obtained in the electronic payment process.
On the other hand, for most payment transaction scenes, the amount of money may have certain regularity, so that the payment verification can be compared and judged according to the requested amount of money to a certain extent and an early warning is given out. However, for some more accidental special problems, such as monetary unit conversion, decimal abandonment and the like, the deviation between the final payment amount and the actual payment intention of the customer may be extremely large, and the prior art still lacks an effective early warning mechanism.
Disclosure of Invention
In order to solve the defects of the prior art, the invention provides a low-coupling transaction early warning method and system based on a message queue, wherein the message queue is used for decoupling services, and transaction amounts of marketing, transfer and payment are verified and early warned respectively through service differentiation, so that the problem of transaction amount errors caused by system reasons or operation reasons can be avoided to a certain extent, a high-performance low-coupling early warning mechanism is realized, and the fund safety is ensured.
In order to achieve the above purpose, the technical scheme adopted by the invention comprises the following steps:
a low coupling transaction early warning method based on a message queue is characterized by comprising the following steps:
s1, configuring a transaction checking rule set, wherein the transaction checking rule set comprises a plurality of transaction checking rules marked with checking category labels;
s2, configuring a transaction checking flow set, wherein the transaction checking flow set comprises transaction checking flows with a plurality of groups of transaction checking rules arranged in order, and each transaction checking rule included in the transaction checking flow has the same checking category label;
s3, receiving the service request, splitting the service request into a plurality of ordered and/or unordered independent request items, and transmitting the request items in sequence by using a message queue;
s4, judging one or more checking type labels matched with the request item, and distributing one or more corresponding transaction checking flows according to the matched checking type labels;
s5, according to the corresponding transaction checking flow, each request item is respectively checked in sequence and/or asynchronously;
and S6, feeding back the transaction early warning corresponding to the service request according to the checking result of each request item.
Further, the inspection category labels include a marketing campaign class, a transaction traceability class, a monetary overflow class, and an anomalous transaction class.
Further, the transaction checking rule comprises comparison with a preset threshold, judgment of a preset conflict condition, judgment of execution time, comparison of historical data and blacklist matching.
Further, the determining one or more examination category labels matching the request item includes:
matching corresponding checking type labels according to preset values of the request items;
or, the corresponding examination type label is matched according to the examination history data of the request item.
Further, the step S5 includes:
sequentially checking the plurality of ordered request items, and stopping checking of the subsequent request items when the checking of the current request item is failed;
multiple request items out of order are checked asynchronously.
Further, the step S5 further includes:
and when the request item corresponds to a plurality of transaction checking flows, checking the request item asynchronously according to the transaction checking flows.
The invention also relates to a low coupling transaction early warning system based on the message queue, which is characterized by comprising the following components:
the rule management module is used for configuring and changing a transaction checking rule set;
the flow management module is used for configuring and changing a transaction checking flow set;
the request preprocessing module is used for splitting the service request into a plurality of ordered and/or unordered independent request items;
a request transmission module for transmitting request items in sequence by using the message queue;
the label judging module is used for judging one or more checking type labels matched with the request item and distributing one or more corresponding transaction checking processes according to the matched checking type labels;
and the inspection execution module is used for respectively carrying out sequential and/or asynchronous inspection on each request item according to the corresponding transaction inspection flow and feeding back the transaction early warning corresponding to the service request.
The invention also relates to a computer-readable storage medium, characterized in that the storage medium has stored thereon a computer program which, when being executed by a processor, carries out the above-mentioned method.
The invention also relates to an electronic device, characterized in that it comprises a processor and a memory;
the memory is used for storing a transaction checking rule set and a transaction checking flow set;
the processor is used for executing the method by calling the transaction checking rule set and the transaction checking flow set.
The invention also relates to a computer program product comprising a computer program and/or instructions, characterized in that the computer program and/or instructions, when executed by a processor, implement the steps of the above-mentioned method.
The invention has the beneficial effects that:
by adopting the low-coupling transaction early warning method and system based on the message queue, the message queue is utilized to decouple the service, the service is distinguished and accessed, the rules configured in advance are uploaded during transaction, secondary check, especially money amount judgment, verification and respective early warning are carried out on transaction amounts of marketing, transfer and payment, and the problem of transaction amount error caused by system reasons or operation reasons can be avoided to a certain extent, so that a high-performance low-coupling early warning mechanism is realized, and the fund safety is ensured.
Drawings
Fig. 1 is a flow chart of a message queue-based low-coupling transaction early warning method according to the present invention.
Fig. 2 is a schematic structural diagram of a message queue-based low-coupling transaction warning system according to the present invention.
Detailed Description
For a clearer understanding of the contents of the present invention, reference will be made to the accompanying drawings and examples.
The invention relates to a message queue-based low-coupling transaction early warning method, which comprises the following steps of:
s1, configuring a transaction checking rule set, wherein the transaction checking rule set comprises a plurality of transaction checking rules marked with checking category labels.
Preferably, the inspection category label comprises a marketing campaign category, a transaction tracing category, a money overflow category and an abnormal transaction category; the transaction checking rules comprise comparison with a preset threshold, judgment of preset conflict conditions, execution time judgment, historical data comparison and blacklist matching. For example, for the marketing campaign class, daily purchase limit sale and coupon data, such as a coupon usage amount upper limit and a coupon discount amount upper limit, may be preset; for actual payment amount, from the perspective of avoiding the risk of fund withdrawal, downward overflow amplitude can be set for the transactions of collection classes, and upward overflow amplitude is set for the withdrawal classes.
S2, configuring a transaction checking flow set, wherein the transaction checking flow set comprises transaction checking flows with a plurality of groups of transaction checking rules arranged in order, and each transaction checking rule included in the transaction checking flow has the same checking category label. It is easy to understand that the transaction checking flow necessarily corresponds to a specific checking category label, so that the transaction checking flow can be marked by the checking category label to correspond to the applicable request item check.
Of course, different transaction checking flows may also be marked with the same checking type tag, and correspond to different transaction checking flows applicable to the checking of the same type of request items. Therefore, preferably, a secondary label may be further set on the basis of the inspection category label, specifically indicating the request item applicable to the transaction inspection process.
S3, receiving the service request, splitting the service request into several independent request items in order and/or in disorder, and transmitting the request items in turn by using the message queue.
By using the message queue for data synchronization, the checking operation can be decoupled from the actual service request, thereby avoiding the checking process from affecting the request of the payment service.
S4, judging one or more check type labels matched with the request item, and preferably matching the corresponding check type labels according to the preset value of the request item for the request item with preset configuration; for request items which are not configured in advance, the corresponding examination type labels can be matched according to the examination history data of the request items. Then, one or more corresponding transaction checking processes are assigned according to the matched checking type label.
S5, checking each request item according to the corresponding transaction checking flow, especially, checking the sequence of a plurality of ordered request items, and stopping the checking of the subsequent request items when the current sequence request item check is failed; multiple request items out of order are checked asynchronously.
Preferably, when the request item corresponds to a plurality of transaction checking flows, the request item is checked asynchronously according to each transaction checking flow, so that the checking efficiency is improved. Of course, it will be readily understood that any one of the checks for the same request cannot pass the check, and therefore, a stop exit mechanism may be provided to stop the remaining outstanding checks when one of the asynchronously performed checks fails.
And S6, feeding back the transaction early warning corresponding to the service request according to the checking result of each request item.
The practical application of the above method is further explained below by using a specific embodiment, using a transaction checking rule and a transaction checking flow which are assumed to be configured.
Example 1 marketing campaign classes
The marketing campaign related to the use of the coupon is checked, whether the change of the payment amount caused by the coupon is reasonable or not needs to be focused, and the following steps can be specifically executed:
(1) when marketing activities are carried out, the business party calculates and configures product preference information in advance, wherein the product preference information comprises preference rules, preference times, whether unified customers use for multiple times, time periods, special rules and other information;
(2) reading the pre-configured coupon rules, judging whether the used coupons conflict with each other, and directly returning if the used coupons do not pass the check so as to avoid the loss of resources;
(3) checking the times of the coupons, namely, limiting by using an LUA script in REDIS, acquiring the configured number and times of the check coupons, and using redIS as a distributed lock to ensure that the phenomena of 'over-sale' and the like cannot occur while the redIS high performance ensures concurrency; when the transaction fails and the final state is obtained, the current use times are removed, so that the condition of multiple purposes is avoided;
(4) if the user has the set one-time use permission, the data can be cached by utilizing the redis in the last step to obtain the transaction record of whether the card number corresponds to the card number or not;
(5) and preferential time check: checking whether the current time is within the configuration time;
(6) and special rule checking: and the scheme is reserved for subsequent expansion and supplement, and subsequent dynamic supplement can be supported.
Example 2 transaction traceability class
The traceability trace check of the time-based repayment client can specifically execute the following steps:
(1) after the system finishes every day, batch running work is carried out, data of the accessed system is put into the hbase, and then historical data are processed according to customers and products;
(2) arranging corresponding previous payment transaction data for the periodic payment client;
(3) the trading price in the 7 days of the past day (the data days need to be determined according to the trading volume of the product, and if the trading volume is larger, the response time is shortened) can be obtained for the product and stored as an array;
(4) daily statistics and summarization are carried out on the daily transaction total amount of the product and the peak value transaction amount per hour and the highest tps (the tie value of 7 days for each parameter can be obtained, and the transaction amount of the current access system is large, so that the last day transaction is only adopted for processing);
(5) and (4) sorting the seven-day pair revolution account data, and calculating the seven-day average amount of money transferred for each merchant.
Example 3 money Overflow class
For the verification of the payment transaction amount, the following steps may be specifically performed:
(1) and aiming at repayment type transaction: and identifying the current transaction amount, if the current transaction amount is judged to be a payment type, acquiring payment transaction data of the next day, comparing and then ensuring that the transaction is released within a set parameter difference (5% is preset by the system). Otherwise, intercepting and manually confirming by an operator;
(2) aiming at the transaction of paying and transferring to a public account: obtaining historical account transfer information, and generally settling the public daily, so that the amount of money is not more than 50% in a floating manner, and in order to avoid the expense caused by wrong transfer amount, the comparison with the overflow of the average amount of money of 7 days by 50% is increased, and if the amount of money exceeds the average amount of money of 7 days, the transaction is intercepted, and the transaction is checked and reviewed by operation;
(2) for unconfigured marketing type products: if the product is not made into the marketing plan, historical price data of the product is obtained, the current price is sorted by using quick ranking, if the past date array has data and the current transaction sorting result is smaller than the forefront or larger than the rearmost, the transaction is passed, otherwise, the transaction is intercepted, and the transaction is sent to a transportation management platform and is confirmed by operators and then the subsequent flow is carried out.
Example 4 abnormal transaction class
The method is used for checking the abnormal transaction of the bill-swiping of the large-batch transaction, and specifically comprises the following steps:
(1) firstly, acquiring a blacklist account, and judging whether the blacklist account exists in a redis cache account or not;
(2) judging whether the number of transaction strokes in one hour of a current account is more than a specified value (the value here is a daily big data batch running result and is data generated by the third step of tracing the source trace), and if so, judging whether the number of transaction strokes in one hour of the current account exceeds 5 percent, or whether the total transaction amount is increased by 10 percent compared with yesterday (temporarily, tps is added, and the tps is not good for statistics, and the statistical logic of each hour transaction is that in redis, the transaction is a key value pair with one hour overdue, the overdue time is 1 hour, key is a product number plus the current hour, the current value plus 1 is obtained and then is compared with batch running acquisition data, and if so, the current transaction is intercepted, and if so, carrying out manual operation judgment, and if so, adding a client into a blacklist or temporarily taking off the product and not accessing the transaction any more;
(3) and acquiring the number of the latest transactions of the user, and judging whether the sum of the money is obviously close to the preset price of the product (about 10% floating). If the interception is met, the operator checks the list manually, and if the list is refreshed, the operator adds the list into a blacklist.
Another aspect of the present invention also relates to a low-coupling transaction early warning system based on message queue, whose structure is shown in fig. 2, including:
the rule management module is used for configuring and changing a transaction checking rule set;
the flow management module is used for configuring and changing a transaction checking flow set;
the request preprocessing module is used for splitting the service request into a plurality of ordered and/or unordered independent request items;
a request transmission module for transmitting request items in sequence by using the message queue;
the label judging module is used for judging one or more checking type labels matched with the request item and distributing one or more corresponding transaction checking processes according to the matched checking type labels;
and the inspection execution module is used for respectively carrying out sequential and/or asynchronous inspection on each request item according to the corresponding transaction inspection flow and feeding back the transaction early warning corresponding to the service request.
By using this system, the above-described arithmetic processing method can be executed and a corresponding technical effect can be achieved.
An embodiment of the present invention further provides a computer-readable storage medium capable of implementing all the steps of the method in the above embodiment, wherein the computer-readable storage medium has a computer program stored thereon, and the computer program, when executed by a processor, implements all the steps of the method in the above embodiment.
Embodiments of the present invention further provide an electronic device for executing the method, as an implementation apparatus of the method, the electronic device at least has a processor and a memory, and particularly, the memory stores data and related computer programs, such as a transaction checking rule set and a transaction checking flow set, etc., required for executing the method, and the processor calls the data and the programs in the memory to execute all steps of the implementation method, and obtains corresponding technical effects.
Preferably, the electronic device may comprise a bus architecture, which may include any number of interconnected buses and bridges linking together various circuits including one or more processors and memory. The bus may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. A bus interface provides an interface between the bus and the receiver and transmitter. The receiver and transmitter may be the same element, i.e., a transceiver, providing a means for communicating with various other systems over a transmission medium. The processor is responsible for managing the bus and general processing, while the memory may be used to store data used by the processor in performing operations.
Additionally, the electronic device may further include a communication module, an input unit, an audio processor, a display, a power source, and the like. The processor (or controller, operational controls) employed may include a microprocessor or other processor device and/or logic device that receives input and controls the operation of various components of the electronic device; the memory may be one or more of a buffer, a flash memory, a hard drive, a removable medium, a volatile memory, a non-volatile memory or other suitable devices, and may store the above-mentioned related data information, and may also store a program for executing the related information, and the processor may execute the program stored in the memory to realize information storage or processing, etc.; the input unit is used for providing input to the processor, and can be a key or a touch input device; the power supply is used for supplying power to the electronic equipment; the display is used for displaying display objects such as images and characters, and may be an LCD display, for example. The communication module is a transmitter/receiver that transmits and receives signals via an antenna. The communication module (transmitter/receiver) is coupled to the processor to provide an input signal and receive an output signal, which may be the same as in the case of a conventional mobile communication terminal. Based on different communication technologies, a plurality of communication modules, such as a cellular network module, a bluetooth module, and/or a wireless local area network module, may be disposed in the same electronic device. The communication module (transmitter/receiver) is also coupled to a speaker and a microphone via an audio processor to provide audio output via the speaker and receive audio input from the microphone to implement the usual telecommunication functions. The audio processor may include any suitable buffers, decoders, amplifiers and so forth. In addition, the audio processor is also coupled to the central processor, so that recording on the local machine can be realized through the microphone, and sound stored on the local machine can be played through the loudspeaker.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create a system for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including an instruction system which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks. While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are also within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (10)

1. A low-coupling transaction early warning method based on a message queue is characterized by comprising the following steps:
s1, configuring a transaction checking rule set, wherein the transaction checking rule set comprises a plurality of transaction checking rules marked with checking category labels;
s2, configuring a transaction checking flow set, wherein the transaction checking flow set comprises transaction checking flows with a plurality of groups of transaction checking rules arranged in order, and each transaction checking rule included in the transaction checking flow has the same checking category label;
s3, receiving the service request, splitting the service request into a plurality of ordered and/or unordered independent request items, and transmitting the request items in sequence by using a message queue;
s4, judging one or more check type labels matched with the request item, and distributing one or more corresponding transaction check processes according to the matched check type labels;
s5, according to the corresponding transaction checking flow, the request items are checked sequentially and/or asynchronously;
and S6, feeding back the transaction early warning corresponding to the service request according to the checking result of each request item.
2. The method of claim 1, wherein the inspection category labels comprise a marketing campaign class, a transaction traceability class, a monetary overflow class, and an exception transaction class.
3. The method of claim 2, wherein the transaction checking rules include comparisons to preset thresholds, preset conflict condition determinations, execution time determinations, historical data comparisons, and blacklists.
4. The method of claim 1, wherein said determining one or more exam category labels that match a request term comprises:
matching corresponding checking type labels according to preset values of the request items;
or, matching the corresponding examination type label according to the examination history data of the request item.
5. The method of claim 1, wherein the step S5 includes:
sequentially checking the plurality of ordered request items, and stopping checking of the subsequent request items when the checking of the current request item is failed;
multiple request items out of order are examined asynchronously.
6. The method of claim 5, wherein the step S5 further comprises:
when the request item corresponds to a plurality of transaction checking flows, the request item is checked asynchronously according to the transaction checking flows.
7. A low-coupling transaction early warning system based on a message queue is characterized by comprising:
the rule management module is used for configuring and changing a transaction checking rule set;
the flow management module is used for configuring and changing a transaction checking flow set;
the request preprocessing module is used for splitting the service request into a plurality of ordered and/or unordered independent request items;
a request transmission module for transmitting request items in sequence by using the message queue;
the label judging module is used for judging one or more checking type labels matched with the request item and distributing one or more corresponding transaction checking processes according to the matched checking type labels;
and the inspection execution module is used for respectively carrying out sequential and/or asynchronous inspection on each request item according to the corresponding transaction inspection flow and feeding back the transaction early warning corresponding to the service request.
8. A computer-readable storage medium, characterized in that a computer program is stored on the storage medium, which computer program, when being executed by a processor, carries out the method of any one of claims 1 to 6.
9. An electronic device comprising a processor and a memory;
the memory is used for storing a transaction checking rule set and a transaction checking flow set;
the processor, configured to execute the method of any one of claims 1 to 6 by invoking a set of transaction checking rules and a set of transaction checking procedures.
10. A computer program product comprising a computer program and/or instructions, characterized in that the computer program and/or instructions, when executed by a processor, implement the steps of the method of any one of claims 1 to 6.
CN202210605011.7A 2022-05-31 2022-05-31 Low-coupling transaction early warning method and system based on message queue Pending CN115034792A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210605011.7A CN115034792A (en) 2022-05-31 2022-05-31 Low-coupling transaction early warning method and system based on message queue

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210605011.7A CN115034792A (en) 2022-05-31 2022-05-31 Low-coupling transaction early warning method and system based on message queue

Publications (1)

Publication Number Publication Date
CN115034792A true CN115034792A (en) 2022-09-09

Family

ID=83123652

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210605011.7A Pending CN115034792A (en) 2022-05-31 2022-05-31 Low-coupling transaction early warning method and system based on message queue

Country Status (1)

Country Link
CN (1) CN115034792A (en)

Similar Documents

Publication Publication Date Title
CN110400184B (en) Method and apparatus for generating information
CN112463780B (en) Data quality inspection method and device
CN108830715A (en) Disk processing method and system are returned in batch documents part
US20080021817A1 (en) Method, apparatus, and computer program product for repository data maximization
CN112465601A (en) Electronic order generation method and device and storage medium
CN114298835A (en) Core system deposit account total score checking method and system based on 7 x 24 hours
US20050144079A1 (en) Budgetary ledger
CN111026560B (en) Method, apparatus, computer device and storage medium for processing product data
CN116823471A (en) Transaction policy return method and device, electronic equipment and storage medium
CN110070383B (en) Abnormal user identification method and device based on big data analysis
CN115034792A (en) Low-coupling transaction early warning method and system based on message queue
CN115760404A (en) Stock reduction scheme generation method, system, terminal and storage medium
CN110555763A (en) financial data processing method and device based on block chain
CN112182400B (en) Message processing method, message processing device, electronic equipment and storage medium
CN107172311A (en) Business appraisal procedure and terminal device
CN112183969A (en) Payment equipment operation control method and device for supply order and electronic equipment
CN113643014B (en) Block chain-based transaction management method, apparatus, device, medium, and program
CN114756556B (en) Method, device, electronic equipment and computer readable medium for processing account data
CN114900807B (en) Method and system for processing short message problem event list
CN114282794A (en) Method, device, equipment and storage medium for determining package information
CN116205398A (en) Material management method, device, terminal equipment and storage medium
CN113469801A (en) Method and device for determining audit result
CN115496583A (en) Asynchronous accounting data processing method, device, equipment and storage medium
CN115099918A (en) Tax data processing method and device
CN113780926A (en) Article order processing method, device and system

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