中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

30 records (took 0.018 seconds)

    2.
    发明专利
    未知

    公开(公告)号：DE60130840T2

    公开(公告)日：2008-07-17

    申请号：DE60130840

    申请日：2001-07-06

    Applicant: IBM

    Inventor： HUSSAIN RIAZ Y ,  JOHN CHESTER CHARLES ,  LEVINE FRANK ELIOT ,  RICHARDSON CHRISTOPHER MICHAEL

    IPC: G06F11/34 ,  G06F11/32 ,  G06F11/36

    Abstract: An apparatus and method for cataloging symbolic data for use in performance analysis of computer programs is provided. The apparatus and method stores symbolic data for loaded modules during or shortly after a performance trace and utilizes the stored symbolic data when performing a performance analysis at a later time. A merged symbol file is generated for a computer program, or application, under trace. The merged symbol file contains information useful in performing symbolic resolution of address information in trace files for each instance of a module. During post processing of the trace information generated by a performance trace of a computer program, symbolic information stored in the merged symbol file is compared to the trace information stored in the trace file. The correct symbolic information in the merged symbol file for loaded modules is identified based a number of validating criteria. The correct symbolic information for the loaded modules may then be stored as an indexed database that is used to resolve address information into corresponding symbolic information when providing the trace information to a display for use by a user.

    3.
    发明专利
    未知

    公开(公告)号：DE60130840D1

    公开(公告)日：2007-11-22

    申请号：DE60130840

    申请日：2001-07-06

    Applicant: IBM

    Inventor： HUSSAIN RIAZ Y ,  JOHN CHESTER CHARLES ,  LEVINE FRANK ELIOT ,  RICHARDSON WINCHESTER

    IPC: G06F11/34 ,  G06F11/32 ,  G06F11/36

    Abstract: An apparatus and method for cataloging symbolic data for use in performance analysis of computer programs is provided. The apparatus and method stores symbolic data for loaded modules during or shortly after a performance trace and utilizes the stored symbolic data when performing a performance analysis at a later time. A merged symbol file is generated for a computer program, or application, under trace. The merged symbol file contains information useful in performing symbolic resolution of address information in trace files for each instance of a module. During post processing of the trace information generated by a performance trace of a computer program, symbolic information stored in the merged symbol file is compared to the trace information stored in the trace file. The correct symbolic information in the merged symbol file for loaded modules is identified based a number of validating criteria. The correct symbolic information for the loaded modules may then be stored as an indexed database that is used to resolve address information into corresponding symbolic information when providing the trace information to a display for use by a user.

    7.
    发明专利
    未知

    公开(公告)号：DE68926693T2

    公开(公告)日：1997-01-23

    申请号：DE68926693

    申请日：1989-02-24

    Applicant: IBM

    Inventor： ELLIOTT LINDA CAROLYN ,  HORN GARY RANDALL ,  JODAN LLOYD EUGENE ,  LEVINE FRANK ELIOT ,  SHIH GENG-FONG ,  MYRE WILLIAM WALTER

    IPC: G06F11/14 ,  G06F12/00 ,  G06F7/22

    Abstract: System and method for reducing data loss in a database system during I/O errors and power failure during non-atomic writes to media in a transaction management system using write-ahead logging protocol. A recovery log is written during forward processing. On system restart processing, the log is traversed and a REDO executed. Recovery is effected from detected incomplete log writes or log write failures and uncommitted transactions are undone. A technique is provided in which files having I/O errors are identified, whereby subsequent restart operations are prevented from accessing these files. In one embodiment index files with such error are renamed, serving to indicate that corresponding original files contain errors, and the error index files are automatically rebuilt whereby I/O error on the files causes no data loss. The index file rebuild does not invalidate access plans related to the failed index.

    Tree structure database system
    8.
    发明专利
    Tree structure database system 未知

    公开(公告)号：HK71296A

    公开(公告)日：1996-05-03

    申请号：HK71296

    申请日：1996-04-25

    Applicant: IBM

    Inventor： LEVINE FRANK ELIOT ,  MOHAN CHANDRESEKARAN

    IPC: G06F17/30 ,  G06F12/00

    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.

    9.
    发明专利
    未知

    公开(公告)号：BR8901659A

    公开(公告)日：1989-11-21

    申请号：BR8901659

    申请日：1989-04-07

    Applicant: IBM

    Inventor： LEVINE FRANK ELIOT ,  MOHAN CHANDRASEKARAN

    IPC: G06F12/00 ,  G06F17/30 ,  G06F15/40

    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.

Patent Agency Ranking