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

41. 发明授权

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.
摘要翻译：提供了一种用于创建用于数据压缩的内存中物理字典的系统和计算机可读存储介质。定义了一种新的启发式算法，用于将多个逻辑节点中的每一个转换成形成多个物理节点的对应物理节点。每个物理节点都以递减的访问次序顺序遍历字典树，放入物理字典。每个物理节点都放置在其最接近的上升缓存行，并具有足够的空间。如果任何上升缓存行中没有空格，则物理节点将被放置到新的高速缓存行中，除非已达到预定义的打包阈值，在这种情况下，物理节点被置于第一个可用的缓存线。

42. 发明授权

US07685437B2 Query optimization in encrypted database systems 有权
标题翻译：加密数据库系统中的查询优化
公开(公告)号：US07685437B2
公开(公告)日：2010-03-23
申请号：US10807662
申请日：2004-03-24
申请人： Vahit Hakan Hacigumus , Balakrishna Raghavendra Iyer , Sharad Mehrotra
发明人： Vahit Hakan Hacigumus , Balakrishna Raghavendra Iyer , Sharad Mehrotra
IPC分类号： G06F11/30 , G06F17/30 , H04L9/00
CPC分类号： G06F17/30463 , G06F17/30471
摘要： A client-server relational database system includes a client computer connected to a server computer via a network. 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 to produce an intermediate results set. The intermediate results set is sent from the server computer to the client computer where it is operated upon by the client computer and then returned to the server computer where it is further operated upon by the server computer before being sent again from the server computer to the client computer in order to produce actual results.
摘要翻译：客户机 - 服务器关系数据库系统包括通过网络连接到服务器计算机的客户端计算机。来自客户端计算机的数据由客户端计算机加密并由服务器计算机托管。加密数据由服务器计算机操作以产生中间结果集。中间结果集从服务器计算机发送到由客户端计算机操作的客户端计算机，然后在服务器计算机再次从服务器计算机发送到服务器计算机之前返回到服务器计算机进一步操作的服务器计算机客户端计算机为了产生实际的结果。

43. 发明授权

US07500111B2 Querying encrypted data in a relational database system 有权
标题翻译：查询关系数据库系统中的加密数据
公开(公告)号：US07500111B2
公开(公告)日：2009-03-03
申请号：US10449421
申请日：2003-05-30
申请人： Vahit Hakan Hacigumus , Balakrishna Raghavendra Iyer , Sharad Mehrotra
发明人： Vahit Hakan Hacigumus , Balakrishna Raghavendra Iyer , Sharad Mehrotra
IPC分类号： H04K1/00 , H04L9/00 , G06F11/30 , G06F17/00 , G06F9/44 , 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）通配符匹配运算符，产生中间结果集，中间结果集从服务器计算机发送到客户端计算机，中间结果集为由客户端计算机进行解密和过滤，以产生实际结果。操作员组是有限的，因为在解密时加密的结果集包含不准确的内容。客户端计算机对解密的结果集应用一组校正过程以消除其中的不准确之处。

44. 发明申请

US20080275897A1 METHOD AND SYSTEM FOR CREATING AN IN-MEMORY PHYSICAL DICTIONARY FOR DATA COMPRESSION 有权
标题翻译：用于创建用于数据压缩的存储器物理字典的方法和系统
公开(公告)号：US20080275897A1
公开(公告)日：2008-11-06
申请号：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分类号： 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.
摘要翻译：本发明的一些方面提供了用于创建用于数据压缩的内存中物理字典的方法，系统和计算机程序产品。为此，根据本发明的方面，新的启发式被定义为将多个逻辑节点中的每一个转换成形成多个物理节点的对应的物理节点; 然后将每个物理节点放入物理字典，同时以递减的访问次序顺序遍历字典树。每个物理节点都放置在其最接近的上升缓存行，并具有足够的空间。如果任何上升缓存行中没有空格，则物理节点将被放置到新的高速缓存行中，除非已达到预定义的打包阈值，在这种情况下，物理节点被置于第一个可用的缓存线。

45. 发明授权

US06262675B1 Method of compressing data with an alphabet 失效
标题翻译：使用字母表压缩数据的方法
公开(公告)号：US06262675B1
公开(公告)日：2001-07-17
申请号：US09471102
申请日：1999-12-21
申请人： Balakrishna Raghavendra Iyer
发明人： Balakrishna Raghavendra Iyer
IPC分类号： H03M734
CPC分类号： H03M7/3086
摘要： An improved LZ77 data compression and decompression method, known as Le′Z99, uses an embedded alphabet to optimize code space and speed in the compressed data.
摘要翻译：改进的LZ77数据压缩和解压缩方法（称为Le'Z99）使用嵌入式字母表来优化压缩数据中的代码空间和速度。

46. 发明授权

US6088691A Enumerating projection in SQL queries containing outer and full outer joins in the presence of inner joins 失效
标题翻译：在存在内部连接的情况下，枚举包含外部和全部外部连接的SQL查询中的预测
公开(公告)号：US6088691A
公开(公告)日：2000-07-11
申请号：US198643
申请日：1998-11-24
申请人： 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.
摘要翻译：本发明公开了一种在存在内连接的情况下，在包含外连接和全外连接的SQL查询中枚举突出（即“SELECT DISTINCT”操作）的方法和装置，而不会在性能上遇到任何回归。本发明通过将投影移动到查询的表达树表示的顶部来从给定用户查询中移除投影，其中使用代数身份而不是基于规则的变换来执行投影删除。本发明还公开了在给定用户查询中枚举用于投影操作和二进制操作的不同计划或计划的几种方法。本发明可以通过选择二进制操作和二进制操作之间的投影的最佳调度来显着地减少查询的执行时间。然而，本发明通过将查询的成本与枚举的计划或计划的成本进行比较来确保性能没有回归，从而确保优化或转换不引入性能惩罚。

47. 发明授权

US5864847A Reordering of complex SQL queries involving groupbys, joins, outer joins and full outer joins 失效
公开(公告)号：US5864847A
公开(公告)日：1999-01-26
申请号：US902975
申请日：1997-07-30
申请人： 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.

48. 发明授权

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查询中引用的外部表中的一行或多行被检索到时，搜索稀疏索引结构的条目以获取每个检索行的最接近的匹配条目。然后，使用距离稀疏索引结构最接近的匹配条目作为起始位置，扫描排序的工作文件，使其与每个检索到的行相匹配的行。然后使用与来自外部表的检索到的行匹配的排序工作文件中的行对应的条目来更新稀疏索引结构。

49. 发明授权

US5713015A Reordering of complex SQL queries involving GROUPBYs, joins, outer joins and full outer joins 失效
公开(公告)号：US5713015A
公开(公告)日：1998-01-27
申请号：US655300
申请日：1996-05-30
申请人： 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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式