PATCHED MULTI-KEY PARTITIONING FOR ROBUST QUERY PERFORMANCE

    公开(公告)号:US20240346022A1

    公开(公告)日:2024-10-17

    申请号:US18636874

    申请日:2024-04-16

    摘要: Aspects described herein relate to partitioning multiple data tuples stored in a database system to multiple partitions based on multiple partition keys. The multiple data tuples can be assigned to multiple partitions such that each partition of the multiple partitions includes a portion of the multiple data tuples having same values for at least one of the multiple partition keys. A set of exceptions can be generated including data tuples having a first value of at least a first one of the multiple partition keys that is the same as the same value of a first portion of data tuples assigned to a first one of the multiple partitions, and a second value of at least a second one of the multiple partition keys that is the same as the same value of a second portion of data tuples assigned to a second one of the multiple partitions.

    PER-NODE CUSTOM CODE ENGINE FOR DISTRIBUTED QUERY PROCESSING

    公开(公告)号:US20170083588A1

    公开(公告)日:2017-03-23

    申请号:US15371245

    申请日:2016-12-07

    IPC分类号: G06F17/30

    摘要: Distributed query processing is often performed by a set of nodes that apply MapReduce to a data set and materialize partial results to storage, which are then aggregated to produce the query result. However, this architecture requires a preconfigured set of database nodes; can only fulfill queries that utilize MapReduce processing; and may be slowed down by materializing partial results to storage. Instead, distributed query processing can be achieved by choosing a node for various portions of the query, and generating customized code for the node that only performs the query portion that is allocated to the node. The node executes the code to perform the query portion, and rather than materializing partial results to storage, streams intermediate query results to a next selected node in the distributed query. Nodes selection may be involve matching the details of the query portion with the characteristics and capabilities of the available nodes.

    Method of and Apparatus for Extraction and Analysis of Macro Operations within Query Language Statement
    8.
    发明申请
    Method of and Apparatus for Extraction and Analysis of Macro Operations within Query Language Statement 审中-公开
    查询语言声明中宏操作的提取和分析方法和设备

    公开(公告)号:US20100153430A1

    公开(公告)日:2010-06-17

    申请号:US12332871

    申请日:2008-12-11

    IPC分类号: G06F17/30

    CPC分类号: G06F16/24526

    摘要: A method receives a query containing at least a statement, and analyzes the statement to determine a query structure of elements forming the statement. The text of the statement is formatted to reflect the query structure. The formatted text is replaced with an equivalent tree of logical blocs representing the statement in a higher level. The representation of one or more of the logical blocks is shortened. A data flow tree of macro operation nodes is generated based on the logical blocks for presentation to a user.

    摘要翻译: 一种方法接收至少包含一个语句的查询,并分析该语句以确定形成语句的元素的查询结构。 语句的文本格式化以反映查询结构。 格式化的文本被替换为表示较高级别的语句的逻辑组合的等效树。 一个或多个逻辑块的表示被缩短。 基于用于呈现给用户的逻辑块来生成宏操作节点的数据流树。

    POINT-IN-TIME QUERY METHOD AND SYSTEM
    9.
    发明申请
    POINT-IN-TIME QUERY METHOD AND SYSTEM 审中-公开
    时间查询方法和系统

    公开(公告)号:US20070271242A1

    公开(公告)日:2007-11-22

    申请号:US11750966

    申请日:2007-05-18

    IPC分类号: G06F17/30

    CPC分类号: G06F16/83 G06F16/24526

    摘要: Embodiments of the present invention include storing a plurality of subtrees in a database, the plurality of subtrees representing one or more structured documents. At least one subtree has a birth timestamp indicating a time at which the at least one subtree was created. If a subtree has been obsoleted, the subtree has a death timestamp indicating a time at which the subtree was obsoleted. Embodiments further include receiving a database query comprising a query string and a query timestamp, the query timestamp indicating a historical time for which the query is to apply, and determining an intermediate result list of subtrees. The intermediate result list is filtered to generate a final result list responsive to the database query, the filtering comprising removing subtrees that do not have a birth timestamp, have a birth timestamp later than the query timestamp, or have a death timestamp earlier than the query timestamp.

    摘要翻译: 本发明的实施例包括将多个子树存储在数据库中,多个子树表示一个或多个结构化文档。 至少一个子树具有指示创建至少一个子树的时间的出生时间戳。 如果子树已经过时,则子树具有指示子树被过时的时间的死亡时间戳。 实施例还包括接收包括查询字符串和查询时间戳的数据库查询,查询时间戳指示查询应用于其的历史时间,以及确定子树的中间结果列表。 过滤中间结果列表以响应于数据库查询生成最终结果列表,包括删除不具有出生时间戳的子树的过滤器具有晚于查询时间戳的出生时间戳,或者具有早于查询的死亡时间戳 时间戳。

    Systems and methods for transforming SQL syntax trees into relational algebra representations
    10.
    发明申请
    Systems and methods for transforming SQL syntax trees into relational algebra representations 审中-公开
    将SQL语法树转换为关系代数表示的系统和方法

    公开(公告)号:US20050177556A1

    公开(公告)日:2005-08-11

    申请号:US10776895

    申请日:2004-02-10

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F16/24526

    摘要: The SQL Algebrizer of the present invention comprises a plurality of algorithms to “algebrize” SQL Trees to QP Algebra using an approach that is more consistent and much more efficient than typical algebrizers. More specifically, the Algebrizer of the present invention processes a SQL Tree using a reduced number of recursive depth-first passes by performing multiple operations in a single pass. Furthermore, the Algebrizer of the present invention also performs the operation of constant folding in this single, multi-operation pass so that the QP, upon receiving the QP Algebra, needs not perform this operation at all.

    摘要翻译: 本发明的SQL代理器包括使用比典型的代数器更一致和更有效的方法来将“SQL树”组合到QP代数的多种算法。 更具体地说,本发明的代理者通过在单程中执行多个操作,使用减少数量的递归深度优先遍历来处理SQL树。 此外,本发明的代理还在该单次多操作遍中进行恒定折叠的操作,使得在接收到QP代数时,QP根本不需要执行该操作。