公开(公告)号：DE69802960D1

公开(公告)日：2002-01-24

申请号：DE69802960

申请日：1998-10-27

Applicant: IBM

Inventor： CASTELLI VITTORIO ,  LI CHUNG-SHENG ,  THAMASIAN ALEXANDER

IPC: G06F20060101 ,  G06F17/30 ,  G06K9/62

Abstract: An improved multidimensional data indexing technique that generates compact indexes such that most or all of the index can reside in main memory at any time. During the clustering and dimensionality reduction, clustering information and dimensionality reduction information are generated for use in a subsequent search phase. The indexing technique can be effective even in the presence of variables which are not highly correlated. Other features provide for efficiently performing exact and nearest neighbor searches using the clustering information and dimensionality reduction information. One example of the dimensionality reduction uses a singular value decomposition technique. The method can also be recursively applied to each of the reduced-dimensionality clusters. The dimensionality reduction can also be applied to the entire database as a first step of the index generation.

公开(公告)号：DE10035043A1

公开(公告)日：2001-03-01

申请号：DE10035043

申请日：2000-07-19

Applicant: IBM

Inventor： BERGMAN LAWRENCE DAVID ,  CASTELLI VITTORIO ,  CHANG YUAN-CHI ,  LI CHUNG-SHEN ,  SMITH JOHN RICHARD

IPC: G06F17/30

Abstract: The method involves forming a first convex envelope of N input data sets, whereby M data sets represent apex points of the first convex envelope and are associated with a first plane of the indexing structure and forming a second convex envelope of the rest of the N -M data sets, whereby P data sets represent apex points of the second envelope and are associated with a second plane and at least part of one plane is located geometrically in another plane. An Independent claim is also included for an arrangement for building a multi-dimensional indexing structure for use with linear optimising requests and for a product for processing a request.

公开(公告)号：CA2511752A1

公开(公告)日：2004-06-24

申请号：CA2511752

申请日：2003-12-05

Applicant: IBM

Inventor： FRANASZEK PETER ,  CASTELLI VITTORIO ,  POFF DAN ,  SCHULZ CHARLES

IPC: G06F12/08 ,  G06F12/10 ,  G06F12/02 ,  G06T9/00 ,  G06T15/70

Abstract: In a computer system having a main memory for storing data in a compressed format and a processor cache for storing decompressed data, a method for converting the data of said main memory from compressed to uncompressed stat e, comprising the steps of reducing used portions of said main memory to a targ et value; disabling a compressor used for compressing the uncompressed data; decompressing said compressed data of said main memory; moving said decompressed data to physical addresses equal to real addresses; and releasi ng the memory occupied by a compressed memory director and data structures used in steps a. to d.

公开(公告)号：AU2003292388A1

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

申请号：AU2003292388

申请日：2003-12-05

Applicant: IBM

Inventor： CASTELLI VITTORIO ,  FRANASZEK PETER ,  POFF DAN ,  SCHULZ CHARLES

IPC: G06F12/08 ,  G06F12/10 ,  G06F12/02 ,  G06T9/00 ,  G06T15/70

Abstract: A computer system having a main memory for storing data in a compressed format and a processor cache for storing decompressed data, a method for converting the data of said main memory from compressed to uncompressed state, comprising the steps of reducing used portions of said main memory to a target value; disabling a compressor used for compressing the uncompressed data; decompressing said compressed data of said main memory; moving said decompressed data to physical addresses equal to real addresses; and releasing the memory occupied by a compressed memory director and data structures used in the above steps.

公开(公告)号：DE69802960T2

公开(公告)日：2002-08-29

申请号：DE69802960

申请日：1998-10-27

Applicant: IBM

Inventor： CASTELLI VITTORIO ,  LI CHUNG-SHENG ,  THAMASIAN ALEXANDER

IPC: G06F20060101 ,  G06F17/30 ,  G06K9/62

Abstract: An improved multidimensional data indexing technique that generates compact indexes such that most or all of the index can reside in main memory at any time. During the clustering and dimensionality reduction, clustering information and dimensionality reduction information are generated for use in a subsequent search phase. The indexing technique can be effective even in the presence of variables which are not highly correlated. Other features provide for efficiently performing exact and nearest neighbor searches using the clustering information and dimensionality reduction information. One example of the dimensionality reduction uses a singular value decomposition technique. The method can also be recursively applied to each of the reduced-dimensionality clusters. The dimensionality reduction can also be applied to the entire database as a first step of the index generation.

公开(公告)号：HU0100581A2

公开(公告)日：2001-06-28

申请号：HU0100581

申请日：1998-10-27

Applicant: IBM

Inventor： CASTELLI VITTORIO ,  LI CHUNG-SHENG ,  THAMASIAN ALEXANDER

IPC: G06F20060101 ,  G06F17/30 ,  G06K9/62

Abstract: An improved multidimensional data indexing technique that generates compact indexes such that most or all of the index can reside in main memory at any time. During the clustering and dimensionality reduction, clustering information and dimensionality reduction information are generated for use in a subsequent search phase. The indexing technique can be effective even in the presence of variables which are not highly correlated. Other features provide for efficiently performing exact and nearest neighbor searches using the clustering information and dimensionality reduction information. One example of the dimensionality reduction uses a singular value decomposition technique. The method can also be recursively applied to each of the reduced-dimensionality clusters. The dimensionality reduction can also be applied to the entire database as a first step of the index generation.

公开(公告)号：DE60336929D1

公开(公告)日：2011-06-09

申请号：DE60336929

申请日：2003-12-05

Applicant: IBM

Inventor： CASTELLI VITTORIO ,  FRANASZEK PETER ,  POFF DAN ,  SCHULZ CHARLES

IPC: G06F12/02 ,  G06F12/08 ,  G06F12/10

公开(公告)号：CA2511752C

公开(公告)日：2009-06-09

申请号：CA2511752

申请日：2003-12-05

Applicant: IBM

Inventor： SCHULZ CHARLES ,  POFF DAN ,  FRANASZEK PETER ,  CASTELLI VITTORIO

IPC: G06F12/02 ,  G06F12/08 ,  G06F12/10 ,  G06T9/00 ,  G06T15/70

Abstract: In a computer system having a main memory for storing data in a compressed format and a processor cache for storing decompressed data, a method for converting the data of said main memory from compressed to uncompressed stat e, comprising the steps of reducing used portions of said main memory to a targ et value; disabling a compressor used for compressing the uncompressed data; decompressing said compressed data of said main memory; moving said decompressed data to physical addresses equal to real addresses; and releasi ng the memory occupied by a compressed memory director and data structures used in steps a. to d.

公开(公告)号：CZ20001552A3

公开(公告)日：2000-08-16

申请号：CZ20001552

申请日：1998-10-27

Applicant: IBM

Inventor： CASTELLI VITTORIO ,  LI CHUNG-SHENG ,  THAMASIAN ALEXANDER

IPC: G06F20060101 ,  G06F17/30 ,  G06K9/62

Abstract: An improved multidimensional data indexing technique that generates compact indexes such that most or all of the index can reside in main memory at any time. During the clustering and dimensionality reduction, clustering information and dimensionality reduction information are generated for use in a subsequent search phase. The indexing technique can be effective even in the presence of variables which are not highly correlated. Other features provide for efficiently performing exact and nearest neighbor searches using the clustering information and dimensionality reduction information. One example of the dimensionality reduction uses a singular value decomposition technique. The method can also be recursively applied to each of the reduced-dimensionality clusters. The dimensionality reduction can also be applied to the entire database as a first step of the index generation.