Index masking based on insert contention ratio

• US 9,613,075 B2
• Filed: 03/10/2016
• Issued: 04/04/2017
• Est. Priority Date: 04/20/2015
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Li, Shuo, Liang, Ping, Yang, Xin Ying, Zhang, Jian Wei
• Primary Examiner(s): Jami, Hares
• Application Number:
  US15/066,543
• Publication Number:
  US 20160306835A1
• Time in Patent Office: 390 Days
• Field of Search: 707711, 707715, 707741-746
• CPC Class Codes: G06F 16/221 Column-oriented storage; Management thereof
• CPC Class Codes: G06F 16/2272 Management thereof
• CPC Class Codes: G06F 16/2379 Updates performed during online database operations; commit processing

Abstract

Embodiments of the present invention provide a method, computer program product, and computer system for masking indexes. The method may include masking the index if the index contention exceeds a defined threshold. The method may also include configuring the mask type for the index to insert the index without masking. In response to determining that the mask type for the index is configured to insert the index without masking, the index is masked according to a set of rules.

Claims

1. A method for reducing index insert times to improve database performance based on masking indexes above an insert contention threshold, the method comprising:

receiving, by one or more computer processors, settings defining a mask type for an index, wherein the index is one of a partitioned index and a data partitioned secondary index, and wherein the mask type is one of mask never, mask always, and mask automatic;

determining, by the one or more computer processors, that an insert contention exceeds a defined threshold;

determining, by the one or more computer processors, that the mask type is not mask always;

determining, by the one or more computer processors, that the mask type is mask automatic;

determining, by the one or more computer processors, that there are no active applications dependent on the index;

determining, by the one or more computer processors, that an index last used time does not exceed a defined threshold;

determining, by the one or more computer processors, that an index contention time did not exceed a defined threshold at an index access time, wherein the index contention time is defined as one of a time and a percentage of central processing unit usage;

determining, by the one or more computer processors, that an index key length does not exceed a defined threshold, wherein the index key length is based on the maximum size of one or more variable-length columns and the size of one or more fixed-data columns;

determining, by the one or more computer processors, that an index free space ratio is less than a defined threshold; and

masking, by the one or more computer processors, the index.