On Thursday 15 March 2007 17:25, Ross Patterson wrote:
> Also, the problem of distributing intids so that they are moved as
> seldom as possible is a bit of a challenge.  I'm sure there's some
> algorithm for such problems that I'm just unaware of.  Does anyone
> have any pointers for this?

Well, this is exactely what BTrees are doing. They move items as rarely as 
possible. I guess you could use IIBTrees in a clever way to so this. 
Otherwise I like your proposal.

Stephan Richter
CBU Physics & Chemistry (B.S.) / Tufts Physics (Ph.D. student)
Web2k - Web Software Design, Development and Training
Zope3-users mailing list

Reply via email to