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

1. 发明申请

US20120239641A1 MEMORY QUOTA 有权
公开(公告)号：US20120239641A1
公开(公告)日：2012-09-20
申请号：US13051986
申请日：2011-03-18
申请人： Sivaramakrishnan Narayanan , Florian Michael Waas , Joy Jie Kent
发明人： Sivaramakrishnan Narayanan , Florian Michael Waas , Joy Jie Kent
IPC分类号： G06F17/30
CPC分类号： G06F17/30486 , G06F12/08
摘要： A method, article of manufacture, and apparatus for processing queries, comprising analyzing a query tree, determining at least one operator based on the query tree analysis, assigning a memory allocation for each of the at least one operator, and storing the assignment in a storage device. In some embodiments, a memory classification for each of the at least one operator is determined. In some embodiments, assigning a memory allocation for each of the at least one operator includes assigning a memory allocation based on the memory classification.
摘要翻译：一种用于处理查询的方法，制品和装置，包括分析查询树，基于所述查询树分析确定至少一个运算符，为所述至少一个运算符中的每一者分配存储器分配，以及将所述分配存储在储存设备。在一些实施例中，确定至少一个操作者中的每一个的存储器分类。在一些实施例中，为所述至少一个操作者中的每一个分配内存分配器包括基于所述存储器分类分配存储器分配。

2. 发明授权

US09418109B2 Memory quota 有权
标题翻译：内存配额
公开(公告)号：US09418109B2
公开(公告)日：2016-08-16
申请号：US13051986
申请日：2011-03-18
申请人： Sivaramakrishnan Narayanan , Florian Michael Waas , Joy Jie Kent
发明人： Sivaramakrishnan Narayanan , Florian Michael Waas , Joy Jie Kent
IPC分类号： G06F17/30 , G06F12/08
CPC分类号： G06F17/30486 , G06F12/08
摘要： A method, article of manufacture, and apparatus for processing queries, comprising analyzing a query tree, determining at least one operator based on the query tree analysis, assigning a memory allocation for each of the at least one operator, and storing the assignment in a storage device. In some embodiments, a memory classification for each of the at least one operator is determined. In some embodiments, assigning a memory allocation for each of the at least one operator includes assigning a memory allocation based on the memory classification.
摘要翻译：一种用于处理查询的方法，制品和装置，包括分析查询树，基于所述查询树分析确定至少一个运算符，为所述至少一个运算符中的每一者分配存储器分配，以及将所述分配存储在储存设备。在一些实施例中，确定至少一个操作者中的每一个的存储器分类。在一些实施例中，为所述至少一个操作者中的每一个分配内存分配器包括基于所述存储器分类分配存储器分配。

3. 发明授权

US08862606B1 Executing correlated and multi-row subqueries in a MPP database 有权
标题翻译：在MPP数据库中执行相关和多行子查询
公开(公告)号：US08862606B1
公开(公告)日：2014-10-14
申请号：US13240923
申请日：2011-09-22
申请人： Sivaramakrishnan Narayanan , Florian Michael Waas
发明人： Sivaramakrishnan Narayanan , Florian Michael Waas
IPC分类号： G06F17/30
CPC分类号： G06F17/30545
摘要： The invention enables a correlated or multi-row subquery (CSQ) to be performed on distributed MPP and shared-nothing databases by broadcasting intermediate results, prior to a correlation operation, from subquery execution on one segment to all other segments in the distributed database so that the respective CSQs of each segment will have access to the necessary results to permit correct execution of the CSQ. Additionally, the intermediate results are saved to disk to avoid the necessity of replicating the same intermediate results multiple times during execution of a subquery plan.
摘要翻译：本发明使得能够在分布式MPP和无共享数据库上执行相关或多行子查询（CSQ），在相关操作之前，从分段数据库中的一个段上的子查询执行到所有其他段的广播中间结果，每个分段的相应CSQ将获得必要的结果，以便正确执行CSQ。另外，将中间结果保存到磁盘，以避免在执行子查询计划期间多次复制相同的中间结果。

4. 发明申请

US20110246481A1 Apparatus and Method for Query Prioritization in a Shared Nothing Distributed Database 有权
标题翻译：无共享分布式数据库中查询优先级的设备和方法
公开(公告)号：US20110246481A1
公开(公告)日：2011-10-06
申请号：US12751208
申请日：2010-03-31
申请人： Sivaramakrishnan Narayanan , Florian Michael Waas
发明人： Sivaramakrishnan Narayanan , Florian Michael Waas
IPC分类号： G06F17/30 , G06F15/173
CPC分类号： G06F17/30442 , G06F9/505 , G06F17/30474
摘要： A shared nothing distributed database system includes a master node and a set of shared nothing nodes. Each shared nothing node includes a node state table stored in memory that characterizes various statements and multiple processes implementing each statement, target resource consumption rate for each process and process activity information. A monitor module executed by a central processing unit processes information in the node state table and adjusts values in the node state table in accordance with priority criteria specifying individual user priority ascribed to a statement. A query associated with a statement is processed in the shared nothing distributed database system in accordance with the priority criteria.
摘要翻译：无共享的分布式数据库系统包括主节点和一组无共享节点。每个无共享节点包括存储在存储器中的节点状态表，其表征各种语句和实现每个语句的多个进程，每个进程的目标资源消耗速率和进程活动信息。由中央处理单元执行的监视器模块处理节点状态表中的信息，并且根据指定归因于语句的个人用户优先级的优先级标准来调整节点状态表中的值。根据优先级标准，在共享无分布式数据库系统中处理与语句关联的查询。

5. 发明授权

US09418064B1 Resource queues 有权
标题翻译：资源队列
公开(公告)号：US09418064B1
公开(公告)日：2016-08-16
申请号：US13051980
申请日：2011-03-18
申请人： Sivaramakrishnan Narayanan , Florian Michael Waas , Joy Jie Kent
发明人： Sivaramakrishnan Narayanan , Florian Michael Waas , Joy Jie Kent
IPC分类号： G06F17/30 , G06F15/173
CPC分类号： G06F17/30 , G06F9/50 , G06F15/173 , G06F17/30477
摘要： A method, article of manufacture, and apparatus for processing queries, comprising receiving a query, determining a query classification for the query, assigning the query to a resource queue based on the determined query classification, and placing the query in the assigned resource queue. In some embodiments, the resource queue is divided into a plurality of slots, and the query is placed in a slot. The resource queue may be associated with a resource queue memory allocation, and each of the plurality of slots is associated with a slot memory allocation.
摘要翻译：一种用于处理查询的方法，制品和装置，包括接收查询，确定所述查询的查询分类，基于所确定的查询分类将所述查询分配给资源队列，以及将所述查询放置在所分配的资源队列中。在一些实施例中，资源队列被划分成多个时隙，并且查询被放置在时隙中。资源队列可以与资源队列存储器分配相关联，并且多个时隙中的每一个与时隙存储器分配相关联。

6. 发明授权

US09171041B1 RLE-aware optimization of SQL queries 有权
标题翻译： RLE感知SQL查询优化
公开(公告)号：US09171041B1
公开(公告)日：2015-10-27
申请号：US13248536
申请日：2011-09-29
申请人： Sivaramakrishnan Narayanan , Florian Michael Waas
发明人： Sivaramakrishnan Narayanan , Florian Michael Waas
IPC分类号： G06F17/30
CPC分类号： G06F17/30501 , G06F17/30442 , G06F17/30463 , G06F17/30466 , G06F17/30498 , G06F17/30569 , G06F17/30864
摘要： SQL queries are optimized to operate directly on compressed data (and obtain the correct result) rather than requiring that the data be first decompressed prior to processing a query. Certain characteristic pattern trees are mapped against a logical input query plan that includes certain logical operators such as a DECOMPRESS that precedes a JOIN or a GROUPBY in association with a COUNT to identify instances in the plan that match a characteristic pattern. Upon locating a match, the input query plan is transformed into a logically equivalent plan that operates correctly on compressed data, by analyzing the interplay of the semantics of logical query operations with the compressed data and substituting less costly structures and operations. DECOMPRESS operations are moved to operate subsequent to a JOIN or eliminated altogether, and COUNT operations are replaced by a different operation, such as SUM, that is logically equivalent for compressed data.
摘要翻译： SQL查询经过优化，可直接对压缩数据进行操作（并获得正确的结果），而不是要求数据在处理查询之前先进行解压缩。某些特征模式树被映射到逻辑输入查询计划，逻辑输入查询计划包括某些逻辑运算符，例如在与COUNT相关联的JOIN或GROUPBY之前的DECOMPRESS，以识别计划中匹配特征模式的实例。在找到匹配后，通过分析逻辑查询操作的语义与压缩数据的相互作用并代替较低成本的结构和操作，将输入查询计划转换为在压缩数据上正确操作的逻辑等效计划。 DECOMPRESS操作被移动到在JOIN之后操作或完全消除，并且COUNT操作被诸如SUM之类的不同操作所替代，在逻辑上等同于压缩数据。

7. 发明授权

US09104663B1 Dynamic allocation of memory for memory intensive operators 有权
标题翻译：为内存密集型操作员动态分配内存
公开(公告)号：US09104663B1
公开(公告)日：2015-08-11
申请号：US13051995
申请日：2011-03-18
申请人： Sivaramakrishnan Narayanan , Florian Michael Waas , Joy Jie Kent
发明人： Sivaramakrishnan Narayanan , Florian Michael Waas , Joy Jie Kent
IPC分类号： G06F17/30 , H04L29/00 , G06F12/00
CPC分类号： G06F17/30 , G06F12/00 , G06F17/3048 , H04L29/00
摘要： A method, article of manufacture, and apparatus for processing queries, comprising performing a query with a first memory intensive allocation, receiving an indication that a memory intensive operator spilled to a first storage device, adjusting a resource queue memory allocation based on the indication, computing a second memory intensive allocation based on the adjusted resource queue memory allocation, and storing the second memory intensive allocation in a second storage device.
摘要翻译：一种用于处理查询的方法，制品和装置，包括执行具有第一存储器密集分配的查询，接收基于所述指示调整资源队列存储器分配的存储器密集型操作者向第一存储设备溢出的指示，基于经调整的资源队列存储器分配来计算第二存储器密集分配，以及将第二存储器密集分配存储在第二存储设备中。

8. 发明授权

US08375047B2 Apparatus and method for query prioritization in a shared nothing distributed database 有权
标题翻译：共享无分布式数据库中查询优先级的设备和方法
公开(公告)号：US08375047B2
公开(公告)日：2013-02-12
申请号：US12751208
申请日：2010-03-31
申请人： Sivaramakrishnan Narayanan , Florian Michael Waas
发明人： Sivaramakrishnan Narayanan , Florian Michael Waas
IPC分类号： G06F17/30
CPC分类号： G06F17/30442 , G06F9/505 , G06F17/30474
摘要： A shared nothing distributed database system includes a master node and a set of shared nothing nodes. Each shared nothing node includes a node state table stored in memory that characterizes various statements and multiple processes implementing each statement, target resource consumption rate for each process and process activity information. A monitor module executed by a central processing unit processes information in the node state table and adjusts values in the node state table in accordance with priority criteria specifying individual user priority ascribed to a statement. A query associated with a statement is processed in the shared nothing distributed database system in accordance with the priority criteria.
摘要翻译：无共享的分布式数据库系统包括主节点和一组无共享节点。每个无共享节点包括存储在存储器中的节点状态表，其表征各种语句和实现每个语句的多个进程，每个进程的目标资源消耗速率和进程活动信息。由中央处理单元执行的监视器模块处理节点状态表中的信息，并且根据指定归因于语句的个人用户优先级的优先级标准来调整节点状态表中的值。根据优先级标准，在共享无分布式数据库系统中处理与语句关联的查询。

9. 发明授权

US09104500B1 Lock-free job scheduler for multi-processor systems 有权
标题翻译：多处理器系统的无锁作业调度程序
公开(公告)号：US09104500B1
公开(公告)日：2015-08-11
申请号：US13248589
申请日：2011-09-29
申请人： Konstantinos Krikellas , Florian Michael Waas , Mohamed Soliman
发明人： Konstantinos Krikellas , Florian Michael Waas , Mohamed Soliman
IPC分类号： G06F9/46 , G06F9/52
CPC分类号： G06F9/52 , G06F9/4881 , G06F2209/483 , G06F2209/484 , G06F2209/486
摘要： A scalable job scheduler for a multi-thread, multi-processor system synchronizes and schedules jobs for execution by using lists and jobs counters for the numbers of active jobs. It minimizes synchronization overhead by using atomic operations for incrementing and decrementing the counters. The scheduler assigns jobs for execution, and can awake up an available thread to pick up work. A parent job spawns child jobs and maintains a job counter. Spawned jobs are added to the list for execution and the counter of waiting jobs is incremented. When execution of a job begins, the parent's counter of outstanding child jobs is decremented. A parent job is suspended until its counter of uncompleted spawned child jobs reaches zero. As a job is completed, the scheduler decrements the counter of active jobs, and assigns the next job in the queue to an available thread.
摘要翻译：用于多线程多处理器系统的可扩展作业调度程序通过使用活动作业数的列表和作业计数器来同步和调度作业进行执行。它通过使用原子操作来递增和递减计数器来最小化同步开销。调度程序分配作业执行，并可以唤醒可用的线程来接收工作。父母的工作产生小孩的工作，并维护一个工作计数器。产生的作业被添加到列表中以执行，并且等待作业的计数器增加。当工作的执行开始时，父母的未完成子任务的计数器递减。父工作被暂停，直到其未完成的子女工作的计数器达到零。当作业完成时，调度器递减活动作业的计数器，并将队列中的下一个作业分配给可用的线程。

10. 发明授权

US08768973B2 Apparatus and method for expanding a shared-nothing system 有权
标题翻译：用于扩展无共享系统的装置和方法
公开(公告)号：US08768973B2
公开(公告)日：2014-07-01
申请号：US12788256
申请日：2010-05-26
申请人： Brian Hagenbuch , Gavin Sherry , Jeffrey Ira Cohen , Chris Pedrotti , John Eshleman , Florian Michael Waas , Joy Kent
发明人： Brian Hagenbuch , Gavin Sherry , Jeffrey Ira Cohen , Chris Pedrotti , John Eshleman , Florian Michael Waas , Joy Kent
IPC分类号： G06F17/30
CPC分类号： G06F17/30289 , G06F9/485 , G06F9/4881 , G06F9/5083 , G06F17/30575
摘要： A computer readable storage medium includes executable instructions to evaluate an expanded shared-nothing data store configuration. A data redistribution schedule table with specified parameters is formed. Data is redistributed within the expanded shared-nothing data store in accordance with the data redistribution schedule table.
摘要翻译：计算机可读存储介质包括用于评估扩展的无共享数据存储配置的可执行指令。形成具有指定参数的数据再分发计划表。数据根据数据再分发计划表在扩展的无共享数据存储中重新分配。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式