Method and apparatus for concurrent modification of an index tree in a transaction processing system utilizing selective indication of structural modification operations

    公开(公告)号:PH27313A

    公开(公告)日:1993-05-28

    申请号:PH38442

    申请日:1989-04-06

    Applicant: IBM

    Abstract: A database system in a data processing system has an index tree structure with a root node having reference keys to nodes in the next lower level and so on until bottom nodes having keys referencing the database records. Multiple users may access the database concurrently. Transactions in which the tree structure is to be modified (for example removal of a record) are performed by traversing the tree to the appropriate bottom node and setting an indication of pendency of the modification. At the same time other accesses to the database, through nodes at which no tree structure modifications are to take place, can continue. When the structure modification has been performed, a log record of it is made to prevent undoing the modification in the event of a system failure, and database access through all the bottom nodes then continues.

    METHOD FOR CONCURRENT RECORD ACCESS USING AN INDEX TREE

    公开(公告)号:CA1285072C

    公开(公告)日:1991-06-18

    申请号:CA573154

    申请日:1988-07-27

    Applicant: IBM

    Abstract: METHOD FOR CONCURRENT RECORD ACCESS USING AN INDEX TREE A method for fetching key record data in a group of record keys according to at least a portion or a key record through an index tree is provided. The index tree provides concurrent accesses of record keys by different transactions. The index tree includes a root node connected to at least one level of nodes, each node having a key record reference to one of more nodes in a next successive level and having bottom nodes that provide access to the key data. The method consists of the steps of (1) traversing across said nodes from said root node by using said key record portion until a bottom node is reached; (2) limiting all but read accesses to the node being traversed and a previously accessed node, to other concurrent transactions; (3) identifying said key record in said bottom node; (4) limiting all but read accesses to said key record; (5) removing all access limitations to traversed nodes; (6) fetching key record data; and (7) removing the access limitation to the key record after the record data has been fetched. Further, methods for inserting and deleting record keys are provided. Additionally, a method for changing the index tree structure while allowing concurrent accesses to take place is provided.

    USER DEFINED PRINTER CONTROL
    5.
    发明专利

    公开(公告)号:CA1274320A

    公开(公告)日:1990-09-18

    申请号:CA534762

    申请日:1987-04-15

    Applicant: IBM

    Abstract: AT9-85-032 A method of, and apparatus for, controlling the printing functions of a printer from an application running on a processing system. The application comprises a user interface for inserting and defining a generic printer control within the text of a document to be printed to control printer functions. This is a generic control that can be defined to be any printer function desired. The user interface comprises a menu for selecting a control number within a document text, and a printer function table for correlating the control number with a printer control sequence that specifies a printing function.

    Method for concurrent record access insertion deletion and alteration using an index tree

    公开(公告)号:PH26386A

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

    申请号:PH37747

    申请日:1988-10-28

    Applicant: IBM

    Abstract: A data base system on a computer uses an index tree containing record keys which reference associated records in the data base. The tree, which comprises a root node extending through intermediate nodes to leaf nodes, provides concurrent accesses to a plurality of users. When changes are to be made to the key structure, action has to be taken to prevent users, other than the user making the change, from corrupting the data or receiving corrupted data. To do this, when one user is inserting or deleting a key and its associated record, all accesses to a node being traversed by this user and the immediately traversed mode are limited to read accesses by other users. At the leaf node, all accesses by others to the key and record being added or deleted are prevented together with accesses to the next successively located record key and its associated record. After the deletion or insertion, the access limitations are removed.

Patent Agency Ranking