CN107273220A - A kind of electric business platform data processing method, device and user terminal - Google Patents

A kind of electric business platform data processing method, device and user terminal Download PDF

Info

Publication number
CN107273220A
CN107273220A CN201710330894.4A CN201710330894A CN107273220A CN 107273220 A CN107273220 A CN 107273220A CN 201710330894 A CN201710330894 A CN 201710330894A CN 107273220 A CN107273220 A CN 107273220A
Authority
CN
China
Prior art keywords
request
panic buying
processing
thread
equal
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201710330894.4A
Other languages
Chinese (zh)
Inventor
陈强
陈利亮
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong Wangjin Holdings Co Ltd
Original Assignee
Guangdong Wangjin Holdings Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Guangdong Wangjin Holdings Co Ltd filed Critical Guangdong Wangjin Holdings Co Ltd
Priority to CN201710330894.4A priority Critical patent/CN107273220A/en
Publication of CN107273220A publication Critical patent/CN107273220A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/54Interprogram communication
    • G06F9/546Message passing systems or structures, e.g. queues
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/0601Electronic shopping [e-shopping]
    • G06Q30/0605Supply or demand aggregation

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Strategic Management (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • General Engineering & Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a kind of electric business platform data processing method, device and user terminal.Method includes:The processing thread of respective amount is generated according to the first preset rules;It is that thread configuration is corresponding handles number of request for every processing according to the second preset rules;Panic buying request is received, judges that the processing of each processing thread completes whether number sum is less than the sum that goes on the razzle-dazzle, if so, panic buying request queue is then added, if it is not, then terminating flow;The panic buying request rushed to purchase in request queue, which is distributed to, can be handled in processing thread of the number of request more than 0;When getting when handling number of request and being equal to 0 of all processing threads, panic buying is pointed out to terminate, and terminate flow.The present invention solves the problem of negative stock occur when electric business platform carries out panic buying activity.

Description

A kind of electric business platform data processing method, device and user terminal
Technical field
The present invention relates to computer software technology, more particularly to the data processing side applied to electric business platform panic buying activity Method.
Background technology
Panic buying activity is a kind of very common application scenarios in electric business platform.Panic buying activity typically has reservation, robs and order Single, three big links of payment, wherein robbing the anti-pressure ability that order link most considers platform.A large amount of use can typically be brought by robbing order link Family high concurrent is accessed and commodity bear stock (commodity amount bought that successfully places an order exceedes the warehousing number of commodity) phenomenon, causes to use Family experience is bad.
The content of the invention
In order to overcome the deficiencies in the prior art, an object of the present invention is to provide a kind of electric business platform data processing side Method, which solves the problem of negative stock occur when electric business platform carries out panic buying activity.
The second object of the present invention is to provide a kind of electric business platform data processing unit, which solves electric business platform and carry out The problem of there is negative stock during panic buying activity.
The third object of the present invention is to provide a kind of user terminal, which solves when electric business platform carries out panic buying activity The problem of now bearing stock.
One of to achieve the above object, the technical solution adopted in the present invention is as follows:
A kind of electric business platform data processing method, it is characterised in that comprise the following steps:
The processing thread of respective amount is generated according to the first preset rules;
It is that thread configuration is corresponding handles number of request for every processing according to the second preset rules;
Panic buying request is received, judges that the processing of each processing thread completes whether number sum is less than the sum that goes on the razzle-dazzle, if It is panic buying request queue then to be added, if it is not, then terminating flow;
The panic buying request rushed to purchase in request queue, which is distributed to, can be handled in processing thread of the number of request more than 0;
By the corresponding panic buying request of each processing thread serial process itself, and judge that the number of request that handles of itself is It is no to be more than 0, if so, then performing panic buying Successful Operation, plus 1 while recording the processing of itself and completing number, number of request can be handled and subtract 1; Distribute again in panic buying request queue if it is not, then returning to panic buying request;
When getting when handling number of request and being equal to 0 of all processing threads, panic buying is pointed out to terminate, and terminate flow.
It is preferred that, first preset rules are:The default number of partitions is designated as N, the sum that will go on the razzle-dazzle is designated as S, if S% N=0, the then quantity for handling thread is equal to N, if S%N ≠ 0, and the quantity of processing thread is equal to N+1, wherein, % is complementation.
It is preferred that, second preset rules are:When the quantity for handling thread is equal to N, every handles locating for thread Reason number of request is S/N, when the quantity for handling thread is equal to N+1, and the number of request that handles of wherein N bars processing thread is S/N, its A number of request that handles for handling thread of remaininging is S%N, wherein ,/it is division operation.
It is preferred that, the default number of partitions is less than or equal to processor core calculation.
It is preferred that, the panic buying request in panic buying request queue is distributed by parallel form.
To achieve the above object two, the technical solution adopted in the present invention is as follows:
A kind of electric business platform data processing unit, it is characterised in that including with lower module:
Thread generation module is handled, the processing thread for generating respective amount according to the first preset rules;
Number of request configuration module can be handled, thread configuration is corresponding to be located for being handled according to the second preset rules for every Manage number of request;
Panic buying request judge module, for receiving panic buying request, judges that the processing of each processing thread completes number sum and is It is no to be less than the sum that goes on the razzle-dazzle, if so, panic buying request queue is then added, if it is not, then terminating flow;
Panic buying request distribution module, can handle number of request and be more than for the panic buying request rushed to purchase in request queue to be distributed to In 0 processing thread;
Request processing module is rushed to purchase, for being asked by each corresponding panic buying of processing thread serial process itself, and is sentenced Break itself handle number of request whether be more than 0, if so, then perform panic buying Successful Operation, while record itself processing complete Number Jia 1, can handle number of request and subtract 1;Distribute again in panic buying request queue if it is not, then returning to panic buying request;
Terminate module is rushed to purchase, for when getting when handling number of request and being equal to 0 of all processing threads, pointing out panic buying Terminate, and terminate flow.
It is preferred that, first preset rules are:The default number of partitions is designated as N, the sum that will go on the razzle-dazzle is designated as S, if S% N=0, the then quantity for handling thread is equal to N, if S%N ≠ 0, and the quantity of processing thread is equal to N+1, wherein, % is complementation.
It is preferred that, second preset rules are:When the quantity for handling thread is equal to N, every handles locating for thread Reason number of request is S/N, when the quantity for handling thread is equal to N+1, and the number of request that handles of wherein N bars processing thread is S/N, its A number of request that handles for handling thread of remaininging is S%N, wherein ,/it is division operation.
It is preferred that, the default number of partitions is less than or equal to processor core calculation.
It is preferred that, the panic buying request in panic buying request queue is distributed by parallel form.
To achieve the above object three, the technical solution adopted in the present invention is as follows:
A kind of user terminal, it is characterised in that including:
Memory, for storage program instruction;
Processor, for running described program instruction, to perform following steps:
The processing thread of respective amount is generated according to the first preset rules;
It is that thread configuration is corresponding handles number of request for every processing according to the second preset rules;
Panic buying request is received, judges that the processing of each processing thread completes whether number sum is less than the sum that goes on the razzle-dazzle, if It is panic buying request queue then to be added, if it is not, then terminating flow;
The panic buying request rushed to purchase in request queue, which is distributed to, can be handled in processing thread of the number of request more than 0;
By the corresponding panic buying request of each processing thread serial process itself, and judge that the number of request that handles of itself is It is no to be more than 0, if so, then performing panic buying Successful Operation, plus 1 while recording the processing of itself and completing number, number of request can be handled and subtract 1; Distribute again in panic buying request queue if it is not, then returning to panic buying request;
When getting when handling number of request and being equal to 0 of all processing threads, panic buying is pointed out to terminate, and terminate flow.
It is preferred that, first preset rules are:The default number of partitions is designated as N, the sum that will go on the razzle-dazzle is designated as S, if S% N=0, the then quantity for handling thread is equal to N, if S%N ≠ 0, and the quantity of processing thread is equal to N+1, wherein, % is complementation.
It is preferred that, second preset rules are:When the quantity for handling thread is equal to N, every handles locating for thread Reason number of request is S/N, when the quantity for handling thread is equal to N+1, and the number of request that handles of wherein N bars processing thread is S/N, its A number of request that handles for handling thread of remaininging is S%N, wherein ,/it is division operation.
It is preferred that, the default number of partitions is less than or equal to processor core calculation.
It is preferred that, the panic buying request in panic buying request queue is distributed by parallel form.
Compared with prior art, the beneficial effects of the present invention are:
Thread is handled by reasonable distribution, every processing thread is just calculated before panic buying activity starts and handles request Number, and it is serial process panic buying request to handle thread, can avoid the occurrence of commodity and bear stock.In addition, by rushing to purchase request queue Request can be responded rapidly to by receiving panic buying request, and multiple processing threads can receive panic buying request parallel, it is possible to resolve in panic buying activity High concurrent access, provide the user good Consumer's Experience.
Brief description of the drawings
Fig. 1 is the flow chart of the electric business platform data processing method of the embodiment of the present invention one;
Fig. 2 is the structure chart of the electric business platform data processing unit of the embodiment of the present invention two;
Fig. 3 is the structure chart of the user terminal of the embodiment of the present invention three.
Embodiment
Below, with reference to accompanying drawing and embodiment, the present invention is described further:
Embodiment one:
As shown in figure 1, a kind of electric business platform data processing method, comprises the following steps:
S1, the processing thread according to the first preset rules generation respective amount;
S2, according to the second preset rules it is that thread configuration is corresponding handles number of request for every processing;
S3, reception panic buying request, judge that whether the processing of each processing thread completes number sum less than the sum that goes on the razzle-dazzle, If so, panic buying request queue is then added, if it is not, then terminating flow;
S4, will rush to purchase request queue in panic buying request be distributed to can handle number of request more than 0 processing thread in;
S5, asked by each corresponding panic buying of processing thread serial process itself, and judge itself handle request Whether number is more than 0, if so, then performing panic buying Successful Operation, plus 1 while recording the processing of itself and completing number, can handle number of request Subtract 1;Distribute again in panic buying request queue if it is not, then returning to panic buying request;
S6, when getting when handling number of request and being equal to 0 of all processing threads, point out panic buying to terminate, and terminate stream Journey.
Wherein, the first preset rules are:The default number of partitions is designated as N, the sum that will go on the razzle-dazzle is designated as S, if S%N=0, Then the quantity of processing thread is equal to N, if S%N ≠ 0, and the quantity of processing thread is equal to N+1, wherein, % is complementation.Second Preset rules are:When the quantity for handling thread is equal to N, the number of request that handles of every processing thread is S/N, when processing thread Quantity when being equal to N+1, wherein N bars processing thread handles number of request for S/N, and remaining one handling for processing thread please It is S%N to seek number, wherein ,/it is division operation.It is preferred that, preset the number of partitions and be less than or equal to processor core calculation.
In step s3, it is less than the sum that goes on the razzle-dazzle when the processing of each processing thread completes number sum, then it represents that also have Commodity stocks, can continue to panic buying request, be equal to the sum that goes on the razzle-dazzle when the processing of each processing thread completes number sum, If continuing to panic buying request, occur that commodity bear stock.
In step s 4, the panic buying request in panic buying request queue is distributed by parallel form, specifically can be real-time Monitoring panic buying request queue, has panic buying request to enter after panic buying request queue by calling route distribution module to rush to purchase request simultaneously Row, which is distributed to, can be handled in processing thread of the number of request more than 0.
In step s 5, the panic buying request serial arrangement in each processing thread, processing thread often handles a panic buying please Itself can be all judged when asking handles whether number of request is more than 0, it is to avoid commodity occurs and bears stock's phenomenon, if so, then rushing to purchase Panic buying request, if it is not, representing that the number of request that handles of the processing thread is equal to 0, is then back in panic buying request queue by success, Distributed again by panic buying request queue.
Based on the above method, thread is handled by reasonable distribution, every processing line is just calculated before panic buying activity starts Journey handles number of request, and it is serial process panic buying request to handle thread, can avoid the occurrence of commodity and bear stock.In addition, logical Request can be responded rapidly to by crossing panic buying request queue reception panic buying request, and multiple processing threads, which can receive panic buying parallel, asks, can The high concurrent solved in panic buying activity is accessed, and provides the user good Consumer's Experience.
Embodiment two:
As shown in Fig. 2 corresponding the virtual bench to be formed for the method flow with embodiment one, there is provided a kind of electric business Platform data processing unit, it is characterised in that including with lower module:
Thread generation module is handled, the processing thread for generating respective amount according to the first preset rules;
Number of request configuration module can be handled, thread configuration is corresponding to be located for being handled according to the second preset rules for every Manage number of request;
Panic buying request judge module, for receiving panic buying request, judges that the processing of each processing thread completes number sum and is It is no to be less than the sum that goes on the razzle-dazzle, if so, panic buying request queue is then added, if it is not, then terminating flow;
Panic buying request distribution module, can handle number of request and be more than for the panic buying request rushed to purchase in request queue to be distributed to In 0 processing thread;
Request processing module is rushed to purchase, for being asked by each corresponding panic buying of processing thread serial process itself, and is sentenced Break itself handle number of request whether be more than 0, if so, then perform panic buying Successful Operation, while record itself processing complete Number Jia 1, can handle number of request and subtract 1;Distribute again in panic buying request queue if it is not, then returning to panic buying request;
Terminate module is rushed to purchase, for when getting when handling number of request and being equal to 0 of all processing threads, pointing out panic buying Terminate, and terminate flow.
It is preferred that, first preset rules are:The default number of partitions is designated as N, the sum that will go on the razzle-dazzle is designated as S, if S% N=0, the then quantity for handling thread is equal to N, if S%N ≠ 0, and the quantity of processing thread is equal to N+1, wherein, % is complementation.
It is preferred that, second preset rules are:When the quantity for handling thread is equal to N, every handles locating for thread Reason number of request is S/N, when the quantity for handling thread is equal to N+1, and the number of request that handles of wherein N bars processing thread is S/N, its A number of request that handles for handling thread of remaininging is S%N, wherein ,/it is division operation.
It is preferred that, the default number of partitions is less than or equal to processor core calculation.
It is preferred that, the panic buying request in panic buying request queue is distributed by parallel form.
Embodiment three:
As shown in figure 3, in order to realize the method flow of embodiment one there is provided a kind of entity apparatus, i.e., a kind of user is whole End, it includes:
Memory, for storage program instruction;
Processor, for running described program instruction, to perform following steps:
The processing thread of respective amount is generated according to the first preset rules;
It is that thread configuration is corresponding handles number of request for every processing according to the second preset rules;
Panic buying request is received, judges that the processing of each processing thread completes whether number sum is less than the sum that goes on the razzle-dazzle, if It is panic buying request queue then to be added, if it is not, then terminating flow;
The panic buying request rushed to purchase in request queue, which is distributed to, can be handled in processing thread of the number of request more than 0;
By the corresponding panic buying request of each processing thread serial process itself, and judge that the number of request that handles of itself is It is no to be more than 0, if so, then performing panic buying Successful Operation, plus 1 while recording the processing of itself and completing number, number of request can be handled and subtract 1; Distribute again in panic buying request queue if it is not, then returning to panic buying request;
When getting when handling number of request and being equal to 0 of all processing threads, panic buying is pointed out to terminate, and terminate flow.
It is preferred that, first preset rules are:The default number of partitions is designated as N, the sum that will go on the razzle-dazzle is designated as S, if S% N=0, the then quantity for handling thread is equal to N, if S%N ≠ 0, and the quantity of processing thread is equal to N+1, wherein, % is complementation.
It is preferred that, second preset rules are:When the quantity for handling thread is equal to N, every handles locating for thread Reason number of request is S/N, when the quantity for handling thread is equal to N+1, and the number of request that handles of wherein N bars processing thread is S/N, its A number of request that handles for handling thread of remaininging is S%N, wherein ,/it is division operation.
It is preferred that, the default number of partitions is less than or equal to processor core calculation.
It is preferred that, the panic buying request in panic buying request queue is distributed by parallel form.
It will be apparent to those skilled in the art that technical scheme that can be as described above and design, make other various It is corresponding to change and deformation, and all these change and deformation should all belong to the protection domain of the claims in the present invention Within.

Claims (10)

1. a kind of electric business platform data processing method, it is characterised in that comprise the following steps:
The processing thread of respective amount is generated according to the first preset rules;
It is that thread configuration is corresponding handles number of request for every processing according to the second preset rules;
Panic buying request is received, judges that the processing of each processing thread completes whether number sum is less than the sum that goes on the razzle-dazzle, if so, then Panic buying request queue is added, if it is not, then terminating flow;
The panic buying request rushed to purchase in request queue, which is distributed to, can be handled in processing thread of the number of request more than 0;
By the corresponding panic buying request of each processing thread serial process itself, and judge itself whether handle number of request big In 0, if so, then performing panic buying Successful Operation, plus 1 while recording the processing of itself and completing number, number of request can be handled and subtract 1;If it is not, Then panic buying request is returned and distributed again in panic buying request queue;
When getting when handling number of request and being equal to 0 of all processing threads, panic buying is pointed out to terminate, and terminate flow.
2. electric business platform data processing method according to claim 1, it is characterised in that first preset rules are: The default number of partitions is designated as N, the sum that will go on the razzle-dazzle is designated as S, if S%N=0, the quantity of processing thread is equal to N, if S%N ≠ 0, the quantity of processing thread is equal to N+1, wherein, % is complementation.
3. electric business platform data processing method according to claim 2, it is characterised in that second preset rules are: When the quantity for handling thread is equal to N, the number of request that handles of every processing thread is S/N, when the quantity of processing thread is equal to N When+1, the number of request that handles of wherein N bars processing thread is S/N, and the number of request that handles of remaining one processing thread is S%N, Wherein ,/it is division operation.
4. electric business platform data processing method according to claim 2, it is characterised in that the default number of partitions be less than or Equal to processor core calculation.
5. electric business platform data processing method according to claim 1, it is characterised in that the panic buying in panic buying request queue Request is distributed by parallel form.
6. a kind of electric business platform data processing unit, it is characterised in that including with lower module:
Thread generation module is handled, the processing thread for generating respective amount according to the first preset rules;
Number of request configuration module can be handled, for being that every corresponding handles of processing thread configuration please according to the second preset rules Ask several;
Judge module is asked in panic buying, for receiving panic buying request, judges whether the processing completion number sum of each processing thread is small In the sum that goes on the razzle-dazzle, if so, panic buying request queue is then added, if it is not, then terminating flow;
Panic buying request distribution module, the panic buying request for that will rush to purchase in request queue, which is distributed to, can handle number of request more than 0 Handle in thread;
Panic buying request processing module, for being asked by each corresponding panic buying of processing thread serial process itself, and judges certainly Body handle number of request whether be more than 0, if so, then perform panic buying Successful Operation, while record itself processing complete number add 1, number of request can be handled and subtract 1;Distribute again in panic buying request queue if it is not, then returning to panic buying request;
Terminate module is rushed to purchase, for when getting when handling number of request and being equal to 0 of all processing threads, pointing out panic buying knot Beam, and terminate flow.
7. a kind of user terminal, it is characterised in that including:
Memory, for storage program instruction;
Processor, for running described program instruction, to perform following steps:
The processing thread of respective amount is generated according to the first preset rules;
It is that thread configuration is corresponding handles number of request for every processing according to the second preset rules;
Panic buying request is received, judges that the processing of each processing thread completes whether number sum is less than the sum that goes on the razzle-dazzle, if so, then Panic buying request queue is added, if it is not, then terminating flow;
The panic buying request rushed to purchase in request queue, which is distributed to, can be handled in processing thread of the number of request more than 0;
By the corresponding panic buying request of each processing thread serial process itself, and judge itself whether handle number of request big In 0, if so, then performing panic buying Successful Operation, plus 1 while recording the processing of itself and completing number, number of request can be handled and subtract 1;If it is not, Then panic buying request is returned and distributed again in panic buying request queue;
When getting when handling number of request and being equal to 0 of all processing threads, panic buying is pointed out to terminate, and terminate flow.
8. user terminal according to claim 7, it is characterised in that first preset rules are:By the default number of partitions N is designated as, the sum that will go on the razzle-dazzle is designated as S, if S%N=0, the quantity of processing thread is equal to N, if S%N ≠ 0, handles thread Quantity be equal to N+1, wherein, % is complementation.
9. user terminal according to claim 8, it is characterised in that second preset rules are:When processing thread When quantity is equal to N, the number of request that handles of every processing thread is S/N, when the quantity for handling thread is equal to N+1, wherein N bars The number of request that handles of processing thread is S/N, and the number of request that handles of remaining one processing thread is S%N, wherein ,/it is except fortune Calculate.
10. user terminal according to claim 8, it is characterised in that the default number of partitions is less than or equal to processor Core number.
CN201710330894.4A 2017-05-11 2017-05-11 A kind of electric business platform data processing method, device and user terminal Pending CN107273220A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710330894.4A CN107273220A (en) 2017-05-11 2017-05-11 A kind of electric business platform data processing method, device and user terminal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710330894.4A CN107273220A (en) 2017-05-11 2017-05-11 A kind of electric business platform data processing method, device and user terminal

Publications (1)

Publication Number Publication Date
CN107273220A true CN107273220A (en) 2017-10-20

Family

ID=60073973

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710330894.4A Pending CN107273220A (en) 2017-05-11 2017-05-11 A kind of electric business platform data processing method, device and user terminal

Country Status (1)

Country Link
CN (1) CN107273220A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108416643A (en) * 2018-01-10 2018-08-17 链家网(北京)科技有限公司 A kind of competition for orders method and system
CN110223109A (en) * 2019-05-24 2019-09-10 深圳市元征科技股份有限公司 A kind of online shopping method and relevant apparatus
CN112835867A (en) * 2021-01-11 2021-05-25 中国农业银行股份有限公司 Data preprocessing method and device

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104462977A (en) * 2014-12-23 2015-03-25 北京京东尚科信息技术有限公司 Data processing method and system
CN106170016A (en) * 2016-07-28 2016-11-30 深圳市创梦天地科技有限公司 A kind of method and system processing high concurrent data requests
CN106355470A (en) * 2016-08-30 2017-01-25 福建新大陆软件工程有限公司 E-commerce snapping-up method and system
CN106411777A (en) * 2016-09-27 2017-02-15 福建中金在线信息科技有限公司 Method and system for processing high concurrent data

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104462977A (en) * 2014-12-23 2015-03-25 北京京东尚科信息技术有限公司 Data processing method and system
CN106170016A (en) * 2016-07-28 2016-11-30 深圳市创梦天地科技有限公司 A kind of method and system processing high concurrent data requests
CN106355470A (en) * 2016-08-30 2017-01-25 福建新大陆软件工程有限公司 E-commerce snapping-up method and system
CN106411777A (en) * 2016-09-27 2017-02-15 福建中金在线信息科技有限公司 Method and system for processing high concurrent data

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108416643A (en) * 2018-01-10 2018-08-17 链家网(北京)科技有限公司 A kind of competition for orders method and system
CN110223109A (en) * 2019-05-24 2019-09-10 深圳市元征科技股份有限公司 A kind of online shopping method and relevant apparatus
CN110223109B (en) * 2019-05-24 2023-09-05 深圳市元征科技股份有限公司 Online shopping method and related device
CN112835867A (en) * 2021-01-11 2021-05-25 中国农业银行股份有限公司 Data preprocessing method and device

Similar Documents

Publication Publication Date Title
CN105447736B (en) Transaction processing and logistics solution method and device in commodity transaction
CN113377540A (en) Cluster resource scheduling method and device, electronic equipment and storage medium
US8108466B2 (en) Automated offloading of user-defined functions to a high performance computing system
CN107273220A (en) A kind of electric business platform data processing method, device and user terminal
CN107370667A (en) Multi-threading parallel process method and apparatus, computer-readable recording medium and storage control
CN107239987A (en) Order processing method and device
CN110401697A (en) A kind of method, system and the equipment of concurrent processing HTTP request
CN107508863A (en) Information processing method and device applied to block chain
CN103198001B (en) Storage system capable of self-testing peripheral component interface express (PCIE) interface and test method
CN108363741A (en) Big data unified interface method, apparatus, equipment and storage medium
CN109491788A (en) A kind of virtual platform implementation of load balancing and device
CN110580195A (en) Memory allocation method and device based on memory hot plug
CN110209597A (en) Handle method, apparatus, equipment and the storage medium of access request
CN104376056B (en) A kind of method and apparatus of data processing
CN109862076A (en) A kind of service data interaction methods, devices and systems
CN109308217A (en) A kind of date storage method and device of timeliness task
CN107657434A (en) The Notification Method, device and gateway device of payment result are supplemented in game with money
CN111007987A (en) Memory management method, system, terminal and storage medium for raid io
CN109582467A (en) Processing method, system and the relevant apparatus of I/O request in a kind of storage system
CN113687926A (en) Control method, device and equipment for server asset scanning
CN108600008A (en) Server management method, server managing device and distributed system
CN112114935A (en) Hot plug method and related equipment
CN109977074A (en) A kind of lob data processing method and processing device based on HDFS
CN110348833A (en) A kind of processing method of payment request, device and electronic equipment
CN115185685A (en) Artificial intelligence task scheduling method and device based on deep learning and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20171020

RJ01 Rejection of invention patent application after publication