公开(公告)号：JPH10320423A

公开(公告)日：1998-12-04

申请号：JP9482898

申请日：1998-04-07

Applicant: INFORMIX SOFTWARE INC

Inventor： KRISHNA MURALI M ,  KASHYAP ANURAG ,  GERBER ROBERT HOWARD ,  TAYLOR PAUL SHERWOOD ,  SHURTS SCOTT ALAN ,  NI SHENGSONG ,  SUNDARESAN PRAKASH

IPC: G06F12/00 ,  G06F17/30

Abstract: PROBLEM TO BE SOLVED: To generate a response to a connection by using a map for erasing a segment which can not satisfy a connected predicate. SOLUTION: A connection has a connected predicate between a 1st table having plural 1st fragments and a 2nd table having plural 2nd fragments and concerning the respective correspondent fragments from the 1st table, a retrieved connection fragment identifies a fragment from the 2nd table including a record satisfying the connected predicate with a record from a correspondent fragment from the 1st table. In order to delete the other fragments, a data base system generates or accesses a connection fragment map 36 in a data base 30. The connection fragment map 36 does not include any record indicating which fragment from two tables can satisfy the connected predicate but shows the unnecessity of retrieval during the execution of question and is used for deleting fragments which can not satisfy the connected predicate.

公开(公告)号：AU752283B2

公开(公告)日：2002-09-12

申请号：AU5943798

申请日：1998-03-20

Applicant: INFORMIX SOFTWARE INC

Inventor： KRISHNA MURALI M ,  KASHYAP ANURAG ,  GERBER ROBERT HOWARD ,  TAYLOR PAUL SHERWOOD ,  SHURTS SCOTT ALAN ,  NI SHENGSONG ,  SUNDARESAN PRAKASH

IPC: G06F12/00 ,  G06F17/30

Abstract: A computer implemented method for generating a response to a join. Two tables are divided into fragments. A join fragment map identifies, for each respective fragment from the first table, the fragments from the second table which contain a record that satisfies the join predicate with a record from the respective fragment from the first table. The map is used to eliminate fragments which cannot satisfy the join predicate.

公开(公告)号：CA2232938C

公开(公告)日：2006-07-04

申请号：CA2232938

申请日：1998-03-24

Applicant: INFORMIX SOFTWARE INC

Inventor： SHURTS SCOTT ALAN ,  KASHYAP ANURAG ,  KRISHNA MURALI M ,  SUNDARESAN PRAKASH ,  GERBER ROBERT HOWARD ,  TAYLOR PAUL SHERWOOD ,  NI SHENGSONG

IPC: G06F12/00 ,  G06F17/30

Abstract: A computer implemented method for generating a response to a join. Two tables are divided into fragments. A join fragment map identifies, for each respective fragment from the first table, the fragments from the second table which contain a record that satisfies the join predicate with a record from the respective fragment from the first table. The map is used to eliminate fragments which cannot satisfy the join predicate.

公开(公告)号：BR9804282A

公开(公告)日：1999-11-16

申请号：BR9804282

申请日：1998-04-06

Applicant: INFORMIX SOFTWARE INC

Inventor： KRISHNA MURALI M ,  KASHYAP ANURAG ,  GERBER ROBERT HOWARD ,  TAYLOR PAUL SHERWOOD ,  SHURTS SCOTT ALAN ,  NI SHENGSONG ,  SUNDARESAN PRAKASH

IPC: G06F12/00 ,  G06F17/30

Abstract: A computer implemented method for generating a response to a join. Two tables are divided into fragments. A join fragment map identifies, for each respective fragment from the first table, the fragments from the second table which contain a record that satisfies the join predicate with a record from the respective fragment from the first table. The map is used to eliminate fragments which cannot satisfy the join predicate.

公开(公告)号：AU5943798A

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

申请号：AU5943798

申请日：1998-03-20

Applicant: INFORMIX SOFTWARE INC

Inventor： KRISHNA MURALI M ,  KASHYAP ANURAG ,  GERBER ROBERT HOWARD ,  TAYLOR PAUL SHERWOOD ,  SHURTS SCOTT ALAN ,  NI SHENGSONG ,  SUNDARESAN PRAKASH

IPC: G06F12/00 ,  G06F17/30

Abstract: A computer implemented method for generating a response to a join. Two tables are divided into fragments. A join fragment map identifies, for each respective fragment from the first table, the fragments from the second table which contain a record that satisfies the join predicate with a record from the respective fragment from the first table. The map is used to eliminate fragments which cannot satisfy the join predicate.

公开(公告)号：MX9802587A

公开(公告)日：1998-12-31

申请号：MX9802587

申请日：1998-04-02

Applicant: INFORMIX SOFTWARE INC

Inventor： KRISHNA MURALI M ,  KASHYAP ANURAG ,  GERBER ROBERT HOWARD ,  TAYLOR PAUL SHERWOOD ,  SHURTS SCOTT ALAN ,  NI SHENGSONG ,  SUNDARESAN PRAKASH

IPC: G06F17/30 ,  G06F12/00 ,  G11B05/00

Abstract: Un método ejecutado por medio de una computadora para generar una respuesta a una union. Dos cuadros se dividen en fragmentos. Un mapa de fragmentos de union identifica, para cada fragmento respectivo del primer cuadro, los fragmentos del segundo cuadro que contengan un registro que satisfaga el predicado de union con un registro del fragmento respectivo del primer cuadro. El mapa se usa para eliminar fragmentos que no pueden satisfacer el predicado de union.

公开(公告)号：CA2232938A1

公开(公告)日：1998-10-07

申请号：CA2232938

申请日：1998-03-24

Applicant: INFORMIX SOFTWARE INC

Inventor： NI SHENGSONG ,  KRISHNA MURALI M ,  SHURTS SCOTT ALAN ,  KASHYAP ANURAG ,  GERBER ROBERT HOWARD ,  TAYLOR PAUL SHERWOOD ,  SUNDARESAN PRAKASH

IPC: G06F12/00 ,  G06F17/30

Abstract: A computer implemented method for generating a response to a join. Two tables are divided into fragments. A join fragment map identifies, for each respective fragment from the first table, the fragments from the second table which contain a record that satisfies the join predicate with a record from the respective fragment from the first table. The map is used to eliminate fragments which cannot satisfy the join predicate.