Versioned and hierarchical data structures and distributed transactions
US11586594B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Feb 12, 2019 |
| Grant date | Feb 21, 2023 |
| Priority date | — |
| Expiry date | Feb 12, 2039 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/282
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Presented herein are methods of replicating versioned and hierarchical data structures, as well as data structures representing complex transactions. Due to interdependencies between data entities and a lack of guaranteed message ordering, simple replication methods employed for simple data types cannot be used. Operations on data structures exhibit dependencies between the messages making up the operations. This strategy can be extended to various types of complex transactions by considering certain messages to depend on other messages or on the existence of other entries at the data store. Regardless of origin, these dependencies can be enforced by suspending the processing of messages with unsatisfied dependencies until all of its dependencies have been met. Alternately, transactions can be committed immediately, creating entities that include versioned identifiers for each of their dependencies. These entities can then be garbage collected of the parent objects are not subsequently created.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.