Table scan predicate with integrated semi-join filter
US-2024419650-A1 · Dec 19, 2024 · US
Rollover strategies in a N-bit dictionary compressed column store
US9489409B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9489409-B2 |
| Application number | US-201314056454-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 17, 2013 |
| Priority date | Oct 17, 2013 |
| Publication date | Nov 8, 2016 |
| Grant date | Nov 8, 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.
Disclosed herein are system, method, and computer program product embodiments for rollover strategies in an n-bit dictionary compressed column store. An embodiment operates by receiving a new value for addition to a compressed column store, determining that a current memory block of a most recently added token to the compressed column store is the insertion block. It is determined that the maximum token value has been reached for the current memory block. A new virtual memory block is created using the current insertion block, and a token corresponding to the new value is stored in the new virtual memory block. In another embodiment, when it is determined a maximum number of token values that may be stored in a compressed column store has been reached for a data dictionary, the compressed column store is converted into a composite store include a flat store where the new value is stored.
First claim
Opening claim text (preview).
What is claimed is: 1. A method, comprising: receiving a new value for addition to a compressed column store, the compressed column store including a plurality of tokens, each token corresponding to a value in a data dictionary, and being associated with a row identifier (RID) in the compressed column store; determining an insertion block of the compressed column store, the insertion block being a physical or virtual memory block where new tokens are inserted; determining that…
Assignees
Inventors
Classifications
Physics · mapped topic
- G06F16/221Primary
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
- G06F17/30315Primary
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 US9489409B2 cover?
- Disclosed herein are system, method, and computer program product embodiments for rollover strategies in an n-bit dictionary compressed column store. An embodiment operates by receiving a new value for addition to a compressed column store, determining that a current memory block of a most recently added token to the compressed column store is the insertion block. It is determined that the maxi…
- Who is the assignee on this patent?
- Sharique Muhammed, Goel Anil Kumar, Andrei Minhnea, and 1 more
- What technology area does this patent fall under?
- Primary CPC classification G06F16/221. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Nov 08 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 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).