Re: revision algorithms

On Thu, 23 Feb 2006 07:12:41 -0800, cartope wrote:
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.

I remember long ago reading about a time-based tree data structure
which would serve your purpose. Unfortauntely, I don't remember any
reasonable references. Look for persistent data structure, maybe?
Some database algorithms/data structures may be helpful, too. They
have to wait to commit, be able to roll back to known-good states,
etc.

-paul-
--
Paul E. Black (p.black@xxxxxxx)

.

Relevant Pages

  • Re: Latest version of glossary
    ... such as XML, refer to the use of the term within that "namespace" using ... An n-dimensional data structure, S, is one where each element of S ... Whenever mathematics is applied to anything, ... associative array (while trying to do something in JavaScript, ...
    (comp.databases.theory)
  • Re: how to read dynamic data structures from the kernel (was Re: reading routing table)
    ... could give us individual entries of the data structure on each call, ... steps for any given kernel subsystem -- we have data structures, ... bumping the references and adding pointers to the array. ... the global locks, and proceed lock, externalize, unlock, and copyout each ...
    (freebsd-net)
  • Re: Looking for advise on storring a complex array
    ... hashes etc. ... The trick is that I would not like to have to read back the entire array ... but you should look into using a database with a few ... This *really* depends on your data structure. ...
    (perl.beginners)
  • Re: any function to handle this kind of counting?
    ... Use a dynamic count data structure, that grows as new element values ... you might dimension the 2D array as ... // then increment the entry in the 2D count array that corresponds ... // then malloc a pair of arrays that are big enough to hold all of the ...
    (comp.programming)
  • Re: What is the best way to pull out a range of values?
    ... Let's say I have a large collection of values and they are in an array ... It seems to me the data structure you are looking for is a sorted list. ... Then you can use binary search to find the first element above the lower ... "Reply" at the bottom of the article headers. ...
    (comp.lang.perl.misc)