Automated and dynamic management of query views for database workloads

Abstract

The embodiments of the invention provide a method, program storage device, etc. for automated and dynamic management of query views for database workloads. More specifically, a method begins by executing queries, which includes accessing a set of data tables for each of the queries. During the executing of the queries, the method accesses a required data table from a cache if the required data table is present in the cache and creates the required data table if the required data table is not present in the cache. The accessing of the required data table from the cache has a lower processing cost than accessing the required data table from a base table. Also during the executing of the queries, created data tables are stored in the cache, wherein one or more of the created data tables are removed from the cache when the cache becomes full.

1 . A method, comprising:
 executing queries, comprising accessing a set of data tables for each of said queries, wherein said data tables summarize common portions of said queries; and   during said executing of said queries,   accessing a required data table from a cache if said required data table is present in said cache,   creating said required data table if said required data table is not present in said cache and if a benefit of accessing said required data table exceeds a cost of creating said required data table, and   storing created data tables in said cache, wherein said accessing of said required data table from said cache comprises a lower processing cost than accessing said required data table from a base table, wherein, prior to said executing of said queries, said cache comprises zero required data tables, and   reordering said queries, wherein said reordering of said queries comprises:   creating workloads such that each of said workloads represents an ordering of said queries; and   at least one of recombining and mutating said workloads to create new orderings of said queries;   identifying one of said new orderings of said queries as an ordering comprising a lowest processing cost; and   during said executing of said queries, removing at least one of said created data tables from said cache when said cache becomes full.   
   
   
       2 - 20 . (canceled)