Rule-based joining of foreign to primary key
US-2015379085-A1 · Dec 31, 2015 · US
Efficient top-down hierarchical join on a hierarchically clustered data stream
US8990187B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8990187-B2 |
| Application number | US-201313798973-A |
| Country | US |
| Kind code | B2 |
| Filing date | Mar 13, 2013 |
| Priority date | May 21, 2012 |
| Publication date | Mar 24, 2015 |
| Grant date | Mar 24, 2015 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
An apparatus for conducting a hierarchical join on a hierarchically clustered data stream is disclosed. The apparatus may include a memory storing query conditions that each determine whether a Structured Query Language query is suitable for performing a non-buffering read operation on a hierarchical data storage. A processor in communication with the memory may be configured to receive a Structured Query Language (“SQL”) query from a client device and evaluate the SQL query for one or more of the query conditions stored in the memory. When the processor determines that the SQL query satisfies one or more of the query conditions, the processor may then perform a non-buffering read operation on the hierarchical data storage to obtain a hierarchically clustered data stream. The hierarchically clustered data stream may be evaluated to obtain a plurality of record results, which may be transmitted to the client device.
First claim
Opening claim text (preview).
The invention claimed is: 1. An apparatus for conducting a hierarchical join on a hierarchically clustered data stream, the apparatus comprising: a memory configured to store a query condition that determines whether a Structured Query Language query is suitable for performing a non-buffering read operation on a hierarchical data storage; and a processor in communication with the memory, the processor being configured to: receive a Structured Query Language (“SQL”) query; eva…
Assignees
Inventors
Classifications
- G06F17/30466Primary
Physics · mapped topic
- G06F16/24544Primary
Physics · mapped topic
Physics · mapped topic
- G06F16/245Primary
Physics · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US8990187B2 cover?
- An apparatus for conducting a hierarchical join on a hierarchically clustered data stream is disclosed. The apparatus may include a memory storing query conditions that each determine whether a Structured Query Language query is suitable for performing a non-buffering read operation on a hierarchical data storage. A processor in communication with the memory may be configured to receive a Struc…
- Who is the assignee on this patent?
- Google Inc
- What technology area does this patent fall under?
- Primary CPC classification G06F17/30466. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Mar 24 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).