Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Semantic integrity enforcement in centralized DBMS and distributed DBMS based on slow (geographically distributed) and fast (local area) networks
Badal D. Information Systems9 (2):121-138,1984.Type:Article
Date Reviewed: Oct 1 1985

In this paper we investigate techniques for decreasing the overhead of semantic integrity enforcement or equivalently the overhead of transaction validation with respect to a set of semantic integrity (SI) assertions. We discuss the problem of semantic integrity enforcement from two points of view. First we describe three approaches to decrease the overhead of SI enforcement. Second we analyze the cost of several SI enforcement methods in centralized and distributed database systems based on slow and fast (local) networks.

--Author’s Abstract

I’m afraid I didn’t find this paper very valuable in assessing semantic integrity enforcement techniques. The three approaches suggested to decrease overhead seem terribly obvious, and their presentation seems somewhat superficial. For example, one suggestion is to associate with an integrity assertion X a condition Y describing circumstances under which a transaction could not violate assertion X. The paper does not point out that whether or not this actually decreases overhead depends on the complexity of evaluating condition Y, nor does it cite any examples of X and Y with cost comparisons.

It would also have been helpful to see in the presentation of the cost analysis some additional material to help the reader evaluate the validity of the conclusions, or even the validity of the simulation model used in the cost analysis.

Reviewer:  F. Manola Review #: CR108998
Bookmark and Share
 
Transaction Processing (H.2.4 ... )
 
 
Design Studies (C.4 ... )
 
 
Distributed Databases (H.2.4 ... )
 
 
Distributed Databases (C.2.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Transaction Processing": Date
Simplification rules and complete axiomatization for relational update transactions
Karabeg D., Vianu V. ACM Transactions on Database Systems 16(3): 439-475, 1991. Type: Article
May 1 1992
Observations on optimistic concurrency control schemes
Härder T. Information Systems 9(2): 111-120, 1984. Type: Article
Jun 1 1985
Compatibility and commutativity of lock modes
Mohan C., Fussell D., Silberschatz A. (ed) Information and Control 61(1): 38-64, 1984. Type: Article
Oct 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy