Database management method and apparatus based on lookup table

A database management apparatus based on a lookup table, comprising a memory, a processor and a computer program stored in the memory and runnable on the processor, wherein when executed by the processor, the computer program implements a database management method based on a lookup table, the method comprising:

• acquiring a data management operation request;
• retrieving a three-level storage table in response to the data management operation request;
• and
• adjusting the three-level storage table according to an operation requested by the data management operation request, so as to obtain the adjusted three-level storage table, wherein the three-level storage table comprises:
• a page information table of data for recording information of a page of data by means of a row of data and associating the row of data of the page information table with a plurality of columns in a column information table of data;
• the column information table of data for recording information of an array in a data table by means of a row of data and associating the row of data of the column information table with a plurality of arrays in the data table;
• and the data table being used as a storage table for multiple rows of data, for recording information of a piece of data by means of a row of data, the multiple rows of data forming one array;
• wherein the page of data in the page information table records a column group composed of a plurality of columns, each of the columns is one array, and each row of the page information table records:
• the start address for storage of the first column of array and the end address for storage of the last column of array in the associated column information table, the number of columns, and a status bit indicating validity of the row of data;
• and
• wherein each row of the column information table stores:
• the number of data in an array of an associated data table, address for storage of the first piece of data in the array, address for storage of the last piece of data in the array, and a status bit indicating validity of the address of the array.

A nonvolatile computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, a database management method based on a lookup table is implemented which comprises the following steps:

• acquiring a data management operation request;
• retrieving a three-level storage table in response to the data management operation request;
• and
• adjusting the three-level storage table according to an operation requested by the data management operation request, so as to obtain the adjusted three-level storage table,
• wherein the three-level storage table comprises:
• a page information table of data for recording information of a page of data by means of a row of data and associating the row of data of the page information table with a plurality of columns in a column information table of data;
• the column information table of data for recording information of an array in a data table by means of a row of data and associating the row of data of the column information table with a plurality of arrays in the data table;
• and the data table being used as a storage table for multiple rows of data, for recording information of a piece of data by means of a row of data, the multiple rows of data forming one array;
• wherein the page of data in the page information table records a column group composed of a plurality of columns, each of the columns is one array, and each row of the page information table records:
• the start address for storage of the first column of array and the end address for storage of the last column of array in the associated column information table, the number of columns, and a status bit indicating validity of the row of data;
• and
• wherein each row of the column information table stores:
• the number of data in an array of an associated data table, address for storage of the first piece of data in the array, address for storage of the last piece of data in the array, and a status bit indicating validity of the address of the array.