Guaranteeing Correctness for Collaboration on Documents Using an Optimal Locking Protocol

Guaranteeing Correctness for Collaboration on Documents Using an Optimal Locking Protocol

Stijn Dekeyser
Copyright: © 2011 |Pages: 13
DOI: 10.4018/jdst.2011100102
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Collaboration on documents has been supported for several decades through a variety of systems and tools; recently a renewed interest is apparent through the appearance of new collaborative editors and applications. Some distributed groupware systems are plug-ins for standalone word processors while others have a purely web-based existence. Most exemplars of the new breed of systems are based on Operational Transformations, although some are using traditional version management tools and still others utilize document-level locking techniques. All existing techniques have their drawbacks, creating opportunities for new methods. The authors present a novel collaborative technique for documents which is based on transactions, schedulers, conflicts, and locks. It is not meant to replace existing techniques; rather, it can be used in specific situations where a strict form of concurrency control is required. While the approach of presentation in this article is highly formal with an emphasis on proving desirable properties such as guaranteed correctness, the work is part of a project which aims to fully implement the technique.
Article Preview
Top

Current Techniques

We briefly discuss existing collaboration techniques and highlight some of their strengths and drawbacks. We limit this discussion to the two dominant methods introduced above.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 2 Issues (2023)
Volume 13: 8 Issues (2022)
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing