QUERY UTILIZATION USING QUERY BURST CLASSIFICATION
First Claim
1. A method comprising:
- using one or more computer processors to determine, for each of a plurality of time periods, a rate of a plurality of queries to a data source;
associating a cost with a query state transition;
assigning a query state to a particular query for a particular time period of the plurality of time periods; and
identifying a query burst during the plurality of time periods based on assignment of the query state to each of the plurality of queries.
2 Assignments
0 Petitions
Accused Products
Abstract
Query utilization in which a rate of a plurality of queries to a data source may be determined for a plurality of time periods. A cost may be associated with a query state transition. A query state may be assigned to a particular query on a particular time period of the plurality of time periods based on the rate of queries for the particular time period and the cost of the query state transition. A query burst may be identified during the plurality of time periods based on assignment of a query state to the plurality of queries. The query may exhibit a normal query state, a normal-to-deviated query state transition, and a deviated query state. A query burst identification module may identify a query burst during the plurality of time periods, a burst conversion module may convert the query burst to a wavelet using a wavelet transform, a clustering module may apply a clustering technique to the wavelet, and a query classification module may classify the query burst based on applying the clustering technique.
-
Citations
23 Claims
-
1. A method comprising:
-
using one or more computer processors to determine, for each of a plurality of time periods, a rate of a plurality of queries to a data source; associating a cost with a query state transition; assigning a query state to a particular query for a particular time period of the plurality of time periods; and identifying a query burst during the plurality of time periods based on assignment of the query state to each of the plurality of queries. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A non-transitory machine-readable medium comprising instructions, which when implemented by one or more processors perform the following operations:
-
determining, for each of a plurality of time periods, a rate of a plurality of queries to a data source; associating a cost with a query state transition; assigning a query state to a particular query for a particular time period of the plurality of time periods, the assigning being based on a particular query rate of the rate of the plurality of queries for the particular time period and the cost of the query state transition; and identifying a query burst during the plurality of time periods based on assignment of the query state to each of the plurality of queries. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A system comprising:
-
one or more computer processors and memory adapted to store and execute a query rate determination module to determine, for each of a plurality of time periods, a rate of a plurality of queries to a data source;
a cost association module to associate a cost with a query state transition;a state assignment module to assign a query state for a particular time period of the plurality of time periods; and a query burst identification module to identify a query burst during the plurality of time periods based on the assignment of the query state to each of the plurality of queries by the state assignment module. - View Dependent Claims (22, 23)
-
Specification