Re: revision algorithms

cartoper@xxxxxxxxx writes:

I am looking for an algorithm to implement a revision system. The data
is quite simple. There is a array of objects. New objects can be
added, objects can be delete, and objects can be moved around in the
array.

I am looking for an effecient way to look at two versions of this list,
capture what changed, and be able to return to init state.

You may be looking for multiversion B-trees. I first encountered
these in Soules et al., "Metadata Efficiency in Versioning File
Systems". That paper references Becker et al., "An
asymptotically optimal multiversion b-tree," as its source for
the data structure.
--
Ben Pfaff
email: blp@xxxxxxxxxxxxxxx
web: http://benpfaff.org
.