Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data
From MaRDI portal
Publication:3524310
DOI10.1007/11864219_19zbMATH Open1155.68330OpenAlexW1490720341MaRDI QIDQ3524310FDOQ3524310
Authors: Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce, Alan Schmitt
Publication date: 9 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11864219_19
Recommendations
Cited In (7)
- Optimistic voting for managing replicated data
- Database Programming Languages
- Exploiting schemas in data synchronization
- Synchronization and replication model in mobile environment
- \(\operatorname{Log}^{\prime}\) version vector: logging version vectors concisely in dynamic replication
- Title not available (Why is that?)
- Concise version vectors in WinFS
This page was built for publication: Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524310)