Index building in response to data input

Abstract

In a method for managing a data index, one or more processors inserting one or more rows of data sequentially into a data table of a database. The method further includes inserting index entries that correspond to the inserted one or more rows of data sequentially into an index of the data table, wherein an index B-tree structure is not built initially during insertion. The method further includes determining whether one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met. The method further includes responsive to determining that one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met, building an index-B-tree structure that includes the index entries inserted into the index.

1 . A method for managing a data index, the method comprising:
 prior to building an index B-tree structure:
 receiving, by one or more processors, a structured query language (SQL) data insert operation to insert one or more rows of data into the table of the database, wherein the one or more rows of data include at least in part: sequential data, columns of data, and one or more sets of rows from a queue of rows, and wherein the one or more rows of data are input via a user interface; 
 inserting, by one or more processors, one or more rows of data sequentially into a data table of a database; 
 determining, by one or more processors, whether the received SQL data insert operation is complete; 
 responsive to determining that the received SQL data insert operation is complete, inserting, by one or more processors, index entries that correspond to the inserted one or more rows of data sequentially into an index of the data table; 
 inserting, by one or more processors, the index entries that correspond to the inserted one or more rows of data sequentially into index leaf pages in the index of the data table wherein the index leaf pages are formatted as sequential index leaf pages; 
 inserting, by one or more processors, index entries that correspond to the inserted one or more rows of data sequentially into the index of the data table, wherein an index B-tree structure is not built initially during insertion; 
 determining, by one or more processors, whether a size threshold of index entries inserted into the index is not met, wherein the size threshold is a maximum number of index entries inserted into the index of the data table; 
 responsive to determining the size threshold of index entries inserted into the index is not met, determining, by one or more processors, whether a time threshold for inserting index entries into the index is met, wherein the time threshold is a maximum time duration for inserting index entries into the index of the data table, and wherein the time threshold defines the maximum time duration that can elapse prior to a build operation; 
   responsive to determining the time threshold for inserting index entries into the index is met:
 building, by one or more processors, at least in part: an index B-tree structure that includes the index entries inserted into the index of the data table utilizing one or more data indexing algorithms and an index B-tree structure as an index sub-partition based on the index leaf pages; 
 building, by one or more processors, the index leaf pages into the index B-tree structure; 
 determining, by one or more computer processors, whether a non-sequential index entry is inserted into the index; 
 responsive to determining the non-sequential index entry is inserted into the index of the data table, completing, by one or more computer processors, building of the index leaf pages into the index B-tree structure; and 
   after building the index B-tree structure:
 inserting the non-sequential index entry into a corresponding location in the built index B-tree structure.