{"title":"分布式和移动协作环境中的并发操作","authors":"Maher Suleiman, Michèle Cart, J. Ferrié","doi":"10.1109/ICDE.1998.655755","DOIUrl":null,"url":null,"abstract":"In a distributed groupware system, objects shared by users are subject to concurrency and real time constraints. In order to satisfy these, various concurrency control algorithms have been proposed that exploit the semantic properties of operations (C.A. Ellis and S.J. Gibbs, 1989; A. Karsenty and M. Beaudouin-Lafon, 1993; C. Sun et al., 1996). By ordering concurrent operations, they generally guarantee consistency of the different copies of each object. However, in some situations they can result in inconsistent copies, a non respect of user's intentions, and in the need to undo and redo some operations. The principle objective of the paper is to present an algorithm that overcomes these drawbacks in distributed and mobile collaborative environments. The algorithm is based on the notion of user intention, and also on the construction of equivalent histories by exploiting and combining some general semantic properties such as forward/backward transposition.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"132","resultStr":"{\"title\":\"Concurrent operations in a distributed and mobile collaborative environment\",\"authors\":\"Maher Suleiman, Michèle Cart, J. Ferrié\",\"doi\":\"10.1109/ICDE.1998.655755\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a distributed groupware system, objects shared by users are subject to concurrency and real time constraints. In order to satisfy these, various concurrency control algorithms have been proposed that exploit the semantic properties of operations (C.A. Ellis and S.J. Gibbs, 1989; A. Karsenty and M. Beaudouin-Lafon, 1993; C. Sun et al., 1996). By ordering concurrent operations, they generally guarantee consistency of the different copies of each object. However, in some situations they can result in inconsistent copies, a non respect of user's intentions, and in the need to undo and redo some operations. The principle objective of the paper is to present an algorithm that overcomes these drawbacks in distributed and mobile collaborative environments. The algorithm is based on the notion of user intention, and also on the construction of equivalent histories by exploiting and combining some general semantic properties such as forward/backward transposition.\",\"PeriodicalId\":264926,\"journal\":{\"name\":\"Proceedings 14th International Conference on Data Engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"132\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 14th International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1998.655755\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 14th International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1998.655755","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 132
摘要
在分布式群件系统中,用户共享的对象受到并发性和实时性的约束。为了满足这些要求,已经提出了各种利用操作的语义属性的并发控制算法(C.A. Ellis和S.J. Gibbs, 1989;A. Karsenty和M. Beaudouin-Lafon, 1993;C. Sun et al., 1996)。通过对并发操作排序,它们通常保证每个对象的不同副本的一致性。然而,在某些情况下,它们可能导致不一致的副本,不尊重用户的意图,并且需要撤消和重做一些操作。本文的主要目标是提出一种在分布式和移动协作环境中克服这些缺点的算法。该算法基于用户意图的概念,并通过利用和结合一些一般的语义属性(如向前/向后转置)来构建等效历史。
Concurrent operations in a distributed and mobile collaborative environment
In a distributed groupware system, objects shared by users are subject to concurrency and real time constraints. In order to satisfy these, various concurrency control algorithms have been proposed that exploit the semantic properties of operations (C.A. Ellis and S.J. Gibbs, 1989; A. Karsenty and M. Beaudouin-Lafon, 1993; C. Sun et al., 1996). By ordering concurrent operations, they generally guarantee consistency of the different copies of each object. However, in some situations they can result in inconsistent copies, a non respect of user's intentions, and in the need to undo and redo some operations. The principle objective of the paper is to present an algorithm that overcomes these drawbacks in distributed and mobile collaborative environments. The algorithm is based on the notion of user intention, and also on the construction of equivalent histories by exploiting and combining some general semantic properties such as forward/backward transposition.