CN112035530B - Transaction message matching method and system in distributed real-time payment system - Google Patents
Transaction message matching method and system in distributed real-time payment system Download PDFInfo
- Publication number
- CN112035530B CN112035530B CN202010979002.5A CN202010979002A CN112035530B CN 112035530 B CN112035530 B CN 112035530B CN 202010979002 A CN202010979002 A CN 202010979002A CN 112035530 B CN112035530 B CN 112035530B
- Authority
- CN
- China
- Prior art keywords
- message
- matching
- matched
- characteristic value
- unique number
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000012545 processing Methods 0.000 claims abstract description 35
- 238000004590 computer program Methods 0.000 claims description 17
- 230000002688 persistence Effects 0.000 claims description 10
- 238000013499 data model Methods 0.000 claims description 9
- 230000002085 persistent effect Effects 0.000 claims description 5
- 238000012423 maintenance Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 9
- 230000008859 change Effects 0.000 description 5
- 230000007246 mechanism Effects 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 238000013515 script Methods 0.000 description 3
- 238000006467 substitution reaction Methods 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000010485 coping Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 210000001503 joint Anatomy 0.000 description 1
- 238000004519 manufacturing process Methods 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
Classifications
-
- 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/24552—Database cache management
-
- 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/248—Presentation of query results
-
- 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/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- 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/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Abstract
The application discloses a transaction message matching method and a system in a distributed real-time payment system, wherein the method comprises the following steps: obtaining a message to be matched, and extracting a characteristic value of the message to be matched; according to a storage mode of a preset characteristic value, generating hot spot data of a message to be matched, and storing the hot spot data into a cache library; acquiring a matching message, and generating a characteristic value of the matching message according to the message type; inquiring a matching item in a cache library according to the characteristic value of the matching message, completing message matching if the matching item is found, generating a system unique number of the matching message, and generating a message matching result according to the system unique number of the message to be matched and the system unique number of the matching message; and after the matching is completed, the message matching result is persisted to a database. The application can be realized by modifying the configuration when the message processing changes are handled, has lower cost, higher flexibility for handling the demand changes and lower error occurrence rate, can be well compatible with the distributed payment system, and reduces maintenance cost.
Description
Technical Field
The application relates to the technical field of transaction message processing, in particular to a transaction message matching method and a transaction message matching system in a distributed real-time payment system.
Background
In recent years, more and more countries and regions are popularizing small real-time payment clearing systems which are operated in end-to-end real-time account and 7×24 hours. The distributed payment platform is in butt joint with each overseas branch real-time clearing system and is used for intensively processing the payment business of the overseas branch clients. As a novel payment system, the business process and the clearing and settling mechanism are greatly different from the traditional central payment system, and one transaction is often required to be completed within a few seconds, so that high requirements are put on the aspects of instantaneity, continuity, performance and the like of the participating mechanism system.
The standards of real-time clearing systems participated in by each overseas branch are different, the requirements on the participators are different, and meanwhile, the development degree of the business of each overseas branch and the processing requirements on the business are different, so that the requirements of each branch on the matching of the messages in the business processing flow are consistent and personalized, but in the existing distributed payment system, the following two ways are generally adopted for the matching of the message processing in each region:
the first way is to perform packet matching in a hard-coded manner, which is generally implemented by hard-coding, and requires a processing branch to be designed for each scene of the packet, so that the flexibility and multiplexing degree are low, compared with the case of being less flexible based on configuration.
The other mode is based on SQL script configuration, the conditions and execution actions for message processing are converted into SQL script forms and stored in a database, and the database is read again when in use, and the processing can realize complex and changeable message processing conditions through flexible rule scripts, but the timeliness is insufficient, and each time the processing is based on complex SQL query and search from a database, the performance bottleneck is easy to be caused, and the real-time payment cannot be met.
In view of the foregoing, a technical solution is needed to overcome the above problems and flexibly implement the matching requirements of message processing in each region.
Disclosure of Invention
In order to overcome the defects of the prior art, the application provides a transaction message matching method and a transaction message matching system in a distributed real-time payment system, and the method and the system combine with a micro-service system architecture, and the system can flexibly realize message processing matching requirements of all areas by a configuration mode without modifying codes; the application establishes a set of mechanism based on configuration and cache characteristic values, thereby realizing the processing and changing of the message by modifying the configuration without modifying codes by developers, having lower cost, higher flexibility for coping with the change of the requirement and lower error occurrence rate. In addition, the distributed payment system can be well compatible, and maintenance cost is reduced.
In a first aspect of an embodiment of the present application, a method for matching transaction messages in a distributed real-time payment system is provided, where the method includes:
obtaining a message to be matched, and extracting a characteristic value of the message to be matched;
generating hot spot data of the message to be matched according to the characteristic value and a storage mode of the preset characteristic value, and storing the hot spot data into a cache library, wherein the hot spot data comprises the characteristic value and a system unique number of the message to be matched;
acquiring a matching message, and generating a characteristic value of the matching message according to the message type;
inquiring a matching item in the cache library according to the characteristic value of the matching message, completing message matching if the matching item is found, generating a system unique number of the matching message, and generating a message matching result according to the system unique number of the message to be matched and the system unique number of the matching message;
and after the matching is completed, the message matching result is persisted to a database.
In a second aspect of the embodiment of the present application, a transaction message matching system in a distributed real-time payment system is provided, the system comprising:
the message to be matched acquisition unit is used for acquiring a message to be matched and extracting the characteristic value of the message to be matched;
the message processing unit is used for generating hot spot data of the message to be matched according to the characteristic value and a storage mode of a preset characteristic value and storing the hot spot data into a cache library, wherein the hot spot data comprises the characteristic value and a system unique number of the message to be matched;
the matching message acquisition unit is used for acquiring the matching message and generating a characteristic value of the matching message according to the message type;
the matching unit is used for inquiring the matching item in the cache library according to the characteristic value of the matching message, completing the message matching if the matching item is found, generating a system unique number of the matching message, and generating a message matching result according to the system unique number of the message to be matched and the system unique number of the matching message;
and the persistence unit is used for persistence of the message matching result to the database after the matching is completed.
In a third aspect of the embodiments of the present application, a computer device is provided, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements a transaction message matching method in a distributed real-time payment system when the computer program is executed.
In a fourth aspect of the embodiments of the present application, a computer readable storage medium is provided, the computer readable storage medium storing a computer program, which when executed by a processor, implements a transaction message matching method in a distributed real-time payment system.
The transaction message matching method and the transaction message matching system in the distributed real-time payment system establish a set of mechanism based on configuration and cache characteristic values, and can be realized by modifying the configuration when the message processing change is handled, so that a developer is not required to modify codes, the cost is low, the flexibility of handling the demand change is high, the error occurrence rate is low, the distributed payment system can be well compatible, and the maintenance cost is reduced.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of a transaction message matching method in a distributed real-time payment system according to an embodiment of the application.
Fig. 2 is a schematic diagram of a transaction message matching system in a distributed real-time payment system according to an embodiment of the present application.
Fig. 3 is a schematic architecture diagram of a transaction message matching system in a distributed real-time payment system according to another embodiment of the present application.
FIG. 4 is a schematic diagram of a computer device according to an embodiment of the present application.
Detailed Description
The principles and spirit of the present application will be described below with reference to several exemplary embodiments. It should be understood that these embodiments are presented merely to enable those skilled in the art to better understand and practice the application and are not intended to limit the scope of the application in any way. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
Those skilled in the art will appreciate that embodiments of the application may be implemented as a system, apparatus, device, method, or computer program product. Accordingly, the present disclosure may be embodied in the following forms, namely: complete hardware, complete software (including firmware, resident software, micro-code, etc.), or a combination of hardware and software.
According to the embodiment of the application, a transaction message matching method and a transaction message matching system in a distributed real-time payment system are provided. The method and the system extract the characteristic value of a single message in a configuration mode and store the characteristic value in a cache; generating a characteristic value after the message to be matched enters the system, and comparing and matching the characteristic value with the existing characteristic in the cache; the function can be deployed as a micro-service in a distributed payment platform to complete message matching work for calling and processing of each combined service. In the process of message matching, after the first message enters the system, a characteristic string is generated according to a rule of customized configuration and stored in a redis cache (the characteristic string is a key and the value is a unique identifier of the first message), and at the moment, the first message is continuously processed by a subsequent system. The second message is a matching message of the first message, after the second message enters the system, a characteristic string is generated according to a rule of customized configuration, the characteristic string is searched in a cache, and if the characteristic string is found, the characteristic string is successfully compared. If the second message does not find the matched message and the message needs to be matched, a fuzzy matching algorithm with general rules is operated, the messages which are possibly matched are listed, and after the matching is successful, a matched result repository is subjected to persistence processing.
In the embodiments of the present application, terms to be described are as follows:
real-time payment: a novel end-to-end, 7 x 24 running real-time checkout micropayment system.
Distributed type: a large-scale system is divided into a plurality of subsystems, the subsystems are distributed to a plurality of hosts through a computer network, and the plurality of hosts cooperate to complete work.
Micro-services: the system is a novel software architecture, and splits a large single application program and service into a plurality of supported micro services.
Rule driving: in the system, background codes for realizing the dynamic rule function are realized.
And (3) caching: the buffer area for data exchange is stored in the memory, and the access speed is faster than the reading speed from the hard disk.
Message matching: in a payment system, two messages may be associated, such as to cancel a previous transaction, or to confirm a previous transaction, etc.
The principles and spirit of the present application are explained in detail below with reference to several representative embodiments thereof.
Fig. 1 is a flow chart of a transaction message matching method in a distributed real-time payment system according to an embodiment of the application. As shown in fig. 1, the method includes:
step S101, obtaining a message to be matched, and extracting a characteristic value of the message to be matched;
step S102, generating hot spot data of the message to be matched according to the characteristic value and a storage mode of the preset characteristic value, and storing the hot spot data into a cache library, wherein the hot spot data comprises the characteristic value and a system unique number of the message to be matched;
step S103, obtaining a matching message, and generating a characteristic value of the matching message according to the message type;
step S104, inquiring the matching item in the cache according to the characteristic value of the matching message, if the matching item is found, completing the message matching, generating a system unique number of the matching message, and generating a message matching result according to the system unique number of the message to be matched and the system unique number of the matching message;
step S105, after the matching is completed, the message matching result is persisted to a database.
In one embodiment, the detailed process of step S101 is as follows:
acquiring a message to be matched, and storing field information in the message into a data model;
and extracting the characteristic value of the matched message according to the data model, wherein the characteristic value at least comprises a message number and a message type.
Further, the method further comprises:
after the matching is completed, judging the state information of the matching message; if the processing is not finished, not clearing the cache data of the cache library; and if the processing is completed, clearing corresponding cache data in the cache library.
In one embodiment, the detailed process of step S105 is as follows:
persisting the system unique number of the message to be matched, the system unique number of the matched message and the association relation of the message into a matching relation table of a database;
when receiving a message opening instruction initiated by a user, calling a message with a message association relationship from the matching relationship table to display the message on a page.
In order to more clearly explain the transaction message matching method in the distributed real-time payment system, each step is described in detail below with reference to a specific embodiment.
Step S101, extracting characteristic values:
in a real-time payment system, due to different protocols of overseas local clearing systems, various message types (such as SWIFT message Pacs messages) exist, and after the message processing is completed, the system stores each field of the message into a unified data model.
The default value of the characteristic value is a message number (referring to the SWIFT message 20 fields), a message type (SWIFT message type or PACS message type), and the characteristic value can be modified and configured on the front page.
For example, as for SWIFT103 message types, the characteristic values are: 1. message numbering; 2. message type (swift_103); 3. message amount (SWIFT message 32 field value); 4. and receiving the line information.
The specific configuration of the characteristic value can be adjusted according to the actual requirement or the message type.
Step S102, storing characteristic values:
after the feature value extraction is completed according to the configuration, a storage mode of the feature value is judged, hot spot data is stored in a redis cache, a key value is the feature value, and a value is a system unique number of the message.
After the hot spot data is determined, the system sets the valid period for the hot spot data, the default valid period is 60 minutes, and the hot spot data exceeding the valid period is cleared from the redis and persisted into the database. Meanwhile, the message is set to be one-to-one (one-to-one refers to that the matching type can be matched only once, such as the matching of SWIFT103 message and SWIFT202cov message), and the message is directly deleted from redis after being matched.
The real-time payment system has requirements on message processing time, so that the message matching is required to be quick and accurate, and the message matching is mainly dependent on redis cache.
Step S103, message matching:
when the matched messages (the matched messages are judged mainly through the message types, such as Pacs002 messages belong to receipt messages, the messages are judged to be the matched messages after entering the system, the matched messages enter a message matching flow), the matched messages generate characteristic values according to the own message types, the characteristic values are used as keys to inquire in a redis cache, if the matched items exist, the message matching is completed, and if the matched items exist, the cache stored in the redis is deleted.
Step S104, matching persistence:
and after the matching is completed, the result of the message matching is persisted into a database. A matching relation table is set in the database, the matching relation of the messages is stored in the table, and when a user opens the messages on a front page, the associated messages are inquired from the table and displayed on the page.
Further, the method of matching transaction messages in a distributed real-time payment system is described in connection with a specific embodiment, however, it should be noted that this embodiment is merely for better illustrating the present application and is not meant to be unduly limiting.
Taking a one-to-many message matching scene as an example, a payment message is matched with a receipt message, and the specific flow is as follows:
in the Severe local clearing system, payment message Pacs008 may receive one or more receipt messages Pacs002 after sending the local clearing.
S1, after generating and sending Pacs008 message, the real-time payment system calls message matching, and generates a characteristic value of the message to be matched according to configured rules.
Eigenvalue = 20 field number + amount + currency = PT00001+1000+ usd.
S2, the unique number of Pacs008 in the system is MID000001, and the hot spot data is:
{KEY: PT00001+1000+USD,VALUE: MID000001}；
the hot spot data is stored in the redis cache and a 60 minute expiration date is set.
S3, when a Pacs002 message enters the system, the message is matched after analysis is completed, the message is a matched message, and the characteristic value of the matched message is generated according to the configured characteristic value generation rule:
eigenvalue = original 20 field number (21 fields of Pacs002 message) +amount + currency = PT00001+1000+ usd.
Searching from the redis cache according to the key value, finding out the MID000001 message, and completing the matching.
The information returned by the query Pacs002 message is pending, and the non-final state message will not clear the redis cache.
S4, storing the Pacs002 message, the unique number MID000002 and the Pacs008 message and the unique number MID000001 into a database matching relation table.
S5, when another Pacs002 message enters the system, the message is matched after analysis is completed, the message is a matched message, and the characteristic value of the matched message is generated according to the configured characteristic value generation rule:
eigenvalue = original 20 field number (21 fields of Pacs002 message) +amount + currency = PT00001+1000+ usd.
Searching from the redis cache according to the key value, finding out the MID000001 message, and completing the matching.
The state information of the Pacs002 message is success, and the redis cache is cleared. Subsequent MID000001Pacs008 messages will not match the response piece class message.
S6, storing the Pacs002 message, the unique number MID000003 and the Pacs008 message and the unique number MID000001 into a database matching relation table.
It should be noted that although the operations of the method of the present application are described in a particular order in the above embodiments and the accompanying drawings, this does not require or imply that the operations must be performed in the particular order or that all of the illustrated operations be performed in order to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step to perform, and/or one step decomposed into multiple steps to perform.
Having described the method of an exemplary embodiment of the present application, a transaction message matching system in a distributed real-time payment system of an exemplary embodiment of the present application is described next with reference to fig. 2.
The implementation of the transaction message matching system in the distributed real-time payment system can be referred to the implementation of the method, and the repetition is not repeated. The term "module" or "unit" as used below may be a combination of software and/or hardware that implements the intended function. While the means described in the following embodiments are preferably implemented in software, implementation in hardware, or a combination of software and hardware, is also possible and contemplated.
Based on the same inventive concept, the application also provides a transaction message matching system in a distributed real-time payment system, as shown in fig. 2, the system comprises:
a message to be matched obtaining unit 210, configured to obtain a message to be matched, and extract a characteristic value of the message to be matched;
the message processing unit 220 is configured to generate, according to the feature value and a storage manner of a preset feature value, hot spot data of the message to be matched, and store the hot spot data in a cache bank, where the hot spot data includes the feature value and a system unique number of the message to be matched;
a matching message obtaining unit 230, configured to obtain a matching message, and generate a characteristic value of the matching message according to a message type;
the matching unit 240 queries the matching item in the cache according to the characteristic value of the matching message, if the matching item is found, the message matching is completed, a system unique number of the matching message is generated, and a message matching result is generated according to the system unique number of the message to be matched and the system unique number of the matching message;
and the persistence unit 250 is configured to persistence the message matching result to the database after the matching is completed.
In an embodiment, the message to be matched acquisition unit 210 is specifically configured to:
acquiring a message to be matched, and storing field information in the message into a data model;
and extracting the characteristic value of the matched message according to the data model, wherein the characteristic value at least comprises a message number and a message type.
In an embodiment, referring to fig. 3, a schematic architecture diagram of a transaction message matching system in a distributed real-time payment system according to another embodiment of the present application is shown. As shown in fig. 3, the system further includes:
a buffer clearing unit 260, configured to determine status information of the matching message after the matching is completed; if the processing is not finished, not clearing the cache data of the cache library; and if the processing is completed, clearing corresponding cache data in the cache library.
In one embodiment, the persistence unit 250 is specifically configured to:
persisting the system unique number of the message to be matched, the system unique number of the matched message and the association relation of the message into a matching relation table of a database;
when receiving a message opening instruction initiated by a user, calling a message with a message association relationship from the matching relationship table to display the message on a page.
It should be noted that while several modules of a transaction message matching system in a distributed real-time payment system are mentioned in the above detailed description, such a division is merely exemplary and not mandatory. Indeed, the features and functions of two or more modules described above may be embodied in one module in accordance with embodiments of the present application. Conversely, the features and functions of one module described above may be further divided into a plurality of modules to be embodied.
Based on the foregoing inventive concept, as shown in fig. 4, the present application further proposes a computer device 400, including a memory 410, a processor 420, and a computer program 430 stored in the memory 410 and executable on the processor 420, where the processor 420 implements the transaction message matching method in the distributed real-time payment system when executing the computer program 430.
Based on the foregoing inventive concept, the present application proposes a computer readable storage medium storing a computer program which, when executed by a processor, implements a transaction message matching method in the foregoing distributed real-time payment system.
The transaction message matching method and the transaction message matching system in the distributed real-time payment system establish a set of mechanism based on configuration and cache characteristic values, and can be realized by modifying the configuration when the message processing change is handled, so that a developer is not required to modify codes, the cost is low, the flexibility of handling the demand change is high, the error occurrence rate is low, the distributed payment system can be well compatible, and the maintenance cost is reduced.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application 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 application is described with reference to flowchart illustrations and/or block diagrams of methods and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations 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 means 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 instruction means 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.
Finally, it should be noted that: the above examples are only specific embodiments of the present application, and are not intended to limit the scope of the present application, but it should be understood by those skilled in the art that the present application is not limited thereto, and that the present application is described in detail with reference to the foregoing examples: any person skilled in the art may modify or easily conceive of the technical solution described in the foregoing embodiments, or perform equivalent substitution of some of the technical features, while remaining within the technical scope of the present disclosure; such modifications, changes or substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application, and are intended to be included in the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A transaction message matching method in a distributed real-time payment system, the method comprising:
obtaining a message to be matched, and extracting a characteristic value of the message to be matched;
generating hot spot data of the message to be matched according to the characteristic value and a storage mode of the preset characteristic value, and storing the hot spot data into a cache library, wherein the hot spot data comprises the characteristic value and a system unique number of the message to be matched;
acquiring a matching message, and generating a characteristic value of the matching message according to the message type;
inquiring a matching item in the cache library according to the characteristic value of the matching message, completing message matching if the matching item is found, generating a system unique number of the matching message, and generating a message matching result according to the system unique number of the message to be matched and the system unique number of the matching message;
and after the matching is completed, the message matching result is persisted to a database.
2. The method for matching transaction messages in a distributed real-time payment system according to claim 1, wherein obtaining a message to be matched and extracting a characteristic value of the message to be matched comprise:
acquiring a message to be matched, and storing field information in the message into a data model;
and extracting the characteristic value of the matched message according to the data model, wherein the characteristic value at least comprises a message number and a message type.
3. The method for matching transaction messages in a distributed real-time payment system of claim 1, further comprising:
after the matching is completed, judging the state information of the matching message; if the processing is not finished, not clearing the cache data of the cache library; and if the processing is completed, clearing corresponding cache data in the cache library.
4. The method for matching transaction messages in a distributed real-time payment system according to claim 1, wherein after the matching is completed, persisting the message matching result to a database, comprising:
persisting the system unique number of the message to be matched, the system unique number of the matched message and the association relation of the message into a matching relation table of a database;
when receiving a message opening instruction initiated by a user, calling a message with a message association relationship from the matching relationship table to display the message on a page.
5. A transaction message matching system in a distributed real-time payment system, the system comprising:
the message to be matched acquisition unit is used for acquiring a message to be matched and extracting the characteristic value of the message to be matched;
the message processing unit is used for generating hot spot data of the message to be matched according to the characteristic value and a storage mode of a preset characteristic value and storing the hot spot data into a cache library, wherein the hot spot data comprises the characteristic value and a system unique number of the message to be matched;
the matching message acquisition unit is used for acquiring the matching message and generating a characteristic value of the matching message according to the message type;
the matching unit is used for inquiring the matching item in the cache library according to the characteristic value of the matching message, completing the message matching if the matching item is found, generating a system unique number of the matching message, and generating a message matching result according to the system unique number of the message to be matched and the system unique number of the matching message;
and the persistence unit is used for persistence of the message matching result to the database after the matching is completed.
6. The transaction message matching system in a distributed real-time payment system according to claim 5, wherein the message to be matched acquisition unit is specifically configured to:
acquiring a message to be matched, and storing field information in the message into a data model;
and extracting the characteristic value of the matched message according to the data model, wherein the characteristic value at least comprises a message number and a message type.
7. The transaction message matching system in a distributed real-time payment system of claim 5, further comprising:
the buffer clearing unit is used for judging the state information of the matched message after the matching is completed; if the processing is not finished, not clearing the cache data of the cache library; and if the processing is completed, clearing corresponding cache data in the cache library.
8. The transaction message matching system in a distributed real-time payment system according to claim 5, wherein the persistence unit is specifically configured to:
persisting the system unique number of the message to be matched, the system unique number of the matched message and the association relation of the message into a matching relation table of a database;
when receiving a message opening instruction initiated by a user, calling a message with a message association relationship from the matching relationship table to display the message on a page.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method of any of claims 1 to 4 when executing the computer program.
10. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program which, when executed by a processor, implements the method of any of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010979002.5A CN112035530B (en) | 2020-09-17 | 2020-09-17 | Transaction message matching method and system in distributed real-time payment system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010979002.5A CN112035530B (en) | 2020-09-17 | 2020-09-17 | Transaction message matching method and system in distributed real-time payment system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112035530A CN112035530A (en) | 2020-12-04 |
| CN112035530B true CN112035530B (en) | 2023-11-21 |
Family
ID=73589631
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010979002.5A Active CN112035530B (en) | 2020-09-17 | 2020-09-17 | Transaction message matching method and system in distributed real-time payment system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112035530B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113553306B (en) * | 2021-07-27 | 2023-07-21 | 重庆紫光华山智安科技有限公司 | Data processing method and data storage management system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106209911A (en) * | 2016-08-30 | 2016-12-07 | 北京仁聚汇通信息科技有限责任公司 | The data processing method of a kind of unified payment message and system |
| CN107635012A (en) * | 2017-10-18 | 2018-01-26 | 中汇信息技术（上海）有限公司 | A kind of match messages method, server and computer-readable recording medium |
| CN110503436A (en) * | 2019-08-28 | 2019-11-26 | 中国银行股份有限公司 | The payment message processing method and system of image file are transmitted by SWIFT |
| CN111177005A (en) * | 2019-12-31 | 2020-05-19 | 中国银行股份有限公司 | Service application testing method, device, server and storage medium |
| CN111371804A (en) * | 2020-03-16 | 2020-07-03 | 广州根链国际网络研究院有限公司 | DNS (Domain name Server) back-end forwarding method and system |
-
2020
- 2020-09-17 CN CN202010979002.5A patent/CN112035530B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106209911A (en) * | 2016-08-30 | 2016-12-07 | 北京仁聚汇通信息科技有限责任公司 | The data processing method of a kind of unified payment message and system |
| CN107635012A (en) * | 2017-10-18 | 2018-01-26 | 中汇信息技术（上海）有限公司 | A kind of match messages method, server and computer-readable recording medium |
| CN110503436A (en) * | 2019-08-28 | 2019-11-26 | 中国银行股份有限公司 | The payment message processing method and system of image file are transmitted by SWIFT |
| CN111177005A (en) * | 2019-12-31 | 2020-05-19 | 中国银行股份有限公司 | Service application testing method, device, server and storage medium |
| CN111371804A (en) * | 2020-03-16 | 2020-07-03 | 广州根链国际网络研究院有限公司 | DNS (Domain name Server) back-end forwarding method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112035530A (en) | 2020-12-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11263622B2 (en) | Computer-implemented system and method for determining the state of a machine executable contract implemented using a blockchain | |
| CN109725926B (en) | Method and device for managing baseline and data processing method | |
| CN108647357B (en) | Data query method and device | |
| CN108256870B (en) | Method and device for generating description information, updating and processing data based on topological structure | |
| US10423625B2 (en) | Exactly-once semantics for streaming analytics in non-idempotent output operations | |
| CN112035530B (en) | Transaction message matching method and system in distributed real-time payment system | |
| CN111695326B (en) | XBRL report checking method and device | |
| CN112037051A (en) | Clearing account opening method and device | |
| CN114995877B (en) | Variable configuration method and device | |
| CN115438630A (en) | Unified message generation method and device based on distributed payment system | |
| CN114493570A (en) | Cross-border remittance processing method and device based on group internal private line | |
| CN112116452B (en) | Transaction processing method and device | |
| CN112507725B (en) | Static publishing method, device, equipment and storage medium of financial information | |
| US20230035551A1 (en) | Multiple source audit log generation | |
| CN114691713A (en) | Data query method and device | |
| CN111552703B (en) | Data processing method and device | |
| CN114996246A (en) | Data cleaning method for checking multiple fields of table based on NiFi assembly | |
| CN111915420A (en) | Label creating method and device, electronic equipment and computer readable storage medium | |
| CN111563091B (en) | Method and system for batch updating MongoDB in non-round-trip mode | |
| CN112035488A (en) | Matching method and device for transaction confirmation messages | |
| US20140149419A1 (en) | Complex event processing apparatus for referring to table within external database as external reference object | |
| US20230029899A1 (en) | Context-dependent event cleaning and publication | |
| US11616744B2 (en) | Context-dependent message extraction and transformation | |
| CN115829742A (en) | Account record generation method and device | |
| CN113724081A (en) | Transaction database based on block chain |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |