Abstract

Its proof relies on an algebraic argument based on partial orders, which may well have applications outside databases, for example in the field of 'true concurrency'. We indicate how the algorithm can be generalised to a number of other network topologies, and give guidelines for further generalisations. If combined with timestamping, the algorithms provide highly concurrent methods of ensuring that the sequence of updates executed at all nodes corresponds to the order implied by these timestamps."