Skip Navigation

The Computer Journal 1984 27(3):209-217; doi:10.1093/comjnl/27.3.209
© 1984 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Prakash, N.
Right arrow Articles by Bolloju, N.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Specifying Integrity Constraints in a Network DBMS

N. Prakash *, N. Parimala * and N. Bolloju *

R & D Group, Group Maintenance Corporation Limited, 4-3596/A, Posnett Bhavan, 7th Floor, Tilak Road, Hyderabad, India

A range of integrity constraints that can be specified on a schema expressed in the network model of data is presented. These integrity constraints can be of three kinds. The first, called value sets, define values which fields of a record type can take on. The second kind can be specified on a record type and the third kind can be specified on a set type. A mechanism which determines integrity constraints of a schema which are applicable to a subschema is described. It is required that all such constraints be explicitly stated in the subschema and that all constraints explicitly stated should be applicable to the subschema concerned. In order to state applicable constraints it may become necessary to include additional structure in the subschema. The implications of this additional structure are discussed.


Received October 1982.

* R & D Group, Computer Maintenance Corporation Limited, 4-3596/A, Posnett Bhavan, 7th Floor, Tilak Road, Hyderabad 500 001, India


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.