Method and system for highly efficient database bitmap index processing

• US 20040249782A1
• Filed: 06/04/2003
• Published: 12/09/2004
• Est. Priority Date: 06/04/2003
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Ricci, Derek Orzo
• Application Number:
  US10/454,274
• Publication Number:
  US 20040249782A1
• Time in Patent Office: Days
• US Class Current: 707/1
• CPC Class Codes: G06F 16/2237 Vectors, bitmaps or matrices

Abstract

A computer-based method for database bitmap index processing in a database management system. The method utilizes a microprocessor supporting instructions for simultaneous processing of at least 128 bits and having storage units of at least 128 bits to process bitmap index format database structures. The instructions may belong to the microprocessor'"'"'s multimedia application extension and be in assembly language. One instruction moves content of the entire storage unit of at least 128 bits between a memory and a register, and another instruction performs a logical AND instruction on the two storage units of at least 128 bits. A join operation on two bitmap indexes is performed by comparing two bitmap indexes and computing their intersection using a logical AND instruction.

Claims

1. A computer-based method for database bitmap index processing in a database management system, the method comprising the steps of:

(a) utilizing a microprocessor supporting instructions for simultaneous processing of at least 128 bits and having storage units of at least 128 bits to process bitmap index format database structures.

2. The method according to claim 1, wherein said instructions belonging to the microprocessor'"'"'s multimedia application extension.

3. The method according to claim 1, wherein said instructions being assembly language instructions, a first instruction for moving content of the entire storage unit of at least 128 bits between a memory and a register, and a second instruction for performing a logical AND instruction on the two storage units of at least 128 bits.

4. The method according to claim 1, wherein a join operation on two bitmap indexes being performed by comparing two bitmap indexes and computing their intersection using a logical AND instruction.

5. A data processing system for database bitmap index processing in a database management system, comprising means for performing the steps of:

(a) utilizing a microprocessor supporting instructions for simultaneous processing of at least 128 bits and having storage units of at least 128 bits to process bitmap index format database structures.

6. The system according to claim 5, wherein said instructions belonging to the microprocessor'"'"'s multimedia application extension.

7. The system according to claim 5, wherein said instructions being assembly language instructions, a first instruction for moving content of the entire storage unit of at least 128 bits between a memory and a register, and a second instruction for performing a logical AND instruction on the two storage units of at least 128 bits.

8. The system according to claim 5, wherein a join operation on two bitmap indexes being performed by comparing two bitmap indexes and computing their intersection using a logical AND instruction.

9. A computer usable medium, in a database management system, tangibly embodying a program of instructions executable by the computer to perform a computer-based method for database bitmap index processing, comprising the steps of:

(a) utilizing a microprocessor supporting instructions for simultaneous processing of at least 128 bits and having storage units of at least 128 bits to process bitmap index format database structures.

10. The method according to claim 9, wherein said instructions belonging to the microprocessor'"'"'s multimedia application extension.

11. The method according to claim 10, wherein said instructions being assembly language instructions, a first instruction for moving content of the entire storage unit of at least 128 bits between a memory and a register, and a second instruction for performing a logical AND instruction on the two storage units of at least 128 bits.

12. The method according to claim 10, wherein a join operation on two bitmap indexes being performed by comparing two bitmap indexes and computing their intersection using a logical AND instruction.