We describe a data structure and algorithms based on segment
trees. They are used to manage different versions of a document and
to reconstruct the version which was valid at a given time in the
past or to get the most recent version. Difficulties arise because it
is not known when a version will be replaced by a newer one. Thus
unbounded time intervals are to be handled. The data structure also
supports the retrieval of the history of a document.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:34515 |
| Date | 12 July 2019 |
| Creators | Sosna, Dieter |
| Publisher | Universität Leipzig |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:book, info:eu-repo/semantics/book, doc-type:Text |
| Source | Report / Institut für Informatik, Report / Institut für Informatik |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | urn:nbn:de:bsz:15-qucosa2-343029, qucosa:34302 |
Page generated in 0.0023 seconds