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

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. In this paper, 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.