-
公开(公告)号：US11922328B1
公开(公告)日：2024-03-05
申请号：US18472883
申请日：2023-09-22
Applicant: Snowflake Inc.
Inventor： Michal Gdak , Ganeshan Ramachandran Iyer , Tomasz Malisz , Mikolaj Niedbala , Pawel Pollak , Saurin Shah , Jan Tomasz Topinski , Daria Wieteska
IPC: G06N5/022
CPC classification number: G06N5/022
Abstract: Systems and methods for generating a machine-learning (ML) model for extracting information from one or more electronic documents, where the ML model can be used as a data object, which can be part of a database command or as part of a document information extraction process that is continuously running (e.g., document information extraction pipeline).
-
公开(公告)号：US20230376391A1
公开(公告)日：2023-11-23
申请号：US18158586
申请日：2023-01-24
Applicant: Snowflake Inc.
Inventor： Abdullah Al Mahmood , Ruta Dhaneshwar , Xin Huang , Ganeshan Ramachandran Iyer , Jiaxing Liang , Nithin Mahesh , Raghav Ramachandran , Purav B. Saraiya , Yanyi Zhang
CPC classification number: G06F11/2028 , G06F16/27 , G06F11/1435
Abstract: Described herein are techniques for improving disaster recovery, in particular disaster recovery pertaining to data transfer requests. The data transfer request can be received by each of multiple deployments; however, only a primary deployment can process the request. The data transferred by the primary deployment may be replicated in the secondary deployments. In response to a failover event, one of the secondary deployments can be designated as the new primary development and continue the data transfer based on the data transfer request and the replication information received from the old primary deployment prior to the failover.
-
公开(公告)号：US11625367B1
公开(公告)日：2023-04-11
申请号：US17934369
申请日：2022-09-22
Applicant: Snowflake Inc.
Inventor： Istvan Cseri , Benoit Dageville , Ganeshan Ramachandran Iyer , Yucan Liu , Jiaqi Yan
Abstract: Techniques for schema mismatch detection and evolution are described. When data is being uploaded into a source table, schema of the data to be uploaded can be compared with the schema for the source table. If a schema mismatch is detected, the schema of the source table can be modified, and the upload can be continued without data loss.
-
公开(公告)号：US20250061099A1
公开(公告)日：2025-02-20
申请号：US18451522
申请日：2023-08-17
Applicant: Snowflake Inc.
IPC: G06F16/215 , G06F11/07 , G06F16/23 , G06F16/2453
Abstract: Provided herein are systems and methods for configuring integrity constraints (including a check constraint) and row violation logging using error tables. An example method includes decoding a query received at a network-based database system. The query includes a command to perform an operation on a base table. An integrity constraint associated with the base table is retrieved. The integrity constraint specifies a desired configuration for the base table. A verification of the integrity constraint is performed to detect erroneous data of the base table that violates the desired configuration. The erroneous data is input into an error table that is configured as a nested object of the base table. A notification that the erroneous data is available in the error table is generated and output.
-
公开(公告)号：US20240338577A1
公开(公告)日：2024-10-10
申请号：US18416379
申请日：2024-01-18
Applicant: Snowflake Inc.
Inventor： Michal Gdak , Ganeshan Ramachandran Iyer , Tomasz Malisz , Mikolaj Niedbala , Pawel Pollak , Saurin Shah , Jan Tomasz Topinski , Daria Wieteska
IPC: G06N5/022
CPC classification number: G06N5/022
Abstract: Systems and methods for generating a machine-learning (ML) model for extracting information from one or more electronic documents, where the ML model can be used as a data object, which can be part of a database command or as part of a document information extraction process that is continuously running (e.g., document information extraction pipeline).
-
Patent Agency Ranking
公开(公告)号：US20240330437A1
公开(公告)日：2024-10-03
申请号：US18737362
申请日：2024-06-07
Applicant: Snowflake Inc.
Inventor： Thierry Cruanes , Ganeshan Ramachandran Iyer , Isaac Kunen
IPC: G06F21/54 , G06F16/2455 , G06F21/53 , G06F21/60
CPC classification number: G06F21/54 , G06F16/2455 , G06F21/53 , G06F21/602 , G06F2221/033
Abstract: The logging techniques described herein can enable using logging tools without having to use different methods for sandbox implementations and push out the log data to storage without problems. The log data is treated as sensitive data and is protected according to the defined security policies. Further, the results may be compressed and encrypted.
-
公开(公告)号：US12032685B2
公开(公告)日：2024-07-09
申请号：US17936770
申请日：2022-09-29
Applicant: Snowflake Inc.
Inventor： Thierry Cruanes , Ganeshan Ramachandran Iyer , Isaac Kunen
IPC: G06F21/54 , G06F16/2455 , G06F21/53 , G06F21/60
CPC classification number: G06F21/54 , G06F16/2455 , G06F21/53 , G06F21/602 , G06F2221/033
Abstract: The logging techniques described herein can enable using logging tools without having to use different methods for sandbox implementations and push out the log data to storage without problems. The log data is treated as sensitive data and is protected according to the defined security policies. Further, the results may be compressed and encrypted.
-
公开(公告)号：US20240086381A1
公开(公告)日：2024-03-14
申请号：US18513163
申请日：2023-11-17
Applicant: Snowflake Inc.
IPC: G06F16/215 , G06F16/2455 , G06F16/2457 , G06F16/248
CPC classification number: G06F16/215 , G06F16/24552 , G06F16/24573 , G06F16/248
Abstract: Disclosed are techniques for deduplicating files to be ingested by a database. A bloom filter may be built for each of a first set of files to be ingested into a data exchange to generate a set of bloom filters, wherein each of the set of bloom filters is built with a number of hash functions that is based on a desired false positive rate. The set of bloom filters may be stored in the metadata storage of the data exchange. In response to receiving a set of candidate files to be ingested, identifying using the set of bloom filters, candidate files from the set of candidate files that are duplicative of a file in the first set of files and pruning from the set of candidate files, each candidate file identified as being duplicative of a file in the first set of files using the set of bloom filters.
-
公开(公告)号：US11853274B2
公开(公告)日：2023-12-26
申请号：US17971482
申请日：2022-10-21
Applicant: Snowflake Inc.
IPC: G06F16/00 , G06F16/215 , G06F16/248 , G06F16/2455 , G06F16/2457
CPC classification number: G06F16/215 , G06F16/248 , G06F16/24552 , G06F16/24573
Abstract: Disclosed are techniques for deduplicating files to be ingested by a database. A bloom filter may be built for each of a first set of files to be ingested into a data exchange to generate a set of bloom filters, wherein the data exchange includes a metadata storage where metadata including a list of files ingested is stored. The set of bloom filters may be stored in the metadata storage of the data exchange. In response to receiving a set of candidate files to be ingested into the data exchange, the set of bloom filters may be used to identify from within the set of candidate files, each candidate file that is duplicative of a file in the first set of files.
-
公开(公告)号：US20230315700A1
公开(公告)日：2023-10-05
申请号：US17971482
申请日：2022-10-21
Applicant: Snowflake Inc.
IPC: G06F16/215 , G06F16/248 , G06F16/2455 , G06F16/2457
CPC classification number: G06F16/215 , G06F16/248 , G06F16/24552 , G06F16/24573
Abstract: Embodiments of the present disclosure provide techniques for deduplicating files to be ingested by a database. A bloom filter may be built for each of a first set of files to be ingested into a data exchange to generate a set of bloom filters, wherein the data exchange includes a metadata storage where metadata including a list of files ingested is stored. The set of bloom filters may be stored in the metadata storage of the data exchange. In response to receiving a set of candidate files to be ingested into the data exchange, the set of bloom filters may be used to identify from within the set of candidate files, each candidate file that is duplicative of a file in the first set of files.
-
-
-
-
-
-
-
-
-
Search Results
36
records
(took 0.031 seconds)
