Neo4j Sweden AB
Held is read from USPTO's recorded assignments; a transfer never recorded there does not appear.
0
Ending by 2030
Mar 2034
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.
- 1 fee due Jan 25, 2027The maintenance fee for Correctness-Preserving Security for Graph Databases (US 11,709,960) comes due Jan 25, 2027. Unpaid by Jul 26, 2027, it lapses early.
- 2 fees due Feb 8 to 28, 2027 · next Feb 8
- 1 fee due Mar 5, 2027The maintenance fee for Bi-Gram Cardinality Estimation in a Graph Database (US 11,748,362) comes due Mar 5, 2027. Unpaid by Sep 7, 2027, it lapses early.
- 1 fee due Sep 5, 2027The maintenance fee for Graph Based Recommendation System (US 11,921,793) comes due Sep 5, 2027. Unpaid by Mar 6, 2028, it lapses early.
- 1 fee due Oct 16, 2027The maintenance fee for Database System with Transactional Commit Protocol Based on Safe Conjunction of Majorities (US 11,960,478) comes due Oct 16, 2027. Unpaid by Apr 17, 2028, it lapses early.
Recent changes
- 1 of the patents on this record was granted since Aug 21, 2026
- Nov 17 US 12,801,618 Efficient Temporal Graph Data Management
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.
Confidence:Highevery input resolvedMediumone input unresolvedLowtwo or more caveatsUSPTO recordfrom USPTO's bulk records, without the patent's file history
| Patent | Title | Status | Expires | Confidence |
|---|---|---|---|---|
| US 9,672,266 | Method and Apparatus for Ensuring Consistent Outcomes in Updates to Distributed Databases In force · High confidence | In force | High confidence | |
| US 9,477,779 | Graph Database Devices and Methods for Partitioning Graphs In force · High confidence | In force | High confidence | |
| US 12,164,571 | Pre-Emptive Graph Search for Guided Natural Language Interactions with Connected Data Systems In force · High confidence | In force | High confidence | |
| US 11,748,362 | Bi-Gram Cardinality Estimation in a Graph Database In force · High confidence | In force | High confidence | |
| US 12,032,582 | Bi-Gram Cardinality Estimation in a Graph Database In force · High confidence | In force | High confidence | |
| US 11,475,065 | Pre-Emptive Graph Search for Guided Natural Language Interactions with Connected Data Systems In force · High confidence | In force | High confidence | |
| US 11,960,478 | Database System with Transactional Commit Protocol Based on Safe Conjunction of Majorities In force · Medium confidence | In force | Medium confidence | |
| US 12,436,944 | Database System with Transactional Commit Protocol Based on Safe Conjunction of Majorities In force · Medium confidence | In force | Medium confidence | |
| US 11,921,793 | Graph Based Recommendation System In force · High confidence | In force | High confidence | |
| US 11,544,280 | Bi-Gram Cardinality Estimation in a Graph Database In force · High confidence | In force | High confidence |
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 pending · 1 abandoned