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

1. 发明授权

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.
摘要翻译：本发明的系统，方法和程序通过数据库管理系统收集多列统计，以反映关系数据库中的表的多个列之间的关系。这些统计信息存储在系统目录中，并且在查询优化期间使用，以便当查询在表的多个列上进行谓词时获得限定行数的估计。通过划分数据来收集多列线性分位数统计量的多个列组成子范围，其中每个子范围具有大致均匀的数据分布，以及确定每个子范围的频率和基数。通过将多列的数据划分为子空间，其中每个子空间包含大致相同数量的元组，并确定每个子空间的频率和基数，收集多列多边形分位数统计量。系统目录被访问对于具有单个范围谓词和至少一个相等谓词的查询的存储的多列线性分位数统计量来确定查询的谓词的选择性值。对于具有多个范围谓词的查询，为存储的多列多边形分位数统计量访问系统目录。这些统计信息以各种方式用于确定查询谓词的选择性值。

2. 发明授权

US5995957A Query optimization through the use of multi-column statistics to avoid the problems of column correlation 失效
标题翻译：查询优化通过使用多列统计来避免列关联的问题
公开(公告)号：US5995957A
公开(公告)日：1999-11-30
申请号：US808521
申请日：1997-02-28
申请人： 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分类号： G06F17/30
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.
摘要翻译：本发明的系统，方法和程序通过数据库管理系统收集多列统计，以反映关系数据库中的表的多个列之间的关系。这些统计信息存储在系统目录中，并且在查询优化期间使用，以便在查询在表的多个列上进行谓词时获取合格行数的估计。通过将多列的数据划分成子范围，其中每个子范围具有大致均匀的数据分布，并且确定每个子范围的频率和基数，来收集多列线性分位数统计量。通过将多列的数据划分成子空间，其中每个子空间包含大致相同数量的元组，并且确定每个子空间的频率和基数，来收集多列多边形分位数统计量。对于具有单一范围谓词和至少一个相等谓词的查询，为存储的多列线性分位数统计量访问系统目录，以确定查询谓词的选择性值。对于具有多个范围谓词的查询，为存储的多列多边形分位数统计量访问系统目录。这些统计信息以各种方式用于确定查询谓词的选择性值。

3. 发明授权

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查询使用的工作文件的静态，动态和混合稀疏索引的方法和装置。

4. 发明授权

US5758145A Method and apparatus for generating dynamic and hybrid sparse indices for workfiles used in SQL queries 失效
标题翻译：用于生成用于SQL查询的工作文件的动态和混合稀疏索引的方法和装置
公开(公告)号：US5758145A
公开(公告)日：1998-05-26
申请号：US393803
申请日：1995-02-24
申请人： 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, apparatus and article for manufacture for generating static, dynamic and hybrid sparse indices for use with workfiles used by SQL queries in a relational database management system. A workfile and a sparse index structure are temporarily created in the computer during execution of the query by the computer. The workfile stores intermediate relations resulting from execution of a portion of the SQL query, wherein the intermediate relations comprise sorted rows for an inner table referenced in the SQL query. The sparse index structure contains one or more entries indicating at least an approximate location for at least some of the rows in the workfile. As one or more rows from an outer table referenced in the SQL query are retrieved, the entries of the sparse index structure are searched for a closest matching entry for each retrieved row. The sorted workfile is then scanned for a row matching each retrieved row using the closest matching entry from the sparse index structure as a starting position. The sparse index structure is then updated with an entry corresponding to the row from the sorted workfile matching the retrieved row from the outer table.
摘要翻译：一种用于生成静态，动态和混合稀疏索引的方法，装置和制品，用于在关系数据库管理系统中用于SQL查询的工作文件。在计算机执行查询期间，在计算机中临时创建工作文件和稀疏索引结构。工作文件存储由执行SQL查询的一部分而产生的中间关系，其中中间关系包括在SQL查询中引用的内部表的排序行。稀疏索引结构包含一个或多个条目，至少指示工作文件中至少一些行的近似位置。当从SQL查询中引用的外部表中的一行或多行被检索到时，搜索稀疏索引结构的条目以获取每个检索行的最接近的匹配条目。然后，使用距离稀疏索引结构最接近的匹配条目作为起始位置，扫描排序的工作文件，使其与每个检索到的行相匹配的行。然后使用与来自外部表的检索到的行匹配的排序工作文件中的行对应的条目来更新稀疏索引结构。

5. 发明授权

US5899992A Scalable set oriented classifier 失效
标题翻译：可扩展集定向分类器
公开(公告)号：US5899992A
公开(公告)日：1999-05-04
申请号：US800357
申请日：1997-02-14
申请人： Balakrishna Raghavendra Iyer , Min Wang
发明人： Balakrishna Raghavendra Iyer , Min Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/30705 , G06F17/30625 , Y10S707/99931 , Y10S707/99935 , Y10S707/99937
摘要： A method, apparatus, and article of manufacture for a computer implemented scaleable set-oriented classifier. The scalable set-oriented classifier stores set-oriented data as a table in a relational database. The table is comprised of rows having attributes. The scalable set-oriented classifier classifies the rows by building a classification tree. The scalable set-oriented classifier determines a gini index value for each split value of each attribute for each node that can be partitioned in the classification tree. The scalable set-oriented classifier selects an attribute and a split value for each node that can be partitioned based on the determined gini index value corresponding to the split value. Then, the scalable set-oriented classifier grows the classification tree by another level based on the selected attribute and split value for each node. The scalable set-oriented classifier repeats this process until each row of the table has been classified in the classification tree.
摘要翻译：一种用于计算机实现的可缩放的面向分类器的方法，装置和制品。可扩展的面向集的分类器将面向对象的数据作为关系数据库中的表存储。该表由具有属性的行组成。可扩展的面向集的分类器通过构建分类树来对行进行分类。可扩展的面向集的分类器为可以在分类树中分区的每个节点的每个属性的每个分割值确定一个gini索引值。可扩展的面向集的分类器根据与分割值相对应的确定的基尼系数索引值，为可分区的每个节点选择属性和分割值。然后，可扩展的面向对象的分类器根据所选择的属性和每个节点的分割值将分类树增加另一个级别。可扩展的面向集的分类器重复此过程，直到表的每一行都分类到分类树中。

6. 发明申请

US20140067851A1 FACILITATING FIELD PROGRAMMABLE GATE ARRAY ACCELERATIONS OF DATABASE FUNCTIONS 审中-公开
标题翻译：促进现场可编程序列阵列数据库功能的加速
公开(公告)号：US20140067851A1
公开(公告)日：2014-03-06
申请号：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.
摘要翻译：促进数据库功能加速的方法和安排。并入现场可编程门阵列。现场可编程门阵列中至少包含一个查询控制块，通过现场可编程门阵列加速数据库管理系统的运行。加速包括采用至少一个查询控制块来执行查询而不重新配置现场可编程门阵列。

7. 发明申请

US20090077378A1 QUERYING ENCRYPTED DATA IN A RELATIONAL DATABASE SYSTEM 有权
标题翻译：查询相关数据库系统中的加密数据
公开(公告)号：US20090077378A1
公开(公告)日：2009-03-19
申请号：US12272460
申请日：2008-11-17
申请人： Vahit Hakan Hacigumus , Balakrishna Raghavendra Iyer , Sharad Mehrotra
发明人： Vahit Hakan Hacigumus , Balakrishna Raghavendra Iyer , Sharad Mehrotra
IPC分类号： H04L9/00 , G06F17/30
CPC分类号： G06F17/30471 , G06F17/30501 , H04L9/0894
摘要： A client-server relational database system, wherein data from the client computer is encrypted by the client computer and hosted by the server computer, the encrypted data is operated upon by the server computer, using one or more operators selected from a group of operators comprising: (a) inequality logic operators, (b) aggregation operators, and (c) wildcard matching operators, to produce an intermediate results set, the intermediate results set is sent from the server computer to the client computer, and the intermediate results set is decrypted and filtered by the client computer to produce actual results. The group of operators is limited because the encrypted results set, when decrypted, includes inaccuracies therein. The client computer applies a set of correction procedures to the decrypted results set to remove the inaccuracies therein.
摘要翻译：一种客户机 - 服务器关系数据库系统，其中来自客户端计算机的数据由客户端计算机加密并由服务器计算机托管，加密数据由服务器计算机使用从一组运营商中选择的一个或多个运营商来操作，该运营商包括：（a）不等式逻辑运算符，（b）聚合运算符和（c）通配符匹配运算符，产生中间结果集，中间结果集从服务器计算机发送到客户端计算机，中间结果集为由客户端计算机进行解密和过滤，以产生实际结果。操作员组是有限的，因为在解密时加密的结果集包含不准确的内容。客户端计算机对解密的结果集应用一组校正过程以消除其中的不准确之处。

8. 发明申请

US20080162517A1 METHOD AND SYSTEM FOR CREATING AN IN-MEMORY PHYSICAL DICTIONARY FOR DATA COMPRESSION 有权
公开(公告)号：US20080162517A1
公开(公告)日：2008-07-03
申请号：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分类号： G06F17/30
CPC分类号： H03M7/3088
摘要： Some aspects of the invention provide methods, systems, and computer program products 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.

9. 发明授权

US07171420B2 Method and system for utilizing a database as a service 有权
标题翻译：利用数据库作为服务的方法和系统
公开(公告)号：US07171420B2
公开(公告)日：2007-01-30
申请号：US09966624
申请日：2001-09-27
申请人： Balakrishna Raghavendra Iyer , Charles William Lickel , Dante Aligheri Aubert , Vahit Hakan Hacigumus
发明人： Balakrishna Raghavendra Iyer , Charles William Lickel , Dante Aligheri Aubert , Vahit Hakan Hacigumus
IPC分类号： G06F17/30
CPC分类号： G06F17/30893 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99939 , Y10S707/99943
摘要： A method and system for providing a database as a is disclosed. In a first aspect, the method comprises the steps of accessing the database over a public network by a browser without downloading software. The method further includes controlling access to the database on an agreed-upon schedule. In a second aspect, a database service for use on a public network is disclosed. The database service comprises a presentation layer, the presentation layer including a browser, a web server coupled to the public network and a web application platform coupled to the web server. The database includes an application layer comprising a user interface (UI) application. The UI application is executed on the web application platform and is capable of communicating with the browser through a standard program code. Finally, the database service includes a database management layer. The database management layer includes at least one database which communicates with the UI application. Accordingly, a database can be managed centrally while resources of the database can be consumed individually and globally.
摘要翻译：公开了一种用于提供数据库的方法和系统。在第一方面，该方法包括以下步骤：通过浏览器在公共网络上访问数据库，而不下载软件。该方法还包括根据商定的时间表来控制对数据库的访问。在第二方面，公开了一种在公共网络上使用的数据库服务。数据库服务包括表示层，表示层包括浏览器，耦合到公共网络的web服务器和耦合到web服务器的Web应用程序平台。数据库包括包括用户界面（UI）应用的应用层。 UI应用程序在Web应用程序平台上执行，并且能够通过标准程序代码与浏览器进行通信。最后，数据库服务包括数据库管理层。数据库管理层包括与UI应用通信的至少一个数据库。因此，可以集中管理数据库，而可以单独和全局地使用数据库的资源。

10. 发明授权

US5855019A Enumerating projections in SQL queries containing outer and full outer joins in the presence of inner joins 失效
公开(公告)号：US5855019A
公开(公告)日：1998-12-29
申请号：US904172
申请日：1997-07-31
申请人： Gautam Bhargava , Piyush Goel , Balakrishna Raghavendra Iyer
发明人： Gautam Bhargava , Piyush Goel , Balakrishna Raghavendra Iyer
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , Y10S707/99932 , Y10S707/99939
摘要： The present invention discloses a method and apparatus for the enumeration of projections (i.e., "SELECT DISTINCT" operations) in SQL queries containing outer and full outer joins in the presence of inner joins without encountering any regression in performance. The present invention removes projections from a given user query by moving the projections to the top of an expression tree representation of the query, wherein the projection removal is performed using algebraic identities rather than rule-based transformations. The present invention also discloses several methods of enumerating different plans or schedules for projection operations and binary operations in the given user query. The present invention can significantly reduce the execution time of a query by selecting the optimal schedule for binary operations and projections between the binary operations. However, the present invention ensures that there is no regression in performance by comparing the cost of the query with the cost of enumerated plans or schedules, thereby ensuring that the optimizations or transformations do not introduce performance penalties.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式