International Business Machines Corporation

Zhen Yu Shi

Shu Wang

Min Fang

Nigel G Slinger

Li Fei Zheng

Wen Jie Zhu

Di Jin

Mei Zhen Cao

Embodiments of the present invention disclose a method, computer program product, and system for inserting one or more records into a database table. An insert request for inserting a new record to a database table is received, wherein the new record includes at least one key field. a partial identity of at least one record matching the at least one key field of the new record is searched for. A partial identity is assigned to the new record based on a result of the searching.

Record insertion by generating unique index bases

Data records may be managed in a relational database by monitoring, a record length for a first data record in a page of memory, an amount of free space in the page, and a page length. In response to receiving an operator command to replace the first data record with a second data record, a database management system may determine whether an estimated record length of a compressed second data record is outside of the amount of free space in the page. In response to determining the estimated record length of a compressed second data record is outside of the amount of free space in the page, the database management system may determine whether an estimated length of a compressed page is outside of the page length. In response to determining the estimated length of a compressed page is within the page length, the page may be compressed.

Managing data records

An approach for index B-tree page creation associated with linear sequential insertions in database management systems (DBMS). A linear pre-splitter receives a current index leaf page for linear sequential insertion. The linear pre-splitter asynchronously creates index leaf pages where the current index leaf page is in a predetermined position at least one page away from a last index leaf page. The linear pre-splitter updates index leaf page position identifiers associated with the index leaf pages where the index leaf page position identifiers link the index leaf pages and the last index leaf page and the linear pre-splitter inserts index leaf page identifiers and index key metadata associated with each of the index leaf pages into index non-leaf pages.

Index B-tree maintenance for linear sequential insertion

As disclosed herein a method, executed by a computer, includes storing, by one or more processors, entries associated with an index to a first buffer of at least two buffers allocated to the index, and moving, by a batch operation, by one or more processors, entries in the first buffer into an index page for the index in response to an entry movement condition being met. The method further includes storing, by one or more processors, new entries associated with the index to another buffer of the at least two buffers while moving the entries in the first buffer. A computer program product corresponding to the above method is also disclosed herein. A computer program product and computer system corresponding to the above method are also disclosed herein.

Index management

A computer-implemented method for recovering data and concurrently rebuilding indexes for the recovered data in a database for a system configured to store fewer than all indexes in backup files may include copying data from one or more database files and storing the copied data to one or more backup files. A recovery manager executing on a processor may read the copied data from the one or more backup files and write the copied data to the one or more database files, wherein the data is recovered to the one or more database files. In response to the reading, an index manager executing on the processor may initiate a rebuilding of one or more indexes for the copied data at substantially the same time as the reading of the copied data.

Growing community of inventors

Beijing, China

Zhen Yu Shi