Patent Application
20150234898
This application is based on and claims priority from Korean Patent Application No. 10-2014-0019730, filed on 20 Feb., 2014, the disclosure of which is incorporated herein in its entirety by reference.
The present invention relates to a table partitioning for use in a relational database system, and more particular, to an apparatus and method for processing a query in a relational database system having a hybrid storage of a memory tablespace and a disk tablespace in which a table partitioning technology is extended in order to use the disk tablespace and memory tablespace in a hybrid manner, which is capable of implementing data discrimination due to different data storages in one logical table, creating scan plans in compliance with the difference in the storages to establish an optimal scan plan to the query intended to access the storages having different properties, and enabling an efficient use of a limited storage capacity while gaining a faster response to the query by providing a time-based partitioned table functionality of storing latest data in the memory tablespace and transferring in sequence old data that has passed a certain period of time into the disk tablespace.
In recent, relational database systems are widely utilized for storing data in many fields. In a relational database system, same types of data is logically collected and stored in a logical table. Each one of data items constituting the table is referred to as a row and the one row is composed of a plurality of columns.
By the way, as the amount of the table increases that is a collection of data with same logical attributes, there has been proposed a technology that divides a table into several segments with horizontal partitions (or row bundles) and stores them in order for a convenient management. Each one of the table segments that are physically horizontally divided is referred to as a partitioned table. The use of this table partitioning technology with partitioned tables enables a user to designate a physical location of each partitioned table to be placed, thereby giving the distribution of simultaneous accesses to the relevant table.
Meanwhile, in order to cope with the request for a rapid response speed, the relational database system has recently adopted a main memory database to store data in memories rather than disks. When the relational database system uses a memory as the main memory for data storage, performance improvement of 3-10 times can be expected, as compared to a typical disk-based database, in terms of insert, delete, and inquiry operations to the table. However, the database system capable of storing data in memory only is not suitable for storing the large amounts of data owing to the limitation of storage capacity.
The following is a brief description as to structures and properties between a disk-based relational database and a memory-based relational database.
First, to explain the structure and property of the disk-based relational database, the disk-based relational database stores table data in a disk in the form of blocks, reads a data block into an area of a buffer cache of the main memory in response to a query from a user, and performs a data processing on the data block on the main memory.
During the data processing, upon receiving a DML (Data Manipulation Language) request to change data, the data block in the buffer cache is changed on the memory and the change is stored in the disk in advance in the form of a redo log, so that the change that has not yet been reflected in the disk can be recovered without any loss when the server goes down. Furthermore, the undo log for the change is stored in an undo block in order for the overall data in an old version to be viewed.
In addition, the contents that are stored on the disk are updated with latest data in a manner of reflecting dirty data blocks that are changed in the buffer cache to the disk periodically.
However, although the disk-based relational database puts frequently used disk data blocks on the buffer cache of the main memory to improve performance, it may be subject to significant influence by IO performance of the disk because all of the data blocks, redo logs, and undo logs have to be stored in the disk. Moreover, the disk-based relational database suffers from query execution delays in reading the data blocks due to the buffer cache whose size is relatively smaller than the disk.
Next, to explain the structure and property of the memory-based relational database, unlike the disk-based relational database, the memory-based relational database basically stores table data in a memory only and stores data with only a type of back-up image at specific point in the past and log data that has changed since then in a disk for recovery of the database provided for the server down.
Thus, when accessing the data in response to the query from the user, the data can be directly read-out from the memory table. Therefore, the memory-based relational database do not experience the disk I/O delay that reads the data block into the buffer cache that would otherwise occur in the disk-based database.
In other words, it is no longer necessary for the memory-based relational database to maintain the data in the form of blocks to optimize the reading and writing disks. Further, the memory-based database eliminates the need for keeping a undo log because it ensures a bulk reading in a way of creating the past version of the data in the memory in the row unit to be connected. In addition, since there is no lock overhead that was necessary to manage the structure of the block unit, the memory-based relational database enables an optimized processing of the query from the user.
Even for the DML to cause the change in the data, the memory-based relational database stores only the redo log data that contains the change. Thus, the memory-based database has many advantages in terms of saving of the disk capacity.
However, as set forth above, the memory-based relational database cannot be used as mass data storage for its memory size limitation.
Therefore, there has been a need for providing an optimization method for query statements and logical tables that is capable of realizing a high response speed while solving the problems of capacity limitation in the memory-based relational database by means of the extension of the horizontal partitioning method of a table in the database having a hybrid storage of disk and memory.
In view of the above, the present invention provides an apparatus and method for processing a query in a relational database system having a hybrid storage of a memory tablespace and a disk tablespace in which a table partitioning technology is extended in order to use the disk tablespace and memory tablespace in a hybrid manner, which is capable of implementing data discrimination due to different data storages in one logical table, creating scan plans in compliance with the difference in the storages to establish an optimal scan plan to the query intended to access the storages having different properties, and enabling an efficient use of a limited storage capacity while gaining a faster response to the query by providing a time-based partitioned table functionality of storing latest data in the memory tablespace and transferring in sequence old data that has passed a certain period of time into the disk tablespace.
In accordance with an aspect of the present invention, there is provided an apparatus for processing a query in a database system, the apparatus including: a tablespace metadata that stores information as to whether tables are stored in which tablespace, wherein the tables are stored in the database system including a disk tablespace and a memory tablespace; a query compiling unit, upon receiving a query statement, configured to check whether a table needed for processing the query statement is stored in the disk tablespace or the memory tablespace by referencing the information about the tablespace and to create a scan plan of the table; a query execution unit configured to read out the data of the table by accessing the disk tablespace or the memory tablespace in accordance with the scan plan that is created by the query compiling unit and to perform a processing of the query statement using the read-out data.
Further, the query execution unit may be configured to read out rows in the table in the form of a data block when it is checked that the table is stored in the disk tablespace; and read out rows in the table through memory pages when it is checked that the table is stored in the memory tablespace.
Further, the query execution unit may be configured to fit the storage structure of the rows that are read-out from the disk tablespace and the memory tablespace into the same format of the rows during performing the scan plan of the table.
Further, the query compiling unit may be configured to when the table is a non-partitioned table, check whether the table is stored in the disk tablespace or the memory tablespace; create a scan plan for a disk table full scan when it is checked that the table is stored in the disk tablespace; and create a scan plan for a memory table full scanning when it is checked that the table is stored in the memory tablespace.
Further, the query compiling unit may be configured to when creating the scan plan for disk table full scanning, check whether there is an index of the table; create a scan plan for a disk index scan when it is checked that there is an index of the table; and select either one of the disk table full scan plan and the disk index scan plan through the comparison of costs between them.
Further, the query compiling unit may be configured to when creating the scan plan for the memory table full scan, check whether there is an index of the table; create a scan plan for a memory index scan when it is checked that there is an index of the table; and select either one of the memory table full scan plan and the memory index scan plan through the comparison of costs between them.
Further, the query compiling unit may be configured to when the table is a partitioned table, check whether the partitioned tables are stored in a hybrid storage of the disk tablespace and the memory tablespace or the partitioned tables are stored either one of the disk tablespace and the memory tablespace; and create a scan plan for a hybrid full table scanning when it is checked that the partitioned table is stored in the hybrid storage.
Further, the query compiling unit may be configured to when creating the scan plan for a hybrid full table scan, check whether there is an index of the table; create a scan plan for a hybrid index scan when it is checked that there is an index of the table; and select either one of the hybrid full table scan plan and the hybrid index scan plan through the comparison of costs between them.
Further, the query compiling unit may be configured to create the scan plan that minimizes a cost required to process the query statement through the calculation of the cost necessary to read-out the table depending on the storage in which the table is stored.
Further, the table may be divided into a plurality of partitions and stored in either one of the disk tablespace and the memory tablespace; or the partitioned tables may be stored in a hybrid storage of the disk tablespace or the memory tablespace depending on the importance of a partition key value in the partitioned table.
Further, each of the partitioned tables may be transferred in sequence from the memory tablespace to the disk tablespace with the lapse of time pursuant according to the partition key value having time information in the partitioned table.
In accordance with another aspect of the present invention, there is provided method for processing a query in a database system including a hybrid storage of memory and disk tablespaces, the method including: receiving a query statement in the database system; upon receiving the query statement, checking whether a table needed for processing the query statement is stored in which storage by referencing information about the storage in which the table is stored; creating a scan plan of the table in compliance with the storage in which the table is stored; reading out data of the table by scanning the disk tablespace or the memory tablespace in accordance with the scan plan of the table; and performing a processing of the query statement using the read-out data.
Further, the reading out data of the table may include: reading out rows in the table in the form of a data block when it is checked that the table is stored in the disk tablespace; and reading out rows in the table through memory pages when it is checked that the table is stored in the memory tablespace.
Further, the creating a scan plan of the table may include: when the table is a non-partitioned table, checking whether the table is stored in the disk tablespace or the memory tablespace; creating a scan plan for a disk table full scan when it is checked that the table is stored in the disk tablespace; and creating a scan plan for a memory table full scanning when it is checked that the table is stored in the memory tablespace.
Further, the creating a scan plan for a disk table full scan may include: checking whether there is an index of the table; creating a scan plan for a disk index scan when it is checked that there is an index of the table; and selecting either one of the disk table full scan plan and the disk index scan plan through the comparison of costs between them.
Further, the creating a scan plan for a memory table full scan may include: checking whether there is an index of the table; create a scan plan for a memory index scan when it is checked that there is an index of the table; and selecting either one of the memory table full scan plan and the memory index scan plan through the comparison of costs between them.
Further, the creating a scan plan of the table may include: when the table is a partitioned table, checking whether the partitioned table is stored in a hybrid storage of the disk tablespace and the memory tablespace or the partitioned tables are stored either one of the disk tablespace and the memory tablespace; and creating a scan plan for a hybrid full scan when it is checked that the partitioned tables are stored in the hybrid storage.
Further, the creating a scan plan for a hybrid full scan may include: checking whether there is an index of the table; creating a scan plan for a hybrid index scan when it is checked that there is an index of the table; and selecting either one of the hybrid full table scan plan and the hybrid index scan plan through the comparison of costs between them.
Further, the table may be divided into a plurality of partitions and stored in either one of the disk tablespace and the memory tablespace; or the partitioned tables may be stored in a hybrid storage of the disk tablespace or the memory tablespace depending on the importance of a partition key value in the partitioned table.
Further, each of the partitioned tables may be transferred in sequence from the memory tablespace to the disk tablespace with the lapse of time pursuant to the partition key value having time information in the partitioned table.
With the configuration of exemplary embodiments of the present invention, by extending a table partitioning technology in order for the relational database system to use the disk tablespace and memory tablespace in a hybrid manner, it is possible to implement data discrimination due to different data storages in one logical table and create scan plans in compliance with the difference in the storages, thereby establishing an optimal scan plan to the query intended to access the storages having different properties.
It is also possible to overcome the limitation of storage capacity while gaining a faster response to the query with the help of providing a time-based partitioned table functionality of storing latest data in the memory tablespace and transferring in sequence old data that has passed a certain period of time into the disk tablespace.
The above and other objects and features of the present invention will become apparent from the following description of the embodiments given in conjunction with the accompanying drawings, in which:
Hereinafter, the embodiments of the present invention will be described in detail with reference to the accompanying drawings. In the following description, well-known functions or constitutions will not be described in detail if they would obscure the subject matter of the present invention in unnecessary detail. Further, the terminologies to be described below are defined in consideration of functions in the present invention and may vary depending on intentions or practices of a user or an operator. Accordingly, the definition may be made on a basis of the content throughout the specification.
First of all, the following description will be made on a process of creating a table in a relational database that supports both a disk and memory tablespaces.
The following DDL statement is an example of a statement of creating disk-based tablespace.
CREATE TABLESPACE DISK_TBS datafile ‘/home/data/TBS.dtf’ size 1G;
In the above DDL statement, a tablespace named DATA_TBS is generated as a storage space to store a file of ‘/home/data/TBS.dtf’ on a real physical disk. If a new table based on the tablespace of DATA_TBS is created additionally and the table requires an additional storage space, a contiguous physical area of a fixed-size unit is assigned to the table from the data file. When data insertion, deletion, or change is made by a data change DML from a user, the change is stored in the disk and a data block for the change is read out from a relevant file upon receipt of a data accessing request by way of a query statement.
For instance, a disk-based table utilizing a disk tablespace can be created through the table creation statement as illustrated in the following EXAMPLE 1.
Next, the following is an instance of a DDL statement to create a tablespace based on a memory:
CREATE MEMORY TABLESPACE MEMORY_TBS size 10G;
In the above DDL statement, a tablespace named as MEMORY_TBS is allocated with a memory size of 10G to initialize.
The memory tablespace utilized by the memory table is allocated with an additional storage space in the memory tables whenever the memory tables require the storage space. The memory table destined to utilize the memory tablespace may be a table having a similar behavior to the memory table that has been discussed with reference to the structure and property of the memory-based relational database. To put it another way, the memory-based relational database ensures an immediate memory access in accessing the table by the query statement and stores a redo log only in the disk even for the data change DML without storing the data in the disk.
As listed in the following EXAMPLE 2, for example, the tablespace is specified as a memory tablespace, thereby creating the memory table in a manner of the same as the table statement based on the disk.
In addition, whether the database is originated from either a disk-based database or a memory-based database does not be contained in table meta information within the database and is discriminated from the attribute of the tablespace in which the table is stored.
Hereinafter, the operation of the respective components of the query processing apparatus will be described with reference to
First, the tablespace metadata unit 102 includes attribute information of the disk tablespace 108 or the memory tablespace 110, which stores tables, in a relational database system including both the disk tablespace 108 and the memory tablespace 110. Thus, the query compiling unit 104 may check in which storage data is stored by making a reference to the tablespace metadata unit 102.
The query compiling unit 104 builds up a table scan plan necessary for processing a query statement when receiving the query statement. When building the scan plan to access the table, the query compiling unit 104 refers to the tablespace metadata unit 102 to check the meta information indicating a tablespace in which the relevant table is stored and determines in which the disk tablespace 108 or the memory tablespace 110 the relevant table is stored. Further, the query compiling unit 104 creates a scan plan which minimizes the cost required to process the query statement through the calculation of the cost to read the relevant table depending on the storage in which the relevant table is stored, thereby achieving a table scan plan capable of optimally performing the query statement.
The query execution unit 106 recognizes the storage in which the relevant table is stored with the help of physical table information contained in the table scan plan created by the query compiling unit 104, and then reads out the data of the relevant table through the use of a function accessible to either the disk tablespace 108 or the memory tablespace 110 in which the relevant table is stored. Specifically, if it is recognized that the relevant table is stored in the disk tablespace 108, the relevant table is read out in the form of a data block. On the contrary, if it is recognized that the relevant table is stored in the memory tablespace 110, rows are obtained through memory pages. Since the rows may differ in their storage structures, they may be fitted into the same structure during the table scan. After performing the table scan, the query execution unit 106 performs a process of the statement, such as join, sort, etc., in a unit of row, based on the structure of the query statement from the user, where the processing may be carried out under assumption of the same structures for the respective rows.
Hereinafter, the operation of the query processing apparatus will be described by means of various queries.
First, the following EXAMPLE 3 represents a query to obtain the number of orders cancelled by a customer whose ID is 1234 and the total amount of orders using with a table ORDER on the disk and a table CUSTOMER on the memory that are created from the foregoing EXAMPLEs.
Referring to
Further, an access plan to the table ORDERS on the single disk is produced as a plan to get an access to the index and table that are stored in the disk tablespace 108 (Block S202) and a Rowid scan is performed on the table on the disk (Block S204). Thereafter, a search is made for the tables containing a customer id with the notation of order state information of ‘cancel’ through a filtering process (Block S206).
Next, two both tables are joined (Block S208), an aggregation is performed on the joined tables (Block S210). A transformation into a row type in the disk block will be performed after performing the memory access plan. Therefore, such a transformation is made without distinguishing the type of lows that are prepared in left or right when performing the nested loop join plan.
Next, the EXAMPLE 4 below is a DDL statement used to create a typical partitioned table.
Referring to the above EXAMPLE 4 and the structure of the table shown in
On the other hand, generally, the partitioned tables that are created can be specified to be stored in different tablespaces. Thus, it is possible for a database that supports simultaneously the disk and memory tablespaces as described above to store the data of a non-partitioned table in separate storages with different physical attributes by specifying different tablespaces.
The EXAMPLE 5 below presents an instance of creating partitioned tables of a table CUSTOMER using the hybrid storage.
The EXAMPLE 6 below presents a query to yield purchase information for a particular customer for one month of November.
In
a scan plan for the table CUSTOMER on the memory creates a plan to access an index and table that are stored in the memory tablespace 110 (Block 500) and performs a Hybrid Rowid scan on the table in the memory (Block S502).
Further, a scan plan for the table CUSTOMER on the disk creates a plan to an access index and table that are stored in the disk tablespace 108 (Block 504) and performs a Rowid scan on the table on the disk (Block S506).
Thereafter, a search is made for the tables containing the user id with the notation of the order date of November through a filtering process (Block S508). Next, two tables are joined (Block S510) and an aggregation is performed on the joined tables (Block S512).
That is, when getting a Rowid as an index after acquiring a value of a unique ID from the user to be inquired, it is possible to determine through the Rowid whether the data for the user is stored in the disk table or in the memory table. In the case where a customer has a ranking of ‘VIP’ and thus it is allowed to access the memory table, a direct access to the memory table can be achieved without reading a disk block in contrast with other customers having rank other than the ‘VIP’, which results in obtaining more high response.
In this regard, since an access way to the table may vary depending on the rowid at an execution time by the query execution unit 106 in the query processing apparatus, the query processing apparatus needs to create a plan for making the selection of the access way through the determination at the execution point by the query processing unit 106. The plan to do such selection is represented as ‘Hybrid Rowid Scan’ node in
Hybrid Full Table scan
Hybrid Rowid scan
Hybrid Local Index scan
First, as shown in
Therefore, the query processing apparatus 100 of the relational database system including the hybrid storage of memories and disks establishes an optimization table scan plan for the query statement by means of the extension of the table partitioning method that enables the use of the hybrid storage of the memory tablespace 110 and the disk tablespace 108.
More specifically, when the query statement is entered from the user, the query processing unit 100 checks whether the table needed for processing the query statement is a non-partitioned table or a partitioned table (Block S600).
If the table needed for processing the query statement is the non-partitioned table, then the query processing device 100 identifies the tablespace meta information stored in the tablespace metadata unit 102 and checks whether the storage having the table stored therein is the disk tablespace 108 or the memory tablespace 110 (Block S602).
Then, if the storage having the table stored therein is determined as the memory tablespace 110 from the check result at Block S604, then the method goes to Block S606 where the query processing apparatus 100 creates a scan plan for a memory table full scan.
After creating the memory table full scan plan as described above, the query processing apparatus 100 checks whether or not there is an index (Block S608).
If there is no index, then the query processing apparatus 100 processes the query statement with the memory table full scan plan. However, if there is an index, then the query processing apparatus 100 also creates a scan plan for a memory index scan. Thereafter, the query processing apparatus 100 processes the query statement with either one of the memory table full scan plan and the memory index scan plan, which is selected by a comparison of costs between them (Block S610).
However, if the storage having the table stored therein is determined as the disk tablespace 108 from the check result results at Block S604, the method advances to Block S612 where the query processing apparatus 100 creates a scan plan for a disk table full scan.
After creating the disk table full scan plan as described above, the query processing apparatus 100 checks whether or not there is an index (Block S614).
If there is no index, then the query processing apparatus 100 processes the query statement with the disk table full scan plan. However, if there is an index, the query processing apparatus 100 also creates a scan plan for a disk index scan. Thereafter, the query processing apparatus 100 processes the query statement with either one of the disk table full scan plan and the disk index scan plan, which is selected by a comparison of costs between them (Block S616).
Meanwhile, if the table needed for processing the query statement is a partitioned table, then the method goes to Block S620 as shown in
Subsequently, the query processing apparatus 100 counts the number of the partitioned tables that are left after being subject to the pruning and then checks whether the number of the partitioned tables becomes ‘one’ (Block S622).
If it is checked that the number of the partitioned tables becomes ‘one’, then the method returns to Block S602 through a tab ‘B’ to repeatedly perform the processing of the query statement as described in Blocks S206 to S616.
If, however, one or more partitioned tables are left after the pruning, the query processing apparatus 100 creates a partitioned table circulation plan with respect to the left partitioned tables (Block S624) and checks whether the left partitioned tables are stored in the hybrid storage of both the disk tablespace 108 and the memory tablespace 110 (Block S626).
If it is checked that the partitioned tables left more than one are stored in only one of the disk tablespace 108 and the memory tablespace 110, then the method returns to Block S602 through a tab ‘B’ to repeatedly perform the processing of the query statement as described in Blocks S206 to S616.
However, if it is checked that the partitioned tables left more than one are stored in the hybrid storage of both the disk tablespace 108 and the memory tablespace 110, then the query processing apparatus 100 creates a hybrid full table scan plan (Block S628).
After creating the hybrid full scan plan, the query processing apparatus 100 checks whether there is an index (Block S630).
If there is no index, then the query processing apparatus 100 processes the query statement with the hybrid full table scan plan, whereas if there is an index, then the query processing apparatus 100 also creates a scan plan for a hybrid local table scan. Thereafter, the query processing apparatus 100 processes the query statement with either one of the hybrid full table scan plan and the hybrid local index scan plan, which is selected by the cost comparison between them (Block S632).
The task performed in ‘applying the pruning to the partitioned table’ as used in Block S620 of
Moreover, the embodiment of the present invention provides a functionality of automatically transferring the partitioned table having data therein from the memory tablespace to the disk tablespace in sequence with the course of time by help of the technology of creating the partitioned tables.
The following EXAMPLE 7 depicts a DDL statement transferring in sequence the partitioned table from the memory tablespace to the disk tablespace in the relational database system including a hybrid storage of memories and disks.
As illustrated in the above EXAMPLE 7, when data is newly added in the partitioned table, the insertion process is made through the procedure of selecting a PARTITION by comparing a value of (SYSDATE-order_dt) and a reference interval value of each PARTITION.
Further, the data storages may vary with the course of time; therefore, the data in the respective partitioned tables is transferred at a period of ‘10 minutes’ intervals that is specified in the aforementioned DDL statement. Such a periodic transferring job may be registered during the process of the DDL statement for table creation in a job management system in the relational database system to continue the transferring job of the partitioned tables.
The table partitioning technology enables the discrimination of the storages to store data with the lapse of time. Accordingly, it is possible to provide a more high response to the user query as for latest data and to enable an efficient use of limited memory tablespace by an automatic transferring of old data that is considered to be less important to other tablespaces.
As set forth above, the embodiment of the present invention extends a table partitioning technology in order for the relational database system to use the disk tablespace and memory tablespace in a hybrid manner, thereby implementing data discrimination due to different data storages in one logical table, and create scan plans in compliance with the difference in the storages, thereby establishing an optimal scan plan to the query intended to access the storages having different properties. Further, the embodiment of the present invention provides a time-based partitioned table functionality of storing latest data in the memory tablespace and transferring in sequence old data that has passed a certain period of time into the disk tablespace, thereby overcoming the limitation of storage capacity while gaining a faster response to the query.
While the description of the present invention has been made to the exemplary embodiments, various changes and modifications may be made without departing from the scope of the present invention. The embodiment of the present invention is not limited thereto. Therefore, the scope of the present invention should be defined by the appended claims rather than by the foregoing embodiments.
| Number | Date | Country | Kind |
|---|---|---|---|
| 10-2014-0019730 | Feb 2014 | KR | national |
