LINKED DATA PROCESSOR FOR DATABASE STORAGE
First Claim
Patent Images
1. A method for storing data in a distributed storage environment, the method comprising:
- receiving input data comprising one or more received data items and a corresponding graph representation, the graph representation including a representation of the one or more data items, the graph representation having a tree format, the graph representation including a representation of at least one link between a first data item from the one or more received data items and second data item from a resource saved in durable storage;
applying a plurality of resource determination rules to the graph representation to identify at least one missing resource, the at least one missing resource comprising a plurality of stored data items, the plurality of stored data items including the second data item;
loading the at least one missing resource;
updating the graph representation to include a representation of the plurality of stored data items of the at least one missing resource;
modifying at least one data item of the plurality of stored data items based on the input data, the first data item and second data item being linked after the modifying of the at least one data item;
applying one or more resource creation rules to the updated graph representation to determine a plurality of resources, each resource of the plurality of resources comprising at least one data item; and
saving the determined plurality of resources to durable storage, the determined plurality of resources comprising the one or more received data items and the modified at least one data item.
1 Assignment
0 Petitions
Accused Products
Abstract
Systems and methods are provided for storing and retrieving data using a linked data model having a tree format. Instead of using a traditional relational database, a linked data model can be used with links between data items that reflect the underlying business logic. To facilitate retrieval of data, the data items stored using the linked data model can be individually addressable.
0 Citations
20 Claims
-
1. A method for storing data in a distributed storage environment, the method comprising:
-
receiving input data comprising one or more received data items and a corresponding graph representation, the graph representation including a representation of the one or more data items, the graph representation having a tree format, the graph representation including a representation of at least one link between a first data item from the one or more received data items and second data item from a resource saved in durable storage; applying a plurality of resource determination rules to the graph representation to identify at least one missing resource, the at least one missing resource comprising a plurality of stored data items, the plurality of stored data items including the second data item; loading the at least one missing resource; updating the graph representation to include a representation of the plurality of stored data items of the at least one missing resource; modifying at least one data item of the plurality of stored data items based on the input data, the first data item and second data item being linked after the modifying of the at least one data item; applying one or more resource creation rules to the updated graph representation to determine a plurality of resources, each resource of the plurality of resources comprising at least one data item; and saving the determined plurality of resources to durable storage, the determined plurality of resources comprising the one or more received data items and the modified at least one data item. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A method for retrieving data in a distributed storage environment, the method comprising:
-
receiving a request for a data item; identifying a data item tree corresponding to the received request, the data item tree comprising a plurality of data items stored according to a linked data model, the data items in the identified data item tree being linked together so that each data item in the identified data item tree can be accessed from any other data item in the identified data item tree by traversing links between data items; traversing the identified data item tree by following one or more links between a root data item and at least one data item matching the received request; providing, responsive to the received request, the matched at least one data item. - View Dependent Claims (12, 13, 14)
-
-
15. A system for storing and retrieving data in a distributed storage environment, the system comprising:
-
durable storage comprising a plurality of physical storage devices; one or more processors having associated memory, the associated memory including computer-executable instructions executed by the one or more processors to provide; a plurality of resource determination rules; a plurality of resource creation rules; a Linked Data Processor for reading stored data items into memory based on the plurality of resource determination rules and for storing data items to the durable storage based on the plurality of resource creation rules; and a plurality of data item trees comprising data items linked by two-way links, each data item tree comprising a root data item and one or more data items linked to at least one other data item, each data item comprising a data item address. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification