directory-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Emmanuel L├ęcharny <>
Subject Re: Index reverse tables : are they useful ?
Date Fri, 24 Jun 2011 08:00:59 GMT
On 6/24/11 9:51 AM, Alex Karasulu wrote:
>>> The reverse index has no duplicate keys. The only way to get a
>>> duplicate key in the reverse index is if the same entry (i.e. 37)
>>> contained the same value ('foo') for the same (sn) attribute. And this
>>> we know is not possible. So the lookups against the reverse table will
>>> be faster.
>> I was thinking about something a bit different : as soon as you have grabbed
>> the list of entry's ID from the first index, looking into the other indexes
>> will also return a list of Entry's ID. Checking if those IDs are valid
>> candidate can then be done in one shot : do the intersection of the two sets
>> (they are ordered, so it's a O(n) operation) and just get the matching
>> entries.
>> Compared to the current processing (ie, accessing the reverse index for
>> *each* candidate), this will be way faster, IMO.
> This is a VERY interesting idea. Maybe we should create a separate
> thread for this and drive deeper into it. You got something I think
> here.
have a look at, 
where I added some paragraphs explaining this idea. We can comment on 
this page.

Emmanuel L├ęcharny

View raw message