|
|
|
@inproceedings{DBLP:conf/vldb/EcklundEET87,
author = {Denise J. Ecklund and
Earl F. Ecklund Jr. and
Robert O. Eifrig and
Fred M. Tonge},
editor = {Peter M. Stocker and
William Kent and
Peter Hammersley},
title = {DVSS: A Distributed Version Storage Server for CAD Applications},
booktitle = {VLDB'87, Proceedings of 13th International Conference on Very
Large Data Bases, September 1-4, 1987, Brighton, England},
publisher = {Morgan Kaufmann},
year = {1987},
isbn = {0-934613-46-X},
pages = {443-454},
ee = {db/conf/vldb/EcklundEET87.html},
crossref = {DBLP:conf/vldb/87},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
The Distributed Version Storage Server (DVSS) provides an underlying storage mechanism for a CAD-oriented data model. DVSS supports such project management features as version histories, alternate data versions, and multi-reader multi-writer access control in a heterogeneous network of workstations and fileservers.
Each design object is managed as a rooted directed acyclic graph (DAG) of versions. At any time, one path in an object's DAG is designated as its principal path; the current version in the principal path is the current version of the object. Other paths contain alternate versions of the object. Updates to any version path must be serializable, but derivation of alternate versions is not subject to this constraint.
Clients interact with DVSS using the checkout/checkin paradigm. Each object has a primary site, which synchronizes actions on the object. Group operations requiring multiple locks follow a deadlock avoidance scheme.
DVSS is robust in that it supports multi-reader and multi-writer data access in the presence of failures. Traditional data replication supports continued read access. Write-write conflicts resulting from continued write access during network partition are resolved at recovery time by creation of alternate versions. The cost of resolution is minimized by employing a unilaterally computable algorithm at each site.
Copyright © 1987 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.
