CN105718452A - Data query method and system - Google Patents
Data query method and system Download PDFInfo
- Publication number
- CN105718452A CN105718452A CN201410719576.3A CN201410719576A CN105718452A CN 105718452 A CN105718452 A CN 105718452A CN 201410719576 A CN201410719576 A CN 201410719576A CN 105718452 A CN105718452 A CN 105718452A
- Authority
- CN
- China
- Prior art keywords
- data query
- lock
- rank
- quantity available
- inquiry request
- 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
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a data query method and a data query system. The data query method comprises: receiving a data query request and a data query level of the query request; acquiring a lock available number of the data query level; comparing the acquired lock available number and 0; and if the acquired lock available number is greater than 0, subtracting 1 from the lock available number of the data query level, and executing the data query request to obtain a data query result. The concurrency number of the same-level query is controlled by setting the lock available numbers of the query requests at different levels, and only when the acquired lock available number of the acquired data query level is greater than 0 after comparison, the data query request is executed, thereby preventing multiple query requests that occupy resources from being concurrently executed, which otherwise causes server resource depletion, and effectively improving the utilization rate of servers.
Description
Technical field
The present invention relates to database technical field, particularly relate to a kind of data query method and system.
Background technology
In enterprise application system, along with number of users increases, concurrently access number significantly high, data base almost can be accessed due to each request, but it is not The more the better that data base connects number, too much data base connects, can cause and fight for server hardware resource, resource is caused all to be wasted in wait, the data query (such as form) of especially needed inquiry mass data, a lot of resource can be taken, other inquiries are caused to wait, it is that one maximum number of connections is set according to server hardware in the usual manner, by arranging maximum number of connections, the quantity of restriction parallel query, in the hope of reaching an average response time, reduce the ample resources situation for waiting as far as possible.
Data query take such as the resource of CPU and disk reading etc., it is possible to being referred to as cost, the cost disparities of different data queries is very big, simply does and classifies, and most of very low cost, minority cost is medium, and only a few is costly.By restricting the maximum number of connections of data base, there is bigger defect.As server hardware can meet 10,000 very low cost data parallel inquiries, but considering that there may be the medium and costly rank data query of cost accesses simultaneously, data base's maximum number of connections is likely to only to be set to 100 to avoid resource contention.If but simply have 400 very low cost data parallel inquiries simultaneously, although server hardware disclosure satisfy that, and perform owing to data base's maximum number of connections only has 100,400 very low cost data parallel inquiries also can be divided into 4 batches of orders, response time extends, and server resource does not make full use of.
Again such as, even if database concurrency maximum number of connections is only set to 100, if but have 10 costly data to inquire about, also enough server resource is taken, and cause other 90 request responses slack-off, it is necessary to wait as long for. simultaneously.
Being exactly generally speaking in most cases, server resource utilization rate is relatively low, and server responds slowly in some extreme environments.
Summary of the invention
Based on this, it is necessary to for the problem that server resource utilization rate is low, it is provided that a kind of data query method and system improving server utilization.
The invention provides a kind of data query method, comprise the following steps:
Receive the data query rank belonging to data inquiry request and inquiry request；
Obtain the lock quantity available of data query rank；
The lock quantity available relatively obtained and the size of 0；
If the lock quantity available obtained is more than 0, then the lock quantity available of data query rank is subtracted 1, and perform data inquiry request to obtain data query result.
Wherein in a kind of embodiment, before obtaining the lock quantity available step of data query rank, also include:
The other lock of request for data query level；
Before or after the step that the lock quantity available of data query rank is subtracted 1, also include: distribute the lock of this data query rank.
Wherein in a kind of embodiment, method also includes:
If the lock quantity available obtained is equal to 0, then postpone the lock of inquiry request continuation application data query rank, until the lock quantity available obtained is more than 0.
Wherein in a kind of embodiment, at execution data inquiry request, after obtaining data query result step, also to include:
The lock of release data query rank；
The lock quantity available of data query rank is added 1.
Wherein in a kind of embodiment, the lock quantity available of data query rank has maximum, and data query rank resource shared by data query divides.
The present invention also provides for a kind of data query system, including:
Receiver module, for receiving the data query rank belonging to data inquiry request and inquiry request；
Acquisition module, for obtaining the lock quantity available of data query rank；
Comparison module, the size of lock quantity available and 0 for comparing acquisition；
Inquiry classification quantity controls module, if the lock quantity available being used for obtaining is more than 0, subtracts 1 by the lock quantity available of data query rank；
Enquiry module, if the lock quantity available being used for obtaining is more than 0, performs data inquiry request to obtain data query result.
Wherein in a kind of embodiment, system also includes performing module, is used for before acquisition module obtains the lock quantity available of data query rank, the other lock of request for data query level；
Inquiry classification quantity controls before or after module is additionally operable to subtract 1 by the lock quantity available of data query rank, to distribute the lock of this data query rank.
Wherein in a kind of embodiment, perform module, it is additionally operable to when the lock quantity available that comparison module is more acquired is equal to 0, postpones inquiry request and also continue to control the module other lock of request for data query level to inquiry classification quantity, until the lock quantity available of acquisition is more than 0.
Wherein in a kind of embodiment, perform module, be additionally operable to perform data inquiry request, after obtaining data query result, to discharge the lock of data query rank at enquiry module；
Inquiry classification quantity controls module, is additionally operable to perform data query, after obtaining data query result, to add 1 by the lock quantity available of data query rank at enquiry module.
Wherein in a kind of embodiment, inquiry classification quantity controls module and is additionally operable to the resource division data query rank shared by data query；The lock quantity available of data query rank has maximum.
According to data query method, the concurrent quantity of same rank inquiry is controlled by setting the lock quantity available of the inquiry request of different stage, only when the lock quantity available of relatively more acquired data query rank is more than 0, just perform data inquiry request, it is thus possible to avoid multiple inquiry request executed in parallel taking resource, cause the situation that server resource exhausts, effectively improve the utilization rate of server.
And data query system controls module by arranging data staging quantity, the concurrent quantity of same rank inquiry is controlled by setting the lock quantity available of the inquiry request of different stage, when performing a certain data inquiry request, size by the lock quantity available of the more acquired data query rank of comparison module and 0, when the lock quantity available of only acquired data query rank is more than 0, just perform data inquiry request.It is thus possible to avoid multiple inquiry request executed in parallel taking resource, cause the situation that server resource exhausts, effectively improve the utilization rate of server.
Accompanying drawing explanation
Fig. 1 is the flow chart of a kind of data query method of embodiment；
Fig. 2 is the flow chart of the data query method of another embodiment；
Fig. 3 is the execution schematic diagram of inquiry inquiry system；
Fig. 4 is the module map of data query system.
Detailed description of the invention
In order to make the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein is only in order to explain the present invention, is not intended to limit the present invention.
As it is shown in figure 1, in one embodiment, a kind of data query method, specifically include following steps:
S100: receive the data query rank belonging to data inquiry request and described inquiry request.
Concrete, the parameter of this inquiry request is carried when sending inquiry request to data base, while obtaining data inquiry request, the data query rank belonging to this inquiry request of parameter acquiring entrained by this inquiry request, such as, obtain this inquiry request to belong to and take the rank that resource is more, relatively costly.
S110: obtain the lock quantity available of described data query rank.
Concrete, take resource previously according to data query, be divided into some grades and preset the lock quantity available of each rank.When performing data query, obtain the lock quantity available of this data query rank.
S120: the lock quantity available of relatively described acquisition and the size of 0.
If acquired lock quantity available is more than 0, then perform step S400, if acquired lock quantity available is equal to 0, then postpones this inquiry request and perform the lock quantity available of step S200 continuation this data query rank of acquisition.
S130: if the lock quantity available of described acquisition is more than 0, then the lock quantity available of described data query rank is subtracted 1, and perform described data inquiry request to obtain data query result.
Above-mentioned querying method controls the concurrent quantity of same rank inquiry by setting the lock quantity available of the inquiry request of different stage, only when the lock quantity available of relatively more acquired data query rank is more than 0, just perform data inquiry request, it is thus possible to avoid multiple inquiry request executed in parallel taking resource, cause the situation that server resource exhausts, effectively improve the utilization rate of server.
As in figure 2 it is shown, in another embodiment, a kind of data query method, specifically include following steps:
S200: receive the data query rank belonging to data inquiry request and this inquiry request.
Concrete, the parameter of this inquiry request is carried when sending inquiry request to data base, while obtaining data inquiry request, the data query rank belonging to this inquiry request of parameter acquiring entrained by this inquiry request, such as, obtain this inquiry request to belong to and take the rank that resource is more, relatively costly.
S210: apply for the lock of this data query rank.
Lock (LOCKING) is the most frequently used con current control mechanism in SQL query.It is the resources control preventing other transactions access from specifying, a kind of Main Means realizing con current control.Lock is affairs to, before the resource in certain data base such as table and record accessing, first filing a request to system, block this resource, and namely affairs obtain the control to data after obtaining lock, and before affairs discharge its lock, other affairs can not update these data.When, after transaction backout, discharging locked resource.When a user pins certain object in data base, other users cannot visit again this object.
S220: obtain the lock quantity available of this data query rank.
Concrete, take resource previously according to data query, be divided into some grades and preset the lock quantity available of each rank.In the present embodiment, data query being divided into Three Estate, be Level1, Level2 and Level3 respectively, wherein, the resource that Level1 takies is less, less costly, and most data query is Level1 rank；The cost of Level2 is medium, and the data query of minority is Level2 rank；And Level3's is relatively costly, the resource taken is more, and only the data query of only a few is Level3 rank.Accordingly, the other lock of each query level is provided with maximum available, and maximum available is configured according to the number taking resource, takies the less Level1 of resource and can arrange maximum lock maximum available, and the Level3 that cost of possession is more, minimum lock maximum available is set.In the present embodiment, the lock maximum available that lock maximum available is 20, Level3 that lock maximum available is 100, Level2 arranging Level1 is 2.
Wherein, being first not construed as limiting by order of step S210 and step S220, it is possible to perform step S220 again performing to first carry out step S210 after step S200, it is also possible to first carry out step S220 and perform step S210 again.
S230: compare the lock quantity available of this acquisition and the size of 0.
If acquired lock quantity available is more than 0, then performs step S500, if acquired lock quantity available is equal to 0, then postpones this inquiry request and perform the lock of this data query rank of step S200 continuation application, until the lock quantity available of described acquisition is more than 0.
S240: if the lock quantity available obtained is more than 0, the lock quantity available of this data query rank subtracts 1.
S250: distribute the lock of this data query rank.Distribute the lock of this data query rank according to application, obtain the control of the resource to this requesting query.
S260: perform this data inquiry request to obtain data query result.
The sequencing of step S240, S250 and step S260 is not construed as limiting.When more acquired lock quantity available is more than 0, just perform this data inquiry request such that it is able to avoid the inquiry request executed in parallel taking resource of multiple peer, cause the situation that server resource exhausts.
S270: discharge the lock of this data query rank.After having performed data inquiry request, the resource that release is locked.
S280: the lock quantity available of this data query rank is added 1.
After having performed inquiry request, discharge the other lock of this query level, discharge resource, and other for this query level lock quantity available is added 1, thus circulating this data query method of execution.Such as, when certain once compares the lock quantity available of acquisition equal to 0, this inquiry request is postponed, and after the inquiry request of ongoing same level performed, release by discharging lock, and other for this query level lock quantity available is added 1 so that the inquiry request application that this is postponed is locked successfully, continues executing with inquiry request.
Wherein, the sequencing of step S270 and step S280 does not limit, it is possible to first carry out step S270 or step S280 after execution of step S260.
Above-mentioned querying method is by setting the lock quantity available of the inquiry request of different stage, control the concurrent quantity of same rank inquiry, the control to query resource is obtained by applying for and distribute the other lock of this query level, and only when the lock quantity available of relatively more acquired data query rank is more than 0, just perform data inquiry request, and when comparing the lock quantity available of acquisition equal to 0, this inquiry request is postponed, after having performed a certain inquiry request, this resource is discharged by discharging lock, and other for this query level lock quantity available is added 1, the application after lock quantity available is more than 0 of the inquiry request of this same rank postponed is locked successfully, just can continue executing with inquiry request.This querying method, it can be avoided that multiple inquiry request executed in parallel taking resource, causes the situation that server resource exhausts, effectively improves the utilization rate of server.
And according to data query cost of possession, inquiry request is pressed grade classification, and each inquiry rank arranges lock maximum available, minimum lock maximum available is arranged for the inquiry rank that cost of possession is many, maximum lock maximum available is arranged for cost of possession less inquiry rank, compared with the method that traditional single solution for diverse problems arranges maximum number of connections, when effectively solving the less inquiry rank parallel query of multiple cost of possession, it is subject to maximum number of connections restriction, server response time is long, the problem that server resource does not make full use of.
As shown in Figure 3 and Figure 4, data query system includes with lower module:
Receiver module 100, for receiving the data query rank belonging to data inquiry request and this inquiry request.
Acquisition module 200: for obtaining the lock quantity available of this data query rank.
Comparison module 500: for the size of relatively more acquired lock quantity available and 0.
Inquiry classification quantity controls module 400: divides and stores data query rank in advance for the resource shared by data query and arrange the other lock maximum available of each query level, and when comparison module 500 compares acquired lock quantity available more than 0, inquiry classification quantity controls module 400 and subtracts 1 by the lock quantity available of this data query rank.
Enquiry module 600: if be used for acquired lock quantity available more than 0, perform this data inquiry request to obtain data query result.
Concrete, also include performing module 300: for, before acquisition module 200 obtains the lock quantity available of this data query rank, applying for the lock of this data query rank.
Inquiry classification quantity controls module 400, before or after being additionally operable to subtract 1 by the lock quantity available of this data query rank, distributes the lock of this data query rank.
Perform module 300, be additionally operable to perform this data inquiry request, after returning data query result step, to discharge the lock of this data query rank at enquiry module 600.
Perform module 300 to be additionally operable to, when comparison module 500 compares acquired lock quantity available equal to 0, postpone this inquiry request and continue to control to inquiry classification quantity the lock of this data query rank of module application, until the lock quantity available of described acquisition is more than 0.
Inquiry classification quantity controls module 400, is additionally operable to perform this data inquiry request, after obtaining data query result, to add 1 by the lock quantity available of this data query rank at enquiry module 600.
Above-mentioned inquiry system controls module by arranging data staging quantity, set the lock quantity available of the inquiry request of different stage, control the concurrent quantity of same rank inquiry, control the other lock of this query level that is applied of module assignment by data staging quantity and obtain the control to query resource, and when performing a certain data inquiry request, size by the lock quantity available of the more acquired data query rank of comparison module and 0, when the lock quantity available of only acquired data query rank is more than 0, just perform data inquiry request.And when comparing the lock quantity available of acquisition equal to 0, this inquiry request is postponed, after having performed a certain inquiry request, this resource is discharged by discharging lock, and other for this query level lock quantity available is added 1, the application after lock quantity available is more than 0 of the inquiry request of this same rank postponed is locked successfully, just can continue executing with inquiry request.This inquiry system, it can be avoided that multiple inquiry request executed in parallel taking resource, causes the situation that server resource exhausts, effectively improves the utilization rate of server.
And classification quantity controls module according to data query cost of possession, inquiry request is pressed grade classification, and each inquiry rank is arranged lock maximum available, minimum lock maximum available is arranged for the inquiry rank that cost of possession is many, maximum lock maximum available is arranged for cost of possession less inquiry rank, compared with the method that traditional single solution for diverse problems arranges maximum number of connections, when effectively solving the less inquiry rank parallel query of multiple cost of possession, it is subject to maximum number of connections restriction, server response time is long, the problem that server resource does not make full use of.
Below in conjunction with concrete case, data query method and system are described in detail.
In advance inquiry classification quantity is controlled the lock maximum available that module falls into three classes according to the resource that data query takies and presets each rank, specifically, set the maximum lock quantity available of Level1 as 100, the maximum lock quantity available of Level2 is 20, the maximum lock quantity available of Level3 is 2, as shown in table 1.
Table 1 is inquired about classification quantity and is controlled module classification and lock maximum available at different levels
Assuming that the data inquiry request being accompanied with three Level3 grades sends to data base, it is inquiry request A, inquiry request B and inquiry request C respectively.The inquiry request that data query rank is three concurrent Level3 that receiver module 100 will receive belonging to data inquiry request and these three inquiry request.
For performing the inquiry request of inquiry request A, control module 400 to inquiry classification quantity and apply for the other lock of Level3 query level, and to obtain the other lock quantity available of Level3 query level be 2, comparison module 500 is by the size of the relatively more acquired other lock quantity available of Level3 query level and 0, it is 2 owing to obtaining the other lock quantity available of Level3 query level, more than 0, then inquiry classification quantity controls module 400 and subtracts 1 by other for Level3 query level lock quantity available, the lock quantity available of Level3 becomes 1, and enquiry module 600 performs inquiry request A to return data query result.As shown in table 2, module lock quantity available change at different levels is controlled for inquiry classification quantity when performing inquiry request A.
Inquiry classification quantity when table 2 performs inquiry request A controls module lock quantity available change at different levels
For performing the inquiry request of inquiry request B, control module 400 to inquiry classification quantity and apply for the other lock of Level3 query level, and to obtain the other lock quantity available of Level3 query level be 1, comparison module 500 is by the size of the relatively more acquired other lock quantity available of Level3 query level and 0, it is 1 owing to obtaining the other lock quantity available of Level3 query level, more than 0, then inquiry classification quantity controls module 400 and subtracts 1 by other for Level3 query level lock quantity available, the lock quantity available of Level3 becomes 0, and enquiry module 600 performs inquiry request B to return data query result.As shown in table 3, module lock quantity available change at different levels is controlled for inquiry classification quantity when performing inquiry request B.
Inquiry classification quantity when table 3 performs inquiry request B controls module lock quantity available change at different levels
For performing the inquiry request of inquiry request C, control module 400 to inquiry classification quantity and apply for the other lock of Level3 query level, and to obtain the other lock quantity available of Level3 query level be 0, comparison module 500 is by the size of the relatively more acquired other lock quantity available of Level3 query level and 0, it is 0 owing to obtaining the other lock quantity available of Level3 query level, then postpone inquiry request C, inquiry request C enters waiting state, can not perform, and continue to control to inquiry classification quantity the lock of module application Level3 rank.
Inquiry classification quantity when table 4 performs inquiry request C controls module lock quantity available at different levels
And after inquiry request A or inquiry request B has performed, enquiry module 600 performs inquiry request A to return data query result, perform module 300 and discharge the other lock of Level3 query level, inquiry classification quantity controls module and adds 1 by the lock quantity available of Level3, then the lock quantity available of Level3 becomes 1.As shown in table 5, inquiry request A inquires about the number change of classification quantity control module lock at different levels after having performed.
Inquiry classification quantity when table 5 performs inquiry request B controls module lock quantity available change at different levels
And owing to inquiry request A executed completes, the lock quantity available of Level3 becomes 1, then inquiry request C recovers from waiting state, the lock success of application Level3 rank, then comparison module 500 is by the size of the relatively more acquired other lock quantity available of Level3 query level and 0, it is 1 owing to obtaining the other lock quantity available of Level3 query level, more than 0, then inquiry classification quantity controls module 400 and subtracts 1 by other for Level3 query level lock quantity available, the lock quantity available of Level3 becomes 0, and enquiry module 600 performs inquiry request C to return data query result.
Inquiry classification quantity when table 6 performs inquiry request C controls module lock quantity available change at different levels
Control module by inquiring about classification quantity, it is possible to control concurrent quantity by rank, do not have multiple Level3 level parallelism and perform, cause the situation that server resource exhausts.Owing to avoiding extreme case, it is higher that the SQL lock quantity that this cost of Level1 is low can be arranged, and need not too much consider the impact on server of Level2, Level3 rank, thus promoting the utilization rate of server.
Embodiment described above only have expressed the several embodiments of the present invention, and it describes comparatively concrete and detailed, but therefore can not be interpreted as the restriction to the scope of the claims of the present invention.It should be pointed out that, for the person of ordinary skill of the art, without departing from the inventive concept of the premise, it is also possible to making some deformation and improvement, these broadly fall into protection scope of the present invention.Therefore, the protection domain of patent of the present invention should be as the criterion with claims.
Claims (10)
1. a data query method, comprises the following steps:
Receive the data query rank belonging to data inquiry request and described inquiry request；
Obtain the lock quantity available of described data query rank；
The relatively size locking quantity available and 0 of described acquisition；
If the lock quantity available of described acquisition is more than 0, then the lock quantity available of described data query rank is subtracted 1, and perform described data inquiry request to obtain data query result.
2. data query method according to claim 1, it is characterised in that before the lock quantity available step of the described data query rank of described acquisition, also include:
Apply for the lock of described data query rank；
Before or after the described step that the lock quantity available of described data query rank is subtracted 1, also include: distribute the lock of this data query rank.
3. data query method according to claim 2, it is characterised in that described method also includes:
If the lock quantity available of described acquisition is equal to 0, then postpone the lock of data query rank described in described inquiry request continuation application, until the lock quantity available of described acquisition is more than 0.
4. data query method according to claim 2, at the described data inquiry request of execution, after obtaining data query result step, also to include:
Discharge the lock of described data query rank；
The lock quantity available of described data query rank is added 1.
5. data query method according to claim 1, it is characterised in that the lock quantity available of described data query rank has maximum, described data query rank resource shared by data query divides.
6. a data query system, it is characterised in that including:
Receiver module, for receiving the data query rank belonging to data inquiry request and described inquiry request；
Acquisition module, for obtaining the lock quantity available of described data query rank；
Comparison module, for the size locking quantity available and 0 of relatively described acquisition；
Inquiry classification quantity controls module, if for the lock quantity available of described acquisition more than 0, subtracting 1 by the lock quantity available of described data query rank；
Enquiry module, if for the lock quantity available of described acquisition more than 0, performing described data inquiry request to obtain data query result.
7. data query system according to claim 6, it is characterised in that described system also includes performing module, for, before the lock quantity available of the described acquisition module described data query rank of acquisition, applying for the lock of described data query rank；
Described inquiry classification quantity controls before or after module is additionally operable to subtract 1 by the lock quantity available of described data query rank, to distribute the lock of this data query rank.
8. data query system according to claim 7, it is characterized in that, described execution module, it is additionally operable to when the more described acquired lock quantity available of comparison module is equal to 0, postpone described inquiry request and continue to control the lock of data query rank described in module application to inquiry classification quantity, until the lock quantity available of described acquisition is more than 0.
9. data query system according to claim 7, it is characterised in that described execution module, is additionally operable to perform described data inquiry request, after obtaining data query result, to discharge the lock of described data query rank at described enquiry module；
Described inquiry classification quantity controls module, is additionally operable to perform described data query, after obtaining data query result, to add 1 by the lock quantity available of described data query rank at described enquiry module.
10. data query system according to claim 6, it is characterised in that described inquiry classification quantity controls module and is additionally operable to the resource division data query rank shared by data query；The lock quantity available of described data query rank has maximum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410719576.3A CN105718452A (en) | 2014-12-01 | 2014-12-01 | Data query method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410719576.3A CN105718452A (en) | 2014-12-01 | 2014-12-01 | Data query method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105718452A true CN105718452A (en) | 2016-06-29 |
Family
ID=56146498
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410719576.3A Pending CN105718452A (en) | 2014-12-01 | 2014-12-01 | Data query method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105718452A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080201383A1 (en) * | 2007-02-21 | 2008-08-21 | At&T Knowledge Ventures, Lp | System for managing data collection processes |
| US20090237998A1 (en) * | 2008-03-19 | 2009-09-24 | Yan Li | Adaptive Algorithm in Cache Operation with Dynamic Data Latch Requirements |
| CN102024008A (en) * | 2009-09-09 | 2011-04-20 | 浙江省电力公司 | Limitation method of Web server concurrent number |
| CN102567086A (en) * | 2010-12-30 | 2012-07-11 | 中国移动通信集团公司 | Task scheduling method, equipment and system |
| CN103324534A (en) * | 2012-03-22 | 2013-09-25 | 阿里巴巴集团控股有限公司 | Operation scheduling method and operation scheduler |
-
2014
- 2014-12-01 CN CN201410719576.3A patent/CN105718452A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080201383A1 (en) * | 2007-02-21 | 2008-08-21 | At&T Knowledge Ventures, Lp | System for managing data collection processes |
| US20090237998A1 (en) * | 2008-03-19 | 2009-09-24 | Yan Li | Adaptive Algorithm in Cache Operation with Dynamic Data Latch Requirements |
| CN102024008A (en) * | 2009-09-09 | 2011-04-20 | 浙江省电力公司 | Limitation method of Web server concurrent number |
| CN102567086A (en) * | 2010-12-30 | 2012-07-11 | 中国移动通信集团公司 | Task scheduling method, equipment and system |
| CN103324534A (en) * | 2012-03-22 | 2013-09-25 | 阿里巴巴集团控股有限公司 | Operation scheduling method and operation scheduler |
Non-Patent Citations (1)
| Title |
|---|
| 冯斌全 等: "能力服务计算应用负载调度技术", 《信息技术快报》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20120054280A1 (en) | Sharing Cloud Data Resources With Social Network Associates | |
| US8396968B2 (en) | Information processor and resource scheduling method | |
| US20190014059A1 (en) | Systems and methods for allocating computing resources in distributed computing | |
| WO2009007251A4 (en) | File system mounting in a clustered file system | |
| CN110383764A (en) | The system and method for usage history data processing event in serverless backup system | |
| CN108616424B (en) | Resource scheduling method, computer equipment and system | |
| US8666958B2 (en) | Approaches to reducing lock communications in a shared disk database | |
| JP2014120097A (en) | Information processor, program, and information processing method | |
| US20130227567A1 (en) | Thin client system, connection management server, connection management method and connection management program | |
| CN106708636B (en) | Data caching method and device based on cluster | |
| WO2017128028A1 (en) | Transaction processing method and apparatus | |
| WO2023207082A1 (en) | Load balance method and apparatus, and electronic device | |
| CN115525434A (en) | Resource allocation method, container management assembly and resource allocation system | |
| CN110309229A (en) | The data processing method and distributed system of distributed system | |
| JPWO2016092604A1 (en) | Data processing system and data access method | |
| CN105718452A (en) | Data query method and system | |
| KR20020042235A (en) | Adaptive Lock Escalation Based on the Concept of Unescalatable Locks | |
| CN107239328A (en) | Method for allocating tasks and device | |
| US20220171756A1 (en) | Method and apparatus for distributed database transactions using global timestamping | |
| US20230032682A1 (en) | Find operation for union-mounted systems | |
| CN111857548B (en) | Data reading method, device and system | |
| CN112445763A (en) | File operation method and device, electronic equipment and storage medium | |
| CN115129709A (en) | Data processing method, server and system | |
| CN110019057B (en) | Request processing method and device | |
| US20140280347A1 (en) | Managing Digital Files with Shared Locks |
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: 20160629 |