A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
The coordination of atomic updates to distributed data is a difficult problem in the design of a distributed information system. ... A common goal for solutions to this problem is that the failure of a site should not prevent any processing that does not require the data stored at that site. ... ACKNOWLEDGEMENTS I would like to thank the members of the Computer Systems Research group of the M.I.T. Laboratory for Computer Science for their support during the research that lead to this paper. ...doi:10.1145/800215.806582 dblp:conf/sosp/Montgomery79 fatcat:c7ywyh35brfwdnye3w436wjnly
The second execution phase is shorter since no disk I/O is required, resulting in a lower effective degree of txn concurrency and less data contention. ... : special methods for indices and aggregate data; modified txn structures; and relaxed levels of consistency for queries; (vi) survey performance evaluation studies of CC methods; (vii) illustrate the ... Polyvalues provide a similar capability for coping with failures in a distributed database environment through a bookkeeping tool described in Montgomery  . ...doi:10.1145/274440.274443 fatcat:poc3s7k7izbevastdzuccfiqjy