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

21. 发明申请

US20160048415A1 Systems and Methods for Auto-Scaling a Big Data System 审中-公开
标题翻译：自动缩放大数据系统的系统和方法
公开(公告)号：US20160048415A1
公开(公告)日：2016-02-18
申请号：US14459631
申请日：2014-08-14
申请人： Joydeep Sen Sarma , Mayank Ahuja , Sivaramakrishnan Narayanan , Shrikanth Shankar
发明人： Joydeep Sen Sarma , Mayank Ahuja , Sivaramakrishnan Narayanan , Shrikanth Shankar
IPC分类号： G06F9/50
CPC分类号： G06F9/5083 , G06F9/5072
摘要： Systems and methods for automatically scaling a big data system are disclosed. Methods may include: determining, at a first time, a first optimal number of nodes for a cluster to adequately process a request; assigning an amount of nodes equal to the first optimal number; determining a rate of progress of the request; determining, at a second time based on the rate of progress a second optimal number of nodes; and modifying the number of nodes assigned to the cluster to equal the second optimal number. Systems may include: a cluster manager, to add and/or remove nodes; a big data system, to process requests that utilize the cluster and nodes, and an automatic scaling cluster manager, including: a big data interface, for communicating with the big data system; a cluster manager interface, for communicating with a cluster manager instructions for adding and/or removing nodes from a cluster used to process a request; and a cluster state machine.
摘要翻译：公开了用于自动缩放大数据系统的系统和方法。方法可以包括：在第一时间确定簇的第一最佳数量的节点以充分地处理请求; 分配等于第一最优数的节点数; 确定请求的进度; 基于所述进展速度在第二时间确定第二最佳数量的节点; 以及修改分配给所述集群的节点数量等于所述第二最佳数量。系统可以包括：群集管理器，用于添加和/或移除节点; 一个大数据系统，用于处理利用集群和节点的请求，以及一个自动扩展集群管理器，包括：一个大数据接口，用于与大数据系统进行通信; 集群管理器接口，用于与集群管理器通信用于从用于处理请求的集群中添加和/或移除节点的指令; 和集群状态机。

22. 发明申请

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时，进行分割修剪。更一般来说，描述了基于不连续的未修剪分区集合进行分割修剪的技术。

23. 发明申请

US20060253429A1 Techniques for partition pruning 有权
标题翻译：分割修剪技术
公开(公告)号：US20060253429A1
公开(公告)日：2006-11-09
申请号：US11124454
申请日：2005-05-04
申请人： 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时，进行分割修剪。更一般来说，描述了基于不连续的未修剪分区集合进行分割修剪的技术。

24. 发明申请

US20050131877A1 Executing filter subqueries using a parallel single cursor model 有权
标题翻译：使用并行单光标模型执行过滤器子查询
公开(公告)号：US20050131877A1
公开(公告)日：2005-06-16
申请号：US10841991
申请日：2004-05-06
申请人： Bhaskar Ghosh , Thierry Cruanes , Rushan Chen , Shrikanth Shankar
发明人： Bhaskar Ghosh , Thierry Cruanes , Rushan Chen , Shrikanth Shankar
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30445
摘要： Techniques are provided for generating execution plans for, and executing, database statements that contain filter subqueries. Upon receiving a database statement that contains a filter subquery, the database server builds an execution plan that includes a filter operation that is fed by a subtree that corresponds to the subquery. The database server performs a cost analysis to determine whether (1) the filter operation should be parallelized, and (2) the subquery tree should be parallelized. Techniques are also described for generating plans and executing queries where (1) both the filter operation and the subquery subtree are parallelized, (2) the filter operation is parallelized but the subquery subtree operation is performed serially, and (3) the filter operation is performed serially but the subquery subtree operation is parallelized.
摘要翻译：提供了技术来生成包含过滤器子查询的数据库语句的执行计划和执行。在收到包含过滤器子查询的数据库语句之后，数据库服务器构建一个执行计划，其中包含由子查询对应的子树进行的过滤操作。数据库服务器执行成本分析来确定（1）是否应该并行化过滤器操作，以及（2）子查询树应该并行化。还描述了用于生成计划和执行查询的技术，其中（1）过滤器操作和子查询子树都被并行化，（2）过滤操作并行化，但是子查询子树操作被串行执行，并且（3）过滤器操作串行执行子查询子树操作并行化。

25. 发明申请

US20160117107A1 High Performance Hadoop with New Generation Instances 审中-公开
标题翻译：具有新一代实例的高性能Hadoop
公开(公告)号：US20160117107A1
公开(公告)日：2016-04-28
申请号：US14920640
申请日：2015-10-22
申请人： Mayank Ahuja , Joydeep Sen Sarma , Shrikanth Shankar
发明人： Mayank Ahuja , Joydeep Sen Sarma , Shrikanth Shankar
IPC分类号： G06F3/06
CPC分类号： G06F3/0604 , G06F3/061 , G06F3/0644 , G06F3/0649 , G06F3/067 , G06F3/0685
摘要： The present invention is generally directed to a distributed computing system comprising a plurality of computational clusters, each computational cluster comprising a plurality of compute optimized instances, each instance comprising local instance data storage and in communication with reserved disk storage, wherein processing hierarchy provides priority to local instance data storage before providing priority to reserved disk storage.
摘要翻译：本发明一般涉及包括多个计算集群的分布式计算系统，每个计算集群包括多个计算优化实例，每个实例包括本地实例数据存储并与保留磁盘存储器通信，其中处理层次结构提供优先级本地实例数据存储，然后提供优先级到保留的磁盘存储。

26. 发明授权

US08356014B2 Referring to partitions with for (values) clause 有权
标题翻译：参考带有for（values）子句的分区
公开(公告)号：US08356014B2
公开(公告)日：2013-01-15
申请号：US11764129
申请日：2007-06-15
申请人： Shrikanth Shankar , Ananth Raghavan , Badhri G. Varanasi
发明人： Shrikanth Shankar , Ananth Raghavan , Badhri G. Varanasi
IPC分类号： G06F7/00
CPC分类号： G06F17/30339
摘要： A method and apparatus for referencing a partition of a data storage space in a request to perform an operation with relation to the partition are disclosed. The techniques disclosed do not rely on knowing the partition's name, thus simplifying the process of requesting a database to perform an operation on a partition when that partition's name is unknown. Data such as a DDL statement is received. The data indicates a value in a FOR clause in lieu of the partition name. The data also indicates an operation to be performed with respect to a particular partition of the partitioned space. The particular partition is not named in the received data. Based on the value, it is determined that the particular partition is a first partition. The operation is performed with respect to the first partition.
摘要翻译：公开了一种用于在执行与分区相关的操作的请求中引用数据存储空间的分区的方法和装置。所公开的技术不依赖于知道分区的名称，因此简化了当该分区的名称未知时请求数据库对分区执行操作的过程。接收到DDL语句等数据。数据表示FOR子句中的值代替分区名称。该数据还指示相对于分割空间的特定分区执行的操作。特定分区在接收的数据中未命名。基于该值，确定特定分区是第一分区。相对于第一分区执行操作。

27. 发明授权

US08209294B2 Dynamic creation of database partitions 有权
标题翻译：动态创建数据库分区
公开(公告)号：US08209294B2
公开(公告)日：2012-06-26
申请号：US11764121
申请日：2007-06-15
申请人： Shrikanth Shankar , Ananth Raghavan , Badhri G. Varanasi
发明人： Shrikanth Shankar , Ananth Raghavan , Badhri G. Varanasi
IPC分类号： G06F7/00
CPC分类号： G06F17/30339 , G06F17/30486
摘要： A method and apparatus for managing data in a partitioned data storage space is provided. Data referencing a new data item to be stored in the data storage space is received. It is determined that the data item does not pertain to any previously created partition. In response to the determination, a new partition is automatically created in the data storage space. The partition is mapped to a new set of values, such as to a next unpartitioned interval of dates or numbers.
摘要翻译：提供了一种用于管理分区数据存储空间中的数据的方法和装置。接收到要存储在数据存储空间中的新数据项的数据。确定数据项与任何先前创建的分区无关。响应于确定，在数据存储空间中自动创建新的分区。分区映射到一组新的值，例如到下一个未分区的日期或数字间隔。

28. 发明授权

US08195702B2 Online index builds and rebuilds without blocking locks 有权
标题翻译：在线索引构建和重建而不阻止锁定
公开(公告)号：US08195702B2
公开(公告)日：2012-06-05
申请号：US11830545
申请日：2007-07-30
申请人： Shrikanth Shankar , Ramesh Kumar , Krishna Kunchithapadam , Ananth Raghavan , Dheeraj Pandey , Amit Ganesh , Joy M. Forsythe
发明人： Shrikanth Shankar , Ramesh Kumar , Krishna Kunchithapadam , Ananth Raghavan , Dheeraj Pandey , Amit Ganesh , Joy M. Forsythe
IPC分类号： G06F17/30
CPC分类号： G06F17/30336
摘要： Techniques are provided for processing a CREATE INDEX statement that avoids one or more locks on the underlying table. The processing of such a statement may be divided into a build phase and a cooperation phase. During the build phase, a journal table is created and published. A snapshot of the table is obtained after the last DML transaction (that was pending at the time the journal table was published) commits. The index is built based on the state of the table as of the snapshot. Any changes to the table while the index is built are recorded in the journal table. During the cooperation phase, the index is partially published. A subsequent DML statement determines whether any changes in the journal table affect the same data as the subsequent DML statement. If so, then those changes are applied to the index followed by the subsequent DML statement.
摘要翻译：提供了技术来处理CREATE INDEX语句，以避免基础表上的一个或多个锁。这种陈述的处理可分为建立阶段和合作阶段。在构建阶段，创建并发布日志表。该表的快照是在最后一个DML事务（在发布日志表时挂起的）提交之后获得的。索引是基于快照的表的状态构建的。索引构建时对表的任何更改记录在日记表中。在合作阶段，该指数部分公布。随后的DML语句确定日记表表中的任何更改是否会影响与后续DML语句相同的数据。如果是这样，那么这些更改将应用于后面跟随的DML语句的索引。

29. 发明授权

US08135688B2 Partition/table allocation on demand 有权
标题翻译：按需分配/分配表
公开(公告)号：US08135688B2
公开(公告)日：2012-03-13
申请号：US11764131
申请日：2007-06-15
申请人： Shrikanth Shankar , Ananth Raghavan , Badhri G. Varanasi
发明人： Shrikanth Shankar , Ananth Raghavan , Badhri G. Varanasi
IPC分类号： G06F17/30
CPC分类号： G06F17/30312 , G06F17/30486
摘要： A method and apparatus for the on-demand allocation of segments and creation of metadata for previously-created data storage spaces and partitions are provided. A space is created in a database. As part of this creation process, no segment is allocated for the space. Rather, metadata describing the space sufficiently to allocate the segment in the future is created and maintained by the database. Data is received indicating a new item. Based on the metadata, it is determined that the new item pertains to the space. In response to the determination, a segment is allocated for the space. Additional metadata necessary for normal database operations in relation to the space and newly-allocated segment may also be created at this time. The new item can then be stored in the space.
摘要翻译：提供了用于按需分配段并且为先前创建的数据存储空间和分区创建元数据的方法和装置。在数据库中创建一个空格。作为此创建过程的一部分，没有为该空间分配段。相反，由数据库创建和维护描述足够分配该段的空间的元数据。收到指示新项目的数据。基于元数据，确定新项目与空间有关。响应于确定，为该空间分配段。此时也可以创建与空间和新分配段相关的正常数据库操作所需的附加元数据。然后可以将新项目存储在空间中。

30. 发明授权

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.
摘要翻译：描述了在关系数据库中支持参考分区表的系统，方法，媒体和其他实施例。一个示例性方法包括通过参考约束识别与父表相关联的分割策略（例如，范围，列表，散列）。示例方法还可以包括根据与父表相关联的分区策略将子表创建为被分区的引用分区表。示例性方法还可以包括创建相对于父表等份分割的子表。子表不是复制父表的分区密钥，而是通过外键关系继承与父表关联的分区密钥。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式