Patent Document

BACKGROUND 
     This invention relates generally to database query optimization, and more generally to optimization of queries for databases having compressed data. 
     In order to conserve resources and processing time, many databases are compressed at the storage level using, for example, run-length encoding (RLE) compression or other compression techniques. Compression conserves storage space and reduces the number of read requests. However, queries conventionally decompress compressed stored data and operate on uncompressed data. Thus, in order to execute a query on compressed databases, the data must be first decompressed and the query executed multiple times on decompressed data that may be the same. The multiple intermediate results must then be aggregated to obtain an answer. This is inefficient, and results in substantial and costly processing and long overall response times. 
     It is desirable to provide systems and methods that address these and other known problems of executing queries on compressed data by minimizing computation costs and reducing query response time, and it is to these ends that the invention is directed. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG. 1  illustrates a conventional shared nothing architecture for a distributed database of the type in which the invention may be employed; 
         FIG. 2  illustrates a master node of the shared nothing database of  FIG. 1  which may incorporate an embodiment of the invention; 
         FIG. 3  is an example of a logical query plan for a database; 
         FIG. 4  illustrates the logical query plan of  FIG. 3  for use on compressed relations; 
         FIGS. 5A and 5B  illustrate, respectively, an example of a query plan pattern and a transformation of the query plan into a logically equivalent query plan; 
         FIG. 6  illustrates a query plan pattern that decompresses compressed data and includes a JOIN operator which may be transformed and optimized in accordance with the invention; 
         FIG. 7  illustrates a transformation and optimization of the query plan of  FIG. 6  in accordance with an embodiment of the invention; 
         FIG. 8  illustrates the transformation of  FIG. 7  applied to the query plan of  FIG. 4  in accordance with another embodiment of the invention; and 
         FIGS. 9A and 9B  illustrate, respectively, another query plan pattern for use with compressed data and a corresponding transformation of the plan in accordance with an embodiment of the invention, where the transformed plan uses a different query operator to enable operation directly on compressed relations. 
     
    
    
     DESCRIPTION OF PREFERRED EMBODIMENTS 
     The invention is particularly well adapted for use with distributed database systems which compresses data at the storage level using RLE-based compression and structured query language (SQL) queries, and will be described in that environment. It will become apparent, however, that this is illustrative of only one utility of the invention and that the invention may be employed with other databases, with other types of compression, and with other query languages. 
       FIG. 1  illustrates a shared-nothing network architecture of a logical database  100  of the type with which the invention may be employed. The network may include a master node  102  which connects to and manages a plurality of shared-nothing nodes  104 -A through  104 -N. Each node may comprise a plurality of database segments (database instances) including one or more primary databases and one or more mirror databases. Data may be stored in the segments in compressed form using run length encoding (RLE) compression, for example, and accessed using queries such as SQL queries. Clients  106  may interact with the database through the master node  102 . 
       FIG. 2  illustrates a master node  202  configured to implement operations in accordance with the invention. The master node may comprise a host computer system  210  (which may be a multi-processor system comprising a plurality of CPUs) connected to input/output (I/O) devices  212  by a bus  214 . The I/O devices may be standard computer system input and output devices. A network interface circuit  216  may also be connected to bus  214  to allow the master node to operate in a networked environment. Clients  106  may communicate with the distributed database through the master node (see  FIG. 1 ) using either the I/O devices or the network interface circuit. The master node may also have a memory  220  connected to the bus that embodies executable instructions to control the operation of the host computer system of the node and to perform processes in accordance with the invention. Included in memory  220  may be a main memory  222  and a query optimizer  224  comprising instructions that control the CPU to perform query optimization processes in accordance with the invention. 
     As will be described, the invention affords optimization of queries on databases employing RLE-based compression at the storage level. It provides a framework to exploit RLE compression during query optimization to optimize the queries to minimize computation costs and reduce overall response time. Optimization processes in accordance with embodiments of the invention identify logical query plans, or portions thereof, that bind to certain predetermined patterns and include certain predetermined query operators and/or aggregation operations involving RLE-compressed relations to which logical transformations may be applied that rearrange the query plan and/or use different query operators to produce an optimized logically equivalent plan. The logical query plans are then transformed into the optimized logically equivalent plans. The transformed plans enable optimized queries to operate directly on compressed data and produce correct results without first having to decompress the data. This minimizes computation costs and reduces overall response time by avoiding the necessity of performing multiple query computations on uncompressed data that is the same. 
     A logical query plan comprises a tree of query language operators that correspond to relational operations such as GET, COMPRESS, DECOMPRESS, JOIN, GROUPBY, and others. The output of each operator is a relation, and each operator produces a set of output columns. For instance, a GET operator corresponds to reading a relation from a storage device and presenting the data in tabular form. This operator has no children. The JOIN operator has two children which correspond to its inputs. It possesses a qualification expression that corresponds to the join condition between two relations. A GROUPBY operator has one child as an input and has a set of grouping columns that should be logically grouped to compute the output relation. The output of the GROUPBY operator may be associated with aggregate functions such as SUM, MIN and COUNT. A COMPRESS operator has one child, and transforms an uncompressed relation to a compressed one. A DECOMPRESS operator performs the reverse function by transforming a compressed relation into an uncompressed one. For example, a stream of numbers &lt;5,5,6,6,6,6,1,1&gt; may be RLE compressed to the form &lt;(5,2),(6,4),(1,2)&gt; where second number represents frequency of occurrence of the first element (number). The COMPRESS operation goes from a stream of objects to RLE-compressed form, whereas the DECOMPRESS operation goes in the opposite direction. 
       FIG. 3  is an example of a logical query plan for a query of the form: SELECT R.r FROM R INNER JOIN T ON (R.r=T.t). R is a relation, e.g., a table, with one column “R.r”, where “r” is a column value. Similarly, T is a relation with a column “T.t”, where “t” is a column value. The GET (R) operator  302  and the GET (T) operator  304  read values (R.r)  306  and (T.t)  308 , respectively. The join operator  310  has a condition “R.r,=T.t”  312 , that determines whether the values “r” and “t” are equal, and provides the answer to a client  320 . 
       FIG. 4  illustrates a query plan for the same query applied to a compressed database. The RLE-compressed form of relation R may be designated R C  and has two columns (R C .r, R C .f), where the second column corresponds to the frequency of occurrence “f” of a particular “r” value. Similarly, the RLE-compressed form of relation T may be designated T C  with columns (T C .t, T C .f) where the second column indicates the frequency of occurrence of the value “t”. In  FIG. 4 , the operator GET(R C )  402  obtains the values (R.r, R.f)  404  and a DECOMPRESS operator  406  decompress the values to obtain the values “r”  408 . Similarly, the operator GET(T C )  410  obtains the values (T.t, T.f)  412 , and a DECOMPRESS operator  414  decompress the values to obtain the values “t”  416 . A JOIN operator  418  having the condition “R.r,=T.t”  420  determines whether the value of “r” and the value of “t” provided by operators  406  and  414 , respectively, are equal, and provides the answer to a client  430 . 
     The logical query plan of  FIG. 4  compares each decompressed value “r” of R with a given decompressed value “t” of T in the JOIN operation  418 , and then repeats this process for the next decompressed value “t”. Where the value “r” has a frequency of occurrence of “f r ” and the value “t” has a frequency of occurrence of “f t ”, the query is run f r  times using the same value “r” for each of the f t  occurrences of the same value “t”. Thus, the number of times that the query must be run on the same data is f r  multiplied by f t . If, for example, f r =4 and f t =3, the query must be executed on the same data values 4*3=12 times, which is costly, time-consuming and inefficient. As will be described, the invention identifies certain patterns in query plans that can be transformed to an optimized plan so that it operates directly on compressed data and provides the correct answer, thus avoiding multiple repeats of a query on data that is the same. 
     A transformation takes an input query plan and produces a logically equivalent query plan. Every transformation has a precondition that must be satisfied for the transformation to be applicable. The precondition is typically expressed as a pattern tree. If there&#39;s a binding (matching) of the input plan to the pattern tree, then the transformation is applicable.  FIGS. 5A and 5B  illustrate, respectively, a pattern tree and a simple transformation for JOIN commutativity. The transformation shown in  FIG. 5B  of an input query plan binding to the pattern tree of  FIG. 5A  merely exchanges the left and right children  502  and  504  of the JOIN operator  506  as shown at  508  and  510  for the JOIN operator  512 . As shown in the figures, both the input plan and the transformation produce the same result  514 , which is a requirement for an acceptable transformation. 
     The invention affords patterns and transformations that enable input query plans, or portions thereof, that bind to certain patterns and which operate on uncompressed data to be transformed so that their transformations operate directly on compressed data to produce the correct answers. While pattern binding and transformations are generally known, they have not previously been applied to compressed data. Known query optimization techniques that are applicable to queries for uncompressed data are very difficult to apply to optimize queries that can be used for compressed data and produce correct answers. The invention identifies those query plans that can be transformed to operate correctly on compressed data by matching the structures and semantics of queries to certain predetermined patterns. The invention then transforms the query plans (and queries) accordingly. Transformations in accordance with the invention take as an input a query plan such as illustrated in  FIG. 4  which decompresses relations early in the query so that the query operates on uncompressed data, and transforms the input query plan to one that decompresses higher up (later), or avoids decompression altogether, so that the transformed query plan operates on compressed data. This enables database operations to work on smaller chunks of compressed data, resulting in better performance. This process is illustrated in  FIGS. 6 and 7 . 
       FIG. 6  illustrates a pattern for an input plan that is similar to the logical query plan of  FIG. 4 . As shown, the pattern has DECOMPRESS operators  602  and  604  early in the query that decompress compressed data prior to a JOIN operator  610 . This means that the JOIN operates on decompressed data and that the query must be run multiple times on data values that are the same, as previously explained. 
       FIG. 7  illustrates a transformation of the query plan pattern of  FIG. 6  in accordance with an embodiment of the invention, where the DECOMPRESS operator  700  has been moved above the JOIN operator  710  so that DECOMPRESS operates on the results of the JOIN operation. In addition, as indicated at  720 , the second output column of the JOIN operator multiplies the frequencies ($3*$5) from its left and right children  722 ,  724 , respectively. Notably, the transformed plan of  FIG. 7  produces the same answer  730  as the answer  612  produced by the input query plan of  FIG. 6 , demonstrating that the transformation produces a logically equivalent query that minimizes processing and overall response time to obtain correct answers. 
       FIG. 8  illustrates another transformation of the logical query plan of  FIG. 4  that is substantially similar to the transformation illustrated in  FIG. 7 , except that the transformation of  FIG. 8  eliminates the DECOMPRESS operation altogether from the plan. As shown in  FIG. 8 , the output of the JOIN operation  810  is supplied directly to the client  812 , and the DECOMPRESS operation  820  is moved from the query to the client. This advantageously further reduces the processing that the master node of the database must perform, which improves the database response time to queries. In a large distributed database, moving decompression to a client can result in a substantial improvement in query response time. 
       FIGS. 9A and 9B  illustrate, respectively, another input query plan pattern for use with compressed data, and a corresponding transformation of the input plan in accordance with an embodiment of the invention where the transformed plan uses a different query operation to work directly on compressed relations. The pattern of  FIG. 9A  applies to an input query on compressed data R C  of the form: SELECT COUNT(*) FROM R C  GROUP BY R C .r. The pattern has a DECOMPRESS operator  900  that decompresses compressed data  910  before it is operated on by a GROUPBY operator  920  which groups the results of a COUNT operation to provide an answer  940  to the query. The transformation of  FIG. 9B  changes both the form of the input query as well as its query operators. The query is transformed to: SELECT SUM(R C .f) FROM R C  GROUP BY R C .r. As shown, the COUNT operator  930  is replaced with a SUM operator  942 . In the transformed plan, the GROUPBY operator  946  produces an answer  948  that is the same as the answer  940  produced by a query operating on decompressed data. This enables eliminating altogether the DECOMPRESS operator  900  from the transformed plan so that it operates on compressed data. This transformation is made possible by the invention because of the discovery that a COUNT operation on uncompressed data in the pattern of  FIG. 9A  is equivalent to a SUM operation on compressed data in the transformed plan of  FIG. 9B . 
     The foregoing pattern binding and transformation process of the invention may be applied repeatedly to different portions of a more complex query plan to optimize those portions for compressed data and to produce a new overall query plan that is less costly computationally and that has an improved response time. 
     While the foregoing description has been with reference to particular embodiments of the invention, it will be appreciated by those skilled in the art that modifications to these embodiments may be made without departing from the principles and spirit the invention, the scope of which is defined by the appended claims.

Technology Category: g