International Business Machines Corporation

Takeshi Fukuda

Takeshi Tokuyama

Yasuhiko Morimoto

Hirofumi Matsuzawa

Shinichi Morishita

Shinichi Morishida

Yasuhiro Suzuki

Kazuhito Akiyama

Tadashi Tsumura

Ryoji Kurosawa

Masahiro Ohkawa

Kunikazu Yoda

A system for integrating databases comprises a first virtual table, a second virtual table, a common table, a list, a generating section, and a selecting section. The first virtual table corresponds to a first data. The second virtual table corresponds to a second data. The common table is associated with the first and second virtual tables. The list indicates information about associations between the first and second virtual tables and the common table. The generating section generates two or more access plans from a database query on the common table. The two or more access plans involve at least one of the first and second virtual tables in accordance with the list. The selecting section selects one of the two or more access plans generated by the generating section to be used to execute the database query.

Integrating databases

Computer systems, methods, and computer program products for managing a service process that includes a plurality of service steps. A repository holds, for each of at least one configuration item, a set of data that represents at least one predetermined attribute of the configuration item and a relation between the configuration item and a second configuration item. The method includes detecting data on a resource for executing at least one of a plurality of service steps of the service process; creating, in response to a particular service process starting, data using a first configuration item model in which the particular service process is defined as a single configuration item; and creating data from the detected data using a second configuration item model in which one or more particular service steps are defined as a single configuration item.

Managing service processes

A text-mining system and method automatically extracts useful information from a large set of tree-structured data by generating successive sets of candidate tree-structured association patterns for comparison with the tree-structured data. The number of times is counted that each of the candidate association patterns matches with a tree in the set of tree-structured data in order to determine which of the candidate association patterns frequently matches with a tree in the data set. Each successive set of candidate association patterns is generated from the frequent association patterns determined from the previous set of candidate association patterns.

Method and system for detecting frequent association patterns

To provide a method for performing a plurality of aggregations in parallel and at a high speed, in a computer system so constructed that each of a plurality of processors connected across a network can use a memory area for itself and a part of the database for itself that includes data categorized into one or a plurality of groups, a method comprising the steps of: (a) ensuring space for storing results of M aggregate queries of the N aggregate queries (M is an integer equal to or less than N) in the memory area for itself in each processor; (b) executing all of the M aggregate queries for the part of the database for itself in each processor; (c) transmitting the results of the M aggregate queries executed by each processor to another processor for counting up and calculating of a final result for counting up; and (d) repeating the steps (a) to (c) until execution of the N aggregate queries is completed by each processor.

Method for executing aggregate queries, and computer system

The present application discloses a method and apparatus for extracting association rules from data having two or more numeric attributes and a true-false attribute, and for presenting the rules in an easily understandable form. The method comprises the steps of: (i) storing numbers u(i,j) and v(i,j) of data in each pixel whose true-false attribute is true, so as to correspond to each pixel in a plane; (ii) inputting a condition .theta.; (iii) segmenting from the plane a rectilinear region S of the pixels to maximize the equation ##EQU1## ;and (iv) outputting data included in the segmented rectilinear region S. The invention also allows regions to be derived which satisfy a desired support maximization rule, confidence maximization rule, optimized entropy rule, and optimized interclass variance rule.

Method and apparatus for deriving association rules from data and for

A method is disclosed for computing an association rule in a database having numerical attributes and 0-1 attributes. First, a numerical attribute is divided into a plurality of intervals (or buckets), and each data set is placed into a single bucket according to the value of the numerical attribute. The number of data sets in each bucket and the number of data sets with a 0-1 attribute being 1 are counted. Second, the starting bucket of an interval to be detected is to be detected. Third, the terminating bucket corresponding to the starting bucket is detected. That is, the largest interval with a confidence equal to or larger than a predetermined value. Fourth, one of the detected pairs of starting and terminating buckets which includes the largest number of customers is the answer to this question. Finally, the required data attributes of data included in this interval is subsequently retrieved.

Method and apparatus for computing association rules for data mining in

A method is disclosed for determining the correlation among data sets having a numerical attribute and a 0-1 attribute. First, a numerical attribute is divided into a plurality of buckets, and each data set is placed into a single bucket according to the value of the numerical attribute. The number of data sets in each bucket and the number of data sets with a 0-1 attribute of 1 are counted. Second, an axis corresponding to the total number of data sets in a first through a particular buckets (X axis) and an axis corresponding to the total number of data sets with a 0-1 attribute of 1 in a first through a particular buckets (Y axis) are virtually established, and points corresponding to the respective values of the first through the particular buckets are virtually plotted. Third, after a plane is constructed in this manner, one of the pairs of points separated at an interval of T.times.N or T or larger which has the largest slope is found. This step is most important to fast processing, and this invention employs the nature of convex hulls to reduce the number of points to be considered. Finally, once this pair of points has been determined, the corresponding pair of buckets can be determined, resulting in the output of the corresponding segment. Also, once this process has been finished, the user can retrieve the required part of the data included in this section.

Method and apparatus for deriving an optimized confidence rule

A method is described for finding correlation between a plurality of data having two kinds of numerical attributes and a true-false attribute. The method comprises the steps of: constituting a plane with two numerical attributes, dividing the plane into meshes, and counting the number of data in each mesh (also called a 'bucket') and the number of data whose true-false attribute represents true. If each mesh is assumed to be a pixel, such plane can be considered as a plane image in which the number of data corresponds to brilliance, and the number of data whose true-false attribute represents true corresponds to saturation. The method further includes the step of segmenting an admissible image which is convex along an axis of the plane according to a predetermined condition .theta. to find an area with strong correlation. If the segmented area as the admissible image satisfies the above-described condition such as the maximized support rule, the method also presents the area to the user. In addition, necessary attributes for data included in the area are also extracted from a database, as required.

Growing community of inventors

Machida, Japan

Takeshi Fukuda