Method and device for realizing column storage based relational database

Abstract

The invention relates to a method and a device for realizing a column storage based relational database. The method comprises: establishing data files, and serially numbering the data blocks which form the data files; defining a table segment; inserting records into the table segment; generating the only record identification number in the table segment for the record inserted in the table segment, and separating the records by columns; for each column in the records, executing the following operation: storing column values and the record identification numbers as value data in the data blocks and sorting according to the size of the column values; storing the record identification numbers and the serial numbers of the data blocks for storing the value data which are taken as connecting data in new data blocks, and sorting according to the size of the record identification numbers; and establishing indexes for the data blocks for storing the value data and the data blocks for storing the connecting data, and generating index data blocks. The embodiment of the invention improves the query performance of the database.

Description

technical field [0001] The present invention relates to the storage technology of relational databases, specifically a method and device for realizing a relational database based on column storage. Background technique [0002] A relational database is a software system for storing and processing structured data. It contains two kinds of data: one is logical data, which is composed of tables, records, etc.; the other is physical data, which represents how the database stores logical data. Different relational database systems may have the same logical data, but they usually have different physical data. There are two ways to realize the physical data of the database: one is based on row storage, and the other is based on column storage. For the implementation method based on row storage, it stores the entire record of the logical data table in the data block of the file. In order to improve the query speed, indexes such as B+ trees are established for certain columns; for ...

AI Technical Summary

Problems solved by technology

[0004] In the process of realizing the present invention, the inventors found that there are at least the following problems in the prior art: the indexes provided by the relational database based on row storage are generally dense indexes, such as B+ tree indexes, that is, the column values ​​of each record must be Being added to the index has two disadvantages: one is to increase the storage space used by the database system, and the other is to increase the performance of data update

It is precisely because of these two problems that in a row-based relational database, it is difficult to index all the columns in the data table, so the following problems arise. If a query statement is based on an unindexed Column query, the system has to do a full table scan, resulting in deterioration of database performance

[0005] The relational database based on column storage in the prior art also has defects. The first is that it does not have the concept of storing records in segments, which leads to sorting between all inserted column values. The more values, the more inserted The slower it is, the second is that the existing technology requires to record the sorting position of the column value data for the connection data, and requires that as long as the sorting position of the column value data changes, the connection data must be updated, which will cause a large number of data to appear when the data is inserted. data update, which affects performance

Images