directory-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
Subject [jira] Commented: (DIRRMS-22) Need mechanism to find index holes in the bit vector
Date Tue, 20 Apr 2004 01:58:53 GMT
The following comment has been added to this issue:

     Author: Alex Karasulu
    Created: Mon, 19 Apr 2004 6:56 PM
We're going to use another database all together to manage bit indices.  This database needs
to be separate because it maps the application name to an index.  Entries represent claimed
indices that are occupied by valid permissions.  The lack of an entry or an index discontinuity
represents holes where indices can be claimed for new permissions.
View this comment:

View the issue:

Here is an overview of the issue:
        Key: DIRRMS-22
    Summary: Need mechanism to find index holes in the bit vector
       Type: Task

     Status: Open
   Priority: Major

    Project: Directory RMS
             Berkeley JE

   Assignee: Alex Karasulu
   Reporter: Alex Karasulu

    Created: Mon, 19 Apr 2004 9:46 AM
    Updated: Mon, 19 Apr 2004 6:56 PM

Right now it's not all that simple to rapidly find the next available bit index to occupy.
 One would think the secondary indices would help and they do but since all permissions from
all applications are involved the problem is not as simple as it seems.  At first glance it
might appear as though a join would work but we still need to find the smallest available
index and so order creeps into the picture taking the option of a join out.  

Keep in mind this operation is for writes and it need not be that fast since we're optimized
for reads.  However it still needs to be efficient regardless and fairly straight forward.

This message is automatically generated by JIRA.

If you think it was sent incorrectly contact one of the administrators:

If you want more information on JIRA, or have a bug to report see:

View raw message