中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

3 records (took 0.024 seconds)

    SYSTEM AND METHOD FOR EFFICIENT ANALYSIS OF RELATIONAL DATABASE OBJECTS
    1.
    发明专利
    SYSTEM AND METHOD FOR EFFICIENT ANALYSIS OF RELATIONAL DATABASE OBJECTS 未知

    公开(公告)号：CA1304506C

    公开(公告)日：1992-06-30

    申请号：CA593250

    申请日：1989-03-09

    Applicant: IBM

    Inventor： CHANG PHILIP Y ,  COYLE DANIEL J JR ,  HOWIE LAUREN D ,  LINDSAY BRUCE G

    IPC: G06F17/30 ,  G06F15/40

    Abstract: AT9-88-013 SYSTEM AND METHOD FOR EFFICIENT ANALYSIS OF RELATIONAL DATABASE OBJECTS A plurality of packed descriptions is provided as a column in a table each entry containing data defining attributes associated with a different object (such as a table or view defined to the database) and all its component objects (such as related columns and indexes). Accessing the row corresponding to a particular object returns a description of all of the attributes of the object's component objects, as well as information describing the object itself. The packed description information is redundantly stored conventionally in other system catalogs for use IN at IN querying physical definitions of objects in a manner consistent with other database products. The database state information comprising the packed descriptions is retained in internal format whereas the correlative redundant information is in a user-readable external format. By denormalizing the schema for schema data whereby identifying relationships between objects is simplified, time required for compilation of statements referencing objects is substantially, reduced. All information concerning attributes of an object specified in statement and its component objects necessary, to compile the statement may thereby be fetched from the packed description field corresponding to the object in one I/O operation. Objects descriptions must otherwise be retrieved from numerous I/Os to separate system catalogs and rows collectively containing the descriptions.

    FAST DIRECT OUTPUT DURING SORT MERGE
    2.
    发明专利
    FAST DIRECT OUTPUT DURING SORT MERGE 未知

    公开(公告)号：CA1290456C

    公开(公告)日：1991-10-08

    申请号：CA589118

    申请日：1989-01-25

    Applicant: IBM

    Inventor： CHANG PHILIP Y ,  COYLE DANIEL J JR ,  MALKEMUS TIMOTHY R ,  RODRIGUEZ REBECCA A ,  WELTI PHILIP J

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

    Abstract: AT9-88-011 In a relational database system, a method is utilized that increases the performance of the sort operation. An optimizer routine in the relational database manager analyzes a user's complete query to determine whether the final sorted results can be used directly by the user as sorting occurs. If the sort results can be used, the sort results are sent to Relational Data Services in the relational database manager for output to the user. Depending upon the determination made by the optimizer routine, one of two output modes for the final sorted sequence string of data are selected by the relational database manager. In disk output mode, the last pass of the final sorted sequence string is written to disk. In fast direct output mode, the records of data are sent to the user as the final sorted sequence string is being merged during the last pass. The system and method of this invention reduces the total sort time by eliminating the overhead of writing to disk during the fast direct output mode. Also, the response time, or availability for each record is reduced since each record is retrieved or sent to the Relational Data Services immediately after it has been sorted into the final sort order instead of completing the entire sort first, and then writing to disk.

Patent Agency Ranking