Complied objective referential constraints in a relational database
having dual chain relationship descriptors linked in data record tables
    1.
    发明授权
    Complied objective referential constraints in a relational database having dual chain relationship descriptors linked in data record tables 失效
    具有链接在数据记录表中的双链关系描述符的关系数据库中的合并目标参考约束

    公开(公告)号:US5133068A

    公开(公告)日:1992-07-21

    申请号:US754227

    申请日:1991-08-28

    IPC分类号: G06F12/00 G06F7/00 G06F17/30

    CPC分类号: G06F17/30371

    摘要: An implementation of referential integrity in which descriptions of referential constraints are compiled into meta-data descriptions of the constraint rules and specifications. The meta-data descriptions of the constraints are stored in the form of objects called relationship descriptors. Each relationship descriptor contains a complete description of a referential constraint, either directly or by means of pointers to other objects such as record and index descriptors which contain information comprised in the constraint's specification. The relationship descriptors are linked into two types of chains by symbolic pointers. One type of relationship descriptor chain connects all relationship descriptors which have a common parent table. The other type of relationship descriptor chain connects relationship descriptors with common dependent tables. Both types of chains are anchored in respective fields in the tables' record descriptors. The use of meta-data descriptors facilitates both ready modification of the constraints, and speedy enforcement of the constraints by a single, shared procedure which may be embedded in the data base manager.

    Method for referential constraint enforcement in a database management
system
    2.
    发明授权
    Method for referential constraint enforcement in a database management system 失效
    在数据库管理系统中引用约束执行的方法

    公开(公告)号:US4947320A

    公开(公告)日:1990-08-07

    申请号:US219513

    申请日:1988-07-15

    IPC分类号: G06F12/00 G06F9/44 G06F17/30

    摘要: A method is disclosed for enforcing referential constraints on a record-by-record basis, immediately before or after each record is manipulated and while the record is still accessed, significantly improving the system's performance. Each record is visited only once to do both the constraint checking and the manipulation (insert/update/delete). If the constraint checking fails, then the entire relational operation of which the record manipulation is a part is backed out. For insertions, each record is first inserted 30, and then constraints respective the record are enforced 32,34. For updates, the record is updated 48 after constraints respecting the record's primary key are enforced 40,42, and before constraints respecting its foreign key(s) are enforced 44,46. Deletions are performed 52 before the constraints on the deleted record are enforced 54,56. Cascade deleted 58 are handled recursively 60. The method correctly processes cyclic constraints and self-referencing rows without special handling.