Skip Navigation

The Computer Journal 1988 31(4):336-343; doi:10.1093/comjnl/31.4.336
© 1988 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 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 Orman, L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Functional Database Constraints

L. Orman

Cornell University, Graduate School of Management, Ithaca, NY 14853, USA

Received 1 October 1986; A general notation is developed based on functional languages and Horn clauses to express database constraints. A general notation not only provides a medium for a comprehensive study of all database constraints, as opposed to individual types of constraints, but it also reveals that constraints constitute a major building block of many other database components. In that respect, they are likely to aid in the study of all of those components ranging from queries and transactions to derivations and design algorithms. A universal building block is also likely to be the first step in the development of a unifying theory.


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.