Ascava, Inc.
Held is read from USPTO's recorded assignments; a transfer never recorded there does not appear.
0
Ending by 2030
Apr 2035
Next term end
When these terms end
Held patents by the year their term ends
20262027202820292030203120322033203420352036203720382039204020412042204320442045
Fee deadlines
Maintenance fees fall due 3.5, 7.5 and 11.5 years after grant. A missed fee ends a patent at the end of the six month grace period that follows, not on the due date.
- 2 fees due Sep 15 to 22, 2027 · next Sep 15
- 1 fee due Oct 2, 2027The maintenance fee for Organizing Prime Data Elements Using a Tree Data Structure (US 11,947,494) comes due Oct 2, 2027. Unpaid by Apr 3, 2028, it lapses early.
Recent changes
Nothing was recorded against this company's patents in the last 90 days.
Patents held now
Soonest term end first. Each date below is computed on that patent's own page, which shows the rule, the adjustments and the fee history it was derived from.
| Patent | Title | Status | Expires | Confidence |
|---|---|---|---|---|
| US 9,286,313 | Efficient lossless reduction of data by deriving data from prime data elements resident in a content-associative sieve In force · From the USPTO record | In force | From the USPTO record | |
| US 9,292,584 | Efficient data communication based on lossless reduction of data by deriving data from prime data elements resident in a content-associative sieve In force · From the USPTO record | In force | From the USPTO record | |
| US 9,582,514 | Performing multidimensional search and content-associative retrieval on data that has been losslessly reduced using a prime data sieve In force · From the USPTO record | In force | From the USPTO record | |
| US 9,594,765 | Performing keyword-based search and retrieval on data that has been losslessly reduced using a prime data sieve In force · From the USPTO record | In force | From the USPTO record | |
| US 10,108,633 | Using a Distributed Prime Data Sieve for Efficient Lossless Reduction, Search, and Retrieval of Data In force · High confidence | In force | High confidence | |
| US 11,947,494 | Organizing Prime Data Elements Using a Tree Data Structure In force · High confidence | In force | High confidence | |
| US 12,505,073 | Organizing Prime Data Elements Using a Tree Data Structure In force · High confidence | In force | High confidence | |
| US 11,567,901 | Reduction of Data Stored on a Block Processing Storage System In force · High confidence | In force | High confidence | |
| US 11,068,444 | Using a Distributed Prime Data Sieve for Efficient Lossless Reduction, Search, and Retrieval of Data In force · Medium confidence | In force | Medium confidence | |
| US 11,363,296 | Lossless reduction of data by using a prime data sieve and performing multidimensional search and content-associative retrieval on data that has been losslessly reduced using a prime data sieve In force · From the USPTO record | In force | From the USPTO record |
Sources and methods
Compiled from the USPTO record, grants, published applications and recorded assignments, not yet reviewed by hand.
How this record was built
Computed patent terms end on the dates shown. Related patents and pending applications may cover overlapping subject matter.
Published applications
US patent applications published under this name that have not become patents. An application is published about eighteen months after its earliest filing; one that has not been published is in no public record.
1 no status recorded