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

11. 发明授权

US5963935A Combining bitmaps within a memory limit 失效
标题翻译：在内存限制内组合位图
公开(公告)号：US5963935A
公开(公告)日：1999-10-05
申请号：US808586
申请日：1997-02-28
申请人： Cetin Ozbutun , Jeffrey I. Cohen , Michael Depledge , Julian Hyde , Hakan Jakobsson , Mark Kremer , Quoc Tai Tran
发明人： Cetin Ozbutun , Jeffrey I. Cohen , Michael Depledge , Julian Hyde , Hakan Jakobsson , Mark Kremer , Quoc Tai Tran
IPC分类号： G06F17/30
CPC分类号： G06F17/30336 , G06F17/30324 , G06F17/30495 , Y10S707/99932 , Y10S707/99933
摘要： A method for combining within memory a limit, a plurality of bitmap streams from bitmaps of indefinite size and number. The bitmap streams are merged into a resulting bitmap which can be used in subsequent logical operations.In order to perform a merge within a memory limit, the method relies on the data compression. When compression by itself may be ineffective, the method produces a resulting bitmap for a reduced range.The ensures the production of a resulting bitmap. When the range is reduced, the method may be repeated to produce a merge for a range beyond the reduced range.
摘要翻译：一种用于在存储器内组合限制的方法，来自不定大小和数量的位图的多个位图流。位图流被合并到可以在随后的逻辑操作中使用的结果位图。为了在内存限制内执行合并，该方法依赖于数据压缩。当压缩本身可能无效时，该方法会产生缩小范围的结果位图。确保生成的位图。当范围减小时，可以重复该方法以产生超出缩小范围的范围的合并。

12. 发明授权

US5924088A Index selection for an index access path 失效
标题翻译：索引访问路径的索引选择
公开(公告)号：US5924088A
公开(公告)日：1999-07-13
申请号：US808094
申请日：1997-02-28
申请人： Hakan Jakobsson , Michael Depledge , Cetin Ozbutun , Jeffrey I. Cohen
发明人： Hakan Jakobsson , Michael Depledge , Cetin Ozbutun , Jeffrey I. Cohen
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , G06F17/30463 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934
摘要： A list of indexes, from which indexes are selected for an index access path, is sorted by number of columns upon which each index is built. From the sorted list of indexes, a set of index access methods is generated in a heuristically ordered set of passes from a given WHERE clause. The index access methods that comprise the index access path are selected from the set of index access methods according to a cost/benefit analysis.
摘要翻译：为索引访问路径选择索引的索引列表按照每个索引构建的列数进行排序。从索引的排序列表中，以给定的WHERE子句的启发式有序集合生成一组索引访问方法。根据成本/效益分析，从索引访问方法集中选择构成索引访问路径的索引访问方法。

13. 发明授权

US5884307A Updating bitmapped indexes 失效
标题翻译：更新位图索引
公开(公告)号：US5884307A
公开(公告)日：1999-03-16
申请号：US808585
申请日：1997-02-28
申请人： Michael Depledge , Hakan Jakobsson , Cetin Ozbutun , Jeffrey I. Cohen
发明人： Michael Depledge , Hakan Jakobsson , Cetin Ozbutun , Jeffrey I. Cohen
IPC分类号： G06F17/30
CPC分类号： G06F17/30312 , Y10S707/99931 , Y10S707/99933 , Y10S707/99935 , Y10S707/99937 , Y10S707/99943
摘要： A method and apparatus for updating a segmented bitmapped index to reflect a change made to data upon which the segmented index is based. Change records specifying changes to bitmap segments contained in the segmented bitmapped index are sorted by key value (bitmap segment) and row ID (bit) before being applied to the segmented bitmapped index. When the change records are being applied to the bitmap segment contained in the segmented bitmapped index, the index entry containing the bitmap segment to be updated is locked. If a new bitmap segment must be generated, the index entry covering a row in the data having a row ID less than the row ID of the change is first locked. Then a new index entry is generated, stored in the segmented bitmapped index, and the locked index entry unlocked. If the segmented bitmapped index does not contain an index entry covering a row in the data having a row ID less than the row ID of the change, then a dummy index entry is generated, stored in the segmented bitmapped index, and locked. A new index entry is then generated and stored in the segmented bitmapped index, after which the dummy index entry is unlocked and deleted.
摘要翻译：一种用于更新分段位图索引以反映对分段索引所依据的数据所做的改变的方法和装置。包含在分段位图索引中的位图段的更改的更改记录在应用于分段位图索引之前按键值（位图段）和行ID（位）进行排序。当更改记录被应用于包含在分段位图索引中的位图片段时，包含要更新的位图片段的索引条目被锁定。如果必须生成新的位图段，则首先锁定具有小于更改行ID的行ID的数据中包含行的索引条目。然后生成新的索引条目，存储在分段位图索引中，并锁定索引条目。如果分段位图索引不包含覆盖具有小于该变化的行ID的行ID的数据中的行的索引条目，则生成虚拟索引条目，存储在分段位图索引中并被锁定。然后生成新的索引条目并将其存储在分段位图索引中，之后解锁和删除虚拟索引条目。

14. 发明授权

US5974408A Method and apparatus for executing a query that specifies a sort plus operation 有权
标题翻译：用于执行指定排序加操作的查询的方法和装置
公开(公告)号：US5974408A
公开(公告)日：1999-10-26
申请号：US129257
申请日：1998-08-04
申请人： Jeffrey Ira Cohen , Cetin Ozbutun , Michael Depledge , Hakan Jakobsson
发明人： Jeffrey Ira Cohen , Cetin Ozbutun , Michael Depledge , Hakan Jakobsson
IPC分类号： G06F17/30
CPC分类号： G06F17/30454 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99937 , Y10S707/99953
摘要： Sort plus operations such as "group by" and "distinct" generally require sorting of the retrieved data before performing the sort plus operation. A method and apparatus is disclosed for executing a query specifying a sort plus operation without performing the sorting operation. To perform the sort plus operation, it is determined whether a sorted source exists that can be used to obtain the data specified in the query. If the sorted source does exist, it is then used to perform the sort plus operation.
摘要翻译：分组加操作，例如“分组”和“不同”通常需要在执行排序加运算之前对检索的数据进行排序。公开了一种用于在不执行排序操作的情况下执行指定排序加操作的查询的方法和装置。要执行排序加操作，确定是否存在可用于获取查询中指定的数据的排序的源。如果排序的源确实存在，则用于执行排序加运算。

15. 发明授权

US6144957A Method and apparatus for using incompatible types of indexes to process a single query 有权
标题翻译：使用不兼容类型的索引来处理单个查询的方法和设备
公开(公告)号：US6144957A
公开(公告)日：2000-11-07
申请号：US311181
申请日：1999-05-13
申请人： Jeffrey Ira Cohen , Cetin Ozbutun , Hakan Jakobsson , Michael Depledge
发明人： Jeffrey Ira Cohen , Cetin Ozbutun , Hakan Jakobsson , Michael Depledge
IPC分类号： G06F17/30
CPC分类号： G06F17/30324 , G06F17/30327 , G06F17/30463 , G06F17/30492 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944
摘要： A method and apparatus for processing a query combines the use of different index types to minimize the rows of data that need to be retrieved from a table. A first index is accessed based on a query to produce a first result having a first format, for example a bitmap index outputting a bitmap. A second index, for example a B-tree index, is also accessed based on the query to produce a second result having a second format, for example a sequence of rowids. The first result is converted to a converted result having the second format, and the converted result and the second result are combined to obtain an end result. The end result can then be used to locate data that satisfies the query while minimizing the rows of data that need to be retrieved from a table during the query processing.
摘要翻译：用于处理查询的方法和装置组合使用不同的索引类型以最小化需要从表中检索的数据行。基于查询来访问第一索引以产生具有第一格式的第一结果，例如输出位图的位图索引。也可以基于查询来访问第二索引，例如B树索引，以产生具有第二格式的第二结果，例如一系列的rowid。将第一结果转换为具有第二格式的转换结果，并将转换结果和第二结果组合以获得最终结果。然后可以使用最终结果来定位满足查询的数据，同时最小化在查询处理期间需要从表中检索的数据行。

16. 发明授权

US5903888A Method and apparatus for using incompatible types of indexes to process a single query 失效
公开(公告)号：US5903888A
公开(公告)日：1999-05-11
申请号：US808096
申请日：1997-02-28
申请人： Jeffrey Ira Cohen , Cetin Ozbutun , Hakan Jakobsson , Michael Depledge
发明人： Jeffrey Ira Cohen , Cetin Ozbutun , Hakan Jakobsson , Michael Depledge
IPC分类号： G06F17/30
CPC分类号： G06F17/30324 , G06F17/30327 , G06F17/30463 , G06F17/30492 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944
摘要： A method and apparatus for processing a query combines the use of different index types to minimize the rows of data that need to be retrieved from a table. A first index is accessed based on a query to produce a first result having a first format, for example a bitmap index outputting a bitmap. A second index, for example a B-tree index, is also accessed based on the query to produce a second result having a second format, for example a sequence of rowids. The first result is converted to a converted result having the second format, and the converted result and the second result are combined to obtain an end result. The end result can then be used to locate data that satisfies the query while minimizing the rows of data that need to be retrieved from a table during the query processing.

17. 发明授权

US5822748A Group by and distinct sort elimination using cost-based optimization 失效
标题翻译：使用基于成本优化的分组排序和排序
公开(公告)号：US5822748A
公开(公告)日：1998-10-13
申请号：US808097
申请日：1997-02-28
申请人： Jeffrey Ira Cohen , Cetin Ozbutun , Michael Depledge , Hakan Jakobsson
发明人： Jeffrey Ira Cohen , Cetin Ozbutun , Michael Depledge , Hakan Jakobsson
IPC分类号： G06F17/30
CPC分类号： G06F17/30454 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99937 , Y10S707/99953
摘要： Sort plus operations such as "group by" and "distinct" generally require sorting of the retrieved data before performing the sort plus operation. A method and apparatus is disclosed for executing a query specifying a sort plus operation without performing the sorting operation. A cost-based optimizer determines at least one execution path where the data is retrieved from a sorted source and the data is processed to satisfy the query without sorting. Execution costs are determined for the respective execution paths, and the execution path having the lowest overall execution cost is selected to process the query.
摘要翻译：分组加操作，例如“分组”和“不同”通常需要在执行排序加运算之前对检索的数据进行排序。公开了一种用于在不执行排序操作的情况下执行指定排序加操作的查询的方法和装置。基于成本的优化器确定至少一个执行路径，其中从排序的源检索数据，并且处理数据以满足查询而不进行排序。对于各个执行路径确定执行成本，并且选择具有最低总执行成本的执行路径来处理该查询。

18. 发明授权

US5848408A Method for executing star queries 失效
标题翻译：执行星型查询的方法
公开(公告)号：US5848408A
公开(公告)日：1998-12-08
申请号：US808621
申请日：1997-02-28
申请人： Hakan Jakobsson , Cetin Ozbutun , William H. Waddington
发明人： Hakan Jakobsson , Cetin Ozbutun , William H. Waddington
IPC分类号： G06F17/30
CPC分类号： G06F17/30498 , G06F17/30445 , G06F17/30501 , Y10S707/99932 , Y10S707/99933
摘要： A method and apparatus for processing star queries is provided. According to the method, a star query is transformed by adding to the star query subqueries that are not in the query. The subqueries are generated based on join predicates and constraints on dimension tables that are contained in the original query. The subqueries are executed, and the values returned by the subqueries are used to access one or more bitmap indexes built on columns of the fact table. The bitmaps retrieved for the values returned by each subquery are merged to create one subquery bitmap per subquery. An AND operation is performed on the subquery bitmaps, and the resulting bitmap is used to determine which data to retrieve from the fact table.
摘要翻译：提供了一种处理星型查询的方法和装置。根据该方法，通过添加到不在查询中的星型查询子查询来转换星型查询。子查询是基于原始查询中包含的维表上的连接谓词和约束生成的。执行子查询，子查询返回的值用于访问一个或多个基于事实表列的位图索引。为每个子查询返回的值检索的位图被合并，以便为每个子查询创建一个子查询位图。在子查询位图上执行AND操作，并且生成的位图用于确定从事实表中检索哪些数据。

19. 发明授权

US07092931B1 Methods and systems for database statement execution plan optimization 有权
标题翻译：数据库语句执行计划优化的方法和系统
公开(公告)号：US07092931B1
公开(公告)日：2006-08-15
申请号：US10144681
申请日：2002-05-10
申请人： Sanjay Kaluskar , Namit Jain , Hakan Jakobsson , Graham S. Wood
发明人： Sanjay Kaluskar , Namit Jain , Hakan Jakobsson , Graham S. Wood
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30463 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942
摘要： The methods and systems for database statement execution plan optimization exploit bind variable data available on the network to build and optimize an execution plan for the statement. A system for database statement execution plan optimization comprises a bind variable analyzer, a frame allocator, and an optimizer, in addition to a parser for parsing and analyzing the statement, a type checker for type checking the statement, and a tree builder for building an expression tree.
摘要翻译：数据库语句执行计划优化的方法和系统利用网络上可用的绑定变量数据来构建和优化语句的执行计划。用于数据库语句执行计划优化的系统除了用于解析和分析语句的解析器之外还包括绑定变量分析器，帧分配器和优化器，用于检查语句的类型检查器，以及用于构建语句的树构建器表达式树。

20. 发明授权

US06965891B1 Method and mechanism for partition pruning 有权
标题翻译：分割修剪的方法和机制
公开(公告)号：US06965891B1
公开(公告)日：2005-11-15
申请号：US09795904
申请日：2001-02-27
申请人： Hakan Jakobsson , Mohamed Zait , Benoit Dageville
发明人： Hakan Jakobsson , Mohamed Zait , Benoit Dageville
IPC分类号： G06F17/30
CPC分类号： G06F17/30333 , G06F17/3033 , G06F17/30492 , Y10S707/99935 , Y10S707/99945
摘要： A method and system for performing partition pruning for queries that include a non-single table predicate is disclosed. According to an embodiment of the invention, this type of query is processed by performing a transformation of the query to include additional predicates comprising subqueries. The transformed query includes single table predicates on the partitioning column of the table being queried, based upon join predicates that exist in the original query.
摘要翻译：公开了一种用于执行包括非单表谓词的查询的分割修剪的方法和系统。根据本发明的实施例，通过执行查询的变换以包括包括子查询的附加谓词来处理这种类型的查询。基于原始查询中存在的连接谓词，转换查询包括正在查询的表的分区列上的单表谓词。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式