METHOD AND SYSTEM FOR APPLYING COLLATING PROCESSING TREE TO RELATIONAL DATABASE

    公开(公告)号:JPH10247203A

    公开(公告)日:1998-09-14

    申请号:JP916498

    申请日:1998-01-20

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To improve the efficiency of constitution and processing by generating a vector record block through the use of data from plural input records guided from a relation database and applying at least one vector operator of an inquiry processing tree to a block. SOLUTION: The relational database system 20 manages plural databases 24, which are the set of database tables 26. A table 26 includes a row or the set of records 28 and all the records are provided with the same or similar structure. The schema of a table describes a column 30 forming a record in which the data type of its column is included. Then, data is inquired through inquiring language. In order to process inquiry, the system 20 compiles inquiring to an operator tree. For example, input/output is executed by an operator tree in simple inquiry such as SELECT a, sum (b) from t1 group by (a).

    OPTIMIZING DATABASE QUERY PERFORMANCE BY DERIVING QUERY PREDICATES

    公开(公告)号:CA2416368A1

    公开(公告)日:2003-10-16

    申请号:CA2416368

    申请日:2003-01-16

    Applicant: IBM

    Abstract: Database Management Systems (DBMS) manage data stored in tables and proce ss database queries against that stored data. The database queries typically specify search conditions (that is, 'predicates') for qualifying database search results to be output by the DBMS. When a database table definition or query includes a given predicate having an expression that operates on a column of a table, it is useful to know whether the expression is monotonic. If the expression is determined to be monotonic, the present invention provides operations for deriving a new predicate from the given predicate for use in a new database query. Advantageously, the use of a new or derived predicate improves operational efficiency of the DBM S. Operation is provided for detecting a type of monotonicity related to the expression, and uses the detected type of monotonicity for generating the derived predicate.

    Method and apparatus for maintaining referential integrity within a relational database in data processing system

    公开(公告)号:SG41966A1

    公开(公告)日:1997-08-15

    申请号:SG1995002313

    申请日:1990-05-21

    Applicant: IBM

    Abstract: The invention relates to a method for determining the validity of a new referential constraint brought about by the creation or alteration of a selected data table within a relational data base, in a data processing system, having a plurality of related data tables. According to the invention the method is characterised by the steps of identifying which of the plurality of related data tables will be affected by the existence of the new referential constraint, and verifying the validity of the new referential constraint only upon the identified related data tables. The invention also relates to apparatus for determining the validity of a new referential constraint brought about by the creation or alteration of a selected data table within a relational database (14), in a data processing system (8), having a plurality of related data tables. According to the invention the apparatus comprises means (14, 18) for identifying which of the plurality of related data tables will be affected by the existence of the new referential constraint, and means for verifying the validity of the new referential constraint only upon the identified related tables.

    4.
    发明专利
    未知

    公开(公告)号:DE69030282D1

    公开(公告)日:1997-04-30

    申请号:DE69030282

    申请日:1990-05-21

    Applicant: IBM

    Abstract: The invention relates to a method for determining the validity of a new referential constraint brought about by the creation or alteration of a selected data table within a relational data base, in a data processing system, having a plurality of related data tables. According to the invention the method is characterised by the steps of identifying which of the plurality of related data tables will be affected by the existence of the new referential constraint, and verifying the validity of the new referential constraint only upon the identified related data tables. The invention also relates to apparatus for determining the validity of a new referential constraint brought about by the creation or alteration of a selected data table within a relational database (14), in a data processing system (8), having a plurality of related data tables. According to the invention the apparatus comprises means (14, 18) for identifying which of the plurality of related data tables will be affected by the existence of the new referential constraint, and means for verifying the validity of the new referential constraint only upon the identified related tables.

    5.
    发明专利
    未知

    公开(公告)号:DE69030282T2

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

    申请号:DE69030282

    申请日:1990-05-21

    Applicant: IBM

    Abstract: The invention relates to a method for determining the validity of a new referential constraint brought about by the creation or alteration of a selected data table within a relational data base, in a data processing system, having a plurality of related data tables. According to the invention the method is characterised by the steps of identifying which of the plurality of related data tables will be affected by the existence of the new referential constraint, and verifying the validity of the new referential constraint only upon the identified related data tables. The invention also relates to apparatus for determining the validity of a new referential constraint brought about by the creation or alteration of a selected data table within a relational database (14), in a data processing system (8), having a plurality of related data tables. According to the invention the apparatus comprises means (14, 18) for identifying which of the plurality of related data tables will be affected by the existence of the new referential constraint, and means for verifying the validity of the new referential constraint only upon the identified related tables.

    6.
    发明专利
    未知

    公开(公告)号:DE68927743T2

    公开(公告)日:1997-08-14

    申请号:DE68927743

    申请日:1989-03-16

    Applicant: IBM

    Abstract: In a relational database system, a method is used that increases the performance of the sort operation. An optimiser routine in the relational database manager analyses 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 optimiser 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. Such an arrangement 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.

    7.
    发明专利
    未知

    公开(公告)号:DE68927743D1

    公开(公告)日:1997-03-20

    申请号:DE68927743

    申请日:1989-03-16

    Applicant: IBM

    Abstract: In a relational database system, a method is used that increases the performance of the sort operation. An optimiser routine in the relational database manager analyses 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 optimiser 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. Such an arrangement 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.

    METHOD AND APPARATUS MADE FOR MAINTAINING REFERENTIAL INTEGRITY WITHIN A RELATIONAL DATABASE

    公开(公告)号:AU629928B2

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

    申请号:AU5506590

    申请日:1990-05-15

    Applicant: IBM

    Abstract: The invention relates to a method for determining the validity of a new referential constraint brought about by the creation or alteration of a selected data table within a relational data base, in a data processing system, having a plurality of related data tables. According to the invention the method is characterised by the steps of identifying which of the plurality of related data tables will be affected by the existence of the new referential constraint, and verifying the validity of the new referential constraint only upon the identified related data tables. The invention also relates to apparatus for determining the validity of a new referential constraint brought about by the creation or alteration of a selected data table within a relational database (14), in a data processing system (8), having a plurality of related data tables. According to the invention the apparatus comprises means (14, 18) for identifying which of the plurality of related data tables will be affected by the existence of the new referential constraint, and means for verifying the validity of the new referential constraint only upon the identified related tables.

Patent Agency Ranking