| Class / Patent application number | Description | Number of patent applications / Date published |
|---|
| 707720000 | Based on resource consumption | 20 |
| 20100121839 | QUERY OPTIMIZATION - A new database design is implemented in which everything in the database is modeled with primitives, including the links and nodes for a graph tuple store. A query syntax provides a nested tree of constraints with a single global schema. Various optimization techniques for queries and replication techniques are also described. | 05-13-2010 |
| 20100153363 | STREAM DATA PROCESSING METHOD AND SYSTEM - An operation management program collects a query status table of a migration-source agent processing program and creates a server status table. The operation management program, based on the server status table, computes a migration cost for each query, and selects the query with the smallest migration cost as a migration query. Then, the operation management program migrates the selected query, using the optimum migration method. | 06-17-2010 |
| 20100211560 | EFFICIENT EVALUATION OF XQUERY AND XPATH FULL TEXT EXTENSION - Techniques are provided for efficiently evaluating XML queries that conform to an extension of an XML language (e.g., XQuery or XPath). The extension allows XML queries to have full-text search capabilities. Such an XML query is compiled to generate a tree of nodes that correspond to one or more conditions in the full-text portion of the query. In one technique, the amount of memory for the execution state of the tree is determined at compile time and allocated only once throughout execution of the query. In another technique, to ensure at most a single scan of a document, all the words or phrases in the full-text portion of an XML query are located before any of the other conditions in the full-text portion are evaluated. In another technique, the elements of the full-text portion of an XML query are analyzed to determine, based at least in part on cost, which evaluation strategy, of a plurality of evaluation strategies, should be employed. | 08-19-2010 |
| 20110022586 | Determining whether change in workload of database system has occurred, and/or whether executing current workload will likely result in problem developing with database system - Whether a change in workload of a database system has occurred can be determined. Investigative queries are formulated. Each investigative query is adapted to test a different resource or a different combination of resources of the database system. The investigative queries are run when the database system is in an unloaded state to acquire unloaded performance metrics. The investigative queries are run when the database system is in a loaded state to acquire loaded performance metrics. Whether executing a current workload of the database system, using a current configuration of the database system, will likely result in a problem developing at a later point in time can also be determined. Simultaneously with actual execution of the current workload on the database system using the current configuration, a simulation of execution of the current workload using the current configuration is performed. The simulation is performed more quickly than the actual execution. | 01-27-2011 |
| 20110035369 | Query Optimization with Memory I/O Awareness - System, method, computer program product embodiments and combinations and sub-combinations thereof for tuning query execution performance in a database management system are described. In an aspect, query optimization in a database management system (DBMS) with memory I/O (input/output) awareness includes determining compensated physical I/O (PIO) values indicative of memory I/O operations, including an approximate cache occupancy level, of an executing query in a DBMS, and utilizing the compensated PIO values as feedback to a query optimizer of the DBMS for optimization of future query execution. | 02-10-2011 |
| 20110072008 | Query Optimization with Awareness of Limited Resource Usage - System, method, computer program product embodiments and combinations and sub-combinations thereof for tuning query execution performance in a database management system are described. In an aspect, query optimization in a database management system (DBMS) with awareness of limited resource usage includes identifying limited resource usage for each possible plan being considered for query execution by a query engine. A determination of whether any possible plan has limited resource usage that does not exceed a threshold level is made, and when at least one possible plan does not exceed the threshold level, the identified limited resource usage is included as a consideration during plan selection by the query engine. In an embodiment, temporary database usage is identified for each possible plan. | 03-24-2011 |
| 20110119252 | Pricing Access to Data Using Contribution Analysis - Techniques are described herein for pricing access to data using contribution analysis. A user may issue a query to a store that stores data. The store may analyze a subset of the data to determine a result that is to be provided to the user in response to the query. The subset is referred to as contribution data. A data access price calculator performs a contribution analysis to determine a price to be charged to the user to access the result. The contribution analysis takes into consideration a number of rows and/or columns of data in the contribution data, a number of rows and/or columns of data in the result, functions used during the store's analysis of the contribution data, or a combination thereof. The data access price calculator may derive such information from an indicator that is received from the store and/or to some extent from the result itself. | 05-19-2011 |
| 20110179015 | DATABASE QUERY RESOURCE MANAGEMENT USING SELECT STATEMENT CONDITION - A resource allocation system for a database environment. In a specific embodiment, the resource allocation system is adapted to implement a method that includes receiving a first signal from a user input device to identify a SQL SELECT statement to be used in a future database query. The system receives a second signal from the user input device to determine a resource to be used when the SELECT statement is executed. The system then stores, in a storage device, an indication of the resource in association with the SELECT statement so that when the SELECT statement is executed the resource is used. | 07-21-2011 |
| 20110246451 | STORAGE DEVICE HAVING FULL-TEXT SEARCH FUNCTION - According to one embodiment, a storage device includes an interface, a first and second memory blocks and a controller. The interface receives a content search request. The first memory block stores files and inverted files corresponding to contents included in the files. The second memory block stores a file search table. The controller creates the inverted file for each content included in the files and stores IDs of the files including the content in the inverted file. The controller obtains, by search of the content, a corresponding inverted file from the inverted files stored in the first memory block and stores, in the file search table, the IDs of the files included in the obtained inverted file. The controller outputs the IDs of the files stored in the file search table from the interface as a search result for the content search request. | 10-06-2011 |
| 20110252019 | PROJECT MANAGEMENT SYSTEM - A project management system includes a database formed of one or more tables and a computing device having one or more modules configured to: receive data and an identifier of the data, store the data in one or more tables of the database based upon the data identifier, in which the one or more tables in the database are accessible by a database management tool, and produce one or more records corresponding to the data stored in the one or more tables, in which the one or more records are accessible by a project management tool. | 10-13-2011 |
| 20120136850 | MEMORY USAGE QUERY GOVERNOR - Techniques for managing query execution based on memory usage using memory compression. Embodiments may receive a query from a requesting entity and estimate an amount of memory required to execute the query. Upon determining that executing the query would consume an impermissible amount of memory, embodiments may optimize the query by adjusting an amount of memory compression used in executing the query. The optimized query may then be executed to produce a set of query results, which may then be returned to the requesting entity. | 05-31-2012 |
| 20120215764 | ENERGY USAGE AND PERFORMANCE QUERY GOVERNOR - Techniques are described for managing query execution using additional performance capabilities from a set of system resources. Embodiments may receive a query and calculate a first estimated execution time for processing the query using a first amount of performance capabilities from a first set of system resources. If embodiments determine that the first estimated execution time exceeds a threshold amount of time, a second estimated execution time is then calculated for processing the query using a second amount of performance capabilities from the first set of system resources. Here, the second amount of performance capabilities is in addition to the first amount of performance capabilities. If the second estimated execution time does not exceed the threshold amount of time, the query is executed using the second amount of performance capabilities from the first set of system resources. | 08-23-2012 |
| 20120233149 | EFFICIENT PROCESSING OF BULK QUERIES TO DETERMINE THE AVAILABILITY OF RESOURCES - Systems and methods for automatically determining the availability of resources, such as Internet advertising opportunities, are described herein. The systems and methods efficiently process bulk queries that specify multiple target values for at least one attribute associated with the resources, such bulk queries being useful for determining the availability of a wide variety of different resource types. | 09-13-2012 |
| 20130024442 | SYSTEM LOAD QUERY GOVERNOR - Techniques are disclosed for query processing. In one embodiment, a query is received for execution in a processing environment. Based on a measure of current load of the processing environment, a maximum amount of a resource that the query is allowed to consume is determined. An amount of the resource that the query is to consume is estimated. Execution of the query is managed based on a comparison between the maximum amount and the estimated amount. | 01-24-2013 |
| 20130151507 | System and Methods for Enabling Arbitrary Developer Code Consumption of Web-Based Data - A structured file includes information to bind a web data source to a web data query system. Code is embedded within the structured file and is in a code language understood by the web data query system. The code is unrestricted in function. Code language objects are exposed within the web data query system for use by the code to interface with the web data query system and the web data source. A URL is associated with the structured file to enable access of the structured file through the Internet. A unit-based quota method is implemented to manage execution of code in the structured file. The unit-based quota method collapses multiple dimensions of computing resource control into a single unit value, tracks a number of units expended by the code, and stops execution of the code when the number of units expended by the code reaches a set limit. | 06-13-2013 |
| 20130166536 | DATABASE QUERY GOVERNOR WITH TAILORED THRESHOLDS - A query governor intelligently sets tailored thresholds for a query accessing a computer database. The query governor preferably generates a tailored threshold for each query sent to the database for execution. The tailored threshold for the query is preferably compared to an estimated query execution time to determine whether to execute the query. The query governor uses one or more factors applied to a standard threshold to generate the tailored threshold. The factors preferably include user factors and query factors. These factors are dynamically adjusted by the query governor in an intelligent way to increase optimal use of the database. Other factors may include factors such as job priority factor, resource factor and an application factor. | 06-27-2013 |
| 20150347512 | DISTRIBUTED EXECUTION OF EXPRESSIONS IN A QUERY - A computer-implemented method for executing a query specification can include evaluating the query specification by a first computing device to identify a candidate expression in the query specification to be executed by a second computing device hosting a source of data specified in the candidate expression. A cost estimate for executing the candidate expression at the first computing device is determined. Whether the cost estimate of executing the candidate expression at the first computing device is greater than a threshold is determined. The candidate expression is replaced with a native query function when the cost estimate of executing the candidate expression at the first computing device is greater than the threshold. The native query function can be executed at the second computing device. It can be determined whether a runtime context is necessary, and if necessary, a context parameter is injected into the native query function. | 12-03-2015 |
| 20150379079 | Personalizing Query Rewrites For Ad Matching - Systems and methods for rewriting queries based on data features are disclosed. A data source contains a history of queries and results associated with the queries. A source query is received and a subset of the data source is extracted that is related to the query. Costs are then associated with the associations of the queries and results, and an absorbed cost is determined for each query. The queries having the lowest absorbed cost are recommended for rewrites. | 12-31-2015 |
| 20160179891 | METHODS AND SYSTEMS FOR LOAD BALANCING DATABASES IN A CLOUD ENVIRONMENT | 06-23-2016 |
| 20160179892 | EFFICIENT DATA TRANSFER | 06-23-2016 |
