Optimized validation of cached query plans

    公开(公告)号:US12277117B1

    公开(公告)日:2025-04-15

    申请号:US18649537

    申请日:2024-04-29

    Applicant: Snowflake Inc.

    Abstract: The subject technology receives a query, the query including a statement for performing the query. The subject technology performs a lookup operation on a stored plan cache based on the query. The subject technology performs, in response to a cache match of the query to a stored query plan in the stored plan cache based on the lookup operation, a validation process of the stored query plan. The subject technology determines whether the stored query plan is valid based on the validation process. The subject technology performs, in response to determining that the stored query plan is valid, a program building process for the stored query plan to generate a final query plan. The subject technology sends the final query plan to an execution node for execution.

    Scalable query processing
    73.
    发明授权

    公开(公告)号:US12216656B2

    公开(公告)日:2025-02-04

    申请号:US18477808

    申请日:2023-09-29

    Applicant: Snowflake Inc.

    Abstract: Embodiments of the present disclosure may provide a dynamic query execution model. This query execution model may provide acceleration by scaling out parallel parts of a query (also referred to as a fragment) to additional computing resources, for example computing resources leased from a pool of computing resources. Execution of the parts of the query may be coordinated by a parent query coordinator, where the query originated, and a fragment query coordinator.

    FLEXIBLE COMPUTING
    75.
    发明申请

    公开(公告)号:US20250021390A1

    公开(公告)日:2025-01-16

    申请号:US18822732

    申请日:2024-09-03

    Applicant: Snowflake Inc.

    Abstract: Embodiments of the present disclosure may provide dynamic and fair assignment techniques for allocating resources on a demand basis. Assignment control may be separated into at least two components: a local component and a global component. Each component may have an active dialog with each other; the dialog may include two aspects: 1) a demand for computing resources, and 2) a total allowed number of computing resources. The global component may allocate resources from a pool of resources to different local components, and the local components in turn may assign their allocated resources to local competing requests. The allocation may also be throttled or limited at various levels.

    System and method for disjunctive joins

    公开(公告)号:US12164514B2

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

    申请号:US18109099

    申请日:2023-02-13

    Applicant: SNOWFLAKE INC.

    Abstract: Joining data using a disjunctive operator is described. An example computer-implemented method can include generating, with a processing device, a query plan for a query, the query comprising a join operator expression for a disjunctive predicate, wherein the join operator expression includes a conjunctive predicate and a disjunctive operator. The method may further include generating a bloom filter for the disjunctive operator. Additionally, the method may include generating a result set as a result of evaluating the join operator expression using the disjunctive operator and bloom filter for the disjunctive predicate.

    QUERY PLAN CACHE SHADOW MODES
    78.
    发明公开

    公开(公告)号:US20240330287A1

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

    申请号:US18128143

    申请日:2023-03-29

    Applicant: Snowflake Inc.

    CPC classification number: G06F16/24542 G06F16/24539

    Abstract: The subject technology receives a query. The subject technology performs a lookup operation on a shadow cache. The subject technology performs a validation process on the particular query plan for determining a cache hit on the shadow cache. The subject technology performs a program building process to update the particular query plan with additional information for executing the particular query plan. The subject technology performs a compilation process to compile an updated program of the updated particular query plan. The subject technology determines that the updated particular query plan is cacheable based at least in part on the compilation process. The subject technology registers the updated particular query plan as a new entry in the shadow cache. The subject technology sends the updated program to an execution node for executing the updated particular query plan.

Patent Agency Ranking