[ZODB-Dev] BTrees, Sets, Performance, and Scalability

[JohnD.Heintz]

What are the performance and scalability characteristics of the BTrees da=
ta=20
structures?

Specifically, I recently found out that BTrees.OOBTree.OOSet doesn't use=20
buckets to store its contents.  This is probably simply for performance o=
f=20
set operations, but it really messed up my scalability for a while becaus=
e I=20
was trying to store an ever increasing number of keys in the OOSet.  I'm =
now=20
using an OOBTree for this data structure - but I dislike using maps this =
way.

Any pointers to documentation would be appreciated.  If the answer is use=
 the=20
source then I will, but I'll also find a documentation bug ;-)

Thanks,
John


--=20
=2E . . . . . . . . . . . . . . . . . . . . . . .

John D. Heintz | Senior Engineer

1016 La Posada Dr. | Suite 240 | Austin TX 78752
T 512.633.1198 | jheintz@isogen.com

w w w . d a t a c h a n n e l . c o m