专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

31. 发明授权

US08037034B2 Methods of creating a dictionary for data compression 有权
标题翻译：创建数据压缩字典的方法
公开(公告)号：US08037034B2
公开(公告)日：2011-10-11
申请号：US11781833
申请日：2007-07-23
申请人： Piotr M. Plachta , Wolfram Sauer , Balakrishna Raghavendra Iyer , Steven Wayne White
发明人： Piotr M. Plachta , Wolfram Sauer , Balakrishna Raghavendra Iyer , Steven Wayne White
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： H03M7/3088
摘要： Some aspects of the invention provide methods, systems, and computer program products for creating a static dictionary in which longer byte-strings are preferred. To that end, in accordance with aspects of the present invention, a new heuristic is defined to replace the aforementioned frequency count metric used to record the number of times a particular node in a data tree is visited. The new heuristic is based on counting the number of times an end-node of a particular byte-string is visited, while not incrementing a count for nodes storing characters in the middle of the byte-string as often as each time such nodes are visited. The result is an occurrence count metric that favors longer byte-strings, by being biased towards not incrementing the respective occurrence count values for nodes storing characters in the middle of a byte-string.
摘要翻译：本发明的一些方面提供用于创建静态词典的方法，系统和计算机程序产品，其中优选较长的字节串。为此，根据本发明的方面，定义新的启发式来代替用于记录数据树中的特定节点被访问次数的上述频率计数度量。新的启发式是基于对特定字节串的端节点进行访问的次数进行计数，而不会在每次访问这些节点时频繁地在字节串中间存储字符的节点递增计数。结果是有利于较长字节串的发生计数度量，偏向于不增加在字节串中间存储字符的节点的相应出现计数值。

32. 发明授权

US07840774B2 Compressibility checking avoidance 失效
标题翻译：压缩性检查避免
公开(公告)号：US07840774B2
公开(公告)日：2010-11-23
申请号：US11233956
申请日：2005-09-09
申请人： Jeffrey Allen Berger , You-Chin Fuh , Sauraj Goswami , Balakrishna Raghavendra Iyer , Michael R. Shadduck , James Zu-Chia Teng , Stephen Walter Turnbaugh
发明人： Jeffrey Allen Berger , You-Chin Fuh , Sauraj Goswami , Balakrishna Raghavendra Iyer , Michael R. Shadduck , James Zu-Chia Teng , Stephen Walter Turnbaugh
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28 , G06F13/12 , G06F13/38
CPC分类号： H03M7/30 , G06F17/30336
摘要： Various embodiments of a computer-implemented method, system and computer program product maintain a logical page having a predetermined size. Data is added to an uncompressed area of the logical page. The uncompressed area of the logical page is associated with an uncompressed area of a physical page. The logical page also has a compressed area associated with a compressed area of a physical page. In response to exhausting the uncompressed area, data in the uncompressed area is included in the compressed area. The uncompressed area is adjusted.
摘要翻译：计算机实现的方法，系统和计算机程序产品的各种实施例维护具有预定大小的逻辑页面。数据被添加到逻辑页面的未压缩区域。逻辑页面的未压缩区域与物理页面的未压缩区域相关联。逻辑页面还具有与物理页面的压缩区域相关联的压缩区域。响应于未压缩区域的耗尽，未压缩区域中的数据被包括在压缩区域中。未压缩区域被调整。

33. 发明授权

US06456998B1 Efficient processing of parent-child relationships in a relational database management system 失效
标题翻译：在关系数据库管理系统中有效处理父子关系
公开(公告)号：US06456998B1
公开(公告)日：2002-09-24
申请号：US09164257
申请日：1998-09-30
申请人： Thuan Quang Bui , Balakrishna Raghavendra Iyer
发明人： Thuan Quang Bui , Balakrishna Raghavendra Iyer
IPC分类号： G06F1730
CPC分类号： G06F17/30595 , Y10S707/99932
摘要： A method, apparatus, article of manufacture, and data structure for efficiently identifying parent-child relationships of a plurality of members. The parent-child relationships are encoded into a matrix, wherein a particular member is represented by a particular row and a particular column of the matrix. A value at an intersection of a specific one of the rows and a specific one of the columns indicates whether a parent-child relationship exists between the member represented by the row and the member represented by the column. Thereafter, matrix operations may be applied to the matrix.
摘要翻译：一种用于有效地识别多个成员的父子关系的方法，装置，制品和数据结构。父子关系被编码为矩阵，其中特定成员由矩阵的特定行和特定列表示。特定行之间的交叉点和特定列之间的值表示在该行所表示的构件与由该列表示的构件之间是否存在父子关系。此后，矩阵运算可以应用于矩阵。

34. 发明授权

US06301575B1 Using object relational extensions for mining association rules 有权
标题翻译：使用对象关系扩展来挖掘关联规则
公开(公告)号：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.
摘要翻译：用于采矿关联规则的对象关系扩展的计算机实现使用的方法，装置和制品。数据挖掘由计算机执行以从存储在耦合到计算机的数据存储设备上的数据存储器中检索数据。接收使用多列数据模型组织的多列数据存储。多列数据存储中的列之一表示事务，多列数据存储中的其余列表示该事务的元素。执行组合运算符以从多列数据存储获得数据的候选项集，每个项集是多列数据存储的多行的组合。从候选项集中生成大量数据项，其中每个项集具有至少最小支持。关联规则是从大量数据集生成的，其中每个关联规则具有至少最小的置信度。

35. 发明授权

US6032146A Dimension reduction for data mining application 失效
标题翻译：数据挖掘应用的维度减少
公开(公告)号：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.
摘要翻译：一种用于计算机实现的随机可靠性引擎的方法，装置和制品，其使用用于数据挖掘应用的关联规则进行计算机实现的维度缩减。数据挖掘由计算机执行以从存储在耦合到计算机的数据存储设备上的数据存储器中检索数据。数据存储具有多个属性的记录。表的多个属性被聚集以产生多组属性。将每组属性聚类以获取数据挖掘属性。

36. 发明授权

US5940822A Encoding method of members related by multiple concept or group hierarchies and identification of members in a corpus or a database that are descendants of one or more selected concepts or groups from the encoding 失效
标题翻译：通过多个概念或组层次相关的成员的编码方法以及作为来自编码的一个或多个所选概念或组的后代的语料库或数据库中的成员的标识
公开(公告)号：US5940822A
公开(公告)日：1999-08-17
申请号：US921197
申请日：1997-08-29
申请人： Donald J. Haderle , Balakrishna Raghavendra Iyer
发明人： Donald J. Haderle , Balakrishna Raghavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30595 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942
摘要： A method, apparatus, and article of manufacture for an encoder for encoding members in a concept hierarchy. A query is executed in a computer. The query is performed by the computer to retrieve data from a database stored on a data storage device connected to the computer. Members in the database that are related by one or more concept hierarchies are encoded. Then, members in one of the concept hierarchies that are descendants of one or more selected concepts are identified based on the encoding.
摘要翻译：用于编码器的方法，装置和制品，用于在概念层级中对构件进行编码。在计算机中执行查询。该查询由计算机执行以从存储在连接到计算机的数据存储设备上的数据库中检索数据。与一个或多个概念层次相关的数据库中的成员被编码。然后，基于编码来识别作为一个或多个所选概念的后代的概念层次之一的成员。

37. 发明授权

US5706495A Encoded-vector indices for decision support and warehousing 失效
标题翻译：用于决策支持和仓储的编码向量索引
公开(公告)号：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操作将转换为该索引上的一系列位向量操作，其中位向量操作的结果是表中的行位列表。

38. 发明授权

US09262491B2 System and method for implementing multi-temporal database functionality 有权
标题翻译：用于实现多时间数据库功能的系统和方法
公开(公告)号：US09262491B2
公开(公告)日：2016-02-16
申请号：US13172498
申请日：2011-06-29
申请人： Ullas Balan Nambiar , Prasad Manikarao Deshpande , Ramanujam Seshadri Halasipuram , Balakrishna Raghavendra Iyer
发明人： Ullas Balan Nambiar , Prasad Manikarao Deshpande , Ramanujam Seshadri Halasipuram , Balakrishna Raghavendra Iyer
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30557
摘要： A computer-implemented method, computer program product, and computing system for implementing multi-temporal tables in a database is described. One or more databases are utilized, wherein the one or more databases implement a first temporal table that includes a first and a second time domain. The one or more databases are enabled to implement a second temporal table that includes at least a third time domain, wherein the second temporal table is associated with the first temporal table.
摘要翻译：描述了一种用于在数据库中实现多时间表的计算机实现的方法，计算机程序产品和计算系统。利用一个或多个数据库，其中一个或多个数据库实现包括第一和第二时域的第一时间表。一个或多个数据库被启用以实现包括至少第三时域的第二时间表，其中第二时间表与第一时间表相关联。

39. 发明授权

US08983992B2 Facilitating field programmable gate array accelerations of database functions 有权
公开(公告)号：US08983992B2
公开(公告)日：2015-03-17
申请号：US13616639
申请日：2012-09-14
申请人： Sameh Asaad , Bernard V. Brezzo , Donna N Eng Dillenberger , Parijat Dube , Balakrishna Raghavendra Iyer , Hong Min , Bharat Sukhwani , Mathew S. Thoennes
发明人： Sameh Asaad , Bernard V. Brezzo , Donna N Eng Dillenberger , Parijat Dube , Balakrishna Raghavendra Iyer , Hong Min , Bharat Sukhwani , Mathew S. Thoennes
IPC分类号： G06F17/30
CPC分类号： G06F17/30 , G06F17/30289 , G06F17/30442
摘要： Methods and arrangements for facilitating accelerations of database functions. A field programmable gate array is incorporated. At least one query control block is incorporated in the field programmable gate array, and database management system operations are accelerated via the field programmable gate array. The accelerating includes employing the at least one query control block to execute a query without reconfiguring the field programmable gate array.

40. 发明授权

US07973680B2 Method and system for creating an in-memory physical dictionary for data compression 有权
标题翻译：用于创建用于数据压缩的内存中物理字典的方法和系统
公开(公告)号：US07973680B2
公开(公告)日：2011-07-05
申请号：US12172557
申请日：2008-07-14
申请人： Balakrishna Raghavendra Iyer , Piotr M. Plachta , Wolfram Sauer , Steven W. White
发明人： Balakrishna Raghavendra Iyer , Piotr M. Plachta , Wolfram Sauer , Steven W. White
IPC分类号： H03M7/34
CPC分类号： H03M7/3088
摘要： A system and computer readable storage medium for creating an in-memory physical dictionary for data compression are provided. A new heuristic is defined for converting each of a plurality of logical nodes into a corresponding physical node forming a plurality of physical nodes. Each of the physical nodes are placed into the physical dictionary while traversing the dictionary tree in descending visit count order. Each physical node is placed in its nearest ascendant's cache-line with sufficient space. If there is no space in any of the ascendant's cache-line, then the physical node is placed into a new cache-line, unless a pre-defined packing threshold has been reached, in which case the physical node is placed in the first available cache-line.
摘要翻译：提供了一种用于创建用于数据压缩的内存中物理字典的系统和计算机可读存储介质。定义了一种新的启发式算法，用于将多个逻辑节点中的每一个转换成形成多个物理节点的对应物理节点。每个物理节点都以递减的访问次序顺序遍历字典树，放入物理字典。每个物理节点都放置在其最接近的上升缓存行，并具有足够的空间。如果任何上升缓存行中没有空格，则物理节点将被放置到新的高速缓存行中，除非已达到预定义的打包阈值，在这种情况下，物理节点被置于第一个可用的缓存线。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式