Data collection for vehicle sensor data
US-2024420523-A1 · Dec 19, 2024 · US
Method for removing duplicate data from a storage array
US8930307B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8930307-B2 |
| Application number | US-201113250570-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 30, 2011 |
| Priority date | Sep 30, 2011 |
| Publication date | Jan 6, 2015 |
| Grant date | Jan 6, 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.
A system and method for efficiently removing duplicate data blocks at a fine-granularity from a storage array. A data storage subsystem supports multiple deduplication tables. Table entries in one deduplication table have the highest associated probability of being deduplicated. Table entries may move from one deduplication table to another as the probabilities change. Additionally, a table entry may be evicted from all deduplication tables if a corresponding estimated probability falls below a given threshold. The probabilities are based on attributes associated with a data component and attributes associated with a virtual address corresponding to a received storage access request. A strategy for searches of the multiple deduplication tables may also be determined by the attributes associated with a given storage access request.
First claim
Opening claim text (preview).
What is claimed is: 1. A computer system comprising: a non-transitory data storage medium; a first fingerprint table comprising a first plurality of entries and a second fingerprint table comprising a second plurality of entries, wherein each entry of the first and the second plurality of entries is configured to store a fingerprint corresponding to a data component already stored in the system, wherein the first fingerprint table has fewer entries than the second fingerprint ta…
Assignees
Inventors
Classifications
Physics · mapped topic
Physics · mapped topic
- G06F3/0608Primary
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 US8930307B2 cover?
- A system and method for efficiently removing duplicate data blocks at a fine-granularity from a storage array. A data storage subsystem supports multiple deduplication tables. Table entries in one deduplication table have the highest associated probability of being deduplicated. Table entries may move from one deduplication table to another as the probabilities change. Additionally, a table ent…
- Who is the assignee on this patent?
- Colgrove John, Hayes John, Miller Ethan, and 3 more
- What technology area does this patent fall under?
- Primary CPC classification G06F3/0608. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Jan 06 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).