N. S. Barghouti and G. E. Kaiser. Concurrency control in advanced database applications. ACM Computing Surveys, 23(3):269-317, Sep. 1991.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....We next examine each of these approaches. 16 7. 1 Communication through artifact sharing The understanding that users in a collaborative process share artifacts (such as documents, code) is deeply rooted in PCSDE [49] The mechanisms employed are versioning and extended transaction models [50,51]. Functionality at this level is usually tied to the underlying support provided by a database where artifacts are stored. In general, the mechanisms make users aware of possible conflicts and help them resolve such conflicts. Detailed presentation of the complex issues involved is beyond the ....

....support provided by a database where artifacts are stored. In general, the mechanisms make users aware of possible conflicts and help them resolve such conflicts. Detailed presentation of the complex issues involved is beyond the scope of the present paper. Interested readers are referred e.g. to [51] and to [52] In ALF [34] several agents can share a single role, which allows them to work in the same working context, therefore sharing information di#erent contexts can share artifact instances. OIKOS [15] o#ers a rich set of metaphors that handle di#erent levels of cooperation: the ....

N. S. Barghouti, G. E. Kaiser, Concurrency control in advanced database applications, ACM Computing Surveys 23 (3) (1991) 269 -- 317.

....serves as an access filter upon all repository accesses, so called transparent versioning. Finally, the work performed by one user (or a group thereof) may be embedded in a transaction. Throughout this paper, the term transaction will primarily refer to cooperative, long lasting transactions [21], 22] which may be associated to change requests or change sets. We will not focus on classical short ACID transactions ( ACID stands for atomicity, consistency, isolation, and durability; see [23] Each transaction owns a subdatabase, which contains a part of the overall versioned database. ....

N.S. Barghouti and G.E. Kaiser, "Concurrency Control in Advanced Database Applications," ACM Computing Surveys, vol. 23, no. 3, pp. 269-317, Sept. 1991.

....models 3.6.1 Hierarchical transactions cf. multi level file systems. Ex. Commercial DBMSes: DAMOKLES [DGL86] ORION [KGBW90] ObjectStore [LLOW91] ONTOS [AHS91] and DEC s Object DB [Cor92] Ex. Research DBMSes: Gandalf [Not85] ISTAR [Dow86] MIT PhD work [Mos85] CAD DBs [KKB88] Marvel [BK91] and Adele [BEM91] Natural subproject breakdown. Still ACID: children s updates only visible after commit, must reconcile possible update conflicts. may handle partial aborts by compensation. User def. consistency rules in DAMOKLES and Adele. How to partition and plan serializeable ....

Naser S. Barghouti and Gail E. Kaiser. Concurrency Control in Advanced Database Applications. ACM Computing Surveys, 23(3):269--317, September 1991.

....serves as an access filter upon 411 repository accesses, so called transparent vetstoning. Finally, the work performed by one user (or a group thereof) may be embedded in a transaction. Throughout this paper, the term transaction will always refer to co operative, long lasting transactions [21], 22] which may be associated to change requests or change sets. We will ignore classical short ACID transactions completely ( ACID stands for atomJetty, consistency, isolation, and durability; see [23] Each transaction owns a subdatabase, which contains a part of the overall versioned ....

Naser S. Barghouti and Gail E. Kaiser, "Concurrency control in advanced database applications," ACM Computing Surveys, vol. 23, no. 3, pp. 269-317, Sept. 1991.

....right before the application is approved or rejected, the preconditions can be rechecked, as shown in figure 3. This technique is analogous to concurrency techniques used in data caching before the cached information is written back, a check is made to see if something changed in the meantime [3]. While this technique is simple, it is not fully satisfying. For if some precondition is violated early on in a lengthy approval process, the rest of the processing will be in vain. Our common sense instinct is that the system should stop processing the application as soon as the violation ....

....and describes in detail both commercial and research implementations of event based workflow. Other work has also looked at publish subscribe in relationship to integration [26, 27] More formal looks at workflow and the problem of long transactions provide a syntactic and semantic perspective [3, 28, 29]. On attempts to describe the context of a system, Abecker et al. [13] details an approach to defining ontologies. Earlier, we pointed out that long transactions can be considered from the perspective of the frame problem [9, 10] In related distributed computing work, software programmers have ....

N. S. Barghouti and G. E. Kaiser, "Concurrency Control in Advanced Database Applications," ACM Computing Surveys, vol. 23, pp. 260-317, 1991.

....of DB queries, according to a lazy or eager strategy. Actions are governed by rules with a triggering mechanims (pre and post conditions, plus imperative code) The process is a set of tasks created dynamically. The model can be managed in a dynamic and flexible way. 3.1. 10 Marvel Marvel [37][38] is a rule based system. The project rule set describes specific process features . Activation rules . Inference rules (e.g. to determine the relationships among objects) The project type set provides an object oriented description of data. The project tool set describes the ....

N. Barghuti, G. Kaiser, "Concurrency control in advanced database applications", ACM Computing Surveys, 23(3), September 1991

....focuses on unaddressed issues of control. 2 Technical issues of network protocols covering modular design and layering of abstraction levels are summarized in [28] and [29] Additional issues of concurrency control covering serializability, record locking, and recovery are also described in [2] and [3] 3 For a reference on software measurement issues see [10] and for assessing project risk and complexity [4, 16] Specific issues of relational database design and data manipulation are covered in [8] and [6] Issues of cooperative software development are covered in [15] Improving ....

Barghouti, N.S. and G.E. Kaiser, Concurrency Control in Advanced Database Applications. ACM Computing Surveys, 1991. 23(3): p. 269-317.

....serves as an access lter upon all repository accesses, so called transparent versioning. Finally, the work performed by one user (or a group thereof) may be embedded in a transaction. Throughout this paper, the term transaction will primarily refer to cooperative, long lasting transactions [21], 22] which may be associated to change requests or change sets. We will not focus on classical short ACID transactions ( ACID stands for atomicity, consistency, isolation, and durability; see [23] Each transaction owns a subdatabase, which contains a part of the overall versioned database. ....

Naser S. Barghouti and Gail E. Kaiser, \Concurrency control in advanced database applications," ACM Computing Surveys, vol. 23, no. 3, pp. 269-317, Sept. 1991.

....is less than optimal on newer platforms, primarily because the speed of synchronization primitives (such as spinlocks) has not increased as rapidly as the speed of other instructions. There has also been great progress in the area of multiprocessor synchronization primitives (citations [BK91, Her91, Her93, SSHT93] give an overview of several areas of recent progress) However, synchronization requires global processing. Global processing is very costly in comparison to local processing and can be expected to become even more expensive as technology advances [HJ91, SC91] We therefore decided to abandon the ....

N. S. Barghouti and G. E. Kaiser. Concurrency control in advanced database applications. ACM Computing Surveys:, September 1991.

....simpler application speci c algorithms that do not incur the performance penalties associated with strict ACID properties. Semantics and Performance Past work in the database community has recognized the evolutionary model of database applications, and their changing semantic requirements [5]. While other approaches to address these changes give limited concessions for increased concurrency, we want to focus instead on the tradeo between semantics and performance. Given these arguments against existing approaches in current database research, we decided to develop a new XML storage ....

....and Poet for Electronic Data Interchange) both of them provide ACID semantics, which imposes additional overhead on performance and concurrency. 8. 2 Relaxed Semantics in Databases Past work in the database community has recognized the changing semantic requirements of database applications [5]. Several approaches have been taken in the context of full ACID database systems to maximize concurrency by taking advantage of these weaker semantic needs. 32 Some of these e orts have focused on how semantic information on datatypes can be exploited to safely trade serializability or ....

Naser S. Barghouti and Gail E. Kaiser. Concurrency control in advanced database applications. ACM Computing Surveys, 23(3):269-317, September 1991.

No context found.

N. S. Barghouti and G. E. Kaiser. Concurrency control in advanced database applications. ACM Computing Surveys, 23(3):269-317, Sep. 1991.

No context found.

N. S. Barghouti and G. E. Kaiser. Concurrency Control in Advanced Database Applications. In ACM Computing Surveys, volume 23, pages 269--317, Sept 1991.

No context found.

N. S. Barghouti and G. E. Kaiser. Concurrency control in advanced database applications. In ACM Computing Surveys, volume 23, pages 269-317, Sept. 1991.

No context found.

Naser S. Barghouti and Gail E. Kaiser. Concurrency control in advanced database applications. ACM Computing Surveys, 23(3):269--317, 1991.

No context found.

N. S. Barghouti and G. E. Kaiser. Concurrency control in advanced database applications. ACM Computing Surveys, 23(3):269--317, 1991.

No context found.

N. S. Barghouti and G. E. Kaiser. Concurrency Control in Advanced Database Applications. In ACM Computing Surveys, volume 23, pages 269--317, Sept 1991.

No context found.

N. Barghouti and G. Kaiser. Concurrency control in advanced database applications. ACM Computing Surveys, 23(3), September 1991.

No context found.

Barghouti, N. S., and Kaiser, G. E. Concurrency control in advanced database applications. ACM Computing Surveys 23, 3 (September 1991), 269{ 317. 121

No context found.

# Barghouti, N. and Kaiser, G. Concurrency Control in Advanced Database Applications. ACM Computing Surveys 23, 3 (September 1991), 269-317.

No context found.

N. S. Barghouti and G. E. Kaiser. Concurrency control in advanced database applications. In ACM Computing Surveys, volume 23, pages 269-317, Sept. 1991.

No context found.

N. Barghouti, G. Kaiser. Concurrency Control in Advanced Database Applications. ACM Computing Surveys, 23:3, pp. 269317, September 1991. 9

No context found.

N. S. Barghouti and G. E. Kaiser. Concurrency Control in Advanced Database Applications. In ACM Computing Surveys, volume 23, pages 269--317, Sept 1991.

No context found.

N.S. Barghouti and G.E. Kaiser. Concurrency control in advanced database applications. ACM Computing Surveys, 23(3):269--317, September 1991.

No context found.

N. S. Barghouti and G. E. Kaiser. Concurrency Control in Advanced Database Applications. ACM Computing Surveys, 23(3):269, September 1991.

No context found.

Barghouti, N.S., and G. Kaiser [1991], "Concurrency control in advanced database applications", ACM Comp. Surveys, 23:3, pp. 269-318.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC