公开(公告)号：CA2327167A1

公开(公告)日：2002-05-30

申请号：CA2327167

申请日：2000-11-30

Applicant: IBM CANADA

Inventor： CHAN VICTOR ,  WANG FEN ,  HUBBARD MARK W ,  CHIN HOWARD CHUN

IPC: G06F17/30

Abstract: A system and method of composing a query object for application against a database is provided. The method composes a selection clause for the query. Next, a criteria clause for the query is generated, with the criteria clause comprising input criteria relat ed to the query and additional criteria specified against the query and generated criteria based on a joint relationship. Next a source clause utilizing elements in the database accessed by the quer y is generated. A database traversal system and method is provided. The method identifies all tables directly accessible by each table and creating a data structure comprising an entry for each table. The entry comprises an identification field for each table and a link field identifying the all tables directly accessible by each table. The data structure is traversed and an optimum path of the traversal paths utilizing data obtained from traversing the data structure is identified.

公开(公告)号：CA2327167C

公开(公告)日：2007-10-16

申请号：CA2327167

申请日：2000-11-30

Applicant: IBM CANADA

Inventor： CHIN HOWARD CHUN ,  CHAN VICTOR ,  HUBBARD MARK W ,  WANG FEN

Abstract: A system and method of composing a query object for application against a database is provided. The method composes a selection clause for the query. Next, a criteria clause for the query is generated, with the criteria clause comprising input criteria relat ed to the query and additional criteria specified against the query and generated criteria based on a joint relationship. Next a source clause utilizing elements in the database accessed by the quer y is generated. A database traversal system and method is provided. The method identifies all tables directly accessible by each table and creating a data structure comprising an entry for each table. The entry comprises an identification field for each table and a link field identifying the all tables directly accessible by each table. The data structure is traversed and an optimum path of the traversal paths utilizing data obtained from traversing the data structure is identified.