By Topic

Specifying and enforcing association semantics via ORN in the presence of association cycles

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
B. K. Ehlmann ; Dept. of Comput. Sci., Southern Illinois Univ., Edwardsville, IL, USA ; G. A. Riccardi ; N. D. Rishe ; Jinyu Shi

Object Relationship Notation (ORN) is a declarative scheme that allows a variety of common relationship types to be conveniently specified to a database management system (DBMS), thereby allowing their semantics to be automatically enforced by the DBMS. ORN can be integrated into any data model that represents binary associations or DBMS that implements them. We give a brief description of ORN syntax and semantics and provide algorithms that can be used to implement ORN. These algorithms must deal with the presence of association cycles in the database. We explore in detail the problems caused by such cycles and how ORN and its implementation deal with them, and we show that ORN semantics are noncircular and unambiguous.

Published in:

IEEE Transactions on Knowledge and Data Engineering  (Volume:14 ,  Issue: 6 )