Instead of gc-ing previous revisions of nodes, record their address in the heap with a new slot in the base NODE class.

kraison / vivace-graph-v3

VivaceGraph version 3. Open source Common Lisp graph database & Prolog implementation. Supersedes http://github.com/kraison/vivace-graph-v2.

Other

154 stars 29 forks source link

Instead of gc-ing previous revisions of nodes, record their address in the heap with a new slot in the base NODE class. #19

Open kraison opened 7 years ago

kraison commented 7 years ago

VG was intended to mimic couchdb's behavior of keeping old revisions of nodes around until manually garbage collected, or perhaps until some condition is triggered. It would be a simple matter to add an PREVIOUS-REVISION-POINTER field to the NODE base class and write the address of the old node to the heap with the new revision.