It seems that for a huge index, it might be a good idea to use a different
implementation of the BitSet when doing filtering (assuming the
non-filtered set is relatively small). This would really help minimize
the memory required for each filter operation.
Since the default implementation of
Hi,
In database systems implementation, there is a type of index called
bit map indexing. The bitset implementation could borrow idea from the
database engine implementation.
You could squeeze all the 0's together and write how many of those
0's, that might be very memory saving.
There are
On Monday 14 February 2005 18:31, jian chen wrote:
Hi,
In database systems implementation, there is a type of index called
bit map indexing. The bitset implementation could borrow idea from the
database engine implementation.
You could squeeze all the 0's together and write how many of
On Monday 14 February 2005 16:29, [EMAIL PROTECTED] wrote:
It seems that for a huge index, it might be a good idea to use a
different implementation of the BitSet when doing filtering (assuming
the non-filtered set is relatively small). This would really help
minimize the memory required for
