Oracle FAQ | Your Portal to the Oracle Knowledge Grid |
Home -> Community -> Usenet -> c.d.o.misc -> Bit-Mapped Indexing Routines-----Beta Testers Wanted
Bit-mapped indexing is still a relatively new concept in the DB field. It is with this in mind that I set out to produce a library of functions for creating, managing and manipulating bit-maps. Although the routines could be used for manipulating any form of bitmap, they were specifically designed for bit-mapped indexing.
There are a number of factors that make these routines superior to those currently used by Sysbase, Oracle, Redbrick and the other DB vendors that have implemented this BM (bitmap) technology:
The BM functions include functions for:
Various logical operations (1 - 8) can be performed on 2 source data sets of 1,000,000 bits each, to produce a result data set in 0.2 seconds for any single operation. This is WORST case senario. Best case... I am unable to time them, as the timing function returns 0.0000. My test have been conducted on a Compaq 90Mz Pentium with 32MB memory.
A beta version of these routines will be available by 1 January 1997. The routines will comprise of a 16-bit Windows library, a 32-bit Windows library, a DOS library, and 16 & 32 Bit Windows DLL's and will be shipped complete with on-line documentation and help.
If anybody is interested in testing the routines, please send me an e-mail at:
bitmapindx_at_aol.com
The above e-mail address will be activated on 11/18/96 at 6:00PM EST. Received on Tue Nov 19 1996 - 00:00:00 CST