中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

80 records (took 0.027 seconds)

    Asynchronous task queue configuration in a database system
    31.
    发明授权
    Asynchronous task queue configuration in a database system 有权

    公开(公告)号：US12032995B1

    公开(公告)日：2024-07-09

    申请号：US18361549

    申请日：2023-07-28

    Applicant: Snowflake Inc.

    Inventor： Gabriel Kliot ,  Ruji Xie ,  Subramanian Muralidhar ,  William Waddington

    IPC: G06F9/48

    CPC classification number: G06F9/4881

    Abstract: A method includes decoding, by at least one hardware processor, an enqueue request received from a data process of a database system. The enqueue request includes a task. The task is enqueued in an in-memory task queue. An enqueue acknowledgment is encoded for transmission to the data process responsive to the enqueue request. The task is persisted in a storage location associated with the in-memory task queue. Initiate a lease of the task to a worker node in response to a lease request received from the worker node. A dequeue request is received from the worker node where the dequeue request indicates completion of the task by the worker node. The task is dequeued from the in-memory task queue based on the dequeue request.

    SCHEMA EVOLUTION FOR KEY COLUMNAR DATA INTO ROW-ORGANIZED SEQUENCES
    32.
    发明公开
    SCHEMA EVOLUTION FOR KEY COLUMNAR DATA INTO ROW-ORGANIZED SEQUENCES 审中-公开

    公开(公告)号：US20240028567A1

    公开(公告)日：2024-01-25

    申请号：US18326929

    申请日：2023-05-31

    Applicant: Snowflake Inc.

    Inventor： Benoit Dageville ,  Adrian Hamza ,  Lishi Jiang ,  William Waddington ,  Khaled Yagoub ,  Wumengjian Zhu

    IPC: G06F16/21 ,  G06F16/22

    CPC classification number: G06F16/213 ,  G06F16/221

    Abstract: The subject technology generates, by a compute service manager, a schema hash value for a new schema version associated with a new schema version value, the schema hash value based on determining a sum of hash values of a set of attributes of value columns, the set of attributes comprises a column identifier, and a logical type of a column. The subject technology stores a mapping of the schema hash value to the new schema version value for a table in a metadata database. The subject technology stores a new schema entry based on the schema hash value, the new schema version value, and a new column for the table in the metadata database, the metadata database storing multiple entries for different schema versions, each entry including a particular schema hash value for mapping to a corresponding schema version from the different schema versions.

    SELECTING PARTITIONS FOR RECLUSTERING BASED ON DISTRIBUTION OF OVERLAPPING PARTITIONS
    37.
    发明申请
    SELECTING PARTITIONS FOR RECLUSTERING BASED ON DISTRIBUTION OF OVERLAPPING PARTITIONS 有权

    公开(公告)号：US20220197886A1

    公开(公告)日：2022-06-23

    申请号：US17654296

    申请日：2022-03-10

    Applicant: Snowflake Inc.

    Inventor： Jiaqi Yan ,  Thierry Cruanes ,  Jeffrey Rosen ,  William Waddington ,  Prasanna Rajaperumal ,  Abdul Munir

    IPC: G06F16/22 ,  G06F16/27 ,  G06F7/08 ,  G06F16/28

    Abstract: Disclosed herein are embodiments of systems and methods for selecting partitions for reclustering based on distribution of overlapping partitions. In an example, a database platform makes a determination to at least partially recluster a database table that includes data stored across a plurality of partitions. The database platform responsively selects a subset of the partitions. The selecting of the subset includes identifying a point on a domain of a clustering key that corresponds to a local maximum of overlapping partitions, and also includes selecting the subset from among a group of overlapping partitions. The group includes at least one partition that overlaps the identified point on the domain of the clustering key. Each partition in the selected subset is above a reduction goal of overlapping partitions. The database platform at least partially reclusters the selected subset based on the clustering key.

    CONCURRENT TRANSACTION PROCESSING IN A DATABASE SYSTEM
    38.
    发明申请
    CONCURRENT TRANSACTION PROCESSING IN A DATABASE SYSTEM 有权

    公开(公告)号：US20220092051A1

    公开(公告)日：2022-03-24

    申请号：US17163034

    申请日：2021-01-29

    Applicant: Snowflake Inc

    Inventor： Alexander Miller ,  William Waddington

    IPC: G06F16/23 ,  G06F16/22 ,  G06F16/2455 ,  G06F16/248

    Abstract: The subject technology receives a first transaction. The subject technology assigns a first read version to the first transaction, the first read version indicating a first version of the linearizable storage. The subject technology performs a read operation from the first transaction on a table in a database. The subject technology determines a first commit version identifier corresponding to first data resulting from the read operation. The subject technology, in response to determining that a particular write operation is absent from the first transaction, proceeding to execute a different transaction and foregoing to perform a commit process in connection with the first transaction.

    INTERNAL RESOURCE PROVISIONING IN DATABASE SYSTEMS
    39.
    发明申请
    INTERNAL RESOURCE PROVISIONING IN DATABASE SYSTEMS 有权

    公开(公告)号：US20220004552A1

    公开(公告)日：2022-01-06

    申请号：US17477663

    申请日：2021-09-17

    Applicant: Snowflake Inc.

    Inventor： Jeffrey Rosen ,  Abdul Munir ,  Jiaqi Yan ,  William Waddington ,  Prasanna Rajaperumal ,  Thierry Cruanes

    IPC: G06F16/2458 ,  G06F16/2453 ,  G06F9/50 ,  G06F16/2455

    Abstract: Resource provisioning systems and methods are described. In an embodiment, a system includes a plurality of shared storage devices collectively storing database data, an execution platform, and a compute service manager. The compute service manager is configured to determine a task to be executed in response to a trigger event and determine a query plan for executing the task, wherein the query plan comprises a plurality of discrete subtasks. The compute service manager is further configured to assign the plurality of discrete subtasks to one or more nodes of a plurality of nodes of the execution platform, determine whether execution of the task is complete, and in response to determining the execution of the task is complete, store a record in the plurality of shared storage devices indicating the task was completed.

    Reclustering of database tables based on peaks and widths
    40.
    发明授权
    Reclustering of database tables based on peaks and widths 有权

    公开(公告)号：US11163746B2

    公开(公告)日：2021-11-02

    申请号：US17249796

    申请日：2021-03-12

    Applicant: Snowflake Inc.

    Inventor： Jiaqi Yan ,  Thierry Cruanes ,  Jeffrey Rosen ,  William Waddington ,  Prasanna Rajaperumal ,  Abdul Munir

    IPC: G06F16/22 ,  G06F16/27 ,  G06F7/08 ,  G06F16/28

    Abstract: The subject technology determines whether a table is sufficiently clustered. The subject technology in response to determining the table is not sufficiently clustered, selects one or more micro-partitions of the table to be reclustered. The subject technology constructs a data structure for the table. The subject technology extracts minimum and maximum endpoints for each micro-partition in the data structure. The subject technology sorts each of one or more peaks in the data structure based on height. The subject technology sorts overlapping micro-partitions based on width. The subject technology selects based on which micro-partitions are within the tallest peaks of the one or more peaks and further based on which of the overlapping micro-partitions have the widest widths.

Patent Agency Ranking