CN106383864A - Query request processing method and apparatus for time series database - Google Patents
Query request processing method and apparatus for time series database Download PDFInfo
- Publication number
- CN106383864A CN106383864A CN201610801140.8A CN201610801140A CN106383864A CN 106383864 A CN106383864 A CN 106383864A CN 201610801140 A CN201610801140 A CN 201610801140A CN 106383864 A CN106383864 A CN 106383864A
- Authority
- CN
- China
- Prior art keywords
- query
- inquiry
- inquiry request
- write frequency
- data amount
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a query request processing method and apparatus for a time series database. The method comprises the steps of determining a query type of a query request when the query request of a user is received, wherein the query type includes quick query and slow query; if the query type is the quick query, adding the query request to a queue of a first thread pool; and if the query type if the slow query, adding the query request to a queue of a second thread pool. By applying the scheme provided by the method and the apparatus, the processing efficiency and the like of a system can be improved.
Description
【Technical field】
The present invention relates to database technology, particularly to a kind of inquiry request treating method and apparatus of time series database.
【Background technology】
Time series database is the data base of storage magnanimity time series data, and time series data refers to each data equal
Corresponding with a timestamp, time series database can support the inquiry to mass data therein for the user.
Time series database can support that multiple users use simultaneously, and multiple users can submit to multiple queries to ask simultaneously, one
User also can submit to multiple queries to ask simultaneously, and these inquiry request can be divided into two kinds of query types, i.e. consumption calculations resource ratio
Less, time-consuming comparatively short fast inquiry, and, consumption calculations resource is relatively more, time-consuming long slow inquiry.
If system is occupied substantial amounts of computing resource by substantial amounts of slow inquiry, can lead to inquire about soon is time-consuming elongated, very
To being likely to occur the situation needing to wait in line, such as, originally only needed to the fast inquiry of time-consuming 100 milliseconds i.e. achievable one,
Due to needing could to execute after the completion of waiting the slow inquiry coming above, therefore become to need to take and just can complete for 10 seconds, thus
Extend the overall latency of system, and then reduce the treatment effeciency of system.
【Content of the invention】
The invention provides a kind of inquiry request treating method and apparatus of time series database, it is possible to increase the process of system
Efficiency.
Concrete technical scheme is as follows：
A kind of inquiry request processing method of time series database, including：
When receiving the inquiry request of user, determine the query type of described inquiry request, described query type includes：
Fast inquiry and slow inquiry；
If fast inquire about, then described inquiry request is added in the queue in first thread pond；
If slow inquire about, then described inquiry request is added in the queue of the second thread pool.
According to one preferred embodiment of the present invention, the described query type determining described inquiry request includes：
Determine described inquiry request corresponding Query Result estimated data amount；
If described Query Result estimated data amount is less than threshold value set in advance it is determined that the inquiry class of described inquiry request
Type is fast inquiry, otherwise, it determines the query type of described inquiry request is slow inquiry.
According to one preferred embodiment of the present invention,
Table, the initial time of data of inquiry and the end time of required inquiry is carried in described inquiry request；
Described determine that described inquiry request corresponding Query Result estimated data amount includes：
Obtain the table of the described required inquiry table write frequency in nearest scheduled duration；
According to described initial time and described end time, calculate query time scope；
According to described table write frequency and described query time scope, calculate described Query Result estimated data amount.
According to one preferred embodiment of the present invention,
Described query time scope=end time-initial time；
Described Query Result estimated data amount=query time scope * table write frequency.
According to one preferred embodiment of the present invention,
Filtercondition is carried further in described inquiry request；
Described determine that described inquiry request corresponding Query Result estimated data amount includes：
Obtain the table of the described required inquiry table write frequency in nearest scheduled duration；
Calculate the row write frequency of the row of required filtration specified in described filtercondition according to described table write frequency；
According to described initial time and described end time, calculate query time scope；
According to described row write frequency and described query time scope, calculate described Query Result estimated data amount.
According to one preferred embodiment of the present invention,
The product of the radix of each row of described row write frequency=table write frequency/required filtration, wherein, the radix of each column
Number equal to the different values in this row.
According to one preferred embodiment of the present invention,
Described query time scope=end time-initial time；
Described Query Result estimated data amount=query time scope * row write frequency.
A kind of inquiry request processing meanss of time series database, including：Receiving unit, processing unit and Dispatching Unit；
Described receiving unit, for the inquiry request of receive user, and it is single that described inquiry request is sent to described process
First and described Dispatching Unit；
Described processing unit, for determining the query type of described inquiry request, described query type includes：Fast inquiry and
Slow inquiry, and determination result is sent to described Dispatching Unit；
Described Dispatching Unit, for when determining that result is fast inquiry, described inquiry request being added to first thread pond
Queue in, when determining that result is slow inquiry, described inquiry request is added in the queue of the second thread pool.
According to one preferred embodiment of the present invention,
Described processing unit includes：First processes subelement and second processing subelement；
Described first process subelement, is used for determining described inquiry request corresponding Query Result estimated data amount, and
Described Query Result estimated data amount is sent to described second processing subelement；
Described second processing subelement, for being compared described Query Result estimated data amount with threshold value set in advance
Relatively, if described Query Result estimated data amount is less than described threshold value it is determined that the query type of described inquiry request is fast inquiry,
Otherwise, it determines the query type of described inquiry request is slow inquiry, and determination result is sent to described Dispatching Unit.
According to one preferred embodiment of the present invention,
Table, the initial time of data of inquiry and the end time of required inquiry is carried in described inquiry request；
Table write frequency in nearest scheduled duration for the table of the described first process subelement described required inquiry of acquisition；Root
According to described initial time and described end time, calculate query time scope；According to described table write frequency and described look into
Ask time range, calculate described Query Result estimated data amount.
According to one preferred embodiment of the present invention,
Described query time scope=end time-initial time；
Described Query Result estimated data amount=query time scope * table write frequency.
According to one preferred embodiment of the present invention,
Filtercondition is carried further in described inquiry request；
Table write frequency in nearest scheduled duration for the table of the described first process subelement described required inquiry of acquisition；Root
Calculate the row write frequency of the row of required filtration specified in described filtercondition according to described table write frequency；According to described
Time beginning and described end time, calculate query time scope；According to described row write frequency and described query time scope,
Calculate described Query Result estimated data amount.
According to one preferred embodiment of the present invention,
The product of the radix of each row of described row write frequency=table write frequency/required filtration, wherein, the radix of each column
Number equal to the different values in this row.
According to one preferred embodiment of the present invention,
Described query time scope=end time-initial time；
Described Query Result estimated data amount=query time scope * row write frequency.
Be can be seen that using scheme of the present invention based on above-mentioned introduction, by thread pool by fast inquiry and inquire about slowly into
Row isolation, thus being avoided as much as the impact to fast inquiry for the slow inquiry described in the prior art, and then decreases system
Overall latency, improve the treatment effeciency of system.
【Brief description】
Fig. 1 is the flow chart of the inquiry request processing method embodiment of time series database of the present invention.
Fig. 2 is the flow chart of the inquiry request processing method preferred embodiment of time series database of the present invention.
Fig. 3 is the composition structural representation of the inquiry request processing meanss embodiment of time series database of the present invention.
【Specific embodiment】
In order that technical scheme is clearer, clear, develop simultaneously embodiment referring to the drawings, to institute of the present invention
The scheme of stating is described in further detail.
Embodiment one
Fig. 1 is the flow chart of the inquiry request processing method embodiment of time series database of the present invention, as shown in figure 1,
Including implementation in detail below：
In 11, when receiving the inquiry request of user, determine the query type of inquiry request, query type includes：
Fast inquiry and slow inquiry；
In 12, if fast inquire about, then inquiry request is added in the queue in first thread pond；If slow inquire about, then
Inquiry request is added in the queue of the second thread pool.
Fast inquiry and slow inquiry are isolated, mainly to pass through for fast inquiry and slow inquiry to be placed on different thread pools
Come to realize, two thread pools have the queue of oneself for execution, and inquiry request only can be arranged in the queue of thread pool belonging to it
Team, therefore, slow inquiry does not interfere with fast inquiry, i.e. slow inquiry will not block fast inquiry.
For ease of statement, two thread pools are referred to as first thread pond and the second thread pool, wherein, it is right to inquire about soon
The thread pool answered is referred to as first thread pond, will inquire about corresponding thread pool slowly and be referred to as the second thread pool.
But, before being also not carried out an inquiry request, it is cannot directly to determine that it is fast inquiry or looks into slowly
Ask, so needing to estimate the query type of inquiry request.
Time-consuming comparatively short due to inquire about soon, inquiry is time-consuming long slowly, and the number of time-consuming length and Query Result
Relevant according to measuring, data volume is bigger, takes longer, therefore, when receiving inquiry request, can first determine that out that inquiry request corresponds to
Query Result estimated data amount, and then determine the query type of inquiry request according to Query Result estimated data amount.
Hereinafter the Query Result estimated data amount how obtaining inquiry request is described in detail.
As prior art, following information in the inquiry request receiving, can be carried：
1) table of required inquiry；
2) initial time of the data inquired about and end time；
3) filtercondition, you can filtered with the value to some row in table.
Wherein, 1) and) 2 must carry, and 3) be optional, you can to carry it is also possible to not carry.
If only carrying above-mentioned 1) and 2 in inquiry request) described in information, then determine that inquiry request is corresponding
The mode of Query Result estimated data amount may include：
Obtain 1) described in required inquiry table write frequency in nearest scheduled duration for the table (points are per second)；
According to 2) described in initial time and the end time, calculate query time scope；
According to table write frequency and query time scope, calculate Query Result estimated data amount.
The concrete value of described scheduled duration can be decided according to the actual requirements, such as, nearest one hour, nearest scheduled duration
Interior table write frequency, typically refers to the average write frequency in nearest scheduled duration, as made a reservation for divided by described with total writing
Duration, how to obtain table write frequency is prior art.
Query time scope=end time-initial time, can be accurate to the second.
Query Result estimated data amount=query time scope * table write frequency.
If carry in inquiry request simultaneously above-mentioned 1), 2) and 3) described in information, then determine inquiry request
The mode of corresponding Query Result estimated data amount may include：
Obtain 1) described in required inquiry table write frequency in nearest scheduled duration for the table；
Calculate 3 according to table write frequency) described in the row of required filtration specified in filtercondition row write frequency
Rate；
According to 2) described in initial time and the end time, calculate query time scope；
According to row write frequency and query time scope, calculate Query Result estimated data amount.
Wherein, the product of the radix of each row of row write frequency=table write frequency/required filtration.
The radix of each column is equal to the number of the different values in this row, and such as, certain string includes 1,1,2,3 four value,
But because 1 presence once repeats, therefore the radix of this row is 3.
The radix of each column can be obtained by the index of timing scan table, is entered with the up-to-date radix getting when calculating every time
Row calculates.
Query time scope=end time-initial time；
Query Result estimated data amount=query time scope * row write frequency.
After the Query Result estimated data amount obtaining inquiry request, can by Query Result estimated data amount with set in advance
Fixed threshold value is compared, if Query Result estimated data amount is less than threshold value, can determine that the query type of inquiry request is fast
Inquiry, otherwise, it determines the query type of inquiry request is slow inquiry.
The concrete value of described threshold value can be decided according to the actual requirements.
If it is determined that the query type of inquiry request is fast inquiry, inquiry request can be added to the queue in first thread pond
In however, it is determined that the query type of inquiry request be slow inquire about, inquiry request can be added in the queue of the second thread pool.
May include multiple threads in each thread pool, for arbitrary thread, once it is in idle condition, and be located
The queue of thread pool is not empty, then can take out an inquiry request according to the principle of first in first out and be processed, and return inquiry
Result.
The Thread Count that each thread pool includes respectively can be decided according to the actual requirements, can be by arranging in two thread pools
Thread Count proportioning, to realize reasonable distribution between fast inquiry and slow inquiry for the computing resource.
Embodiment two
Based on above-mentioned introduction, Fig. 2 is the inquiry request processing method preferred embodiment of time series database of the present invention
Flow chart, as shown in Fig. 2 include implementation in detail below.
In 21, the inquiry request of receive user.
In 22, the initial time of the data according to the inquiry carrying in inquiry request and end time, calculate and look into
Ask time range.
Query time scope=end time-initial time.
In 23, obtain table write frequency in nearest scheduled duration for the table of required inquiry carrying in inquiry request.
In 24, determining in inquiry request whether carry filtercondition further, if it is not, then executing 25, if so, then holding
Row 26.
That is, following information can be carried in the inquiry request receiving：
1) table of required inquiry；
2) initial time of the data inquired about and end time；
3) filtercondition, you can filtered with the value to some row in table.
Wherein, 1) and) 2 must carry, and 3) be optional, you can to carry it is also possible to not carry.
In 25, according to table write frequency and query time scope, calculate Query Result estimated data amount, hold afterwards
Row 28.
Query Result estimated data amount=query time scope * table write frequency.
The row write frequency of the row of required filtration specified in filtercondition in 26, is calculated according to table write frequency.
The product of the radix of each row of row write frequency=table write frequency/required filtration, wherein, the radix of each column is equal to
The number of the different values in this row.
In 27, according to row write frequency and query time scope, calculate Query Result estimated data amount, execute afterwards
28.
Query Result estimated data amount=query time scope * row write frequency.
In 28, determine whether Query Result estimated data amount is less than threshold value set in advance, if so, then execution 29, no
Then, 210 are executed.
In 29, determine that the query type of inquiry request is fast inquiry, inquiry request is added to the team in first thread pond
In row, execute 211 afterwards.
In 210, determine that the query type of inquiry request is slow inquiry, inquiry request is added to the team of the second thread pool
In row, execute 211 afterwards.
In 211, execute the inquiry request in queue, terminate flow process.
It is more than the introduction with regard to embodiment of the method, below by way of device embodiment, scheme of the present invention is entered to advance
One step explanation.
Embodiment three
Fig. 3 is the composition structural representation of the inquiry request processing meanss embodiment of time series database of the present invention, such as
Shown in Fig. 3, including：Receiving unit 31, processing unit 32 and Dispatching Unit 33.
Receiving unit 31, for the inquiry request of receive user, and inquiry request is sent to processing unit 32 and distribution
Unit 33.
Processing unit 32, for determining the query type of inquiry request, query type includes：Fast inquiry and slow inquiry, and
Determination result is sent to Dispatching Unit 33.
Dispatching Unit 33, for when determining that result is fast inquiry, inquiry request being added to the queue in first thread pond
In, when determining that result is slow inquiry, inquiry request is added in the queue of the second thread pool.
Fast inquiry and slow inquiry are isolated, mainly to pass through for fast inquiry and slow inquiry to be placed on different thread pools
Come to realize, two thread pools have the queue of oneself for execution, and inquiry request only can be arranged in the queue of thread pool belonging to it
Team, therefore, slow inquiry does not interfere with fast inquiry, i.e. slow inquiry will not block fast inquiry.
For ease of statement, two thread pools are referred to as first thread pond and the second thread pool, wherein, it is right to inquire about soon
The thread pool answered is referred to as first thread pond, will inquire about corresponding thread pool slowly and be referred to as the second thread pool.
But, before being also not carried out an inquiry request, it is cannot directly to determine that it is fast inquiry or looks into slowly
Ask, so needing to estimate the query type of inquiry request.
Time-consuming comparatively short due to inquire about soon, inquiry is time-consuming long slowly, and the number of time-consuming length and Query Result
Relevant according to measuring, data volume is bigger, takes longer, therefore, when receiving inquiry request, can first determine that out that inquiry request corresponds to
Query Result estimated data amount, and then determine the query type of inquiry request according to Query Result estimated data amount.
Correspondingly, may include in processing unit 32：First processes subelement 321 and second processing subelement 322.
First process subelement 321, is used for determining inquiry request corresponding Query Result estimated data amount, and will inquire about
Result estimated data amount is sent to second processing subelement 322.
Second processing subelement 322, for Query Result estimated data amount and threshold value set in advance are compared, if
Query Result estimated data amount is less than described threshold value it is determined that the query type of inquiry request is fast inquiry, otherwise, it determines inquiring about
The query type of request is slow inquiry, and determination result is sent to Dispatching Unit 33.
The same with prior art, table, the initial time of the data of inquiry of required inquiry can be carried in inquiry request
And the end time.
First process subelement 321 can obtain table write frequency in nearest scheduled duration for the required table inquired about first,
And according to initial time and end time, calculate query time scope, afterwards according to table write frequency and query time model
Enclose, calculate Query Result estimated data amount.
Wherein, query time scope=end time-initial time；
Query Result estimated data amount=query time scope * table write frequency.
In addition, filtercondition also can be carried in inquiry request further.
When carrying filtercondition, the table that the first process subelement 321 can obtain required inquiry first makes a reservation for recently
Table write frequency in duration, and the row write of the row of required filtration specified in filtercondition is calculated according to table write frequency
Frequency, afterwards according to initial time and end time, calculates query time scope, and then according to when row write frequency and inquiry
Between scope, calculate Query Result estimated data amount.
Wherein, the product of the radix of each row of row write frequency=table write frequency/required filtration, wherein, the base of each column
Number is equal to the number of the different values in this row；
Query time scope=end time-initial time；
Query Result estimated data amount=query time scope * row write frequency.
In a word, using scheme of the present invention, by thread pool, fast inquiry and slow inquiry are isolated, thus as far as possible
Avoid the impact to fast inquiry for the slow inquiry described in the prior art, and then decrease the overall latency of system, carry
The high treatment effeciency of system；And, computing resource can be realized fast by arranging the Thread Count proportioning in two thread pools
Reasonable distribution between inquiry and slow inquiry；In addition, scheme of the present invention implement simple and convenient, consequently facilitating carrying out general
And and promote.
It should be understood that disclosed apparatus and method in several embodiments provided by the present invention, can be passed through it
Its mode is realized.For example, device embodiment described above is only schematically, for example, the division of described unit, and only
It is only a kind of division of logic function, actual can have other dividing mode when realizing.
The described unit illustrating as separating component can be or may not be physically separate, show as unit
The part showing can be or may not be physical location, you can with positioned at a place, or can also be distributed to multiple
On NE.The mesh to realize this embodiment scheme for some or all of unit therein can be selected according to the actual needs
's.
In addition, can be integrated in a processing unit in each functional unit in each embodiment of the present invention it is also possible to
It is that unit is individually physically present it is also possible to two or more units are integrated in a unit.Above-mentioned integrated list
Unit both can be to be realized in the form of hardware, it would however also be possible to employ the form that hardware adds SFU software functional unit is realized.
The above-mentioned integrated unit realized in the form of SFU software functional unit, can be stored in an embodied on computer readable and deposit
In storage media.Above-mentioned SFU software functional unit is stored in a storage medium, including some instructions with so that a computer
Equipment (can be personal computer, server, or network equipment etc.) or processor (processor) execution the present invention each
The part steps of embodiment methods described.And aforesaid storage medium includes：USB flash disk, portable hard drive, read only memory (ROM,
Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disc or CD etc. various
Can be with the medium of store program codes.
The foregoing is only presently preferred embodiments of the present invention, not in order to limit the present invention, all essences in the present invention
Within god and principle, any modification, equivalent substitution and improvement done etc., should be included within the scope of protection of the invention.
Claims (14)
1. a kind of inquiry request processing method of time series database is it is characterised in that include：
When receiving the inquiry request of user, determine the query type of described inquiry request, described query type includes：Look into soon
Ask and slow inquiry；
If fast inquire about, then described inquiry request is added in the queue in first thread pond；
If slow inquire about, then described inquiry request is added in the queue of the second thread pool.
2. method according to claim 1 it is characterised in that
The described query type determining described inquiry request includes：
Determine described inquiry request corresponding Query Result estimated data amount；
If described Query Result estimated data amount is less than threshold value set in advance it is determined that the query type of described inquiry request is
Fast inquiry, otherwise, it determines the query type of described inquiry request is slow inquiry.
3. method according to claim 2 it is characterised in that
Table, the initial time of data of inquiry and the end time of required inquiry is carried in described inquiry request；
Described determine that described inquiry request corresponding Query Result estimated data amount includes：
Obtain the table of the described required inquiry table write frequency in nearest scheduled duration；
According to described initial time and described end time, calculate query time scope；
According to described table write frequency and described query time scope, calculate described Query Result estimated data amount.
4. method according to claim 3 it is characterised in that
Described query time scope=end time-initial time；
Described Query Result estimated data amount=query time scope * table write frequency.
5. method according to claim 3 it is characterised in that
Filtercondition is carried further in described inquiry request；
Described determine that described inquiry request corresponding Query Result estimated data amount includes：
Obtain the table of the described required inquiry table write frequency in nearest scheduled duration；
Calculate the row write frequency of the row of required filtration specified in described filtercondition according to described table write frequency；
According to described initial time and described end time, calculate query time scope；
According to described row write frequency and described query time scope, calculate described Query Result estimated data amount.
6. method according to claim 5 it is characterised in that
The product of the radix of each row of described row write frequency=table write frequency/required filtration, wherein, the radix of each column is equal to
The number of the different values in this row.
7. the method according to claim 5 or 6 it is characterised in that
Described query time scope=end time-initial time；
Described Query Result estimated data amount=query time scope * row write frequency.
8. a kind of inquiry request processing meanss of time series database are it is characterised in that include：Receiving unit, processing unit and point
Bill unit；
Described receiving unit, for the inquiry request of receive user, and by described inquiry request be sent to described processing unit and
Described Dispatching Unit；
Described processing unit, for determining the query type of described inquiry request, described query type includes：Inquire about soon and look into slowly
Ask, and determination result is sent to described Dispatching Unit；
Described Dispatching Unit, for when determining that result is fast inquiry, described inquiry request being added to the team in first thread pond
In row, when determining that result is slow inquiry, described inquiry request is added in the queue of the second thread pool.
9. device according to claim 8 it is characterised in that
Described processing unit includes：First processes subelement and second processing subelement；
Described first process subelement, is used for determining described inquiry request corresponding Query Result estimated data amount, and by institute
State Query Result estimated data amount and be sent to described second processing subelement；
Described second processing subelement, for described Query Result estimated data amount is compared with threshold value set in advance,
If described Query Result estimated data amount is less than described threshold value it is determined that the query type of described inquiry request is fast inquiry, no
Then, determine that the query type of described inquiry request is inquired about for slow, and determination result is sent to described Dispatching Unit.
10. device according to claim 9 it is characterised in that
Table, the initial time of data of inquiry and the end time of required inquiry is carried in described inquiry request；
Table write frequency in nearest scheduled duration for the table of the described first process subelement described required inquiry of acquisition；According to institute
State initial time and described end time, calculate query time scope；According to when described table write frequency and described inquiry
Between scope, calculate described Query Result estimated data amount.
11. devices according to claim 10 it is characterised in that
Described query time scope=end time-initial time；
Described Query Result estimated data amount=query time scope * table write frequency.
12. devices according to claim 10 it is characterised in that
Filtercondition is carried further in described inquiry request；
Table write frequency in nearest scheduled duration for the table of the described first process subelement described required inquiry of acquisition；According to institute
State the row write frequency that table write frequency calculates the row of required filtration specified in described filtercondition；According to described initial when
Between and the described end time, calculate query time scope；According to described row write frequency and described query time scope, calculate
Go out described Query Result estimated data amount.
13. devices according to claim 12 it is characterised in that
The product of the radix of each row of described row write frequency=table write frequency/required filtration, wherein, the radix of each column is equal to
The number of the different values in this row.
14. devices according to claim 12 or 13 it is characterised in that
Described query time scope=end time-initial time；
Described Query Result estimated data amount=query time scope * row write frequency.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610801140.8A CN106383864B (en) | 2016-09-02 | 2016-09-02 | A kind of inquiry request treating method and apparatus of time series database |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610801140.8A CN106383864B (en) | 2016-09-02 | 2016-09-02 | A kind of inquiry request treating method and apparatus of time series database |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106383864A true CN106383864A (en) | 2017-02-08 |
| CN106383864B CN106383864B (en) | 2019-08-27 |
Family
ID=57938840
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610801140.8A Active CN106383864B (en) | 2016-09-02 | 2016-09-02 | A kind of inquiry request treating method and apparatus of time series database |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106383864B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107341056A (en) * | 2017-07-05 | 2017-11-10 | 郑州云海信息技术有限公司 | A kind of method and device of the thread distribution based on NFS |
| CN108595254A (en) * | 2018-03-09 | 2018-09-28 | 北京永洪商智科技有限公司 | A kind of query scheduling method |
| CN109241094A (en) * | 2017-07-10 | 2019-01-18 | 大唐移动通信设备有限公司 | A kind of data query method and device |
| CN110069511A (en) * | 2017-09-26 | 2019-07-30 | 北京国双科技有限公司 | A kind of distribution method and device of data query |
| CN110166282A (en) * | 2019-04-16 | 2019-08-23 | 苏宁易购集团股份有限公司 | Resource allocation methods, device, computer equipment and storage medium |
| CN110609737A (en) * | 2019-08-14 | 2019-12-24 | 平安科技（深圳）有限公司 | Associated data query method and device, computer equipment and storage medium |
| CN111046081A (en) * | 2019-12-06 | 2020-04-21 | 宁波和利时智能科技有限公司 | Access method and system for industrial time sequence data |
| CN112311616A (en) * | 2019-08-01 | 2021-02-02 | 北京百度网讯科技有限公司 | Data communication frequency statistical method, device and storage medium |
| CN116719646A (en) * | 2023-08-09 | 2023-09-08 | 浙江邦盛科技股份有限公司 | Hot spot data processing method, device, electronic device and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102495851A (en) * | 2011-11-17 | 2012-06-13 | 百度在线网络技术（北京）有限公司 | Method, system and device for storing and querying timing sequence data |
| CN103853752A (en) * | 2012-11-30 | 2014-06-11 | 国际商业机器公司 | Method and device for managing time series database |
| CN104750690A (en) * | 2013-12-25 | 2015-07-01 | 中国移动通信集团公司 | Query processing method, device and system |
| US20150331910A1 (en) * | 2014-04-28 | 2015-11-19 | Venkatachary Srinivasan | Methods and systems of query engines and secondary indexes implemented in a distributed database |
-
2016
- 2016-09-02 CN CN201610801140.8A patent/CN106383864B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102495851A (en) * | 2011-11-17 | 2012-06-13 | 百度在线网络技术（北京）有限公司 | Method, system and device for storing and querying timing sequence data |
| CN103853752A (en) * | 2012-11-30 | 2014-06-11 | 国际商业机器公司 | Method and device for managing time series database |
| CN104750690A (en) * | 2013-12-25 | 2015-07-01 | 中国移动通信集团公司 | Query processing method, device and system |
| US20150331910A1 (en) * | 2014-04-28 | 2015-11-19 | Venkatachary Srinivasan | Methods and systems of query engines and secondary indexes implemented in a distributed database |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107341056A (en) * | 2017-07-05 | 2017-11-10 | 郑州云海信息技术有限公司 | A kind of method and device of the thread distribution based on NFS |
| CN109241094A (en) * | 2017-07-10 | 2019-01-18 | 大唐移动通信设备有限公司 | A kind of data query method and device |
| CN110069511B (en) * | 2017-09-26 | 2021-10-15 | 北京国双科技有限公司 | Data query distribution method and device |
| CN110069511A (en) * | 2017-09-26 | 2019-07-30 | 北京国双科技有限公司 | A kind of distribution method and device of data query |
| CN108595254B (en) * | 2018-03-09 | 2022-02-22 | 北京永洪商智科技有限公司 | Query scheduling method |
| CN108595254A (en) * | 2018-03-09 | 2018-09-28 | 北京永洪商智科技有限公司 | A kind of query scheduling method |
| CN110166282A (en) * | 2019-04-16 | 2019-08-23 | 苏宁易购集团股份有限公司 | Resource allocation methods, device, computer equipment and storage medium |
| CN112311616A (en) * | 2019-08-01 | 2021-02-02 | 北京百度网讯科技有限公司 | Data communication frequency statistical method, device and storage medium |
| CN110609737A (en) * | 2019-08-14 | 2019-12-24 | 平安科技（深圳）有限公司 | Associated data query method and device, computer equipment and storage medium |
| CN110609737B (en) * | 2019-08-14 | 2023-04-25 | 平安科技（深圳）有限公司 | Associated data query method, device, computer equipment and storage medium |
| CN111046081A (en) * | 2019-12-06 | 2020-04-21 | 宁波和利时智能科技有限公司 | Access method and system for industrial time sequence data |
| CN111046081B (en) * | 2019-12-06 | 2023-09-12 | 和利时卡优倍科技有限公司 | Industrial time sequence data access method and system |
| CN116719646A (en) * | 2023-08-09 | 2023-09-08 | 浙江邦盛科技股份有限公司 | Hot spot data processing method, device, electronic device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106383864B (en) | 2019-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106383864A (en) | Query request processing method and apparatus for time series database | |
| CN103678408B (en) | A kind of method and device of inquiry data | |
| US9842136B2 (en) | Database management system, computer, and database management method | |
| US7478083B2 (en) | Method and system for estimating cardinality in a database system | |
| CN106502791B (en) | A kind of method for allocating tasks and device | |
| US9805077B2 (en) | Method and system for optimizing data access in a database using multi-class objects | |
| CN103970870A (en) | Database query method and server | |
| CN107608773A (en) | task concurrent processing method, device and computing device | |
| JP2008059438A (en) | Storage system, data rearranging method thereof and data rearrangement program | |
| EP3040865A1 (en) | Database management system and computer system | |
| CN105956666B (en) | A kind of machine learning method and system | |
| CN103019649B (en) | Information providing method and equipment | |
| CN103713895B (en) | A kind of data transmission method for uplink and device | |
| CN110807145A (en) | Query engine acquisition method, device and computer-readable storage medium | |
| CN107480041A (en) | The task automation method of testing and system of a kind of big data | |
| CN110209597A (en) | Handle method, apparatus, equipment and the storage medium of access request | |
| CN105975331A (en) | Data parallel processing method and apparatus | |
| CN108139938A (en) | For assisting the device of main thread executing application task, method and computer program using secondary thread | |
| US9384219B2 (en) | Computer system, data retrieval method and database management computer | |
| CN110175073B (en) | Scheduling method, sending method, device and related equipment of data exchange job | |
| CN108664322A (en) | Data processing method and system | |
| CN106202374A (en) | A kind of data processing method and device | |
| CN106446080B (en) | Data query method, query service equipment, client equipment and data system | |
| CN105468603B (en) | Data selecting method and device | |
| CN108073444A (en) | To the method and system of client push user data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |