[Kolab-devel] imap search operation costs

[Stuart K. Bingë]

On Thursday, 15 July 2004 16:54, Bernhard Reiter wrote:
> Briefly talked to Martin about this.
> He says that single searches are fast, but concurrent searches
> pose the problem. So benchmarking seems to be difficult.
>
> The problem with concurrent users seems to come up
> with a couple users already. If they change the folder contents,
> the indexes will get invalid often, so the searches getting to become
> more like linear operations.

Don't mean to pick a bone here; merely providing more information. We're also 
using a UID search within the resource manager, although currently it's a 
full-body search :-/. If we include the UID in the subject we can 
restrict/optimise this to a Subject search.

This is not critical, as the resource manager is not something that is being 
hammered all the time - there are usually few groups/resources within an 
organisation (compared to the number of total users), and the case of a 
concurrent search for a group/resource is exceptionally rare.

With that said, maintaining a EUID->IUID cache within the resource manager is 
not something I want to do either - its lifetime is exceptionally short, so 
adding all this complexity seems pointless.

Just thought I'd provide more reasons for my cause :-)

Cheers,

-- 
Stuart Bingë
Code Fusion cc.

Office: +27 11 673 0411
Mobile: +27 83 298 9727
Email: s.binge at codefusion.co.za

Tailored email solutions; Kolab specialists.
http://www.codefusion.co.za/