Abstract: A visual query system, and associated method and computer program product enhance and accelerate content-based querying, and present a new image similarity measure using known or available software applications and hardware components of video compression systems. The present system encodes images as consecutive frames in a video sequence and uses the ratio between the file length of the compressed sequence and the original file length as a distance measure. The system considers the compression ratio to be an estimate of the entropy of the combined images, which can be used to estimate the amount of new information introduced from one image to the other.

Abstract: A visual query system, and associated method and computer program product enhance and accelerate content-based querying, and present a new image similarity measure using known or available software applications and hardware components of video compression systems. The present system encodes images as consecutive frames in a video sequence and uses the ratio between the file length of the compressed sequence and the original file length as a distance measure. The system considers the compression ratio to be an estimate of the entropy of the combined images, which can be used to estimate the amount of new information introduced from one image to the other.

Abstract: A method, apparatus, and article of manufacture for computer-implemented use of object relational extensions for mining association rules. Data mining is performed by a computer to retrieve data from a data store stored on a data storage device coupled to the computer. A multi-column data store organized using a multi-column data model is received. One of the columns in the multi-column data store represents a transaction, and each of the remaining columns in the multi-column data store represents elements of that transaction. A combination operator is performed to obtain candidate itemsets of data from the multi-column data store, each itemset being a combination of a number of rows of the multi-column data store. Large itemsets of data are generated from the candidate itemsets, wherein each itemset has at least a minimum support. Association rules are generated from the large itemsets of data, wherein each association rule has at least a minimum confidence.

Abstract: A method, apparatus, and article of manufacture for a computer-implemented random reliability engine for computer-implemented association rule reduction using association rules for data mining application. The data mining is performed by the computer to retrieve data from a data store stored on a data storage device coupled to the computer. The data store has records that have multiple attributes. Attribute value associations are determined between attributes and their values. Attribute associations are determined from the determined attribute value associations. Attributes are selected based on the determined attribute associations for performing data mining.

Abstract: Disclosed are a method and processor for linking a dynamic data fetch command to a document file, the document file initially in a preliminary markup state having at least one matching pair of a special beginning tag and a special ending tag, the tags separately contained in sequential comment statements of the preliminary markup document file, the tags delimiting and identifying an area in the preliminary markup document file for placement of requested dynamic data, the dynamic data fetch command located in a predefined script file having a linkage identifier, comprising the steps of identifying, in the preliminary markup document file, the matching pair of the special beginning tag and the special ending tag to identify the delimited area therebetween; selecting the predefined script file; generating a linked document file from the preliminary markup document file, adding, at the identified area in the preliminary markup document file, the linkage identifier for the selected predefined script file; and merg

Abstract: Many web applications require access to a relational database. The requirements of such web applications are different from conventional applications that access a database. Web applications need to have selective recoverability and need to have support for different transaction structures, other than the flat transaction structure of conventional database applications, including nested and chained transactions. To achieve this, an interface between the application and database has the following functional features: 1) the interface to the database is connection oriented, i.e., the connection is retained across several invocations of the application; 2) the backend of the interface is long living, i.e., it exists across multiple invocations; 3) state information about a session in progress is maintained, and more specifically, it is distributed between the backend of the interface and the hidden fields of the HTML output document.

Abstract: A method, apparatus, and article of manufacture for a computer-implemented random reliability engine for computer-implemented dimension reduction using association rules for data mining application. The data mining is performed by the computer to retrieve data from a data store stored on a data storage device coupled to the computer. The data store has records that have multiple attributes. The multiple attributes of a table are clustered to produce a plurality of sets of attributes. Each set of attributes is clustered to obtain data mining attributes.

Abstract: The present invention provides a system and method for utilizing the proximity of keys in sequential or near sequential index probes to avoid complete index tree traversal. Page information from three pages (LAST, PARENT and NEXT) are stored in separate information fields within an Index Lookaside Buffer. The LAST information field contains information on the most recent leaf page accessed during an index probe in a read key or an insert key operation, the PARENT information field contains information on the parent page of the most recently accessed leaf page described in the LAST information field, and the NEXT information field contains information on the most recent leaf page accessed during a fetch-next key or delete key operation.

Abstract: The present invention provides a system and method for utilizing the proximity of keys in sequential or near sequential index probes to avoid complete index tree traversal. Page information from three pages (LAST, PARENT and NEXT) are stored in separate information fields within an Index Lookaside Buffer. The LAST information field contains information on the most recent leaf page accessed during an index probe in a read key or an insert key operation, the PARENT information field contains information on the parent page of the most recently accessed leaf page described in the LAST information field, and the NEXT information field contains information on the most recent leaf page accessed during a fetch-next key or delete key operation.

Abstract: A method, apparatus, and article of manufacture for optimizing SQL queries in a relational database management system using a vectorized index. The vectorized index represents values in one or more of the columns of a particular table in the relational database. The vectorized index is comprised of a plurality of positions, wherein each of the positions comprises a linear array that represents a value for the specified columns in a corresponding row of the particular table in the relational database. To use the vectorized index, SQL operations are converted to a series of bit-vector operations on that index, where the result of the bit-vector operations is a list of row positions in the table.