Claims
- 1. A computer-readable media containing compressed output, comprising:compressed sets of one or more bit sequences that represent groups of bit sequences; wherein each bit sequence of said groups of bit sequences contains an identical number of bits; wherein each group of bit sequences of said groups of bit sequences includes either a gap bit sequence, an offset bit sequence, or a map bit sequence; and wherein at least one compressed set of one or more bit sequences of said compressed sets contains a set of one or more gap size bit sequences, wherein each gap size bit sequence of said set of one or more gap size bit sequences includes a flag, wherein said flag indicates whether a subsequent gap size bit sequence follows within said at least one compressed set.
- 2. The computer-readable media of claim 1, whereinwherein each gap bit sequence in said group of bit sequences has all bits set to logical zero, wherein each offset bit sequence in said group of bit sequences has one bit of said bit sequence set to logical one, wherein each said map bit sequence in said group of bit sequences has two or more bits.
- 3. The computer-readable media of claim 1, wherein each gap size sequence in said compressed sets of one or more bit sequences stores a portion of a gap size of the respective group of bit sequences of said each gap size sequence.
- 4. The computer-readable media of claim 1, wherein each compressed set of one or more bit sequences of said compressed sets includes a control bit sequence, wherein said control bit sequence indicates:a number of gap bit sequences in said each group, a number of map bit sequences in said each group, and if said each group contains an offset bit sequence, then which bit is set to value one in said offset bit sequence in said each group.
- 5. The computer-readable media of claim 1, wherein the compressed sets of one or more bit sequences include:a first gap bit group that represents a first group of bit sequences from said groups of bit sequences, wherein said first group has a first gap size, wherein said first gap bit group contains zero or more offset bit sequences and zero or more gap bit sequences, wherein said first gap size is less than a threshold; and a second gap bit group that represents a second group of bit sequences that has a second gap size, wherein said second gap bit group contains zero or more offset bit sequences, zero or more gap bit sequences, and one or more gap size bit sequences that represent a portion of the second gap size, wherein the second gap size is equal to or greater than a threshold.
- 6. The computer-readable media of claim 1, wherein the compressed sets of one or more bit sequences include:a first map bit group that represents a first group of bit sequences from said groups of bit sequences, wherein said first group has a first gap size, wherein said first map bit group contains zero or more map bit sequences and zero or more gap bit sequences, wherein said first gap size is less than a threshold; and a second map bit group that represents a second group of bit sequences that has said second gap size, wherein said second map bit group contains zero or more map bit sequences, zero or more gap bit sequences, and one or more gap size bit sequences that represent a portion of the second gap size, wherein the second gap size is equal to or greater than a threshold.
- 7. The computer-readable media of claim 1, wherein at least one compressed set of said compressed sets contains another set of one or more gap size bit sequences, wherein said other set of one or more gap size bit sequences represents an offset number, wherein said offset number is less than the gap size of the group of bit sequences represented by said at least one compressed set that contains said other set of one or more gap size bit sequences.
- 8. A computer-readable media containing compressed output, comprising:compressed sets of one or more bit sequences that represent groups of bit sequences; wherein each bit sequence of said groups of bit sequences contains an identical number of bits; wherein each group of bit sequences of said groups of bit sequences includes either a gap bit sequence, an offset bit sequence, or a map bit sequence; and wherein at least one compressed set of said compressed sets contains a set of one or more gap size bit sequences, wherein said set of one or more gap size bit sequences represents an offset number, wherein said offset number is less than the gap size of the group of bit sequences represented by said at least one compressed set.
- 9. The computer-readable media of claim 8, wherein at least one compressed set of one or more bit sequences of said compressed sets contains another set of one or more gap size bit sequences, wherein each gap size bit sequence of said other set of one or more gap size bit sequences includes a flag, wherein said flag indicates whether a subsequent gap size bit sequence follows within said at least one compressed set that contains said other set of one or more gap size bit sequences.
- 10. The computer-readable media of claim 8, whereinwherein each gap bit sequence in said group of bit sequences has all bits set to logical zero, wherein each offset bit sequence in said group of bit sequences has one bit of said bit sequence set to logical one, wherein each said map bit sequence in said group of bit sequences has two or more bits.
- 11. The computer-readable media of claim 8, wherein each gap size sequence in said compressed sets of one or more bit sequences stores a portion of a gap size of the respective group of bit sequences of said each gap size sequence.
- 12. The computer-readable media of claim 8, wherein each compressed set of one or more bit sequences of said compressed sets includes a control bit sequence, wherein said control bit sequence indicates:a number of gap bit sequences in said each group, a number of map bit sequences in said each group, and if said each group contains an offset bit sequence, then which bit is set to value one in said offset bit sequence in said each group.
- 13. The computer-readable media of claim 8, wherein the compressed sets of one or more bit sequences include:a first gap bit group that represents a first group of bit sequences from said groups of bit sequences, wherein said first group has a first gap size, wherein said first gap bit group contains zero or more offset bit sequences and zero or more gap bit sequences, wherein said first gap size is less than a threshold; and a second gap bit group that represents a second group of bit sequences that has a second gap size, wherein said second gap bit group contains zero or more offset bit sequences, zero or more gap bit sequences, and one or more gap size bit sequences that represent a portion of the second gap size, wherein the second gap size is equal to or greater than a threshold.
- 14. The computer-readable media of claim 8, wherein the compressed sets of one or more bit sequences include:a first map bit group that represents a first group of bit sequences from said groups of bit sequences, wherein said first group has a first gap size, wherein said first map bit group contains zero or more map bit sequences and zero or more gap bit sequences, wherein said first gap size is less than a threshold; and a second map bit group that represents a second group of bit sequences that has said second gap size, wherein said second map bit group contains zero or more map bit sequences, zero or more gap bit sequences, and one or more gap size bit sequences that represent a portion of the second gap size, wherein the second gap size is equal to or greater than a threshold.
- 15. A computer-readable media containing compressed output, comprising:compressed sets of one or more bit sequences that represent groups of bit sequences; wherein each bit sequence of said groups of bit sequences contains an identical number of bits; wherein each group of bit sequences of said groups of bit sequences includes either a gap bit sequence, an offset bit sequence, or a map bit sequence; and wherein each compressed set of one or more bit sequences of said compressed sets contains a set of one or more gap size bit sequences, wherein said control bit sequence contains a field representing a range of numbers, wherein said range of numbers includes a first subrange and a second subrange; wherein a first subgroup of said group of bit sequences has a first bit sequence with one bit set to value one and said field set to a particular value within said first subrange, wherein said value represents the gap size of said group; and wherein a second subgroup of said group of bit sequences has a second bit sequence with one bit set to value one and said field set to a particular value within said second subrange, wherein said value represents the gap size of said second group, and wherein the gap size of said second subgroup and said first subgroup are the same.
- 16. The computer-readable media of claim 15, wherein at least one compressed set of one or more bit sequences of said compressed sets contains a set of one or more gap size bit sequences, wherein each gap size bit sequence of said set of one or more gap size bit sequences includes a flag, wherein said flag indicates whether a subsequent gap size bit sequence follows within said at least one compressed set.
- 17. The computer-readable media of claim 15, wherein at least one compressed set of said compressed sets contains a set of one or more gap size bit sequences, wherein said set of one or more gap size bit sequences represents an offset number, wherein said offset number is less than the gap size of the group of bit sequences represented by said at least one compressed set.
- 18. The computer-readable media of claim 15, whereinwherein each gap bit sequence in said group of bit sequences has all bits set to logical zero, wherein each offset bit sequence in said group of bit sequences has one bit of said bit sequence set to logical one, wherein each said map bit sequence in said group of bit sequences has two or more bits.
- 19. The computer-readable media of claim 15, wherein each gap size sequence in said compressed sets of one or more bit sequences stores a portion of a gap size of the respective group of bit sequences of said each gap size sequence.
RELATED APPLICATIONS
This application is a continuation of application Ser. No. 08/808,560 filed Feb. 28, 1997, now U.S. Pat. No. 5,907,297.
The present application is related to: U.S. patent application Ser. No. 08/807,334, entitled “CREATING BITMAPS FROM MULTI-LEVEL IDENTIFIERS”, filed by Cetin Ozbutun, Michael Depledge, Hakan Jakobsson, Mark Kremer, Jeffrey I. Cohen, Quoc Tai Tran, and Alexander C. Ho on Feb. 28, 1997 the contents of which are incorporated herein by reference.
U.S. patent application Ser. No. 08/808,584, entitled “BITMAP SEGMENTATION”, filed by Cetin Ozbutun, Jeffrey I. Cohen, Hakan Jakobsson, Mark Kremer, Michael Depledge, Quoc Tai Tran, Alexander C. Ho, and Julian Hyde, on the Feb. 28, 1997 the contents of which are incorporated herein by reference.
U.S. patent application Ser. No. 08/752,128, entitled “METHOD AND APPARATUS FOR PROCESSING COUNT STATEMENTS IN A DATABASE SYSTEM”, filed by Cetin Ozbutun, Michael Depledge, Hakan Jakobsson, and Jeffrey I. Cohen, on Nov. 20, 1996, the contents of which are incorporated herein by reference.
U.S. patent application Ser. No. 08/808,097, entitled “GROUP BY AND DISTINCT SORT ELIMINATION USING COST-BASED OPTIMIZATION”, filed by Jeffrey Ira Cohen, Cetin Ozbutun, Michael Depledge, and Hakan Jakobsson, on Feb. 28, 1997 the contents of which are incorporated herein by reference.
U.S. patent application Ser. No. 08/808,096, entitled “METHOD AND APPARATUS FOR USING INCOMPATIBLE TYPES OF INDEXES TO PROCESS A SINGLE QUERY”, filed by Jeffrey Ira Cohen, Cetin Ozbutun, Hakan Jakobsson, and Michael Depledge, on Feb. 28, 1997 the contents of which are incorporated herein by reference.
U.S. patent application Ser. No. 08/808,094, entitled “INDEX SELECTION FOR AN INDEX ACCESS PATH”, filed by Hakan Jakobsson, Michael Depledge, Cetin Ozbutun, and Jeffrey I. Cohen, on Feb. 28, 1997 the contents of which are incorporated herein by reference.
U.S. patent application Ser. No. 08/807,429, entitled “QUERY PROCESSING USING COMPRESSED BITMAPS”, filed by Cetin Ozbutun, Jeffry I. Cohen, Michael Depledge, Julian Hyde, Hakan Jakobsson, Mark Kremer, and Quoc Tai Tran, on Feb. 28, 1997 the contents of which are incorporated herein by reference.
U.S. patent application Ser. No. 08/807,451, entitled “BITMAPPED INDEXING WITH HIGH GRANULARITY LOCKING”, filed by Michael Depledge, Jeffrey I. Cohen, Hakan Jakobsson, Mark Kremer, Cetin Ozbutun, Quoc Tai Tran, and Alexander C. Ho, on Feb. 28, 1997 the contents of which are incorporated herein by reference.
U.S. patent application Ser. No. 08/808,560, entitled “UPDATING BITMAPPED INDEXES”, filed by Michael Depledge, Hakan Jakobsson, Cetin Ozbutun, Jeffrey I. Cohen, and Quoc Tai Tran, on Feb. 28, 1997 the contents of which are incorporated herein by reference.
U.S. patent application Ser. No. 08/808,586, entitled “COMBINING BITMAPS WITHIN A MEMORY LIMIT”, filed by Cetin Ozbutun, Jeffry I. Cohen, Michael Depledge, Julian Hyde, Hakan Jakobsson, Mark Kremer, and Quoc Tai Tran, on Feb. 28, 1997 the contents of which are incorporated herein by reference.
US Referenced Citations (6)
Non-Patent Literature Citations (3)
Entry |
Antoshenkov, G., “Byte-aligned bitmap compression”, Proceedings Data Compression Conference, 1995. DCC '95. Mar. 28-30, 1995, Abstract: p. 476.* |
Bookstein, A., “Flexible compression for bitmap sets”, Data Compression Conference, 1991. DCC '91., Apr. 8-11, 1991, pp. 402-410.* |
Kun-Lung Wu, “Range-based bitmap indexing for high cardinality attributes with skew”, Proceedings. The Twenty-Second Annual International Computer Software and Applications Conference, 1998. COMPSAC '98., Aug. 19-21, 1998, pp. 61-66. |
Continuations (1)
|
Number |
Date |
Country |
Parent |
08/808560 |
Feb 1997 |
US |
Child |
09/311654 |
|
US |