A guide to the SQL standard
Controlling propagation of operations using attributes on relations
OOPSLA '88 Conference proceedings on Object-oriented programming systems, languages and applications
Relational database writings (1985–1989)
Relational database writings (1985–1989)
The object database standard: ODMG 2.0
The object database standard: ODMG 2.0
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Object-Oriented Databases: Definition and Research Directions
IEEE Transactions on Knowledge and Data Engineering
Object Related Plus: A Practical Tool for Developing Enhanced Object Databases
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
A Run-Time Execution Model for Referential Integrity Maintenance
Proceedings of the Eighth International Conference on Data Engineering
Referential Integrity Revisited: An Object-Oriented Perspective
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
A Relationship Mechanism for a Strongly Typed Object-Oriented Database Programming Language
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Incorporating Object Relationship Notation (ORN) into SQL: revisited
Proceedings of the 44th annual Southeast regional conference
Incorporating Object Relationship Notation (ORN) into SQL: revisited
Proceedings of the 44th annual Southeast regional conference
| Hi-index | 0.00 |
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.