CN105096174A - Transaction matching method and transaction matching system - Google Patents
Transaction matching method and transaction matching system Download PDFInfo
- Publication number
- CN105096174A CN105096174A CN201410153963.5A CN201410153963A CN105096174A CN 105096174 A CN105096174 A CN 105096174A CN 201410153963 A CN201410153963 A CN 201410153963A CN 105096174 A CN105096174 A CN 105096174A
- Authority
- CN
- China
- Prior art keywords
- product
- queue
- transaction
- trading order
- order form
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a transaction matching method and a transaction matching system. The transaction matching method comprises the steps of carrying out service processing on a transaction appointment submitted by a user and generating a transaction order; regarding the transaction order as a message so as to be transmitted in a first message-oriented middleware; reading the transaction order transmitted in the first message-oriented middleware based on any one server in a matching processing cluster formed by a plurality of servers, matching the transaction order with on-sale products, and generating a result order; and carrying out service processing on the result order. The transaction matching method disclosed by the invention adopts cluster processing, and problems caused by increase in service quantity are processed smoothly through a distributed framework. In addition, overall operations of the transaction matching system are not affected if any one server in the cluster breaks down, and normal operations of the transaction matching system are ensured by only removing the failure server from the cluster, thereby reducing the risk of the transaction matching system.
Description
Technical field
The application relates to transaction system, is specifically related to a kind of deals match method, and the application relates to a kind of deals match system in addition.
Background technology
Coupling refers to that, in many ways concluding the business, in the middle of existing, Transaction Information is in many ways concentrated by a side, is then mated by Transaction Information, to meet in many ways to the demand of transaction.As: in many ways in transaction, the trading order form of each side is concentrated on deals match platform, is matched suitable product after the trading order form that deals match platform processes is above-mentioned, and impels described transaction automatically to strike a bargain simultaneously.The most basic principle that will meet for coupling is time priority principle and price priority principle.According to the supplydemand relationship between described transaction reservation and described product, introduce the concept of market model, in described process of exchange in many ways, if the quantity of the trading order form that the transaction buyer provides is far smaller than the product quantity that the transaction seller provides, then now the buyer is in leading position, is referred to as buyer's market model; Similar with it, described market model also comprises seller's market model, equilibrium market model etc.
The deals match system that prior art adopts is unit, single lining up mode deals match system.Single cpu mode refers to that deals match system is deployed on a station server usually, and all coupling business processions complete in same station server.Single lining up mode refers to that trading order forms all in the middle of deals match system carries out matching treatment by time priority principle in single queue.Fig. 1 provides the schematic diagram of the deals match system that prior art adopts.In the deals match system solution that prior art provides, main distinguish trading order form and result order, by the entrance of trading order form as business, described trading order form to insert in the middle of transaction queue and calls this trading order form by deals match system; After completing above-mentioned calling, carry out matching treatment, described matching treatment completes on a station server, the list of deals match system real-time calling product is inquired about, after inquiring an available product, by business rule, described product is mated with described both trading order forms, the stock of the described product of deduction after the match is successful, and final formation result order.
There is obvious defect in the deals match system that above-mentioned prior art provides.
The deals match system that prior art provides adopts single cpu mode, and hardware resource waste is serious, and there is larger machine of delaying risk.
In the deals match system that above-mentioned prior art provides, deals match system is deployed on a station server usually carries out business processing.The inventory information that in deals match system, business operation relates to, sequence informations etc. are shared by internal memory, along with portfolio progressively promotes, once the business datum amount of current deals match system is beyond the data capacity of current server, then need to purchase the better new server of hardware performance.In addition, deals match Account Dept is deployed on a station server and carries out business processing, the machine once this server is delayed, then the business that deals match system is all is completely unavailable, very risky.
Summary of the invention
The application provides a kind of deals match method, and the application provides a kind of deals match system in addition, and this deals match system can reduce hardware resource waste and reduce machine risk of delaying; In the further preferred embodiment of this deals match system, additionally provide a kind of mode of differentiated service processing priority; In another one preferred implementation, this deals match system can also be configured according to different market models, thus more effectively mates.
The application provides a kind of deals match method, comprising:
Business processing is carried out and generating trading order form to the transaction reservation that user submits to;
Described trading order form is transmitted in the first message-oriented middleware as message;
Read based on any station server in the middle of the matching treatment cluster of multiple servers composition the trading order form transmitted in the form of a message in described first message-oriented middleware, and it is mated with product on sale, generate result order;
Business processing is carried out to described result order.
Optionally, any station server that described transaction is preengage in the middle of the reservation processing cluster that can be made up of multiple servers carries out business processing; And corresponding any transaction reservation, forms one or many transactions order.
Optionally, described first message-oriented middleware comprises multiple transaction queue;
Wherein, described transaction queue comprises queue first and/or retry queue.
Optionally, the number of retries that described retry queue carries out business processing according to wherein trading order form is divided into several retry queues, and the trading order form of identical number of retries is positioned at same retry queue.
Optionally, when described matching treatment cluster reads trading order form in described transaction queue, the processing priority according to this transaction queue performs from high to low successively; And
The processing priority of described queue is first lower than the processing priority of described retry queue; The priority of described retry queue is determined according to the number of retries of trading order form in the middle of this queue, and the more queue priority of number of retries is not higher.
Optionally, described coupling comprises:
From product database, obtain product collection, and described product collection is loaded in the middle of working memory;
Trading order form in the middle of transaction queue is mated with the product in the middle of described product collection.
Optionally, described product collection refers to the product data that the representative current matching read from product database needs; Described product data comprise product category, product quantity and/or various product ratio; And
Described product category, product quantity and/or various product ratio configure according to current market model.
Optionally, described market model comprises buyer's market model, seller's market model and/or equilibrium market model.
The application provides a kind of deals match system in addition, comprising:
Reservation processing unit, carries out business processing and generating trading order form to the transaction reservation that user submits to;
First message-oriented middleware, for receiving the trading order form that described reservation processing unit generates, and it can be used as message transmission;
Matching treatment unit, reads the trading order form that the first message-oriented middleware transmits in the form of a message, and it is mated with product on sale, and generates result order; Described matching treatment unit comprises the matching treatment cluster of multiple servers composition, and described trading order form can carry out business processing by any station server in the middle of matching treatment cluster;
Result treatment unit, for receiving the result order that described matching treatment unit exports, and carries out business processing to described result order.
Optionally, any station server that described transaction is preengage in the middle of the reservation processing cluster that can be made up of multiple servers carries out business processing; And corresponding any transaction reservation, forms one or many transactions order.
Optionally, described first message-oriented middleware comprises multiple transaction queue; Wherein, described transaction queue is made up of queue first and retry queue;
First message-oriented middleware receives the trading order form from described reservation processing unit, and is inserted in the middle of queue first, and the trading order form in the middle of queue first described in matching treatment unit reads carries out business processing;
If described business processing success, then described trading order form is consumed;
If described business processing failure, then described trading order form is inserted in the middle of retry queue.
Optionally, described retry queue is divided into several retry queues according to wherein trading order form by the number of retries that matching treatment unit carries out business processing, and the trading order form of identical number of retries is positioned at same retry queue.
Optionally, when described matching treatment cluster reads trading order form in described transaction queue, the processing priority according to this transaction queue performs from high to low successively; And
The processing priority of described queue is first lower than the processing priority of described retry queue; The priority of described retry queue is determined according to the number of retries of trading order form in the middle of this queue, and the more queue priority of number of retries is not higher.
Optionally, described matching treatment unit comprises coupling preparation subelement, coupling subelement;
Coupling prepares subelement, for obtaining product collection from product database, and is loaded in the middle of working memory by described product collection;
Coupling subelement, for mating the trading order form in the middle of transaction queue with the product in the middle of described product collection.
Optionally, described product collection refers to the product data that the representative current matching read from product database needs; Described product data comprise product category, product quantity and various product ratio; And
Described product category, product quantity and various product ratio configure according to current market model.
Optionally, described working memory is divided into multiple memory partitioning by the product category according to described product collection, and described memory partitioning is according to the various product one_to_one corresponding in the middle of the principle of the corresponding series products in memory partitioning and described product collection.
Optionally, described market model comprises buyer's market model, seller's market model, equilibrium market model.
Optionally, arrange the maximum permissible value of matching times, if the matching times of trading order form exceedes this maximum permissible value, then this trading order form is rejected by matching treatment unit from transaction queue.
Optionally, described result treatment unit is cooperated with described matching treatment unit by the second message-oriented middleware, the result order that described matching treatment unit generates forms result indent queue in the second message-oriented middleware, and described result treatment unit reads result order successively from this queue.
Compared with prior art, the application has the following advantages:
The deals match system that the application provides, the deals match system that solving prior art provides adopts single cpu mode cause serious waste of resources and there is the larger problem of risk.
In the deals match system that prior art provides, deals match system is deployed on a large machine server usually carries out business processing.Along with portfolio progressively promotes, once the business datum amount of current deals match system exceeds the data capacity of described server, then need to purchase new server, former server faces idle, causes the wasting of resources.In addition, deals match Account Dept is deployed on a station server and carries out business processing, the machine once this server is delayed, then all business of deals match system all can be failed, very risky.
The deals match system that the application provides, adopts distributed system, comprises reservation processing unit, carries out business processing and generating trading order form to the transaction reservation that user submits to; First message-oriented middleware, for receiving the trading order form that described reservation processing unit generates, and it can be used as message transmission; Matching treatment unit, reads the trading order form that the first message-oriented middleware transmits in the form of a message, and it is mated with product on sale, and generates result order; Described matching treatment unit comprises the matching treatment cluster of multiple servers composition, and described trading order form can carry out business processing by any station server in the middle of matching treatment cluster; Result treatment unit, for receiving the result order that described matching treatment unit exports, and carries out business processing to described result order.
In the above-mentioned deals match system that the application provides, described matching treatment cluster is made up of multiple servers, under this distributed structure/architecture, if the lifting along with portfolio causes the processing power of distributed transaction matching system not enough, by the quantity increasing the server in the middle of described matching treatment cluster, whole cluster can be expanded, thus the problem that the growth of level and smooth process portfolio causes, the problem of resource waste that the unit deals match system solving prior art needs device upgrade to cause.Meanwhile, matching treatment cluster described in the application adopts a kind of without master deployment scheme, if any station server in the middle of described matching treatment cluster breaks down, can not affect the overall operation of distributed transaction matching system.For when occurring that server cannot normally work in the middle of described matching treatment cluster, only need by monitor and detection to described server can not duty, thus described server is rejected in the middle of described matching treatment cluster, ensure the normal operation of described reservation processing cluster, reduce the risk of described distributed transaction matching system.
Accompanying drawing explanation
Fig. 1 is the schematic diagram of the deals match system that prior art provides.
Fig. 2 is a kind of deals match method processing flow chart that the application first embodiment provides.
Fig. 3 is the schematic diagram of a kind of deals match system that the application second embodiment provides.
Fig. 4 is the process flow diagram of a kind of deals match system reservation processing unit 301 processing procedure that the application second embodiment provides.
Fig. 5 is the process flow diagram of a kind of deals match system matches preparation subelement 303-1 processing procedure that the application second embodiment provides.
Fig. 6 is the process flow diagram of a kind of deals match system matches subelement 303-2 processing procedure that the application second embodiment provides.
Fig. 7 is the process flow diagram of a kind of deals match system results processing unit 305 processing procedure that the application second embodiment provides.
Embodiment
Set forth a lot of detail in the following description so that fully understand the application.But the application can be much different from alternate manner described here to implement, those skilled in the art can when doing similar popularization without prejudice to when the application's intension, and therefore the application is by the restriction of following public concrete enforcement.
The application provides a kind of deals match method, and in addition, the application also provides a kind of deals match system.
A kind of embodiment of deals match method is as follows:
Embodiment one
With reference to Fig. 2, it illustrates the present embodiment and a kind of deals match method processing flow chart is provided.
Described in the present embodiment, deals match method comprises the following steps:
S201; The transaction receiving user's submission is preengage and is stored into reservation databases.
Receive the transaction that user submits to described in this step to preengage and be stored into reservation databases and performed by reservation processing cluster.Described transaction is preengage real-time storage in reservation databases after receiving the transaction reservation of user's submission by reservation processing cluster.
Described reservation processing cluster comprises multiple servers, and any station server in the middle of this reservation processing cluster all can perform above-mentioned processing procedure.
S202; Read transaction reservation from reservation databases, business processing is carried out to described transaction reservation, and exports after being converted into trading order form.
In above-mentioned steps S201, completed by described reservation processing cluster and reservation databases process has been stored in described transaction reservation.In this step, when reservation processing cluster processes described transaction reservation, in the middle of described reservation databases, first read described transaction reservation; Secondly business processing is carried out to described transaction reservation and form trading order form; Finally described trading order form is exported.A corresponding transaction reservation, generates one or strokes trading order form.
S203; Receive described trading order form, and this trading order form is inserted in the first message-oriented middleware.
Described first message-oriented middleware comprises queue first and retry queue;
Wherein, the retry set of queues that is made up of multiple retry queue of described retry queue; The quantity of described retry queue is determined according to the overstocked number of trading order form in the middle of retry queue.
Queue in the middle of described first message-oriented middleware also comprises priority and arranges, and specifically arranges as follows:
The priority of described retry queue is determined according to the number of retries of trading order form in the middle of retry queue, and the retry queue priority that described number of retries is larger is also higher.
Described queue first and the retry global precedence effect level order to team is as follows:
Retry queue n> ... > retry queue 2> retry queue 1> queue first.
In addition, described first message-oriented middleware can also adopt the set of queues outside the present embodiment to realize, and the priority setting of described queue also can adopt the method outside the present embodiment to realize, in this no limit.
S204; Trading order form is read from described first message-oriented middleware.
Described matching treatment cluster reads according to the priority orders of queue in the middle of described first message-oriented middleware when reading described trading order form from the first message-oriented middleware, and the preferential trading order form read in the middle of the higher queue of priority.
S205; From working memory, find the product that current matching needs most, and read the product data of this product.
Described working memory needs the product data of product for storing matching process.
Before find the product that current matching needs most from working memory, comprise the following steps:
1) from product database, read the product collection of Vehicles Collected from Market model adaptation;
Described product collection derives from product database, and is the product data that current matching needs most, and the full dose product data of described product collection not necessarily in product database, only represent the portioned product data that current matching needs most.Described product data comprise product category, product quantity and various product ratio.
Further, described product category, product quantity and various product ratio configure according to current market model (comprising: buyer's market model, seller's market model, equilibrium market model).
Such as:
A, under the model of buyer's market, the buyer in the middle of both parties is in leading status, and the product that the seller provides is more, and the demand of the buyer is less, and within considerable time, the product provided of the seller cannot consume by the buyer completely.
Now, can increase the quantity that described working memory loads product, that is: the product quantity of described product collection, is configured to maximum, as 100,000 by the quantity of described product collection.
In addition, also can, by the ratio of various product in the middle of the described product collection of configuration, product content be made to meet the purchase application of most user as much as possible.The main purchase application Dou Shi bank series products of the such as current buyer, then increase the ratio of bank's series products in the middle of described product collection, to promote the success ratio of coupling, so the proportioning of product in the middle of described product collection may be:
Mechanism's product: 10%; P2P product 10%; Bank product 75%; Other products 5%.
B, under the model of seller's market, the seller in the middle of both parties is in leading status, and the buyer is a lot, and the product that the seller provides is little, once the seller provides product, will have been consumed in a short time by the buyer.
Now, the product quantity of described product collection can be reduced, the quantity of described product collection is configured to 40,000.
In addition, configure described product collection according to the market pattern of product as far as possible, do enough consumptions to ensure that various product can obtain.Such as, the proportioning of product is:
Mechanism's product: 5%; P2P product 60%; Bank product 25%; Other products 10%.
C, under equilibrium market model, both parties are at equilibrium.
Now, the configuration of product collection is trended towards to the intermediateness of above-mentioned buyer's market model and seller's market model, even, configure described product collection according to the marketing strategy of business.Such as, the proportioning of product is:
Mechanism's product: 10%; P2P product 50%; Bank product 10%; Other products 30%.
In the present embodiment, described product collection configures according to different market models, thus make described product energy collecting enough farthest meet the product of user for the demand of product and simultaneously reasonably under consumption Vehicles Collected from Market model, support described distributed transaction matching system business processing under multiple market model.
2) memory partitioning of various product and working memory in the middle of described product collection is stored in the middle of memory partitioning according to one-to-one principle;
Described working memory is divided into different memory partitionings to store described product collection, such as: the mechanism's product in the middle of product collection, P2P product, bank product and other products, according to the principle of the corresponding series products in memory partitioning, and to be stored in the middle of each self-corresponding memory partitioning.
After completing the Data Preparation of above-mentioned two steps, enter searching product and reading product data process of this step.
B+ tree is adopted to set up index to product, with the product that fast finding is relevant; Certainly, the indexing means using other is not got rid of yet.
B+ tree is a kind of data tree structure, is generally used in the file system of database and operating system.The feature of B+ tree to keep data stabilization orderly, and it inserts and has more stable logarithmic time complexity with amendment.B+ sets element bottom-up insertion, and this and binary tree are just the opposite.
Node in B+ tree is represented as one group of orderly element and sub-pointer usually.If the ordinal number (order) that this B+ sets is m, then each node except root comprises the maximum m-1 of a minimum m/2 element element, has maximum m sub-pointer for arbitrary node.For all non-leaf nodes, the number of sub-pointer always more than the number of element one.
The element of each non-leaf nodes serves as the separation value of separately its subtree.Such as, if non-leaf nodes has three child nodes (or subtree), then it must have two separation values (a1, a2); Values all in the subtree on the left side is all less than a1, and values all in middle subtree is all between a1 and a2, and values all in the subtree of the right is all greater than a2.
The mode of searching of B+ is similar to binary tree search, originates in root node, top-down traverse tree.When searching, if the key value in non-leaf nodes equals the desired value that will inquire about, do not stop inquiry, but continue downwards until leafy node.Therefore, in B+ tree, no matter search success or not, search is all walked a path from root node to leafy node at every turn.
B+ is adopted to set the operational data test comparison of searching the mode of searching of mode and common traversal as follows:
| Product quantity list | Common traversal searches unit/in the least | B+ tree searches unit/millisecond |
| 10000 | 4981.54 | 1894.237 |
| 20000 | 1677.428 | 139.346 |
| 30000 | 2196.821 | 164.908 |
| 40000 | 3881.273 | 141.766 |
| 50000 | 3907.733 | 129.441 |
| 60000 | 4866.081 | 135.001 |
| 70000 | 5356.214 | 145.497 |
| 80000 | 6052.107 | 128.189 |
| 90000 | 7694.815 | 135.467 |
| 100000 | 7411.704 | 126.357 |
The algorithm complex that common traversal is searched is O [], and the complexity of B+ tree algorithm is O [log
2n], the query time based on the mode of searching of common traversal is linear increase substantially as can be seen from upper table also, and the query time that B+ tree searches mode is progressively stabilized in a minimum value, there is not the situation of linear increase.In addition, in actual applications, can according to expected yield, product issuing time, product type, production life cycle, the data such as the minimum purchase share of product are set up B+ and are set index, easy-to-look-up.
It should be noted that, above-mentioned working memory, product integrate, the implementation method of market model and index search as a kind of preferred implementation of the application, in addition, the method outside the present embodiment all can be adopted to realize, in this no limit.
S206; Described trading order form is mated with described product.
The product data that the trading order form read according to above-mentioned steps S204 and step S205 read, both products that described trading order form is corresponding with described product data mate; Described coupling meets time priority principle and price priority principle.
S207; Judge that whether described coupling is successful.
If the match is successful, then enter step S208;
If it fails to match, then enter following steps:
Judge whether the matching times of described trading order form exceedes maximum permissible value;
If described matching times exceedes maximum permissible value, then described trading order form is rejected in the middle of described transaction queue;
If described matching times does not exceed maximum permissible value, then described trading order form is proceeded in the middle of the more higher leveled transaction queue of priority from current transaction queue.
The object arranging the maximum permissible value of matching times is in order to avoid the wasting of resources.In deals match process, sometimes have the trading order form that some conditions are harsh especially, these trading order forms cannot obtain the product on sale matched all the time; And according to the prioritization schemes of this match trading system, this trading order form can obtain very high priority level, like this, will cause match trading system is constantly these trading order form input coefficient resources, but cannot produce and obtain coupling achievement, for this reason, this deals match system pre-sets the maximum permissible value of coupling, as the criterion whether continuing as a certain trading order form input coefficient resource.If exceed this maximum permissible value, then reject this trading order form to save system resource.
S208; Described trading order form is converted to result order, and this result order is inserted into the second message-oriented middleware.
The processing procedure of this step is performed by matching treatment cluster, and the processing procedure of above-mentioned steps S204 to S207 performs by matching treatment cluster.
Described matching treatment cluster comprises multiple servers, and the processing procedure of above-mentioned steps S204 to S207 and this step all can perform handled by any station server in the middle of this matching treatment cluster.
S209; From described second message-oriented middleware, read result order, business processing is carried out and outgoing traffic result to described result order.
Described second message-oriented middleware be implemented as a result queue, described result queue comprises multiple result order, each result order is as a message of the second message-oriented middleware, and described second message-oriented middleware meets first in first out and possesses the function of initiatively PUSH.
It is as follows that described result order carries out business procession:
1) result treatment cluster receives the trading instruction for described trading order form that user sends;
Described result treatment cluster comprises multiple servers, and described trading order form can perform handled by any station server in the middle of this result treatment cluster.
2) corresponding operation is performed according to described trading instruction, outgoing traffic result.
Such as: user agrees to described result order, and by the instruction placed an order be committed in the middle of described match trading system; Described deals match system performs respective operations according to described lower single instrction, and proceeds to payment step, and completes the payment to described result order.After completing the business processing to described result order, the service processing result of described result order is stored in transaction data base.
A kind of deals match system embodiment is as follows:
Embodiment two
With reference to Fig. 3--Fig. 7, it illustrates a kind of deals match system provided according to the application first embodiment.Comprise:
Fig. 3 is the schematic diagram of a kind of deals match system that the present embodiment provides;
Fig. 4--Fig. 7 is the component units internal processes figure that a kind of deals match system that the present embodiment provides is concrete; Wherein
Fig. 4 shows the process flow diagram of reservation processing unit 301 processing procedure; Fig. 5 shows the process flow diagram that coupling prepares subelement 303-1 processing procedure; Fig. 6 shows the process flow diagram of coupling subelement 303-2 processing procedure; Fig. 7 shows the process flow diagram of result treatment unit 305 processing procedure.
With reference to Fig. 2, it illustrates the schematic diagram of a kind of deals match system that the present embodiment provides.
Described deals match system comprises: reservation processing unit 301, first message-oriented middleware 302, matching treatment unit 303, second message-oriented middleware 304 and result treatment unit 305.
Reservation processing unit 301; After business processing is carried out in transaction reservation for user being submitted to, described transaction reservation is converted to trading order form.
With reference to Fig. 4, it illustrates the process flow diagram of a kind of deals match system reservation processing unit 301 processing procedure that the present embodiment provides.
S401; The transaction receiving user's submission is preengage and is stored into reservation databases.
S402; Read transaction reservation from reservation databases, business processing is carried out to described transaction reservation, and exports after being converted into trading order form.
The transaction submitted to for user is preengage by the middle of reservation processing cluster real-time storage to reservation databases; When reservation processing cluster processes described transaction reservation, read described transaction and preengage and carry out business processing in the middle of described reservation databases, corresponding described any transaction reservation, forms one or many transactions order; After generating trading order form, described trading order form is exported.
Wherein, described reservation processing cluster is made up of multiple servers, and described transaction reservation can be carried out business processing by any subscription server in described reservation processing cluster.
First message-oriented middleware 302; For receiving the trading order form that described reservation processing unit 301 generates, and it can be used as message transmission.
First message-oriented middleware be implemented as a transaction queue group; Described transaction queue group is made up of queue first and retry queue;
First message-oriented middleware 302 receives described trading order form from described reservation processing unit 301, and is inserted in the middle of queue first, and the trading order form in the middle of queue first described in matching treatment unit reads carries out business processing;
If described business processing success, then described trading order form is consumed;
If described business processing failure, then described trading order form is inserted in the middle of retry queue.
Described trading order form transmits in the form of a message in the middle of described first message-oriented middleware 302.Further, described first message-oriented middleware 302 meets first in first out and has the function of initiatively PUSH.
Matching treatment unit 303; Described matching treatment unit 303 comprises coupling and prepares subelement 303-1 and coupling subelement 303-2.
Coupling prepares subelement 303-1; For reading product collection from product database, and described product collection is loaded in the middle of working memory.
A large amount of product data are needed to mate with described trading order form in the middle of process due to coupling, described product data are stored in product database, if therefore read above-mentioned large-tonnage product data from described product database in the process of coupling, the performance bottleneck of equipment must be faced.There is provided in technical scheme at the present embodiment, in advance by mate the product data needed most in the middle of described product database and be loaded into described matching treatment cluster working memory in the middle of.
With reference to Fig. 5, a kind of deals match system matches that it illustrates the present embodiment provides prepares the process flow diagram of subelement 303-1 processing procedure.
S501; The product collection of Vehicles Collected from Market model adaptation is read from product database.
Described product collection derives from product database, and is the product data that current matching needs most, and the full dose product data of described product collection not necessarily in product database, only represent the portioned product data that current matching needs most.Described product data comprise product category, product quantity and various product ratio.
Further, described product category, product quantity and various product ratio configure according to current market model (comprising: buyer's market model, seller's market model, equilibrium market model).
Such as:
1) under the model of buyer's market, the buyer in the middle of both parties is in leading status, and the product that the seller provides is more, and the demand of the buyer is less, and within considerable time, the product provided of the seller cannot consume by the buyer completely.
Now, can increase the quantity that described working memory loads product, that is: the product quantity of described product collection, is configured to maximum, as 100,000 by the quantity of described product collection.
In addition, also can be concentrated the ratio of various product by the described product of configuration, make product content meet the purchase application of most user as much as possible.The main purchase application Dou Shi bank series products of the such as current buyer, then increase the ratio of bank's series products in the middle of described product collection, to promote the success ratio of coupling, so the proportioning of product in the middle of described product collection may be:
Mechanism's product: 10%; P2P product 10%; Bank product 75%; Other products 5%.
2) under the model of seller's market, the seller in the middle of both parties is in leading status, and the buyer is a lot, and the product that the seller provides is little, once the seller provides product, will have been consumed in a short time by the buyer.
Now, the product quantity of described product collection can be reduced, the quantity of described product collection is configured to 40,000.
In addition, configure described product collection according to the market pattern of product as far as possible, do enough consumptions to ensure that various product can obtain.Such as, the proportioning of product is:
Mechanism's product: 5%; P2P product 60%; Bank product 25%; Other products 10%.
3) under equilibrium market model, both parties are at equilibrium.
Now, the configuration of product collection is trended towards to the intermediateness of above-mentioned buyer's market model and seller's market model, even, configure described product collection according to the marketing strategy of business.Such as, the proportioning of product is:
Mechanism's product: 10%; P2P product 50%; Bank product 10%; Other products 30%.
In the present embodiment, described product collection configures based on market model, thus make described product energy collecting enough farthest meet the product of user for the demand of product and simultaneously reasonably under consumption Vehicles Collected from Market model, support the business processing of described distributed transaction matching system under multiple market model.
S502; Described product also concentrates the memory partitioning of various product and working memory according to one-to-one principle corresponding stored by the product collection described in receiving step S501.
Described working memory is divided into different memory partitionings to store described product collection, such as: the mechanism's product in the middle of product collection, P2P product, bank product and other products, according to the principle of the corresponding series products in memory partitioning, and to be stored in the middle of each self-corresponding memory partitioning.
Coupling subelement 303-2, for reading described trading order form in the middle of the first message-oriented middleware 302, read the product data of described product from the working memory described in step S502, mates the two, and output matching result.
With reference to Fig. 6, show the process flow diagram of the coupling subelement 303-2 processing procedure of a kind of deals match system that the present embodiment provides.
S601; From the working memory described in step S502, find the product that current matching needs most, read the product data of this product and export.
Described product collection is loaded in the middle of working memory from product database by above-mentioned steps S502, and this step searches the product that current matching needs most further in the middle of described working memory, and reads this product data.
From working memory, search described product according to the product data of product described in this step, the concrete B+ of employing sets and sets up index to product, with the product that fast finding is relevant; Certainly, the indexing means using other is not got rid of yet.
B+ tree is a kind of data tree structure, is generally used in the file system of database and operating system.The feature of B+ tree to keep data stabilization orderly, and it inserts and has more stable logarithmic time complexity with amendment.B+ sets element bottom-up insertion, and this and binary tree are just the opposite.
Node in B+ tree is represented as one group of orderly element and sub-pointer usually.If the ordinal number (order) that this B+ sets is m, then each node except root comprises the maximum m-1 of a minimum m/2 element element, has maximum m sub-pointer for arbitrary node.For all non-leaf nodes, the number of sub-pointer always more than the number of element one.
The element of each non-leaf nodes serves as the separation value of separately its subtree.Such as, if non-leaf nodes has three child nodes (or subtree), then it must have two separation values (a1, a2); Values all in the subtree on the left side is all less than a1, and values all in middle subtree is all between a1 and a2, and values all in the subtree on the right is all greater than a2.
The mode of searching of B+ is similar to binary tree search, originates in root node, top-down traverse tree.When searching, if the key value in non-leaf nodes equals the desired value that will inquire about, do not stop inquiry, but continue downwards until leafy node.Therefore, in B+ tree, no matter search success or not, search is all walked a path from root node to leafy node at every turn.
B+ is adopted to set the operational data test comparison of searching the mode of searching of mode and common traversal as follows:
| Product quantity unit/ | Common traversal searches unit/millisecond | B+ tree searches unit/millisecond |
| 10000 | 4981.54 | 1894.237 |
| 20000 | 1677.428 | 139.346 |
| 30000 | 2196.821 | 164.908 |
| 40000 | 3881.273 | 141.766 |
| 50000 | 3907.733 | 129.441 |
| 60000 | 4866.081 | 135.001 |
| 70000 | 5356.214 | 145.497 |
| 80000 | 6052.107 | 128.189 |
| 90000 | 7694.815 | 135.467 |
| 100000 | 7411.704 | 126.357 |
The algorithm complex that common traversal is searched is O [], the complexity of B+ tree algorithm is O [], as can be seen from upper table also, query time based on the mode of searching of common traversal is linear increase substantially, and the query time that B+ tree searches mode is progressively stabilized in a minimum value, there is not the situation of linear increase.In addition, in actual applications, can according to expected yield, product issuing time, product type, production life cycle, the data such as the minimum purchase share of product are set up B+ and are set index, easy-to-look-up.
S602; The product data of the described product that receiving step S601 exports, and described trading order form is read in the middle of the first message-oriented middleware 302, the two is mated.
Read the trading order form in the middle of queue first in described first message-oriented middleware 302, and its product data with described step S601 output products are mated therebetween, and described coupling meets time priority principle and price priority principle.
S603; Judge that whether described coupling is successful.
If the match is successful described in step S602, then perform step S604;
If it fails to match described in step S602, then perform step S605.
S604; Described trading order form is converted to result order and exports.
Described trading order form is converted into result order, and exports described result order to second message-oriented middleware 304; This time transaction processing process completes, and can return step S601 and carry out next round coupling.
S605; Judge whether the matching times of described trading order form exceedes maximum permissible value.
This step carries out the maximum permissible value of matching times according to trading order form in the described transaction queue arranged in advance, judges whether the matching times of current trading order form exceedes this maximum permissible value; If the matching times of described trading order form exceedes this maximum permissible value, then perform step S606; If the matching times of described trading order form does not exceed this maximum permissible value, then perform step S607;
The object arranging the maximum permissible value of matching times is in order to avoid the wasting of resources.In deals match process, sometimes have the trading order form that some conditions are harsh especially, these trading order forms cannot obtain the product on sale matched all the time; And according to the prioritization schemes of this match trading system, this trading order form can obtain very high priority level, like this, will cause match trading system is constantly these trading order form input coefficient resources, but cannot produce and obtain coupling achievement, for this reason, this deals match system pre-sets the maximum permissible value of coupling, as the criterion whether continuing as a certain trading order form input coefficient resource.If exceed this maximum permissible value, then reject this trading order form to save system resource.
S606; Described trading order form is rejected in the middle of described transaction queue.
Rejected in the middle of described transaction queue by described trading order form by matching treatment cluster, this transaction order is judged as that it fails to match, no longer carries out the matching treatment of repetition; As more perfect processing scheme, when being rejected in the middle of described transaction queue by this trading order form, corresponding notification can also be generated, and send it to the client sending relationship trading reservation, due to the Core Feature that this is not this deals match system, no longer describe in detail at this.After completing this step, return step S601, carry out next round coupling.
S607; Described trading order form is proceeded in the middle of the more higher leveled transaction queue of priority from current transaction queue.
Read from the queue first of described first message-oriented middleware 302 by matching treatment cluster by the trading order form of matching treatment if current, then this trading order form is proceeded in the middle of retry queue 1;
Read from the retry queue of described first message-oriented middleware 302 by matching treatment cluster by the trading order form of matching treatment if current, then this trading order form is proceeded to than in the middle of the more higher leveled retry queue of current retry queue priority.
When matching treatment cluster mates with the product in the middle of described product collection described trading order form, described in processing successively according to the priority orders of queue, queue first and retry are to the trading order form in the middle of queue.
The priority of described queue is first lower than the priority of described retry queue; Described retry queue is a set of queues, is made up of multiple retry queue, and the priority of described retry queue is determined according to the number of retries of trading order form in the middle of described retry queue, and the retry queue priority that described number of retries is larger is also higher.Described queue first and the retry global precedence effect level order to team is as follows:
Retry queue n> ... > retry queue 2> retry queue 1> queue first.
In the present embodiment, in described transaction queue group, the processing priority of transaction queue is arranged, and has well distinguished the processing priority of business processing in distributed transaction matching system.
It should be noted that, the quantity of described retry queue is determined according to the overstocked number of trading order form in the middle of retry queue.In described retry queue, the overstocked number of trading order form is relevant with described market model, that is: can configure the quantity of described retry queue according to described market model.
Such as:
Under the model of buyer's market, the seller has enough products to mate, and the probability of retry is extremely low, now, the quantity of retry queue can be configured to 2;
Under the model of seller's market, the supply of product is far smaller than the trading order form of the buyer, and a large amount of trading order forms may cannot find adaptive product in first fit, distinguishes so need to carry out strategy effectively to the application of retry after first purchase and failure.Now, a kind of configuration of recommendation is 10 by retry cohort design.
Although have employed the mode being divided into multiple retry queue according to number of retries in the present embodiment, virtually completely also can adopt and only have a retry queue, retry does not still have the trading order form that the match is successful can reenter described retry queue for the first time, until after number of retries exceedes maximum permissible value, this trading order form is rejected.
Described second message-oriented middleware 304; For carrying out Message Transmission therebetween at described matching treatment unit 303 and result treatment unit 305.
Described second message-oriented middleware 304 is implemented as a result queue; Described result queue comprises multiple independently result order, and each result order is as a message of described second message-oriented middleware 304.
Further, described second message-oriented middleware 304 meets first in first out and possesses the function of initiatively PUSH.
Described result treatment unit 305; For reading the result order in the middle of described second message-oriented middleware 304, and outgoing traffic result after being carried out business processing.
With reference to Fig. 7, it illustrates the process flow diagram of a kind of deals match system results processing unit 305 processing procedure that the present embodiment provides.
S701; Result treatment unit 305 receives the relationship trading instruction that user submits to, and responds this trading instruction.
First user responds described result order, and described response results is committed to distributed transaction matching system.
S702; The response results of trading instruction described in receiving step S701, and perform corresponding operation according to this response results, outgoing traffic result.
Described distributed matcher transaction system, according to the accordingly result of user, performs corresponding operation.And described Transaction Information is stored in the middle of transaction data base.
Such as: in step s 701, user agrees to described result order, and the instruction placed an order is committed in the middle of described match trading system;
In step S702, described deals match system performs respective operations according to described lower single instrction, and proceeds to payment step, and completes the payment to described result order.After completing the business processing to described result order, the service processing result of described result order is stored in transaction data base.
Although the application with preferred embodiment openly as above; but it is not for limiting the application; any those skilled in the art are not departing from the spirit and scope of the application; can make possible variation and amendment, the scope that therefore protection domain of the application should define with the application's claim is as the criterion.
In one typically configuration, computing equipment comprises one or more processor (CPU), input/output interface, network interface and internal memory.
Internal memory may comprise the volatile memory in computer-readable medium, and the forms such as random access memory (RAM) and/or Nonvolatile memory, as ROM (read-only memory) (ROM) or flash memory (flashRAM).Internal memory is the example of computer-readable medium.
1, computer-readable medium comprises permanent and impermanency, removable and non-removable media can be stored to realize information by any method or technology.Information can be computer-readable instruction, data structure, the module of program or other data.The example of the storage medium of computing machine comprises, but be not limited to phase transition internal memory (PRAM), static RAM (SRAM), dynamic RAM (DRAM), the random access memory (RAM) of other types, ROM (read-only memory) (ROM), Electrically Erasable Read Only Memory (EEPROM), fast flash memory bank or other memory techniques, read-only optical disc ROM (read-only memory) (CD-ROM), digital versatile disc (DVD) or other optical memory, magnetic magnetic tape cassette, tape magnetic rigid disk stores or other magnetic storage apparatus or any other non-transmitting medium, can be used for storing the information can accessed by computing equipment.According to defining herein, computer-readable medium does not comprise non-temporary computer readable media (transitorymedia), as data-signal and the carrier wave of modulation.
2, it will be understood by those skilled in the art that the embodiment of the application can be provided as method, system or computer program.Therefore, the application can adopt the form of complete hardware embodiment, completely software implementation or the embodiment in conjunction with software and hardware aspect.And the application can adopt in one or more form wherein including the upper computer program implemented of computer-usable storage medium (including but not limited to magnetic disk memory, CD-ROM, optical memory etc.) of computer usable program code.
Claims (19)
1. a deals match method, is characterized in that, comprising:
Business processing is carried out and generating trading order form to the transaction reservation that user submits to;
Described trading order form is transmitted in the first message-oriented middleware as message;
Read based on any station server in the middle of the matching treatment cluster of multiple servers composition the trading order form transmitted in the form of a message in described first message-oriented middleware, and it is mated with product on sale, generate result order;
Business processing is carried out to described result order.
2. deals match method according to claim 1, is characterized in that, any station server in the middle of the reservation processing cluster that described transaction reservation can be made up of multiple servers carries out business processing; And corresponding any transaction reservation, forms one or many transactions order.
3. deals match method according to claim 1, is characterized in that, described first message-oriented middleware comprises multiple transaction queue;
Wherein, described transaction queue comprises queue first and/or retry queue.
4. deals match method according to claim 3, is characterized in that, the number of retries that described retry queue carries out business processing according to wherein trading order form is divided into several retry queues, and the trading order form of identical number of retries is positioned at same retry queue.
5. deals match method according to claim 4, is characterized in that, when described matching treatment cluster reads trading order form in described transaction queue, the processing priority according to this transaction queue performs from high to low successively; And
The processing priority of described queue is first lower than the processing priority of described retry queue; The priority of described retry queue is determined according to the number of retries of trading order form in the middle of this queue, and the more queue priority of number of retries is not higher.
6. deals match method according to claim 5, is characterized in that, described coupling comprises:
From product database, obtain product collection, and described product collection is loaded in the middle of working memory;
Trading order form in the middle of transaction queue is mated with the product in the middle of described product collection.
7. deals match method according to claim 6, is characterized in that, described product collection refers to the product data that the representative current matching read from product database needs; Described product data comprise product category, product quantity and/or various product ratio; And
Described product category, product quantity and/or various product ratio configure according to current market model.
8. deals match system, method according to claim 7, is characterized in that, described market model comprises buyer's market model, seller's market model and/or equilibrium market model.
9. a deals match system, is characterized in that, comprising:
Reservation processing unit, carries out business processing and generating trading order form to the transaction reservation that user submits to;
First message-oriented middleware, for receiving the trading order form that described reservation processing unit generates, and it can be used as message transmission;
Matching treatment unit, reads the trading order form that the first message-oriented middleware transmits in the form of a message, and it is mated with product on sale, and generates result order; Described matching treatment unit comprises the matching treatment cluster of multiple servers composition, and described trading order form can carry out business processing by any station server in the middle of matching treatment cluster;
Result treatment unit, for receiving the result order that described matching treatment unit exports, and carries out business processing to described result order.
10. deals match system according to claim 9, is characterized in that, any station server in the middle of the reservation processing cluster that described transaction reservation can be made up of multiple servers carries out business processing; And corresponding any transaction reservation, forms one or many transactions order.
11. deals match systems according to claim 9, is characterized in that, described first message-oriented middleware comprises multiple transaction queue; Wherein, described transaction queue is made up of queue first and retry queue;
First message-oriented middleware receives the trading order form from described reservation processing unit, and is inserted in the middle of queue first, and the trading order form in the middle of queue first described in matching treatment unit reads carries out business processing;
If described business processing success, then described trading order form is consumed;
If described business processing failure, then described trading order form is inserted in the middle of retry queue.
12. deals match systems according to claim 11, it is characterized in that, described retry queue is divided into several retry queues according to wherein trading order form by the number of retries that matching treatment unit carries out business processing, and the trading order form of identical number of retries is positioned at same retry queue.
13. deals match systems according to claim 12, is characterized in that, when described matching treatment cluster reads trading order form in described transaction queue, the processing priority according to this transaction queue performs from high to low successively; And
The processing priority of described queue is first lower than the processing priority of described retry queue; The priority of described retry queue is determined according to the number of retries of trading order form in the middle of this queue, and the more queue priority of number of retries is not higher.
14. deals match systems according to claim 13, is characterized in that, described matching treatment unit comprises coupling and prepares subelement, coupling subelement;
Coupling prepares subelement, for obtaining product collection from product database, and is loaded in the middle of working memory by described product collection;
Coupling subelement, for mating the trading order form in the middle of transaction queue with the product in the middle of described product collection.
15. deals match systems according to claim 14, is characterized in that, described product collection refers to the product data that the representative current matching read from product database needs; Described product data comprise product category, product quantity and various product ratio; And
Described product category, product quantity and various product ratio configure according to current market model.
16. deals match systems according to claim 15, it is characterized in that, described working memory is divided into multiple memory partitioning by the product category according to described product collection, and described memory partitioning is according to the various product one_to_one corresponding in the middle of the principle of the corresponding series products in memory partitioning and described product collection.
17. deals match systems according to claim 15, is characterized in that: described market model comprises buyer's market model, seller's market model, equilibrium market model.
18. deals match systems according to claim 13, is characterized in that, arrange the maximum permissible value of matching times, if the matching times of trading order form exceedes this maximum permissible value, then this trading order form is rejected by matching treatment unit from transaction queue.
19. deals match systems according to claim 9, it is characterized in that, described result treatment unit is cooperated with described matching treatment unit by the second message-oriented middleware, the result order that described matching treatment unit generates forms result indent queue in the second message-oriented middleware, and described result treatment unit reads result order successively from this queue.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410153963.5A CN105096174A (en) | 2014-04-16 | 2014-04-16 | Transaction matching method and transaction matching system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410153963.5A CN105096174A (en) | 2014-04-16 | 2014-04-16 | Transaction matching method and transaction matching system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105096174A true CN105096174A (en) | 2015-11-25 |
Family
ID=54576534
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410153963.5A Pending CN105096174A (en) | 2014-04-16 | 2014-04-16 | Transaction matching method and transaction matching system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105096174A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107133302A (en) * | 2017-04-28 | 2017-09-05 | 努比亚技术有限公司 | Realize method, system, terminal and the computer-readable recording medium of data consistency |
| CN107179896A (en) * | 2016-03-09 | 2017-09-19 | 阿里巴巴集团控股有限公司 | Task processing method and device |
| CN107273192A (en) * | 2016-04-06 | 2017-10-20 | 阿里巴巴集团控股有限公司 | A kind of propulsion method of product trading, server and system |
| CN107291769A (en) * | 2016-04-11 | 2017-10-24 | 北京京东尚科信息技术有限公司 | The method and apparatus for handling concurrent order |
| CN107819696A (en) * | 2017-11-22 | 2018-03-20 | 中国银行股份有限公司 | A kind of transaction flow control method and system |
| CN108449226A (en) * | 2018-02-28 | 2018-08-24 | 华青融天（北京）技术股份有限公司 | The method and system of information Fast Classification |
| CN110135925A (en) * | 2018-02-08 | 2019-08-16 | 北京京东尚科信息技术有限公司 | Order processing system, method and apparatus |
| CN110147391A (en) * | 2019-04-08 | 2019-08-20 | 顺丰速运有限公司 | Data handover method, system, equipment and storage medium |
| CN110473097A (en) * | 2019-08-06 | 2019-11-19 | 深圳证券交易所 | Transaction monitoring method, terminal and computer readable storage medium |
| CN113282659A (en) * | 2017-03-28 | 2021-08-20 | 创新先进技术有限公司 | Data processing method and device based on block chain |
| CN113283517A (en) * | 2021-05-31 | 2021-08-20 | 长沙市到家悠享家政服务有限公司 | Household service matching method, system and computer equipment |
| CN113901150A (en) * | 2021-09-27 | 2022-01-07 | 上海淇玥信息技术有限公司 | Service processing method and device and electronic equipment |
| CN114860349A (en) * | 2022-07-06 | 2022-08-05 | 深圳华锐分布式技术股份有限公司 | Data loading method, device, equipment and medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101068381A (en) * | 2007-06-07 | 2007-11-07 | 中兴通讯股份有限公司 | Short message system and short message retransmitting method |
| CN101646142A (en) * | 2009-09-03 | 2010-02-10 | 中兴通讯股份有限公司 | Method for re-sending short message and short message service center |
| CN102073963A (en) * | 2011-01-05 | 2011-05-25 | 阎东升 | Spot continuous transaction system and method |
| CN102932144A (en) * | 2011-08-11 | 2013-02-13 | 方正国际软件(北京)有限公司 | Shell-authentication-based data transaction method and system |
-
2014
- 2014-04-16 CN CN201410153963.5A patent/CN105096174A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101068381A (en) * | 2007-06-07 | 2007-11-07 | 中兴通讯股份有限公司 | Short message system and short message retransmitting method |
| CN101646142A (en) * | 2009-09-03 | 2010-02-10 | 中兴通讯股份有限公司 | Method for re-sending short message and short message service center |
| CN102073963A (en) * | 2011-01-05 | 2011-05-25 | 阎东升 | Spot continuous transaction system and method |
| CN102932144A (en) * | 2011-08-11 | 2013-02-13 | 方正国际软件(北京)有限公司 | Shell-authentication-based data transaction method and system |
Non-Patent Citations (1)
| Title |
|---|
| 谭臻尧: "《住房公积金管理实践与创新（第1版）》", 31 December 2008, 东北财经大学出版社 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107179896A (en) * | 2016-03-09 | 2017-09-19 | 阿里巴巴集团控股有限公司 | Task processing method and device |
| CN107273192B (en) * | 2016-04-06 | 2020-05-08 | 阿里巴巴集团控股有限公司 | Product transaction propelling method, server and system |
| CN107273192A (en) * | 2016-04-06 | 2017-10-20 | 阿里巴巴集团控股有限公司 | A kind of propulsion method of product trading, server and system |
| CN107291769A (en) * | 2016-04-11 | 2017-10-24 | 北京京东尚科信息技术有限公司 | The method and apparatus for handling concurrent order |
| CN113282659A (en) * | 2017-03-28 | 2021-08-20 | 创新先进技术有限公司 | Data processing method and device based on block chain |
| CN107133302A (en) * | 2017-04-28 | 2017-09-05 | 努比亚技术有限公司 | Realize method, system, terminal and the computer-readable recording medium of data consistency |
| CN107819696A (en) * | 2017-11-22 | 2018-03-20 | 中国银行股份有限公司 | A kind of transaction flow control method and system |
| CN110135925A (en) * | 2018-02-08 | 2019-08-16 | 北京京东尚科信息技术有限公司 | Order processing system, method and apparatus |
| CN110135925B (en) * | 2018-02-08 | 2023-09-26 | 北京京东尚科信息技术有限公司 | Order processing system, method and device |
| CN108449226A (en) * | 2018-02-28 | 2018-08-24 | 华青融天（北京）技术股份有限公司 | The method and system of information Fast Classification |
| CN110147391A (en) * | 2019-04-08 | 2019-08-20 | 顺丰速运有限公司 | Data handover method, system, equipment and storage medium |
| CN110473097A (en) * | 2019-08-06 | 2019-11-19 | 深圳证券交易所 | Transaction monitoring method, terminal and computer readable storage medium |
| CN113283517A (en) * | 2021-05-31 | 2021-08-20 | 长沙市到家悠享家政服务有限公司 | Household service matching method, system and computer equipment |
| CN113901150A (en) * | 2021-09-27 | 2022-01-07 | 上海淇玥信息技术有限公司 | Service processing method and device and electronic equipment |
| CN114860349A (en) * | 2022-07-06 | 2022-08-05 | 深圳华锐分布式技术股份有限公司 | Data loading method, device, equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105096174A (en) | Transaction matching method and transaction matching system | |
| CN111563101B (en) | Execution plan optimization method, device, equipment and storage medium | |
| CN106547796B (en) | Database execution method and device | |
| CN103106249B (en) | A kind of parallel data processing system based on Cassandra | |
| CN102402605B (en) | Mixed distribution model for search engine indexing | |
| CN104067216B (en) | System and method for implementing expansible data storage service | |
| US10268639B2 (en) | Joining large database tables | |
| US20220292093A1 (en) | Techniques For In Memory Key Range Searches | |
| US20160012118A1 (en) | System and methods for mapping and searching objects in multidimensional space | |
| CN106528787B (en) | query method and device based on multidimensional analysis of mass data | |
| JP6928677B2 (en) | Data processing methods and equipment for performing online analysis processing | |
| CN104408159B (en) | A kind of data correlation, loading, querying method and device | |
| CN101739398A (en) | Distributed database multi-join query optimization algorithm | |
| CN106202416A (en) | Table data write method and device, table data read method and device | |
| CN106407244A (en) | Multi-database-based data query method, system and apparatus | |
| CN110036381B (en) | In-memory data search technique | |
| US20190362016A1 (en) | Frequent pattern analysis for distributed systems | |
| CN104268298A (en) | Method for creating database index and inquiring data | |
| CN114357085B (en) | Financial data storage method and device based on block chain and storage medium | |
| CN104376014A (en) | Structured P2P network resource publishing and querying method | |
| CN106156185B (en) | Method, device and system for inquiring service request execution state | |
| CN112579633A (en) | Data retrieval method, device, equipment and storage medium | |
| EP2765517B1 (en) | Data stream splitting for low-latency data access | |
| CN103856535B (en) | A kind of method and apparatus obtaining user data | |
| US20210141791A1 (en) | Method and system for generating a hybrid data model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20151125 |