2.
    发明专利
    未知

    公开(公告)号:DE3781577T2

    公开(公告)日:1993-04-08

    申请号:DE3781577

    申请日:1987-01-02

    Applicant: IBM

    Abstract: A method utilizing a coordinated pair of locking limits for managing concurrency and lock granularity tradeoff relations. A first limit is placed on the number of small granularity locks per resource. A second limit is placed on the number of locks assignable to each process. When the first number of small locks is reached, the method withdraws the small locks and grants only one lock to the entire resource (lock escalation). When a process requests an additional lock over the second limit, the lock is refused.

    3.
    发明专利
    未知

    公开(公告)号:DE68926422D1

    公开(公告)日:1996-06-13

    申请号:DE68926422

    申请日:1989-07-12

    Applicant: IBM

    Abstract: 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.

    7.
    发明专利
    未知

    公开(公告)号:DE3781577D1

    公开(公告)日:1992-10-15

    申请号:DE3781577

    申请日:1987-01-02

    Applicant: IBM

    Abstract: A method utilizing a coordinated pair of locking limits for managing concurrency and lock granularity tradeoff relations. A first limit is placed on the number of small granularity locks per resource. A second limit is placed on the number of locks assignable to each process. When the first number of small locks is reached, the method withdraws the small locks and grants only one lock to the entire resource (lock escalation). When a process requests an additional lock over the second limit, the lock is refused.

    8.
    发明专利
    未知

    公开(公告)号:DE68926422T2

    公开(公告)日:1996-11-07

    申请号:DE68926422

    申请日:1989-07-12

    Applicant: IBM

    Abstract: 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.

    10.
    发明专利
    未知

    公开(公告)号:BR8904808A

    公开(公告)日:1990-05-01

    申请号:BR8904808

    申请日:1989-09-22

    Applicant: IBM

    Abstract: 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.

Patent Agency Ranking