Re: revision algorithms
- From: "Andrae Muys" <andrae.muys@xxxxxxxxx>
- Date: 23 Feb 2006 22:50:28 -0800
A persistent datastructure will permit you to operate on multiple
versions of a single structure concurrently. As mentioned various
papers on transactional systems or databases may be of use, although if
you are only interested in a small number of objects then they are
probably overkill.
Chris Okasaki wrote a very popular book on the topic "Purely Functional
Data Structures", and has published a number of papers on persistent
datastructures, especially the sort of lightweight structures commonly
used in applications like lists, maps, and trees.
If N is small, and the occasional O(N) operation isn't going to kill
you, a persistent binary-search-tree is almost trivial.
Andrae Muys
.
- References:
- revision algorithms
- From: cartoper
- revision algorithms
- Prev by Date: Re: o-1 Knapsack problem
- Next by Date: Re: HEAP SORT
- Previous by thread: Re: revision algorithms
- Next by thread: HEAP SORT
- Index(es):
Relevant Pages
|
