Log in
Enquire now
‌

US Patent 11567939 Lazy reassembling of semi-structured data

Patent 11567939 was granted and assigned to Snowflake on January, 2023 by the United States Patent and Trademark Office.

OverviewStructured DataIssuesContributors

Contents

Is a
Patent
Patent
0

Patent attributes

Patent Applicant
0
Current Assignee
0
Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
0
Patent Number
115679390
Date of Patent
January 31, 2023
0
Patent Application Number
178141100
Date Filed
July 21, 2022
0
Patent Citations
‌
US Patent 10628418 Data driven multi-provider pruning for query execution plan
0
‌
US Patent 10025823 Techniques for evaluating query predicates during in-memory table scans
‌
US Patent 10311062 Filtering structured data using inexact, culture-dependent terms
‌
US Patent 10528599 Tiered data processing for distributed data
‌
US Patent 11016975 Scan set pruning for pattern matching queries
‌
US Patent 11037258 Media content processing techniques using fingerprinting and heuristics
0
‌
US Patent 11042650 Sargable query-predicate evaluation for encrypted databases
‌
US Patent 11093518 Information technology networked entity monitoring with dynamic metric and threshold selection
...
Patent Citations Received
‌
US Patent 11893025 Scan set pruning for queries with predicates on semi-structured fields
0
Patent Primary Examiner
‌
Merilyn P Nguyen
0
CPC Code
‌
G06F 16/283
0
‌
G06F 17/18
0
‌
G06F 16/248
0
‌
G06F 16/903
0
‌
G06F 16/24557
0
‌
G06F 16/2272
0
‌
G06F 16/9035
0

A pruning index is generated for a source table organized into a set of batch units. The source table comprises a column of semi-structured data. The pruning index comprises a set of filters that index distinct values in each column of the source table. Rather than reassembling an entire tree structure of the semi-structured data prior to indexing, the generating of the pruning index comprises traversing a reassembly hook object that represents a first portion of the semi-structured data that is subcolumnarized and traversing a residual object that represents a second portion of the semi-structured data that is not subcolumnarized. The reassembly hook object is traversed to identify values corresponding to the first portion of the semi-structured data and the residual object is traversed to identify values corresponding to the second portion. The pruning index is stored with an association with the source table.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 11567939 Lazy reassembling of semi-structured data

Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
Open Query Tool
Access by API
Golden Query Tool
Golden logo

Company

  • Home
  • Press & Media
  • Blog
  • Careers
  • WE'RE HIRING

Products

  • Knowledge Graph
  • Query Tool
  • Data Requests
  • Knowledge Storage
  • API
  • Pricing
  • Enterprise
  • ChatGPT Plugin

Legal

  • Terms of Service
  • Enterprise Terms of Service
  • Privacy Policy

Help

  • Help center
  • API Documentation
  • Contact Us
By using this site, you agree to our Terms of Service.