78
scheme for addresses (given in terms of specific change operations) provides a persistent
identity for locations in the sequence that will give any piece of data the same address in
different states of the sequence. Of course, it will only be valid for those sets of changes
(states of the sequence) in which all changes required to create that location are present.
The structure of the address space and contents of a sequence are both defined by functions
of a set of changes.
3.6 Summary
This chapter has examined the issues of conflict resolution, change interaction, address-
ing, and merge for the Palimpsest operation set: insert, delete, move, copy.The goal has been
to develop intuition and explore the justifications for and implications of an unfamiliar
model. Chapter 4 presents a formal model of the operations informally described in this
chapter.
scheme for addresses (given in terms of specific change operations) provides a persistent
identity for locations in the sequence that will give any piece of data the same address in
different states of the sequence. Of course, it will only be valid for those sets of changes
(states of the sequence) in which all changes required to create that location are present.
The structure of the address space and contents of a sequence are both defined by functions
of a set of changes.
3.6 Summary
This chapter has examined the issues of conflict resolution, change interaction, address-
ing, and merge for the Palimpsest operation set: insert, delete, move, copy.The goal has been
to develop intuition and explore the justifications for and implications of an unfamiliar
model. Chapter 4 presents a formal model of the operations informally described in this
chapter.
