CN110390528B - Information matching method and readable storage medium - Google Patents
Information matching method and readable storage medium Download PDFInfo
- Publication number
- CN110390528B CN110390528B CN201910662504.2A CN201910662504A CN110390528B CN 110390528 B CN110390528 B CN 110390528B CN 201910662504 A CN201910662504 A CN 201910662504A CN 110390528 B CN110390528 B CN 110390528B
- Authority
- CN
- China
- Prior art keywords
- information
- node object
- information set
- determining
- matching
- 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
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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/40—Authorisation, 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/405—Establishing or using transaction specific rules
Abstract
An information matching method and a readable storage medium are disclosed. And acquiring second node objects by acquiring second information matched with the first information, and further acquiring third node objects which have authorization relations with the first node objects and the second node objects, and initiating information exchange requests for the first node objects and the second node objects to match the two node objects for information exchange. The two node objects without authorization relation can also realize information exchange, thereby improving the efficiency of information exchange and enabling the system to have more flexibility.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to an information matching method and a readable storage medium.
Background
Interest Rate Swap (IRS) refers to a financial contract in which two parties agree to exchange Interest amounts on a nominal principal of the same currency in an agreed amount within a certain period of time in the future. The exchange is simply an interest in the different features, without substantial exchange of principal. Interest rate interchange can take many forms, with the most common being to switch between a fixed interest rate and a floating interest rate.
In the current interest rate exchange system, buyers and sellers can check the quotation of each organization in the quotation market under the condition of meeting bilateral credit authorization, and can trade with counter-parties meeting expected quotation.
However, even if both parties are in proper prices, two institutions that do not have bilateral trust cannot deal with each other because of no trust relationship between them.
Disclosure of Invention
In view of the above, the present invention provides an information matching method and a readable storage medium, which can improve the efficiency of information exchange and make the system more flexible.
In a first aspect, an embodiment of the present invention discloses an information matching method, where the method includes:
determining a first node object, wherein the state of the first node object is an unlocked state;
determining an information set which needs to be subjected to matching operation in the first node object, wherein the information set which needs to be subjected to matching operation has at least one piece of first information;
determining a second node object according to the information set needing matching operation, wherein the second node object has second information matched with the first information;
determining a third node object according to the first node object and the second node object, wherein the bridging switch of the third node object is on, and has a predetermined first authorization relationship with the first node object and a predetermined second authorization relationship with the second node object respectively; and
initiating an information exchange request by the third node object.
Preferably, determining the first node object comprises:
selecting a node object in the node object table according to a first predetermined rule;
determining a locking state according to a locking zone bit of the selected node object, wherein the locking state comprises a locked state and an unlocked state; and
and in response to the locking state being an unlocked state, taking the node object as a first node object.
Preferably, the determining, in the first node object, the set of information that needs to be subjected to the matching operation includes:
selecting an information set in said first node object according to a second predetermined rule;
acquiring a matching amount of the selected information set, wherein the matching amount is exchangeable amount of the first information under a first condition;
and in response to the matching amount of the selected information sets being zero, determining the selected information sets as the information sets needing matching operation.
Preferably, the determining, in the first node object, the information set that needs to be subjected to the matching operation includes:
selecting an information set in the first node object according to a second predetermined rule;
acquiring exchangeable quantity of first information of the selected information set under a second condition; and
and in response to the exchangeable amount of the first information of the selected information set under the second condition being zero, determining the selected information set as the information set which needs to be subjected to the matching operation.
Preferably, the determining, in the first node object, the information set that needs to be subjected to the matching operation includes:
selecting an information set in the first node object according to a second predetermined rule;
acquiring the information fullness of the first information of the selected information set under a second condition; and
and in response to the information satisfaction quantity of the selected information set under the second condition being less than a preset threshold value, determining the selected information set as the information set needing to be subjected to the matching operation.
Preferably, the determining the second node object according to the information set requiring matching operation includes:
selecting one information from the information which can be exchanged under the second condition of the information set needing matching according to a third preset rule to determine the information as second information; and
and determining the node object of the second information as a second node object.
Preferably, the method further comprises:
and traversing the first information in the information set needing matching operation.
Preferably, the method further comprises:
and clearing the information which is exchanged in the information set needing the matching operation.
Preferably, the method further comprises:
and traversing the information set in the first node object.
Preferably, the method further comprises:
updating a locking flag bit of the first node object;
the updating is to change the state of the locking flag bit of the first node object to a locking state.
In a second aspect, an embodiment of the present invention discloses a computer-readable storage medium on which computer program instructions are stored, which, when executed by a processor, implement the method according to the first aspect.
According to the technical scheme of the embodiment of the invention, the second node object is obtained by obtaining the second information matched with the first information, and then the third node object which has authorization relation with the first node object and the second node object is obtained and initiates an information exchange request for the first node object and the second node object to match the two node objects for information exchange. The two node objects without authorization relation can also realize information exchange, thereby improving the efficiency of information exchange and enabling the system to have more flexibility.
Drawings
The above and other objects, features and advantages of the present invention will become more apparent from the following description of embodiments of the present invention with reference to the accompanying drawings, in which:
FIG. 1 is a flow chart of an information matching method of an embodiment of the present invention;
FIG. 2 is a flow chart of determining a first node object according to an embodiment of the present invention;
FIG. 3 is a flow chart for determining a set of information according to an embodiment of the present invention;
FIG. 4 is a flow chart for determining a set of information according to an embodiment of the present invention;
FIG. 5 is a flow chart of determining a set of information according to an embodiment of the present invention;
FIG. 6 is a flow chart for determining a second node object in accordance with an embodiment of the present invention;
FIG. 7 is a flow chart of an information matching method of an embodiment of the present invention;
fig. 8 is a schematic view of an electronic device of an embodiment of the invention.
Detailed Description
The present invention will be described below based on examples, but the present invention is not limited to only these examples. In the following detailed description of the present invention, certain specific details are set forth. It will be apparent to one skilled in the art that the present invention may be practiced without these specific details. Well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the present invention.
Further, those of ordinary skill in the art will appreciate that the drawings provided herein are for illustrative purposes and are not necessarily drawn to scale.
Unless the context clearly requires otherwise, throughout the description and the claims, the words "comprise", "comprising", and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is, what is meant is "including but not limited to".
In the description of the present invention, it is to be understood that the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. In addition, in the description of the present invention, "a plurality" means two or more unless otherwise specified.
Fig. 1 is a flowchart of an information matching method according to an embodiment of the present invention. As shown in fig. 1, the information matching method according to the embodiment of the present invention includes the following steps:
step S100, a first node object is determined, and the state of the first node object is an unlocked state.
Further, fig. 2 is a flowchart of determining a first node object according to an embodiment of the present invention. As shown in fig. 2, determining a first node object according to an embodiment of the present invention includes the following steps:
step S110, a node object is selected from the node object table according to a first predetermined rule.
And step S120, determining a locking state according to the locking zone bit of the selected node object, wherein the locking state comprises a locked state and an unlocked state.
And step S130, in response to the locked state being the unlocked state, taking the node object as a first node object.
Step S140, in response to the locking state being the locking state, selecting a next node object in the node object table according to a first predetermined rule.
Thus, the first node object can be determined.
Step S200, determining an information set which needs to be subjected to matching operation in the first node object, wherein the information set which needs to be subjected to matching operation has at least one piece of first information.
Further, fig. 3 is a flow chart of determining a set of information according to an embodiment of the present invention. As shown in fig. 3, determining the information set according to the embodiment of the present invention includes the following steps:
step S211, selecting an information set in the first node object according to a second predetermined rule.
Step S212, obtaining the matching amount of the selected information set, wherein the matching amount is the exchangeable amount of the first information under the first condition.
And step S213, in response to the matching amount of the selected information set being zero, determining the selected information set as an information set which needs to be subjected to matching operation.
And step S214, responding to the non-zero matching quantity of the selected information set, and selecting the next information set in the first node object according to a second preset rule.
Further, fig. 4 is a flow chart of determining a set of information according to an embodiment of the present invention. As shown in fig. 4, the determining information set according to the embodiment of the present invention includes the following steps:
step S221, selecting an information set in the first node object according to a second predetermined rule.
Step S222, obtaining exchangeable amount of the first information of the selected information set under the second condition.
And step S223, in response to that the exchangeable amount of the first information of the selected information set under the second condition is zero, determining the selected information set as an information set which needs to be subjected to matching operation.
Step S224, in response to the exchangeable amount of the first information being not zero under the second condition for the selected information set, selecting a next information set in the first node object according to a second predetermined rule.
Further, fig. 5 is a flow chart of determining a set of information according to an embodiment of the present invention. As shown in fig. 5, the determining information set according to the embodiment of the present invention includes the following steps:
step S231, selecting an information set in the first node object according to a second predetermined rule.
And step S232, acquiring the information fullness of the first information of the selected information set under the second condition.
And step S233, in response to the information satisfaction quantity of the selected information set under the second condition being less than a preset threshold value, determining the selected information set as an information set which needs to be subjected to matching operation.
And step S234, responding to the information satisfaction quantity of the selected information set under the second condition being larger than the preset threshold value, selecting the next information set in the first node object according to the second preset rule.
It should be understood that for the three methods of determining information sets shown in fig. 3-5, embodiments of the present invention may select one or more of them.
And step S300, determining a second node object according to the information set needing matching operation, wherein the second node object has second information matched with the first information.
Further, fig. 6 is a flowchart of determining a second node object according to an embodiment of the present invention. As shown in fig. 6, determining the second node object according to the embodiment of the present invention includes the following steps:
and step S310, selecting one piece of information from the information which can be exchanged under the second condition and needs to be matched according to a third preset rule, and determining the piece of information as second information.
And step S320, determining the node object of the second information as a second node object.
Step S400, determining a third node object according to the first node object and the second node object.
In this embodiment, the bridging switch of the third node object is turned on, and has a predetermined first authorization relationship with the first node object and a predetermined second authorization relationship with the second node object, respectively.
Step S500, initiating an information exchange request through the third node object.
Thus, information exchange can be realized.
Further, the information matching method of the embodiment of the present invention further includes the following steps:
and step S610, traversing the first information in the information set which needs to be subjected to the matching operation.
And step S620, emptying the information which is required to be subjected to matching operation and completes the exchange in the information set.
And step S630, traversing the information set in the first node object.
And step S640, updating the locking flag bit of the first node object.
In this embodiment, the updating is to change the state of the lock flag of the first node object to an unlocked state.
In the embodiment of the invention, the second node object is obtained by obtaining the second information matched with the first information, and then the third node object which has authorization relation with the first node object and the second node object is obtained and initiates an information exchange request for the first node object and the second node object to match the two node objects for information exchange. The two node objects without authorization relation can also realize information exchange, thereby improving the efficiency of information exchange and enabling the system to have more flexibility.
In an alternative embodiment, the information matching method described above may be applied in an interest rate interchange system to bridge two transaction institutions that are not authorized in the interest rate interchange system to enable transactions between the two transaction structures. Fig. 7 is a flowchart of an information matching method according to an embodiment of the present invention. It should be understood that in this embodiment, the first node object and the second node object are trading institutions in the interest rate interchange system, and the third node object is a bridge institution. Correspondingly, the information set is a digital contract in the exchange, and the information is a digital order placed by the digital contract. Correspondingly, the information is exchanged as a trade for a digital order. Wherein the digital orders include digital orders in a first direction and digital orders in a second direction. Wherein the digital orders in the first direction are buy orders, including a buy price and a buy order total. The numerical order in the second direction is a sell order, including a sell price and a sell total. Correspondingly, the directions of the two mutually matching information are different. As shown in fig. 7, the information matching method according to the embodiment of the present invention includes the following steps:
step S701 selects a node object.
In this embodiment, the system obtains a node object table in advance, where the node object table includes all node objects that need to exchange information.
Further, a node object is selected in the node object table according to a first predetermined rule. The first predetermined rule may be a sequential selection, a random selection, or otherwise.
Step S702, the locking state of the selected node object is detected.
In this embodiment, the system acquires the lock status by detecting the lock flag of the node object. The locked state includes a locked state and an unlocked state.
Further, in response to the locking status being the locked status, the method returns to step S701, and selects a next node object according to a first predetermined rule.
In response to the locked state being the unlocked state, step S703 is entered.
Step S703, selecting an information set.
In this embodiment, one information set is selected according to a second predetermined rule from among the node objects determined in step S702. The information set comprises at least one first information. The second predetermined rule may be a sequential selection, a random selection, or otherwise.
Step S704, detecting the matching amount.
In this embodiment, a matching amount of the first information in the selected information set is detected. The matching amount is an exchangeable amount of the first information under the first condition, that is, the matching amount is an amount of information that can be exchanged at any time before the system matches the first information by the matching method.
Further, the first condition is formed after a third node object adds a new additional condition on the basis of a second condition, and the second condition is an original condition of the first information. For example, if the first information is order information, the second condition is an original price quote of the order, and the first condition is that the third node object (bridge agency) adds a price after a bridge fee on the basis of the original price quote. Correspondingly, the matching amount is the number of orders in the interest rate interactive system that meet the price quote after adding the bridge fee on the basis of the original price quote, and can be used to detect whether the system has already performed information matching for the corresponding information set.
Further, in response to that the matching amount is not zero, it indicates that the system has performed information matching for the first information in the information set, and does not continue to perform information matching. Returning to step S703, the next information set is selected according to the second predetermined rule.
In response to the matching amount being zero, it indicates that the system has not performed information matching for the first information in the information set, and step 705 is entered.
Step 705, exchangeable amount is detected.
In this embodiment, the system obtains the exchangeable amount of the first information in the second condition for the selected information set. For example, if the first information is order information, then the exchangeable amount of the first information under the second condition is the amount of the order that can be traded that corresponds to the original price quoted for the order.
Further, in response to that the exchangeable amount of the first information is not zero under the second condition, it indicates that there is information that can be exchanged in the first information, and information matching is not continued, and the process returns to step S703, and selects a next information set according to a second predetermined rule.
In response to the exchangeable amount of the first information being zero under the second condition, which indicates that there is no information that can be exchanged, the process proceeds to step S706.
Step S706, detecting whether the full amount is greater than a predetermined threshold.
In this embodiment, the system detects that the selected information set is sufficient for the information of the first information under the second condition. For example, if the first information is order information, the information capacity of the first information under the second condition is the total amount of all orders in the system that fit the original price quote for the order.
Further, in response to that the information satisfaction amount of the selected information set under the second condition is greater than the predetermined threshold, it indicates that the selected information set can find the matched information quickly even if the system is not used for matching, and the information matching is not continued, and the process returns to step S703 to select the next information set according to the second predetermined rule.
In response to the information satisfaction amount of the selected information set under the second condition being less than the predetermined threshold, the flow proceeds to step S707.
And step S707, determining second information.
In this embodiment, the system selects one of the information sets to be matched, which is exchangeable under the second condition, to be determined as the second information according to a third predetermined rule. The third predetermined rule may be a sequential selection, a random selection, or otherwise. Then the second information is determined as one of all orders in the system that matches the original price quoted for the order is selected as the second information.
And step S708, determining a second node object.
In this embodiment, the system acquires a node object to which the second information belongs as the second node object.
Step S709, determining a third node object.
In this embodiment, the system determines a third node object according to the first node object and the second node object, where the bridging switch of the third node object is turned on, and has a predetermined first authorized relationship with the first node object and a predetermined second authorized relationship with the second node object, respectively.
Further, in response to the system being unable to determine the third node object, the system returns to step S707, and selects the next information to be determined as the second information according to a third predetermined rule among the information that the set of information that needs to be matched can be exchanged under the second condition.
Further, in response to the system being able to determine the third node object, step S710 is entered.
And step S710, detecting the exchange state.
In this embodiment, after the third node object is determined, the first information and the second information may be exchanged through the third node object. The system detects the exchange state of the first information and the second information, wherein the exchange state comprises the completion of exchange and non-exchange.
Further, in response to not exchanging, the process returns to step S703, and selects the next information set according to the second predetermined rule.
In response to the completion of the exchange, step S711 is entered.
Step S711 clears the exchanged information.
In this embodiment, the system clears the information that the exchange has been completed.
Further, the system traverses the first information in the information set which needs to be matched, and performs information matching on all the first information.
Further, the system traverses the information sets in the first node object and performs information matching for all the information sets.
And step S712, updating the locking state.
In this embodiment, after the system matches the information of all the information sets in the first node object, the system updates the locking state of the first node object. The updating is to change the state of the locking flag bit of the first node object to a locked state. The node object in the locked state cannot perform information matching.
Further, the information matching method further comprises the following steps:
step S713, detecting a matching time.
In this embodiment, the system detects a matching time, which is a time from the start of the system selecting the first node object to the completion of information matching of all information sets of the first node object.
Further, in response to the matching time not exceeding the predetermined time threshold, returning to step S701, selecting the next node object according to the first predetermined rule.
And responding to the fact that the matching time does not exceed a preset time threshold, and finishing the information matching.
Therefore, the method can bridge two transaction mechanisms which do not have authorization relationship with each other in the interest rate interchange system, so that the two transaction mechanisms which do not have authorization relationship with each other can interchange the interest rates, the efficiency of interest rate interchange can be improved, and the system has more flexibility.
In the embodiment of the invention, the second node object is obtained by obtaining the second information matched with the first information, and then the third node object which has authorization relation with the first node object and the second node object is obtained and initiates an information exchange request for the first node object and the second node object to match the two node objects for information exchange. The two node objects without authorization relation can also realize information exchange, thereby improving the efficiency of information exchange and enabling the system to have more flexibility.
Fig. 8 is a schematic diagram of an electronic device of an embodiment of the invention. The electronic device shown in fig. 8 is an automatic question answering apparatus, which includes a general-purpose computer hardware structure including at least a processor 81 and a memory 82. The processor 81 and the memory 82 are via a bus. And (4) connecting. The memory 82 is adapted to store instructions or programs executable by the processor 81. Processor 81 may be a stand-alone microprocessor or a collection of one or more microprocessors. Thus, the processor 81 implements the processing of data and the control of other devices by executing instructions stored by the memory 82 to perform the method flows of embodiments of the present invention as described above. The bus 83 connects the above components together, and also connects the above components to a display controller 84 and a display device and an input/output (I/O) device 85. Input/output (I/O) device 85 may be a mouse, keyboard, modem, network interface, touch input device, motion sensitive input device, printer, and other devices known in the art. Typically, the input/output devices 85 are coupled to the system through an input/output (I/O) controller 86.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, various aspects of embodiments of the invention may take the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a "circuit," module "or" system. Furthermore, various aspects of embodiments of the invention may take the form of: a computer program product embodied in one or more computer readable media having computer readable program code embodied thereon.
Any combination of one or more computer-readable media may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of embodiments of the invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. The computer readable signal medium may be any computer readable medium; is not a computer readable storage medium and may communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of embodiments of the present invention may be written in any combination of one or more programming languages, including: object-oriented programming languages such as Java, small talk, C + + and the like; and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer; or entirely on a remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention described above describe various aspects of embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of 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, 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/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made to the present invention by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (9)
1. An information matching method, characterized in that the method comprises:
determining a first node object, wherein the state of the first node object is an unlocked state;
determining an information set which needs to be subjected to matching operation in the first node object, wherein the information set which needs to be subjected to matching operation has at least one piece of first information;
determining a second node object according to the information set needing matching operation, wherein the second node object has second information matched with the first information;
determining a third node object according to the first node object and the second node object, wherein the bridging switch of the third node object is on, and has a predetermined first authorization relationship with the first node object and a predetermined second authorization relationship with the second node object respectively; and
initiating an information exchange request by the third node object; wherein the content of the first and second substances,
the determining the first node object comprises:
selecting a node object in the node object table according to a first predetermined rule;
determining a locking state according to a locking zone bit of the selected node object, wherein the locking state comprises a locked state and an unlocked state; and
in response to the locked state being an unlocked state, treating the node object as a first node object;
the third node object is a bridge mechanism;
the determining, in the first node object, the set of information that needs to be subjected to the matching operation includes:
selecting an information set in the first node object according to a second predetermined rule;
obtaining a matching amount of the selected information set, wherein the matching amount is an exchangeable amount of the first information under a first condition;
in response to the matching amount of the selected information set being zero, determining the selected information set as an information set which needs to be subjected to matching operation;
wherein the first condition is formed by adding a new additional condition to the third node object based on a second condition, and the second condition is an original condition of the first information.
2. The method of claim 1, wherein determining a set of information in the first node object that requires a matching operation comprises:
selecting an information set in the first node object according to a second predetermined rule;
acquiring exchangeable quantity of first information of the selected information set under a second condition; and
and in response to the exchangeable amount of the first information of the selected information set under the second condition being zero, determining the selected information set as the information set needing to be subjected to the matching operation.
3. The method of claim 1, wherein determining the set of information in the first node object that requires a matching operation comprises:
selecting an information set in the first node object according to a second predetermined rule;
acquiring the information fullness of the first information of the selected information set under a second condition; and
and in response to the information satisfaction quantity of the selected information set under the second condition being less than a preset threshold value, determining the selected information set as the information set needing to be subjected to the matching operation.
4. The method of claim 1, wherein determining a second node object based on the set of information requiring matching comprises:
selecting one information from the information which can be exchanged under the second condition of the information set needing matching according to a third preset rule to determine the information as second information; and
and determining the node object of the second information as a second node object.
5. The method of claim 4, further comprising:
and traversing the first information in the information set which needs to be subjected to the matching operation.
6. The method of claim 5, further comprising:
and clearing the information which is required to be subjected to matching operation and completes the exchange in the information set.
7. The method of claim 6, further comprising:
and traversing the information set in the first node object.
8. The method of claim 7, further comprising:
updating a locking flag bit of the first node object;
the updating is to change the state of the locking flag bit of the first node object to a locked state.
9. A computer-readable storage medium on which computer program instructions are stored, which, when executed by a processor, implement the method of any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910662504.2A CN110390528B (en) | 2019-07-22 | 2019-07-22 | Information matching method and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910662504.2A CN110390528B (en) | 2019-07-22 | 2019-07-22 | Information matching method and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110390528A CN110390528A (en) | 2019-10-29 |
| CN110390528B true CN110390528B (en) | 2022-11-04 |
Family
ID=68286970
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910662504.2A Active CN110390528B (en) | 2019-07-22 | 2019-07-22 | Information matching method and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110390528B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106504094A (en) * | 2016-11-25 | 2017-03-15 | 中国银行股份有限公司 | Transaction match method and system based on the distributed general ledger system of block chain technology |
| KR20180128874A (en) * | 2018-11-14 | 2018-12-04 | 주식회사 미탭스플러스 | Apparatus and method of deposit of cryptocurrency exchange using transaction verification |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7324976B2 (en) * | 2004-07-19 | 2008-01-29 | Amazon Technologies, Inc. | Automatic authorization of programmatic transactions |
| GB2467530A (en) * | 2009-02-03 | 2010-08-11 | Eservglobal Uk Ltd | Credit transfer between telecommunications networks |
| CN104063789B (en) * | 2013-03-18 | 2016-04-20 | 财付通支付科技有限公司 | A kind of method, Apparatus and system that handling object is processed |
| CN108259594B (en) * | 2018-01-11 | 2020-02-18 | 杭州秘猿科技有限公司 | Data interaction system based on block chain and relay server |
| CN109064330A (en) * | 2018-07-19 | 2018-12-21 | 中链科技有限公司 | Service transacting processing method, system and device based on alliance's block chain |
-
2019
- 2019-07-22 CN CN201910662504.2A patent/CN110390528B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106504094A (en) * | 2016-11-25 | 2017-03-15 | 中国银行股份有限公司 | Transaction match method and system based on the distributed general ledger system of block chain technology |
| KR20180128874A (en) * | 2018-11-14 | 2018-12-04 | 주식회사 미탭스플러스 | Apparatus and method of deposit of cryptocurrency exchange using transaction verification |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110390528A (en) | 2019-10-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6911849B2 (en) | Information processing equipment, information processing methods and programs | |
| JP6351779B1 (en) | Information search apparatus, information search method, and information search program | |
| CN108885762B (en) | Method and system for allocating price discovery mechanism in data market | |
| WO2019227609A1 (en) | Blockchain-based smart stock purchase method, device, apparatus and storage medium | |
| JP2020154347A (en) | Credit analysis support method, credit analysis support system and node | |
| CN107451157B (en) | Abnormal data identification method, device and system, and searching method and device | |
| CN110390528B (en) | Information matching method and readable storage medium | |
| CN109118225A (en) | Collectibles management method, device, medium and electronic equipment based on block chain | |
| CN112435068A (en) | Malicious order identification method and device, electronic equipment and storage medium | |
| Bielecki et al. | No‐Arbitrage Pricing for Dividend‐Paying Securities in Discrete‐Time Markets with Transaction Costs | |
| CN111046276A (en) | Data sending method and device | |
| US20160078552A1 (en) | System and method for forecasting payments of healthcare claims | |
| CN109308331B (en) | Patent transaction recommendation method and device | |
| CN104700283B (en) | Data processing method and commodity selling apparatus | |
| WO2015080725A1 (en) | Method and system for facilitating multi-currency card payment transactions | |
| CN112419025A (en) | User data processing method and device, storage medium and electronic equipment | |
| KR20170080128A (en) | Lease payment system and method | |
| CN112131251A (en) | Bidding transaction method and device, readable storage medium and electronic device | |
| CN103886497A (en) | Method and system for generating transaction data in online transaction | |
| US20230377071A1 (en) | Verifiable property record using a distributed electronic ledger | |
| CN111339741B (en) | Account application method and device, computer readable storage medium and electronic equipment | |
| CN110517157B (en) | Method, device, medium and electronic equipment for managing mutual insurance of property | |
| CN115456802B (en) | Insurance event processing system based on digital currency | |
| CN117136370A (en) | Systems, methods, and apparatus for a multi-layered electronic platform for an electronic marketplace | |
| US20150199734A1 (en) | Pricing data according to contribution in a query |
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 |