On 11/15/2013 06:01 PM, Jens W. Klein wrote:
The idea is simple:

- iterate over all transactions starting with the lowest
   transaction id (tid)
- for each transaction load the object states connected with tid
- for each state fetch its outgoing references and fill a table where
   all incoming references of an object are stored as an array.
   if an state has no references write it anyway to the table with empty
   outgoing references

I would describe the RelStorage packing algorithm with the same words, but since you reimplemented the algorithm from scratch, you found a more optimal implementation for your database. Good work!


For more information about ZODB, see http://zodb.org/

ZODB-Dev mailing list  -  ZODB-Dev@zope.org

Reply via email to