Write behind cache with M-to-N referential integrity
First Claim
1. A method, comprising:
- caching, via a processor, a batch of data records generated by at least one application for persistent storage, where at least one of the batch of data records comprises at least one foreign key reference that each references one non-existent data record;
where caching, via the processor, the batch of data records generated by the at least one application for persistent storage comprises;
maintaining a bidirectional directed graph with each data record represented as a node within the bidirectional directed graph, where each vertex in the bidirectional directed graph other than a root node represents one of a plurality of parent records and one of a plurality of child records to be persisted to the database, and each edge in the bidirectional directed graph represents a foreign key directional relationship from one child record to one associated parent record;
determining that one of a plurality of batch database storage events has occurred;
iteratively determining, in response to the one of the plurality of batch database storage events, which of the at least one of the batch of data records do not comprise the at least one foreign key reference that each references the one non-existent data record; and
persisting to a database, via a batch storage operation, each of the cached batch of data records that do not comprise the at least one foreign key reference that each references the one non-existent data record.
0 Assignments
0 Petitions
Accused Products
Abstract
A batch of data records generated by at least one application for persistent storage is cached by a cache management device. At least one of the batch of data records includes at least one foreign key reference that each references one non-existent data record. It is determined that one of a group of batch database storage events has occurred. In response to one of the group of batch database storage events, it is iteratively determined which of the at least one of the batch of data records do not include the at least one foreign key reference that each references the one non-existent data record. Each of the cached batch of data records that do not include the at least one foreign key reference that each references the one non-existent data record is persisted to a database by a batch storage operation.
44 Citations
7 Claims
-
1. A method, comprising:
-
caching, via a processor, a batch of data records generated by at least one application for persistent storage, where at least one of the batch of data records comprises at least one foreign key reference that each references one non-existent data record; where caching, via the processor, the batch of data records generated by the at least one application for persistent storage comprises; maintaining a bidirectional directed graph with each data record represented as a node within the bidirectional directed graph, where each vertex in the bidirectional directed graph other than a root node represents one of a plurality of parent records and one of a plurality of child records to be persisted to the database, and each edge in the bidirectional directed graph represents a foreign key directional relationship from one child record to one associated parent record; determining that one of a plurality of batch database storage events has occurred; iteratively determining, in response to the one of the plurality of batch database storage events, which of the at least one of the batch of data records do not comprise the at least one foreign key reference that each references the one non-existent data record; and persisting to a database, via a batch storage operation, each of the cached batch of data records that do not comprise the at least one foreign key reference that each references the one non-existent data record. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
Specification