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

1. 发明授权

US06980981B2 Method, system, and program for selecting a join order for tables subject to a join operation 失效
标题翻译：用于选择连接操作的表的连接顺序的方法，系统和程序
公开(公告)号：US06980981B2
公开(公告)日：2005-12-27
申请号：US10143410
申请日：2002-05-10
申请人： Thomas Abel Beavin , You-Chin Fuh , Joseph F. Sinnott, Jr.
发明人： Thomas Abel Beavin , You-Chin Fuh , Joseph F. Sinnott, Jr.
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , Y10S707/99932 , Y10S707/99933 , Y10S707/99937 , Y10S707/99938 , Y10S707/99942 , Y10S707/99943
摘要： Provided are a method, system, and program for selecting a join order for tables subject to a join operation. An estimation is made of a join cost to perform joins on permutations of at least two of the tables, wherein each join permutation indicates an order of joining the tables. A determination is made as to whether sufficient computational resources are available to perform a join cost analysis of further join permutations of the tables. If sufficient computational resources are not available, then a determination is made of a restricted subset of remaining join permutations of at least two of the tables for which join costs have not been estimated that is less than all the remaining join permutations. The join costs of permutations of tables in the restricted subset is estimated and the estimated join costs are used to select one join permutation of all the tables having a lowest estimated join cost.
摘要翻译：提供了一种用于选择连接操作的表的连接顺序的方法，系统和程序。估计在至少两个表的排列上执行连接的连接成本，其中每个连接置换指示连接表的顺序。确定足够的计算资源是否可用于执行表的进一步连接排列的连接成本分析。如果没有足够的计算资源，则确定尚未估计连接成本小于所有其余连接置换的表中至少两个的剩余连接置换的受限子集。估计受限子集中表的排列的连接成本，并且使用估计的连接成本来选择具有最低估计连接成本的所有表的一个连接排列。

2. 发明授权

US07970756B2 Generalized partition pruning in a database system 有权
标题翻译：数据库系统中的广义分区修剪
公开(公告)号：US07970756B2
公开(公告)日：2011-06-28
申请号：US12268391
申请日：2008-11-10
申请人： Thomas Abel Beavin , Sauraj Goswami , Terence Patrick Purcell
发明人： Thomas Abel Beavin , Sauraj Goswami , Terence Patrick Purcell
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30454 , G06F17/30492 , Y10S707/99935 , Y10S707/99943 , Y10S707/99945
摘要： A system for executing a query on data that has been partitioned into a plurality of partitions is provided. The system includes providing partitioned data including one or more columns and the plurality of partitions. The partitioned data includes a limit key value associated with each column for a given partition. The system further includes receiving a query including a predicate on one of the one or more columns of the partitioned data; and utilizing the predicate on the one of the one or more columns in a pruning decision on at least one of the one or more partitions based on the limit key values associated with the plurality of partitions.
摘要翻译：提供了一种用于执行对已被分割成多个分区的数据的查询的系统。该系统包括提供包括一个或多个列和多个分区的分区数据。分区数据包括与给定分区的每列关联的限制键值。该系统还包括在分区数据的一列或多列之一上接收包括谓词的查询; 以及基于与所述多个分区相关联的所述限制键值，在所述一个或多个分区中的至少一个分割中的所述一个或多个列中的所述一个或多个列中的所述谓词。

3. 发明授权

US6026412A Interaction between application of a log and maintenance of a table that maps record identifiers during online reorganization of a database 失效
标题翻译：在数据库的在线重组期间，应用日志和维护映射记录标识符的表之间的交互
公开(公告)号：US6026412A
公开(公告)日：2000-02-15
申请号：US885955
申请日：1997-06-30
申请人： Gary Howard Sockut , Thomas Abel Beavin
发明人： Gary Howard Sockut , Thomas Abel Beavin
IPC分类号： G06F17/30
CPC分类号： G06F17/30339 , Y10S707/99952 , Y10S707/99953
摘要： The present invention includes reorganization of a Database Management System (DBMS). The reorganization of the present invention is implemented by recording a first current Relative Byte Address (RBA). Then, data is copied from the old area in the table space to a new area in the table space in reorganized form. In the present invention, throughout most of reorganization a user maintains access to the DBMS's normal facilities to read and write to the old area. The DBMS uses its normal facilities to record writing, which occurs during reorganization, in a log. The reorganization in accordance with the present invention reads the log (that has been written to during reorganization) and processes the log to the new area to bring the new area up to date. This process is performed with the use of a RID mapping table. Finally, at the end of reorganization, the user's access is switched from the old area to the new area.
摘要翻译：本发明包括重组数据库管理系统（DBMS）。通过记录第一当前相对字节地址（RBA）来实现本发明的重组。然后，将数据从表空间中的旧区域复制到重新组织形式的表空间中的新区域。在本发明中，在整个大部分重组中，用户维护对DBMS正常设施的访问以读写旧区域。 DBMS使用其正常的设施来记录在重组期间发生的记录。根据本发明的重组读取记录（在重组期间已写入日志）并将日志处理到新区域以使新区域更新。使用RID映射表来执行该过程。最后，在重组结束时，用户的访问从旧区域切换到新的区域。

4. 发明授权

US07461060B2 Generalized partition pruning in a database system 有权
标题翻译：数据库系统中的广义分区修剪
公开(公告)号：US07461060B2
公开(公告)日：2008-12-02
申请号：US11242951
申请日：2005-10-04
申请人： Thomas Abel Beavin , Sauraj Goswami , Terence Patrick Purcell
发明人： Thomas Abel Beavin , Sauraj Goswami , Terence Patrick Purcell
IPC分类号： G06F7/00 , G06F17/30 , G06F17/00
CPC分类号： G06F17/30454 , G06F17/30492 , Y10S707/99935 , Y10S707/99943 , Y10S707/99945
摘要： Methods for executing a query on data that has been partitioned into a plurality of partitions are provided. The method includes providing partitioned data including one or more columns and the plurality of partitions. The partitioned data includes a limit key value associated with each column for a given partition. The method further includes receiving a query including a predicate on one of the one or more columns of the partitioned data; and utilizing the predicate on the one of the one or more columns in a pruni.ng decision on at least one of the one or more partitions based on the limit key values associated with the plurality of partitions.
摘要翻译：提供了对已经被分割成多个分区的数据执行查询的方法。该方法包括提供包括一个或多个列和多个分区的分区数据。分区数据包括与给定分区的每列关联的限制键值。该方法还包括在分区数据的一列或多列之一上接收包括谓词的查询; 以及基于与所述多个分区相关联的所述限制密钥值，在所述一个或多个分区中的至少一个分区上的所述一个或多个列中的所述一个或多个列中的所述谓词。

5. 发明授权

US5940819A User specification of query access paths in a relational database management system 失效
标题翻译：关系数据库管理系统中查询访问路径的用户规范
公开(公告)号：US5940819A
公开(公告)日：1999-08-17
申请号：US920531
申请日：1997-08-29
申请人： Thomas Abel Beavin , Donald J. Haderle , Akira Shibamiya , Hong Sang Tie , Yun Wang
发明人： Thomas Abel Beavin , Donald J. Haderle , Akira Shibamiya , Hong Sang Tie , Yun Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30306 , Y10S707/99932 , Y10S707/99933 , Y10S707/99942
摘要： A relational data base management system includes a query processor that permits consideration of alternative user-specified access paths, which the processor will validate and incorporate into the query execution plan it otherwise generates. The optimizer of the query processor retrieves user-specified data that defines an access path for a query during bind operations. Any access path parameters that are invalid are replaced with processor-selected values.
摘要翻译：关系数据库管理系统包括查询处理器，该查询处理器允许考虑替代的用户指定的访问路径，处理器将验证其并且并入其否则生成的查询执行计划中。查询处理器的优化器检索在绑定操作期间定义查询的访问路径的用户指定的数据。任何无效的访问路径参数都被处理器选择的值替换。

6. 发明授权

US07499917B2 Processing cross-table non-Boolean term conditions in database queries 失效
标题翻译：在数据库查询中处理跨表非布尔项条件
公开(公告)号：US07499917B2
公开(公告)日：2009-03-03
申请号：US11046278
申请日：2005-01-28
申请人： Terence Patrick Purcell , Thomas Abel Beavin
发明人： Terence Patrick Purcell , Thomas Abel Beavin
IPC分类号： G06F17/30
CPC分类号： G06F17/30483 , Y10S707/99932 , Y10S707/99933
摘要： Processing non-Boolean term conditions in database queries. A query that is a request for data in a database is received and includes at least one uneven non-Boolean term condition that spans multiple tables in the database. The non-Boolean term condition is split into separate portions, each of the portions providing a Boolean term that can be satisfied by accessing one table in the database. The separate portions are executed independently to find at least one data result in the database that satisfies the Boolean term of each separate portion, and the data result from each separate portion are combined into a final result that satisfies the query.
摘要翻译：处理数据库查询中的非布尔项条件。接收到对数据库中的数据请求的查询，并且包括跨越数据库中的多个表的至少一个不均匀的非布尔项条件。非布尔项条件被分为单独的部分，每个部分提供一个布尔项，可以通过访问数据库中的一个表来满足。独立地执行单独部分以在数据库中找到满足每个单独部分的布尔项的至少一个数据结果，并且将来自每个单独部分的数据结果组合成满足查询的最终结果。

7. 发明授权

US07376646B2 Cost-based subquery correlation and decorrelation 失效
标题翻译：基于成本的子查询相关和去相关
公开(公告)号：US07376646B2
公开(公告)日：2008-05-20
申请号：US11156500
申请日：2005-06-17
申请人： Thomas Abel Beavin , Mengchu Cai , Yao-Ching Stephen Chen , Hsiuying Yen Cheng , Fen-Ling Lin , Irene Ching-Hua Liu , Jerry Mukai , Demai Ni , Yoichi Tsuji , Li Xia , Ying Zeng
发明人： Thomas Abel Beavin , Mengchu Cai , Yao-Ching Stephen Chen , Hsiuying Yen Cheng , Fen-Ling Lin , Irene Ching-Hua Liu , Jerry Mukai , Demai Ni , Yoichi Tsuji , Li Xia , Ying Zeng
IPC分类号： G06F17/30
CPC分类号： G06F17/30436 , G06F17/30442 , Y10S707/99933 , Y10S707/99934 , Y10S707/99943
摘要： Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table.
摘要翻译：提供了确定查询包括至少一个可以相关或解相关的子查询的技术。生成表示相关和解相关形式的子查询的查询的内部表示，其中内部表示包括至少一个虚拟表。

8. 发明授权

US6038569A System for data structure loading with concurrent image copy 失效
标题翻译：用于并行映像副本的数据结构加载系统
公开(公告)号：US6038569A
公开(公告)日：2000-03-14
申请号：US798532
申请日：1997-02-10
申请人： Thomas Abel Beavin , John Marland Garth , Laura Michiko Kunioka-Weis , James Zu-Chia Teng
发明人： Thomas Abel Beavin , John Marland Garth , Laura Michiko Kunioka-Weis , James Zu-Chia Teng
IPC分类号： G06F17/30
CPC分类号： G06F17/30315 , Y10S707/915 , Y10S707/99937 , Y10S707/99943 , Y10S707/99945 , Y10S707/99954
摘要： Data is loaded to a data structure while an image copy of the data structure is concurrently formed. After data records are obtained from one or more data sources, each of the data records is associated with one of multiple pages. As each page is completed, it is written to a primary data structure. Also upon completion of each page in the primary data structure, concurrently with storage of the page in the primary data structure, an image copy of the page is made in an image copy data set. Partially or completely failed primary data structures may also be restored using image copies made according to the invention. Timestamps mark the time at which each page are made; image copy pages include the same timestamp as their respective primary pages. Upon detecting a data structure failure, each page of the image copy is sequentially reviewed. For each image page being reviewed, the page's timestamp is compared with the timestamp of the corresponding page from the primary data structure. The page is copied from the image copy to the primary data structure only if the timestamp comparison indicates that the image page is more recent than the page from the primary data structure.
摘要翻译：数据被加载到数据结构，同时形成数据结构的图像副本。在从一个或多个数据源获得数据记录之后，每个数据记录与多个页面之一相关联。当每个页面完成时，它被写入主数据结构。此外，在主数据结构中的每个页面完成时，与主数据结构中的页面的存储同时，在图像复制数据集中进行页面的图像副本。也可以使用根据本发明制造的图像副本来恢复部分或完全失败的主数据结构。时间戳标记每个页面的时间; 图像复制页面包含与其各自的主页面相同的时间戳。在检测到数据结构故障时，依次审查图像副本的每一页。对于正在审核的每个图像页面，将页面的时间戳与主数据结构中相应页面的时间戳进行比较。只有当时间戳比较指示图像页面比主数据结构中的页面更新时，页面才从图像副本复制到主数据结构。

9. 发明授权

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

10. 发明授权

US08200657B2 Processing cross-table non-boolean term conditions in database queries 有权
标题翻译：在数据库查询中处理跨表非布尔项条件
公开(公告)号：US08200657B2
公开(公告)日：2012-06-12
申请号：US12239654
申请日：2008-09-26
申请人： Terence Patrick Purcell , Thomas Abel Beavin
发明人： Terence Patrick Purcell , Thomas Abel Beavin
IPC分类号： G06F17/30
CPC分类号： G06F17/30483 , Y10S707/99932 , Y10S707/99933
摘要： Processing non-Boolean term conditions in database queries. A query that is a request for data in a database is received and includes at least one uneven non-Boolean term condition that spans multiple tables in the database. The non-Boolean term condition is split into separate portions, each of the portions providing a Boolean term that can be satisfied by accessing one table in the database. The separate portions are executed independently to find at least one data result in the database that satisfies the Boolean term of each separate portion, and the data result from each separate portion are combined into a final result that satisfies the query.
摘要翻译：处理数据库查询中的非布尔项条件。接收到对数据库中的数据请求的查询，并且包括跨越数据库中的多个表的至少一个不均匀的非布尔项条件。非布尔项条件被分为单独的部分，每个部分提供一个布尔项，可以通过访问数据库中的一个表来满足。独立地执行单独部分以在数据库中找到满足每个单独部分的布尔项的至少一个数据结果，并且将来自每个单独部分的数据结果组合成满足查询的最终结果。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式