Lecture Notes in Computer Science
DOI: 10.1007/bfb0022173
|View full text |Cite
|
Sign up to set email alerts
|

A lock technique for disjoint and non-disjoint complex objects

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…In OODBs, two different objects can share a common object in anunderlying hierarchy [6]. We call the common object a referentially shared object (RSO).…”
Section: Nested Methods Invocationmentioning
confidence: 99%
“…In OODBs, two different objects can share a common object in anunderlying hierarchy [6]. We call the common object a referentially shared object (RSO).…”
Section: Nested Methods Invocationmentioning
confidence: 99%
“…Unfortunately, while this is relatively simple and actually implemented in our system for the case of disjoint complex objects, it seems that the case of complex objects with referentially shared subobjects has not yet been completely solved (Garza and Kim, 1988;Herrmann et al, 1990;Haerder et al, 1992).…”
Section: Multi-granularity Lockingmentioning
confidence: 97%
“…This goal is similar to our goal of efficiently implementing atomic operations in parallel programs. In fact, database researchers have identified lock granularity as a key issue in the implementation of atomic transactions and found that excessive lock overhead can be a significant problem if the lock granularity is too fine [3,9].…”
Section: Database Concurrency Controlmentioning
confidence: 99%