This is an automated notification sent by LCG Savannah.
It relates to:
task #7875, project CDS Invenio
==============================================================================
OVERVIEW of task #7875:
==============================================================================
URL:
<http://savannah.cern.ch/task/?7875>
Summary: Possible improvements to intbitset
Project: CDS Invenio
Submitted by: skaplun
Submitted on: 2008-09-22 09:16
Should Start On: 2008-09-22 00:00
Should be Finished on: 2008-09-22 00:00
Category: BibIndex
Priority: 2
Status: None
Privacy: Public
Percent Complete: 0%
Assigned to: skaplun
Open/Closed: Open
Discussion Lock: Any
Effort: 0.00
_______________________________________________________
Currently intbitset is not optimized for boolean AND operations and for
storing few big integers.
AND operations are currently performed by aligning the two intbitsets to the
larger one. Actually aligning to the shortest one should also be possible
(provided that they're not both infinite sets).
If intbitset is storing e.g. only one big integer, it will store all the
zeros representing all the previous big integers before the one currently
stored.
000000000000000000000000...000000000000000000000000001
This implementation is not very scalable and can be improved by adding the
notion of an offset, so that intbitset will keep in memory what the first bit
set to 1 is really representing.
_______________________________________________________
Carbon-Copy List:
CC Address | Comment
------------------------------------+-----------------------------
2195 | -SUB-
==============================================================================
This item URL is:
<http://savannah.cern.ch/task/?7875>
_______________________________________________
Message sent via/by LCG Savannah
http://savannah.cern.ch/
