History
The concept of bitmap index was first introduced by Professor Israel Spiegler and Rafi Maayan in their research "Storage and Retrieval Considerations of Binary Data Bases", published in 1985. The first commercial database product to implement a bitmap index was Computer Corporation of America's Model 204. Patrick O'Neil published a paper about this implementation in 1987. This implementation is a hybrid between the basic bitmap index (without compression) and the list of Row Identifiers (RID-list). Overall, the index is organized as a B+tree. When the column cardinality is low, each leaf node of the B-tree would contain long list of RIDs. In this case, it requires less space to represent the RID-lists as bitmaps. Since each bitmap represents one distinct value, this is the basic bitmap index. As the column cardinality increases, each bitmap becomes sparse and it may take more disk space to store the bitmaps than to store the same content as RID-lists. In this case, it switches to use the RID-lists, which makes it a B+tree index.
Read more about this topic: Bitmap Index
Famous quotes containing the word history:
“The history of American politics is littered with bodies of people who took so pure a position that they had no clout at all.”
—Ben C. Bradlee (b. 1921)
“The history of the past is but one long struggle upward to equality.”
—Elizabeth Cady Stanton (1815–1902)
“As History stands, it is a sort of Chinese Play, without end and without lesson.”
—Henry Brooks Adams (1838–1918)