"ZODB.fsIndex" tells us in its source code documentation that it splits the 8 byte oid into a 6 byte prefix and a two byte suffix and represents the index by an "OOBTree(prefix -> fsBucket(suffix -> position))"
It explains that is uses "fsBucket" (instead of a full tree) because the "suffix -> position" would contain at most 256 entries. This explanation surprises me a bit: why should the bucket contain only 256 rather than 256 * 256 (= 64.000) entries? If the assumption is wrong (i.e. the "fsBucket" can contain up to 64.000 entries), is the implementation inefficient (because of that)? -- Dieter _______________________________________________ For more information about ZODB, see the ZODB Wiki: http://www.zope.org/Wikis/ZODB/ ZODB-Dev mailing list - ZODB-Dev@zope.org http://mail.zope.org/mailman/listinfo/zodb-dev