Directed graph for distribution of time-constrained data
First Claim
Patent Images
1. A method comprising:
- translating grouping values into nodes of a directed graph, wherein the grouping values are associated with periods of timelines, the timelines comprising data records;
distributing data through the nodes to obtain a modified subset of the data records;
re-distributing the data recursively along the nodes to obtain a modified directed graph; and
translating the modified directed graph into a modified plurality of timelines that include the modified subset of data records.
2 Assignments
0 Petitions
Accused Products
Abstract
In synchronizing data across a database, time-dependent and time-constrained data may be synchronized, using grouping value(s) that may themselves be time-dependent. When a time constraint prohibits data timelines from exhibiting time gaps, data included in the timeline may be mapped to a directed graph. In this way, any time gaps may be filled by extending data records that precede the gap(s), and this operation may be reflected in a coloring of the directed graph. Then, recursive processing may be performed using the directed graph, so as to account for any unanticipated effects of the extended data records.
18 Citations
22 Claims
-
1. A method comprising:
-
translating grouping values into nodes of a directed graph, wherein the grouping values are associated with periods of timelines, the timelines comprising data records;
distributing data through the nodes to obtain a modified subset of the data records;
re-distributing the data recursively along the nodes to obtain a modified directed graph; and
translating the modified directed graph into a modified plurality of timelines that include the modified subset of data records. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. An apparatus comprising a storage medium having instructions stored thereon, the instructions including:
-
a first code segment for selecting a first grouping value sequence associated with a first timeline, the first timeline including first data records;
a second code segment for selecting a second grouping value sequence associated with a second timeline, the second timeline including second data records;
a third code segment for mapping the first grouping value sequence and the second grouping value sequence into nodes of a directed graph; and
a fourth code segment for representing data associated with a first grouping value in the directed graph by providing a first designation to a first node associated with the first grouping value. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A system comprising:
-
means for associating nodes of a directed graph with grouping periods and grouping values associated with timelines;
means for associating an edge of the directed graph between succeeding grouping periods; and
means for distributing data associated with the timelines by operating on the directed graph, and thereafter translating the directed graph back into the timelines. - View Dependent Claims (20, 21, 22)
-
Specification