International Business Machines Corporation
Index leaf page splits avoidance or reduction

Abstract:

In an approach, a processor receives a first request to store a specific key to index pages of a database, wherein: the request indicates that the specific key is to be stored to a specific leaf page in a key-ordered chain of the index pages, and there is insufficient room in the specific leaf page to store the specific key. A processor determines at least one sibling leaf page of the specific leaf page in the key-ordered chain, the specific leaf page and the at least one sibling leaf page forming a first set. A processor determines that there is enough room in leaf pages of the first set to store existing keys in the leaf pages of the first set together with the specific key. A processor stores the existing keys in the leaf pages of the first set together with the specific key according to a redistribution policy.