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

1. 发明申请

US20140067845A1 FACILITATING FIELD PROGRAMMABLE GATE ARRAY ACCELERATIONS OF DATABASE FUNCTIONS 有权
公开(公告)号：US20140067845A1
公开(公告)日：2014-03-06
申请号：US13599600
申请日：2012-08-30
申请人： 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.

2. 发明授权

US08001128B2 Selection of a set of optimal n-grams for indexing string data in a DBMS system under space constraints introduced by the system 失效
标题翻译：在系统引入的空间约束下，选择一组用于在DBMS系统中索引字符串数据的最佳n-gram
公开(公告)号：US08001128B2
公开(公告)日：2011-08-16
申请号：US12264899
申请日：2008-11-04
申请人： Vahit Hakan Hacigumus , Balakrishna Raghavendra Iyer , Sharad Mehrotra
发明人： Vahit Hakan Hacigumus , Balakrishna Raghavendra Iyer , Sharad Mehrotra
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30619 , G06F17/30625 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99937 , Y10S707/99942 , Y10S707/99943
摘要： The present invention provides a computer-readable medium and system for selecting a set of n-grams for indexing string data in a DBMS system. Aspects of the invention include providing a set of candidate n-grams, each n-gram comprising a sequence of characters; identifying sample queries having character strings containing the candidate n-grams; and based on the set of candidate n-grams, the sample queries, database records, and an n-gram space constraint, automatically selecting, given the space constraint, a minimal set of an n-grams from the set of candidate n-grams that minimizes the number of false hits for the set of sample queries had the sample queries been executed against the database records.
摘要翻译：本发明提供了一种用于在DBMS系统中选择用于索引字符串数据的一组n-gram的计算机可读介质和系统。本发明的方面包括提供一组候选n克，每个n-gram包括一系列字符; 识别具有包含候选n-gram的字符串的样本查询; 并且基于候选n-gram的集合，样本查询，数据库记录和n-gram空间约束，给定空间约束，从候选n-gram集合中自动选择n-gram的最小集合这可以最小化针对数据库记录执行样本查询的一组样本查询的假命中数。

3. 发明授权

US07460033B2 Method for creating an in-memory physical dictionary for data compression 有权
标题翻译：用于创建用于数据压缩的内存中物理字典的方法
公开(公告)号：US07460033B2
公开(公告)日：2008-12-02
申请号：US11617610
申请日：2006-12-28
申请人： 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
摘要： Some aspects of the invention provide methods for creating an in-memory physical dictionary for data compression. To that end, in accordance with aspects of the present invention, a new heuristic is defined for converting each of the plurality of logical nodes into a corresponding physical node forming a plurality of physical nodes; then place each of the physical nodes 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.
摘要翻译：本发明的一些方面提供了用于创建用于数据压缩的内存中物理字典的方法。为此，根据本发明的方面，新的启发式被定义为将多个逻辑节点中的每一个转换成形成多个物理节点的对应的物理节点; 然后将每个物理节点放入物理字典，同时以递减的访问次序顺序遍历字典树。每个物理节点都放置在其最接近的上升缓存行，并具有足够的空间。如果任何上升缓存行中没有空格，则物理节点将被放置到新的高速缓存行中，除非已达到预定义的打包阈值，在这种情况下，物理节点被置于第一个可用的缓存线。

4. 发明授权

US06906719B2 System and method for content-based querying using video compression format 有权
标题翻译：使用视频压缩格式进行内容查询的系统和方法
公开(公告)号：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.
摘要翻译：视觉查询系统，相关方法和计算机程序产品增强和加速基于内容的查询，并使用视频压缩系统的已知或可用的软件应用程序和硬件组件呈现新的图像相似性度量。本系统将图像编码为视频序列中的连续帧，并将压缩序列的文件长度与原始文件长度之间的比率用作距离度量。该系统认为压缩比是组合图像熵的估计，可用于估计从一个图像引入到另一个图像的新信息的数量。

5. 发明授权

US06748448B1 High performance internet storage access scheme 失效
标题翻译：高性能互联网存储接入方案
公开(公告)号：US06748448B1
公开(公告)日：2004-06-08
申请号：US09459585
申请日：1999-12-13
申请人： Clodoaldo Barrera , Daniel Alexander Ford , Saugata Guha , Balakrishna Raghavendra Iyer , Jaishankar Moothedath Menon , Harsha Ramalingam
发明人： Clodoaldo Barrera , Daniel Alexander Ford , Saugata Guha , Balakrishna Raghavendra Iyer , Jaishankar Moothedath Menon , Harsha Ramalingam
IPC分类号： G06F1516
CPC分类号： H04L29/12594 , G06F17/30887 , G06F17/30902 , H04L29/06 , H04L29/12009 , H04L61/3065 , H04L67/06 , H04L69/329
摘要： Systems and methods of increasing the performance of computer networks, especially networks connecting users to the Web, are provided. Performance is increased by reducing the latency the client experiences between sending a request to the server and receiving a response. A connection is obtained by a client device to the network target node addressed by a physical I/O address, to more quickly respond to requests for resource files on data storage devices. This enhancement may be implemented by connecting the controller of the data storage device directly to the network, to reduce the latency involved in mapping the logical I/O address into a physical I/O address. In that case the requested resource file is sent to the client directly by the data storage device controller, thus saving time otherwise spent in sending the request and data between computer network components.
摘要翻译：提供了增加计算机网络，特别是将用户连接到网络的网络的性能的系统和方法。通过减少客户端向服务器发送请求和接收响应之间的延迟时间来提高性能。客户端设备获取到由物理I / O地址寻址的网络目标节点的连接，以更快地响应数据存储设备上的资源文件请求。该增强可以通过将数据存储设备的控制器直接连接到网络来实现，以减少将逻辑I / O地址映射到物理I / O地址中所涉及的等待时间。在这种情况下，所请求的资源文件由数据存储设备控制器直接发送给客户端，从而节省了在计算机网络组件之间发送请求和数据所花费的时间。

6. 发明授权

US06282541B1 Efficient groupby aggregation in tournament tree sort 失效
标题翻译：在比赛树分类中有效的组合聚合
公开(公告)号：US06282541B1
公开(公告)日：2001-08-28
申请号：US09123840
申请日：1998-07-27
申请人： Peter Hoa , Balakrishna Raghavendra Iyer , Beth Rivenes Moore , Bryan Frederick Smith
发明人： Peter Hoa , Balakrishna Raghavendra Iyer , Beth Rivenes Moore , Bryan Frederick Smith
IPC分类号： G06F1700
CPC分类号： G06F17/30489 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99937 , Y10S707/99942 , Y10S707/99943
摘要： A method, apparatus, and article of manufacture for a computer implemented groupby aggregation system. Groupby aggregation is performed when a statement is executed in a database stored on a data storage device, which is connected to a computer. Initially, data elements are input into a tournament tree from an input sequence. Then, a winner of a tournament in the tournament tree is identified. The winner is recycled into the tournament tree.
摘要翻译：一种用于计算机实现的组合聚合系统的方法，装置和制品。当在存储在连接到计算机的数据存储设备上的数据库中执行语句时执行Groupby聚合。最初，数据元素从输入序列输入到比赛树中。然后，确定了比赛树中比赛的获胜者。获胜者被回收到比赛树中。

7. 发明授权

US06272487B1 Query optimization through the use of multi-column statistics to avoid the problems of non-indexed column correlation 有权
标题翻译：查询优化通过使用多列统计来避免非索引列相关的问题
公开(公告)号：US06272487B1
公开(公告)日：2001-08-07
申请号：US09277612
申请日：1999-03-26
申请人： Thomas Abel Beavin , Balakrishna Raghavendra Iyer , Akira Shibamiya , Hong Sang Tie , Min Wang
发明人： Thomas Abel Beavin , Balakrishna Raghavendra Iyer , Akira Shibamiya , Hong Sang Tie , Min Wang
IPC分类号： G06F1730
CPC分类号： G06F17/30469 , Y10S707/99932
摘要： The system, method, and program of this invention collects multi-column statistics, by a database management system, to reflect a relationship among multiple columns of a table in a relational database. These statistics are stored in the system catalog, and are used during query optimization to obtain an estimate of the number of qualifying rows when a query has predicates on multiple columns of a table. A multi-column linear quantile statistic is collected by dividing the data of multiple columns into sub-ranges where each sub-range has approximately an even distribution of data, and determining a frequency and cardinality of each sub-range. A multi-column polygonal quantile statistic is collected by dividing the data of multiple columns into sub-spaces where each sub-space contains approximately the same number of tuples, and determining a frequency and cardinality of each sub-space. The system catalog is accessed for the stored multi-column linear quantile statistic for a query having a single range predicate and at least one equal predicate to determine the selectivity value for the predicates of the query. The system catalog is accessed for the stored multi-column polygonal quantile statistic for a query having more than one range predicate. These statistics are used in various ways to determine the selectivity value for the predicates of the query.
摘要翻译：本发明的系统，方法和程序通过数据库管理系统收集多列统计，以反映关系数据库中的表的多个列之间的关系。这些统计信息存储在系统目录中，并且在查询优化期间使用，以便当查询在表的多个列上进行谓词时获得限定行数的估计。通过划分数据来收集多列线性分位数统计量的多个列组成子范围，其中每个子范围具有大致均匀的数据分布，以及确定每个子范围的频率和基数。通过将多列的数据划分为子空间，其中每个子空间包含大致相同数量的元组，并确定每个子空间的频率和基数，收集多列多边形分位数统计量。系统目录被访问对于具有单个范围谓词和至少一个相等谓词的查询的存储的多列线性分位数统计量来确定查询的谓词的选择性值。对于具有多个范围谓词的查询，为存储的多列多边形分位数统计量访问系统目录。这些统计信息以各种方式用于确定查询谓词的选择性值。

8. 发明授权

US5978792A Method and apparatus for generating dynamic and hybrid sparse indices for workfiles used in SQL queries 失效
标题翻译：用于生成用于SQL查询的工作文件的动态和混合稀疏索引的方法和装置
公开(公告)号：US5978792A
公开(公告)日：1999-11-02
申请号：US6745
申请日：1998-01-13
申请人： Gautam Bhargava , Paramesh Sampatrai Desai , Piyush Goel , Peter Hoa , Fen-Ling Lin , Balakrishna Raghavendra Iyer , Jerry Mukai , William Samuel Perlman , Hong Sang Tie
发明人： Gautam Bhargava , Paramesh Sampatrai Desai , Piyush Goel , Peter Hoa , Fen-Ling Lin , Balakrishna Raghavendra Iyer , Jerry Mukai , William Samuel Perlman , Hong Sang Tie
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99936 , Y10S707/99937
摘要： A method and apparatus for generating static, dynamic and hybrid sparse indices for use with workfiles used by SQL queries in a relational database management system.
摘要翻译：一种用于生成关系数据库管理系统中SQL查询使用的工作文件的静态，动态和混合稀疏索引的方法和装置。

9. 发明授权

US5960427A Reordering of complex SQL queries involving groupbys, joins, outer joins and full outer joins 失效
标题翻译：重新排序复杂的SQL查询，包括groupbys，连接，外连接和完整的外连接
公开(公告)号：US5960427A
公开(公告)日：1999-09-28
申请号：US905106
申请日：1997-08-01
申请人： Piyush Goel , Balakrishna Raghavendra Iyer
发明人： Piyush Goel , Balakrishna Raghavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30471 , G06F17/30454 , Y10S707/99932 , Y10S707/99934
摘要： A method, apparatus, and article of manufacture for query simplification by applying generalized inference propagation and generalized transitive closure in SQL queries having selection, projection, join, outer join, and intersection operations. The disclosed transformations and enumeration method unify and solve the problems of 1) unnesting join aggregate queries, and 2) complete enumeration of queries containing outer joins, when the outer join predicate references an aggregated value, or the predicate references more than two base relations in a query subtree. The system first eliminates redundant sub-expressions and modifies expensive binary operations to inexpensive binary operations, then converts complex predicates to simple predicates by application of a generalized selection (GS) operator.
摘要翻译：通过在具有选择，投影，连接，外连接和交叉操作的SQL查询中应用广义推理传播和广义传递闭包来查询简化的方法，装置和制造。所公开的转换和枚举方法统一并解决了1）不连接聚合查询的问题，以及2）当外部连接谓词引用聚合值时，或者谓词引用两个以上的基础关系，完整枚举包含外部联接的查询一个查询子树。系统首先消除冗余子表达式，并将昂贵的二进制操作修改为廉价的二进制操作，然后通过应用广义选择（GS）运算符将复数谓词转换为简单谓词。

10. 发明授权

US5826262A Parallel bottom-up construction of radix trees 失效
标题翻译：平行自下而上建设的基数
公开(公告)号：US5826262A
公开(公告)日：1998-10-20
申请号：US621757
申请日：1996-03-22
申请人： Thuan Quang Bui , Scott Dennis Helt , Balakrishna Raghavendra Iyer , Gary Ross Ricard
发明人： Thuan Quang Bui , Scott Dennis Helt , Balakrishna Raghavendra Iyer , Gary Ross Ricard
IPC分类号： G06F17/30
CPC分类号： G06F17/30625 , Y10S707/99932 , Y10S707/99937
摘要： A method for partitioning keys onto radix tree logical pages and a parallel index page build algorithm in order to provide radix tree build speedup proportional to the number of processors on the system and controlled efficient page utilization. Also, since keys are intelligently partitioned so that a complete set of keys is inserted into a logical page, there is no page overflow during the tree construction and thus page splitting is eliminated. Since radix index trees are really groups of logical pages in which each logical page contains a small tree, the tree is built (with respect to the logical pages) from the bottom up, while within each individual logical page the tree is constructed from the top down. The space required for a logical page is pre-allocated to allow construction of limbs to begin without waiting for the build of their underlying pages to complete.
摘要翻译：一种将键分解到基数树逻辑页面的方法和一个并行的索引页构建算法，以便提供与系统上的处理器数量成比例的基数树构建速度，并控制有效的页面利用率。另外，由于密钥被智能地分割，使得一整套密钥被插入到逻辑页面中，所以在树构造期间没有页面溢出，因此页面拆分被消除。由于基数索引树是真正的逻辑页面组，其中每个逻辑页面都包含一个小树，所以从底部向上构建树（相对于逻辑页面），而在每个单独的逻辑页面中，树从顶部构建下。逻辑页面所需的空间被预先分配，以允许构建四肢开始，而无需等待其底层页面的构建才能完成。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式