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

1. 发明申请

US20090100089A1 Reference partitioned tables 有权
标题翻译：引用分区表
公开(公告)号：US20090100089A1
公开(公告)日：2009-04-16
申请号：US11974084
申请日：2007-10-11
申请人： George Eadon , Eugene Inseok Chong , Shrikanth Shankar , Ananth Raghavan , Jagannathan Srinivasan , Souriprlya Das
发明人： George Eadon , Eugene Inseok Chong , Shrikanth Shankar , Ananth Raghavan , Jagannathan Srinivasan , Souriprlya Das
IPC分类号： G06F7/00
CPC分类号： G06F17/30595 , G06F17/30486 , Y10S707/953 , Y10S707/954
摘要： Systems, methodologies, media, and other embodiments associated with supporting reference partitioned tables in a relational database are described. One example method includes identifying a partitioning strategy (e.g., range, list, hash) associated with a parent table that is related to a child table by a referential constraint. The example method may also include creating the child table to be a reference-partitioned table partitioned according to the partitioning strategy associated with the parent table. The example method may also include creating the child table to be equi-partitioned with respect to the parent table. The child table is not to replicate a partition key of the parent table but rather is to inherit a partitioning key associated with the parent table through a foreign key relationship.
摘要翻译：描述了在关系数据库中支持参考分区表的系统，方法，媒体和其他实施例。一个示例性方法包括通过参考约束识别与父表相关联的分割策略（例如，范围，列表，散列）。示例方法还可以包括根据与父表相关联的分区策略将子表创建为被分区的引用分区表。示例性方法还可以包括创建相对于父表等份分割的子表。子表不是复制父表的分区密钥，而是通过外键关系继承与父表关联的分区密钥。

2. 发明授权

US07870174B2 Reference partitioned tables 有权
标题翻译：引用分区表
公开(公告)号：US07870174B2
公开(公告)日：2011-01-11
申请号：US11974084
申请日：2007-10-11
申请人： George Eadon , Eugene Inseok Chong , Shrikanth Shankar , Ananth Raghavan , Jagannathan Srinivasan , Souripriya Das
发明人： George Eadon , Eugene Inseok Chong , Shrikanth Shankar , Ananth Raghavan , Jagannathan Srinivasan , Souripriya Das
IPC分类号： G06F17/30
CPC分类号： G06F17/30595 , G06F17/30486 , Y10S707/953 , Y10S707/954
摘要： Systems, methodologies, media, and other embodiments associated with supporting reference partitioned tables in a relational database are described. One example method includes identifying a partitioning strategy (e.g., range, list, hash) associated with a parent table that is related to a child table by a referential constraint. The example method may also include creating the child table to be a reference-partitioned table partitioned according to the partitioning strategy associated with the parent table. The example method may also include creating the child table to be equi-partitioned with respect to the parent table. The child table is not to replicate a partition key of the parent table but rather is to inherit a partitioning key associated with the parent table through a foreign key relationship.
摘要翻译：描述了在关系数据库中支持参考分区表的系统，方法，媒体和其他实施例。一个示例性方法包括通过参考约束识别与父表相关联的分割策略（例如，范围，列表，散列）。示例方法还可以包括根据与父表相关联的分区策略将子表创建为被分区的引用分区表。示例性方法还可以包括创建相对于父表等份分割的子表。子表不是复制父表的分区密钥，而是通过外键关系继承与父表关联的分区密钥。

3. 发明授权

US07644106B2 Avoiding lock contention by using a wait for completion mechanism 有权
标题翻译：通过使用等待完成机制避免锁争用
公开(公告)号：US07644106B2
公开(公告)日：2010-01-05
申请号：US11830538
申请日：2007-07-30
申请人： Shrikanth Shankar , Ramesh Kumar , Amirali S. Valiani , Vasudha Krishnaswamy , Ananth Raghavan , Juan R. Loaiza
发明人： Shrikanth Shankar , Ramesh Kumar , Amirali S. Valiani , Vasudha Krishnaswamy , Ananth Raghavan , Juan R. Loaiza
IPC分类号： G06F17/30
CPC分类号： G06F17/30362 , Y10S707/99952
摘要： Techniques for avoiding lock contention when processing data definition language (DDL) statements are provided. Some DDL statements modify metadata of a table and then require access to the table. After such a DDL statement modifies the metadata of a table and the updated metadata is made available (i.e., published) to other database statements, execution of the DDL statement is suspended. Data manipulation language (DML) statements acquire locks on the table. In one approach, the locks, of any DML statement, that are granted after the DDL statement is issued are timestamped. The DDL statement uses the timestamps to determine when to access the table. The timestamps are used to determine when the last DML statement (that was pending at the time the modified metadata was published) commits and releases its lock on the table.
摘要翻译：提供处理数据定义语言（DDL）语句时避免锁争用的技术。一些DDL语句修改表的元数据，然后需要访问该表。在这样一个DDL语句修改表的元数据之后，更新后的元数据可用（即发布）到其他数据库语句，DDL语句的执行被暂停。数据操作语言（DML）语句获取表上的锁。在一种方法中，在发出DDL语句之后授予的任何DML语句的锁定是时间戳的。 DDL语句使用时间戳来确定何时访问表。时间戳用于确定最后一个DML语句（修改后的元数据发布时待处理的）是否提交并释放其在表上的锁定。

4. 发明申请

US20090037417A1 AVOIDING LOCK CONTENTION BY USING A WAIT FOR COMPLETION MECHANISM 有权
标题翻译：通过等待完成机制避免锁定
公开(公告)号：US20090037417A1
公开(公告)日：2009-02-05
申请号：US11830538
申请日：2007-07-30
申请人： Shrikanth Shankar , Ramesh Kumar , Amirali S. Valiani , Vasudha Krishnaswamy , Ananth Raghavan , Juan R. Loaiza
发明人： Shrikanth Shankar , Ramesh Kumar , Amirali S. Valiani , Vasudha Krishnaswamy , Ananth Raghavan , Juan R. Loaiza
IPC分类号： G06F17/30
CPC分类号： G06F17/30362 , Y10S707/99952
摘要： Techniques for avoiding lock contention when processing data definition language (DDL) statements are provided. Some DDL statements modify metadata of a table and then require access to the table. After such a DDL statement modifies the metadata of a table and the updated metadata is made available (i.e., published) to other database statements, execution of the DDL statement is suspended. Data manipulation language (DML) statements acquire locks on the table. In one approach, the locks, of any DML statement, that are granted after the DDL statement is issued are timestamped. The DDL statement uses the timestamps to determine when to access the table. The timestamps are used to determine when the last DML statement (that was pending at the time the modified metadata was published) commits and releases its lock on the table.
摘要翻译：提供处理数据定义语言（DDL）语句时避免锁争用的技术。一些DDL语句修改表的元数据，然后需要访问该表。在这样一个DDL语句修改表的元数据之后，更新后的元数据可用（即发布）到其他数据库语句，DDL语句的执行被暂停。数据操作语言（DML）语句获取表上的锁。在一种方法中，在发出DDL语句之后授予的任何DML语句的锁定是时间戳的。 DDL语句使用时间戳来确定何时访问表。时间戳用于确定最后一个DML语句（修改后的元数据发布时待处理的）是否提交并释放其在表上的锁定。

5. 发明申请

US20080046454A1 METHODS FOR PARTITIONING AN OBJECT 有权
标题翻译：用于分配对象的方法
公开(公告)号：US20080046454A1
公开(公告)日：2008-02-21
申请号：US11871529
申请日：2007-10-12
申请人： Subhransu Basu , Ananth Raghavan , Shrikanth Shankar , Vikram Shukla
发明人： Subhransu Basu , Ananth Raghavan , Shrikanth Shankar , Vikram Shukla
IPC分类号： G06F17/30
CPC分类号： G06F17/30587 , Y10S707/953 , Y10S707/972 , Y10S707/99932 , Y10S707/99942 , Y10S707/99943
摘要： The concept of portioning is expanded with a variety of techniques. In particular, one technique involves partitioning an object at multiple levels, where at least one of the levels uses list-based partitioning. Further, a partitioning technique is provided which involves storing a data item in a default partition when the item does not map to any one of the list-based partitions for which a key value group has been defined. Techniques are also provided for efficiently splitting a partition.
摘要翻译：分割的概念用各种技术扩展。特别地，一种技术涉及在多个级别上划分对象，其中至少一个级别使用基于列表的分区。此外，提供了一种分割技术，其涉及当项目不映射到已经定义了键值组的基于列表的分区中的任何一个时，将数据项存储在默认分区中。还提供了用于有效地分割分区的技术。

6. 发明授权

US07966330B2 Techniques for partition pruning 有权
标题翻译：分割修剪技术
公开(公告)号：US07966330B2
公开(公告)日：2011-06-21
申请号：US12903013
申请日：2010-10-12
申请人： Ananth Raghavan , Shrikanth Shankar
发明人： Ananth Raghavan , Shrikanth Shankar
IPC分类号： G06F17/30 , G06F15/16
CPC分类号： G06F17/30492
摘要： Techniques are described for performing partition pruning in situations where previous database servers could not. Specifically, techniques are provided for (1) performing partition pruning based on predicates that involve non-prefix subsets of composite partitioning keys, (2) performing partition pruning when a global index access path is used to execute a query, and (3) performing partition pruning when predicates on partitioning columns are OR-ed together. More generally, techniques are described for partition pruning based on a non-contiguous set of not-pruned partitions.
摘要翻译：描述了在以前的数据库服务器不能执行的情况下执行分区修剪的技术。具体地说，提供了（1）基于包含复合分区键的非前缀子集的谓词进行分割修剪的技术，（2）当使用全局索引访问路径执行查询时执行分割修剪，以及（3）执行在分区列上的谓词分割OR-ed时，进行分割修剪。更一般来说，描述了基于不连续的未修剪分区集合进行分割修剪的技术。

7. 发明授权

US07814104B2 Techniques for partition pruning 有权
标题翻译：分割修剪技术
公开(公告)号：US07814104B2
公开(公告)日：2010-10-12
申请号：US11124454
申请日：2005-05-04
申请人： Ananth Raghavan , Shrikanth Shankar
发明人： Ananth Raghavan , Shrikanth Shankar
IPC分类号： G06F17/30 , G06F15/16
CPC分类号： G06F17/30492
摘要： Techniques are described for performing partition pruning in situations where previous database servers could not. Specifically, techniques are provided for (1) performing partition pruning based on predicates that involve non-prefix subsets of composite partitioning keys, (2) performing partition pruning when a global index access path is used to execute a query, and (3) performing partition pruning when predicates on partitioning columns are OR-ed together. More generally, techniques are described for partition pruning based on a non-contiguous set of not-pruned partitions.
摘要翻译：描述了在以前的数据库服务器不能执行的情况下执行分区修剪的技术。具体地说，提供了（1）基于包含复合分区键的非前缀子集的谓词进行分割修剪的技术，（2）当使用全局索引访问路径执行查询时执行分割修剪，以及（3）执行在分区列上的谓词分割OR-ed时，进行分割修剪。更一般来说，描述了基于不连续的未修剪分区集合进行分割修剪的技术。

8. 发明申请

US20090037416A1 METHOD FOR ACQUIRING LOCKS IN WAIT MODE IN A DEADLOCK FREE MANNER 有权
标题翻译：在无人值守的等待模式下获得锁的方法
公开(公告)号：US20090037416A1
公开(公告)日：2009-02-05
申请号：US11830528
申请日：2007-07-30
申请人： Ananth Raghavan , Shrikanth Shankar , Ramesh Kumar
发明人： Ananth Raghavan , Shrikanth Shankar , Ramesh Kumar
IPC分类号： G06F17/30
CPC分类号： G06F17/30362
摘要： Techniques for a data definition language (DDL) statement acquiring a lock on a table in wait mode in a deadlock free manner are provided. A DDL statement specifies metadata of a table that is to be modified, whereas a data manipulation language (DML) statement specifies a table to be modified. When a DDL statement is received, a proxy statement is initiated and executed instead of first acquiring an exclusive lock on metadata of a particular table. The proxy statement is similar to a DML statement in that the proxy statement acquires a lock on the particular table. After the proxy statement has been processed, an exclusive lock on the metadata is acquired.
摘要翻译：提供了一种数据定义语言（DDL）语句以无死锁的方式获取等待模式下的表的锁的技术。 DDL语句指定要修改的表的元数据，而数据操作语言（DML）语句指定要修改的表。当接收到DDL语句时，将发起并执行代理语句，而不是首先获取特定表的元数据的排他锁。代理语句类似于DML语句，因为代理语句获取特定表上的锁。在处理代理语句之后，获取元数据的排他锁。

9. 发明申请

US20110029557A1 TECHNIQUES FOR PARTITION PRUNING 有权
标题翻译：用于分区激活的技术
公开(公告)号：US20110029557A1
公开(公告)日：2011-02-03
申请号：US12903013
申请日：2010-10-12
申请人： Ananth Raghavan , Shrikanth Shankar
发明人： Ananth Raghavan , Shrikanth Shankar
IPC分类号： G06F17/30
CPC分类号： G06F17/30492
摘要： Techniques are described for performing partition pruning in situations where previous database servers could not. Specifically, techniques are provided for (1) performing partition pruning based on predicates that involve non-prefix subsets of composite partitioning keys, (2) performing partition pruning when a global index access path is used to execute a query, and (3) performing partition pruning when predicates on partitioning columns are OR-ed together. More generally, techniques are described for partition pruning based on a non-contiguous set of not-pruned partitions.
摘要翻译：描述了在以前的数据库服务器不能执行的情况下执行分区修剪的技术。具体地说，提供了（1）基于包含复合分区键的非前缀子集的谓词进行分割修剪的技术，（2）当使用全局索引访问路径执行查询时执行分割修剪，以及（3）执行在分区列上的谓词分割OR-ed时，进行分割修剪。更一般来说，描述了基于不连续的未修剪分区集合进行分割修剪的技术。

10. 发明授权

US07774379B2 Methods for partitioning an object 有权
公开(公告)号：US07774379B2
公开(公告)日：2010-08-10
申请号：US11871529
申请日：2007-10-12
申请人： Subhransu Basu , Ananth Raghavan , Shrikanth Shankar , Vikram Shukla
发明人： Subhransu Basu , Ananth Raghavan , Shrikanth Shankar , Vikram Shukla
IPC分类号： G06F17/30
CPC分类号： G06F17/30587 , Y10S707/953 , Y10S707/972 , Y10S707/99932 , Y10S707/99942 , Y10S707/99943
摘要： The concept of portioning is expanded with a variety of techniques. In particular, one technique involves partitioning an object at multiple levels, where at least one of the levels uses list-based partitioning. Further, a partitioning technique is provided which involves storing a data item in a default partition when the item does not map to any one of the list-based partitions for which a key value group has been defined. Techniques are also provided for efficiently splitting a partition.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式