公开(公告)号：US5748952A

公开(公告)日：1998-05-05

申请号：US438558

申请日：1995-05-10

申请人： Atul Chadha ,  Donald J. Haderle ,  Akira Shibamiya ,  Robert W. Lyle ,  Steven J. Watts

发明人： Atul Chadha ,  Donald J. Haderle ,  Akira Shibamiya ,  Robert W. Lyle ,  Steven J. Watts

IPC分类号： G06F17/30

CPC分类号： G06F17/30327 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99953

摘要： 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. On a subsequent index probe, the LAST, NEXT and PARENT information fields are sequentially analyzed to determine if the search key is contained within the leaf page described by the LAST or NEXT information fields or if the search key is contained within one of the leaf pages pointed to by the parent page described by the PARENT information field. If none of the LAST, NEXT or PARENT information fields identify the leaf page containing the search key then the default root-to-leaf traversal would commence.

摘要翻译： 本发明提供一种用于利用顺序或近序列索引探针中的密钥接近以避免完整的索引树遍历的系统和方法。 来自三个页面（LAST，PARENT和NEXT）的页面信息存储在索引后备缓冲区中的单独的信息字段中。 LAST信息字段包含在读取键或插入键操作期间在索引探测期间访问的最新叶子页面的信息，PARENT信息字段包含在LAST信息字段中描述的最近访问的叶子页面的父页面上的信息 ，并且NEXT信息字段包含在获取下一个键或删除键操作期间访问的最新叶子页面的信息。 在随后的索引探针中，顺序地分析LAST，NEXT和PARENT信息字段以确定搜索关键字是否包含在由LAST或NEXT信息字段描述的叶子页内，或者如果搜索关键字包含在叶子页之一内 由PARENT信息字段描述的父页指向。 如果LAST，NEXT或PARENT信息字段中没有一个标识包含搜索关键字的叶子页面，则将开始默认的从根到叶遍历。

公开(公告)号：US5845274A

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

申请号：US471509

申请日：1995-06-06

申请人： Atul Chadha ,  Donald J. Haderle ,  Akira Shibamiya ,  Robert W. Lyle ,  Steven J. Watts

发明人： Atul Chadha ,  Donald J. Haderle ,  Akira Shibamiya ,  Robert W. Lyle ,  Steven J. Watts

IPC分类号： G06F17/30

CPC分类号： G06F17/30327 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99953

摘要： 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. On a subsequent index probe, the LAST, NEXT and PARENT information fields are sequentially analyzed to determine if the search key is contained within the leaf page described by the LAST or NEXT information fields or if the search key is contained within one of the leaf pages pointed to by the parent page described by the PARENT information field. If none of the LAST, NEXT or PARENT information fields identify the leaf page containing the search key then the default root-to-leaf traversal would commence.

摘要翻译： 本发明提供一种用于利用顺序或近序列索引探针中的密钥接近以避免完整的索引树遍历的系统和方法。 来自三个页面（LAST，PARENT和NEXT）的页面信息存储在索引后备缓冲区中的单独的信息字段中。 LAST信息字段包含在读取键或插入键操作期间在索引探测期间访问的最新叶子页面的信息，PARENT信息字段包含在LAST信息字段中描述的最近访问的叶子页面的父页面上的信息 ，并且NEXT信息字段包含在获取下一个键或删除键操作期间访问的最新叶子页面的信息。 在随后的索引探针中，顺序地分析LAST，NEXT和PARENT信息字段以确定搜索关键字是否包含在由LAST或NEXT信息字段描述的叶子页内，或者如果搜索关键字包含在叶子页之一内 由PARENT信息字段描述的父页指向。 如果LAST，NEXT或PARENT信息字段中没有一个标识包含搜索关键字的叶子页面，则将开始默认的从根到叶遍历。

公开(公告)号：US6038562A

公开(公告)日：2000-03-14

申请号：US708512

申请日：1996-09-05

申请人： Vaishnavi Anjur ,  Atul Chadha ,  Piyush Goel ,  Balakrishna Raghavendra Iyer ,  Venkatachary Srinivasan ,  Steven John Watts

发明人： Vaishnavi Anjur ,  Atul Chadha ,  Piyush Goel ,  Balakrishna Raghavendra Iyer ,  Venkatachary Srinivasan ,  Steven John Watts

IPC分类号： G06F17/30

CPC分类号： G06F17/30595 ,  Y10S707/99932 ,  Y10S707/99942 ,  Y10S707/99953

摘要： 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.

摘要翻译： 许多Web应用程序需要访问关系数据库。 这种Web应用程序的需求与访问数据库的常规应用程序不同。 Web应用程序需要具有选择性可恢复性，并且需要支持不同的事务结构，而不是常规数据库应用程序的平面事务结构，包括嵌套和链接事务。 为了实现这一点，应用程序和数据库之间的接口具有以下功能特征：1）到数据库的接口是面向连接的，即连接在应用程序的多个调用之间保留; 2）接口的后端是长生命的，即它存在于多个调用之间; 3）维护关于正在进行的会话的状态信息，更具体地说，它分布在接口的后端和HTML输出文档的隐藏字段之间。

公开(公告)号：US06906719B2

公开(公告)日：2005-06-14

申请号：US10270791

申请日：2002-10-12

申请人： Atul Chadha ,  Balakrishna Raghavendra Iyer ,  Apostol Ivanov Natsev

发明人： Atul Chadha ,  Balakrishna Raghavendra Iyer ,  Apostol Ivanov Natsev

IPC分类号： G06F17/30 ,  G06K9/36 ,  G06K9/46 ,  G06K9/54 ,  G06T15/00

CPC分类号： G06F17/30244

摘要： 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.

摘要翻译： 视觉查询系统，相关方法和计算机程序产品增强和加速基于内容的查询，并使用视频压缩系统的已知或可用的软件应用程序和硬件组件呈现新的图像相似性度量。 本系统将图像编码为视频序列中的连续帧，并将压缩序列的文件长度与原始文件长度之间的比率用作距离度量。 该系统认为压缩比是组合图像熵的估计，可用于估计从一个图像引入到另一个图像的新信息的数量。

公开(公告)号：US6134555A

公开(公告)日：2000-10-17

申请号：US20438

申请日：1998-02-09

申请人： Atul Chadha ,  Balakrishna Raghavendra Iyer ,  Hammou Messatfa ,  Jeonghee Yi

发明人： Atul Chadha ,  Balakrishna Raghavendra Iyer ,  Hammou Messatfa ,  Jeonghee Yi

IPC分类号： G06F17/30

CPC分类号： G06F17/30598 ,  Y10S707/99932 ,  Y10S707/99936 ,  Y10S707/99943

摘要： 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.

摘要翻译： 一种用于计算机实现的随机可靠性引擎的方法，装置和制品，用于使用数据挖掘应用的关联规则的计算机实现的关联规则减少。 数据挖掘由计算机执行以从存储在耦合到计算机的数据存储设备上的数据存储器中检索数据。 数据存储具有多个属性的记录。 属性值关联在属性及其值之间确定。 根据确定的属性值关联确定属性关联。 基于确定的用于执行数据挖掘的属性关联来选择属性。

公开(公告)号：US6061698A

公开(公告)日：2000-05-09

申请号：US955884

申请日：1997-10-22

申请人： Atul Chadha ,  Honghai Shen

发明人： Atul Chadha ,  Honghai Shen

IPC分类号： G06F17/21 ,  G06F17/30 ,  G06F7/06

CPC分类号： G06F17/214 ,  G06F17/30896

摘要： 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 merging the predefined script file having the dynamic data variable fetch command with the linked document file.

摘要翻译： 公开了一种用于将动态数据获取命令链接到文档文件的方法和处理器，该文档文件最初处于初步标记状态，其具有至少一个特定开始标签和特殊结束标签的匹配对，标签分别包含在顺序 初步标记文档文件的注释语句，定义和标识用于放置所请求的动态数据的初步标记文档文件中的区域的标签，位于具有链接标识符的预定义脚本文件中的动态数据获取命令，包括以下步骤： 在初步标记文件档案中，特殊起始标签和特殊结束标签的匹配对以识别其间的界定区域; 选择预定义的脚本文件; 从所述初步标记文档文件生成链接的文档文件，在所述初步标记文档文件的所识别的区域添加所选择的预定义脚本文件的链接标识符; 并将具有动态数据变量获取命令的预定义脚本文件与链接的文档文件合并。

公开(公告)号：US06301575B1

公开(公告)日：2001-10-09

申请号：US09191424

申请日：1998-11-12

申请人： Atul Chadha ,  Balakrishna Raghavendra Iyer ,  Karthick Rajamani

发明人： Atul Chadha ,  Balakrishna Raghavendra Iyer ,  Karthick Rajamani

IPC分类号： G06F1730

CPC分类号： G06F17/30539 ,  Y10S707/99932

摘要： 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.

摘要翻译： 用于采矿关联规则的对象关系扩展的计算机实现使用的方法，装置和制品。 数据挖掘由计算机执行以从存储在耦合到计算机的数据存储设备上的数据存储器中检索数据。 接收使用多列数据模型组织的多列数据存储。 多列数据存储中的列之一表示事务，多列数据存储中的其余列表示该事务的元素。 执行组合运算符以从多列数据存储获得数据的候选项集，每个项集是多列数据存储的多行的组合。 从候选项集中生成大量数据项，其中每个项集具有至少最小支持。 关联规则是从大量数据集生成的，其中每个关联规则具有至少最小的置信度。

公开(公告)号：US6032146A

公开(公告)日：2000-02-29

申请号：US21038

申请日：1998-02-09

申请人： Atul Chadha ,  Balakrishna Raghavendra Iyer ,  Hammou Messatfa ,  Jeonghee Yi

发明人： Atul Chadha ,  Balakrishna Raghavendra Iyer ,  Hammou Messatfa ,  Jeonghee Yi

IPC分类号： G06F17/30

CPC分类号： G06F17/30592 ,  G06F17/30539 ,  G06F2216/03 ,  Y10S707/962 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99936

摘要： 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.

摘要翻译： 一种用于计算机实现的随机可靠性引擎的方法，装置和制品，其使用用于数据挖掘应用的关联规则进行计算机实现的维度缩减。 数据挖掘由计算机执行以从存储在耦合到计算机的数据存储设备上的数据存储器中检索数据。 数据存储具有多个属性的记录。 表的多个属性被聚集以产生多组属性。 将每组属性聚类以获取数据挖掘属性。

公开(公告)号：US5706495A

公开(公告)日：1998-01-06

申请号：US643998

申请日：1996-05-07

申请人： Atul Chadha ,  Ashish Gupta ,  Piyush Goel ,  Venkatesh Harinarayan ,  Balakrishna Raghavendra Iyer

发明人： Atul Chadha ,  Ashish Gupta ,  Piyush Goel ,  Venkatesh Harinarayan ,  Balakrishna Raghavendra Iyer

IPC分类号： G06F17/30

CPC分类号： G06F17/30324 ,  Y10S707/99932 ,  Y10S707/99933

摘要： 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.

摘要翻译： 一种使用向量化索引在关系数据库管理系统中优化SQL查询的方法，设备和制品。 向量化索引表示关系数据库中特定表的一个或多个列中的值。 矢量化索引由多个位置组成，其中每个位置包括线性阵列，其表示关系数据库中特定表的对应行中的指定列的值。 要使用向量化索引，SQL操作将转换为该索引上的一系列位向量操作，其中位向量操作的结果是表中的行位列表。