Minimizing result set size when converting from asymmetric to symmetric requests
US-9275111-B2 · Mar 1, 2016 · US
Minimizing result set size when converting from asymmetric to symmetric requests
US9524318B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9524318-B2 |
| Application number | US-201414498571-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 26, 2014 |
| Priority date | Mar 15, 2013 |
| Publication date | Dec 20, 2016 |
| Grant date | Dec 20, 2016 |
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.
A method, system, and a computer program product for converting asymmetric requests into symmetric requests are disclosed. In a first aspect, the method comprises a computer partitioning a query into a set of partitions along a dimension of a multi-dimensional data source, wherein each partition of the set of partitions comprises more than one member and the query has a query result count. The method includes the computer creating a candidate query for each partition of the set of partitions, wherein each candidate query has a candidate query result count. Responsive to a determination that the query result count is greater than a sum of the candidate query result counts, the method includes the computer substituting the query with the candidate queries.
First claim
Opening claim text (preview).
What is claimed is: 1. A method for minimizing query result counts, the method comprising: a computer partitioning a query into a set of partitions along a dimension of a multi-dimensional data source, wherein each partition of the set of partitions comprises more than one member and the query has a query result count; the computer creating a candidate query for each partition of the set of partitions, wherein each candidate query has a candidate query result count; and respon…
Assignees
Inventors
Classifications
Physics · mapped topic
- G06F17/30498Primary
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
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 US9524318B2 cover?
- A method, system, and a computer program product for converting asymmetric requests into symmetric requests are disclosed. In a first aspect, the method comprises a computer partitioning a query into a set of partitions along a dimension of a multi-dimensional data source, wherein each partition of the set of partitions comprises more than one member and the query has a query result count. The …
- Who is the assignee on this patent?
- IBM
- What technology area does this patent fall under?
- Primary CPC classification G06F17/30498. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Dec 20 2016 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 2 related publications on this page (citations in our corpus or others sharing the same primary CPC).