Granularity of locks in a shared data base

Gray, Jim; Lorie, Raymond A.; Putzolu, G. R.

doi:10.1145/1282480.1282513

Cited by 252 publications

(181 citation statements)

References 0 publications

Supporting

Mentioning

176

Contrasting

Unclassified

Order By: Relevance

“…In [14], they have defined the following types of lock modes for coarse and fine granules for relational databases. It is extended to object oriented databases as follows.…”

Section: Types and Granul Arity Of Locks Based On Methods Types For Inmentioning

confidence: 99%

Semantic Multi-granular Lock model for Object Oriented Distributed Systems

Geetha¹,

Sreenath²

2013

IJITCS

View full text Add to dashboard Cite

Abstract-In object oriented distributed systems (OODS), the objects are viewed as resources. Concurrency control techniques are usually applied on the database tier. This has the limitations of lack of support of legacy files and requirement of separate concurrency control mechanis ms for each database model. Hence concurrency control on the objects at server tier is explo red. To imp lement concurrency control on the objects participating in a system, the impact of method types, properties and class relationships namely inheritance, association and aggregation are to be analyzed. In this paper, the types and properties of classes and attributes are analysed. The semantics of the class relationships are analysed to ascertain their lock modes, granule sizes for defining concurrency control in OODS. It is also intended to propose compatibility matrix among all these object relationships.

show abstract

“…In [14], they have defined the following types of lock modes for coarse and fine granules for relational databases. It is extended to object oriented databases as follows.…”

Section: Types and Granul Arity Of Locks Based On Methods Types For Inmentioning

confidence: 99%

Semantic Multi-granular Lock model for Object Oriented Distributed Systems

Geetha¹,

Sreenath²

2013

IJITCS

View full text Add to dashboard Cite

show abstract

“…In order to provide reasonable performance for a wide spectrum of user requirements, the RSS supports multiple levels of consistency which control the isolation of a user from the actions of other concurrent users (see also [13]). When a transaction is started at the RSI, one of three consistency levels must be specified.…”

Section: Concurrency Controlmentioning

confidence: 99%

“…For example, locks on single tuples are effective for transactions which access small amounts of data, while locks on entire relations or even entire segments are more reasonable for transactions which cause the RDS to access large amounts of data. In order to accommodate these differences, a dynamic lock hierarchy protocol has been developed so that a small number of locks can be used to lock both few and many objects [13]. The basic idea of the scheme is that separate locks are associated with each granularity of object, such as segment, relation, and tuple.…”

Section: Concurrency Controlmentioning

confidence: 99%

System R: Relational Approach to Database Management

Astrahan

Blasgen

Chamberlin

et al. 1989

Readings in Artificial Intelligence and Databases

101

View full text Add to dashboard Cite

System R is a database management system which provides a high level relational data interface. The system provides a high level of data independence by isolating the end user as much as possible from underlying storage structures. The system permits definition of a variety of relational views on common underlying data. Data control features are provided, including authorization, integrity assertions, triggered transactions, a logging and recovery subsystem, and facilities for maintaining data consistency in a shared-update environment.This paper contains a description of the overall architecture and design of the system. At the present time the system is being implemented and the design evaluated. We emphasize that System R is a vehicle for research in database architecture, and is not planned as a product.

show abstract

“…TM systems must provide transaction atomicity (all or nothing) and isolation (the partially-complete state of a transaction is hidden from other transactions) [9]. Providing these properties requires data version management and conflict detection, whose implementations distinguish alternative TM proposals.…”

Section: Introductionmentioning

confidence: 99%