Collection of timepoints and mapping preloaded graphs

Patent metadata

Field	Value
Publication number	US-11748355-B2
Application number	US-202117549593-A
Country	US
Kind code	B2
Filing date	Dec 13, 2021
Priority date	Dec 21, 2018
Publication date	Sep 5, 2023
Grant date	Sep 5, 2023

Abstract

The described technology is generally directed towards causing the generation of a content selection graph (or set of graphs) upon receipt of a notification that a new graph or replacement graph is needed with respect to a starting timepoint. For a new graph, a timepoint for that new graph indicates the need for the new graph at a given starting time. For a replacement graph, a notification (subscribed from a monitoring service) can indicate that an existing graph has changed; a replacement graph is generated with a graph identifier of the replacement graph, which then replaces the graph identifier of the existing graph in the mappings of valid graphs to start times. A Redis cache can be used to maintain the various graph sets, including the active graph sets and graph sets that will become active at a future time.

First claim

What is claimed is:

1. A system, comprising:
a processor; and
a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations, the operations comprising:
collecting first data indicating a first timepoint and corresponding to a first point in time, wherein the first timepoint is associated with a first content graph set preloaded into a cache;
collecting second data indicating a second timepoint and corresponding to a second point in time, wherein the second timepoint is associated with a second content graph set preloaded into a cache, and wherein the second point in time is later than the first point in time;
in a case where the first point in time has passed and the second point in time is not yet reached at a current time related to requesting of a first request for data, responding to the first request by accessing the first content graph set; and
in a case where both the first point in time has been reached and the second point in time has been reached at a current time related to requesting of a second request for data, responding to the second request by accessing the second content graph set.

2. The system of claim 1 , wherein the first data indicating the first timepoint and an identifier of the first content graph set are stored in a collection of timepoint, content graph set identifier mappings.

3. The system of claim 1 , wherein the operations further comprise:
expiring the first content graph set after the second point in time is reached.

4. The system of claim 3 , wherein the operations further comprise:
removing the first content graph set from the cache after the expiring the first content graph set.

5. The system of claim 1 , wherein the operations further comprise:
preloading a third content graph set into the cache, and collecting third data indicating a third timepoint and corresponding to a third point in time, wherein the third timepoint is associated with the third content graph set, and wherein the third point in time is later than the second point in time.

6. The system of claim 5 , wherein the operations further comprise:
preloading a fourth content graph set into the cache, generating an indication of the third data indicating an association of the third timepoint with the fourth content graph set, and disassociating the third data from the third content graph set.

7. The system of claim 6 , wherein the operations further comprise:
generating the fourth content graph set in response to a notification received prior to the third point in time, wherein receipt of the notification received prior to the third point in time triggers a notification that the third content graph set is no longer valid.

8. The system of claim 6 , wherein the operations further comprise:
removing the third content graph set from the cache.

9. A method, comprising:
collecting, by a system comprising a processor, a collection of timepoints, wherein respective timepoints in the collection of timepoints are mapped to respective content graph sets maintained in a cache;
replacing, by the system, in the cache, an existing content graph set in the cache with a first new content graph set;
remapping, by the system, an existing timepoint in the collection of timepoints from being mapped to the existing content graph set to being mapped to the first new content graph set;
adding, by the system, a second new content graph set to the cache;
inserting, by the system, a new timepoint into the collection of timepoints, wherein the new timepoint is mapped to the second new content graph set; and
serving a request for content from an active content graph set in the cache, wherein the active content graph set is one of the first new content graph set or the second new content graph set, and wherein the active content graph set is selected based on a comparison of a current time, related to the serving, to a timepoint that is mapped to the active content graph set.

10. The method of claim 9 , wherein data indicating the respective timepoints in the collection of timepoints is mapped to the respective content graph sets via respective graph set identifiers.

11. The method of claim 9 , wherein the replacing the existing content graph set in the cache with the first new content graph set is performed in response to receiving a notification that the existing content graph set is no longer valid.

12. The method of claim 9 , further comprising:
garbage collecting the existing content graph set after the remapping.

13. The method of claim 9 , further comprising:
generating the first new content graph set in response to a change relative to the existing content graph set.

14. The method of claim 9 , further comprising:
selecting the first new content graph set as the active content graph set when the current time reaches the existing timepoint, and selecting the second new content graph set as the active content graph set when the current time reaches the new timepoint.

15. The method of claim 14 , further comprising garbage collecting data representing the existing timepoint after selecting the second new content graph set as the active content graph set.

16. A machine-readable storage medium, comprising executable instructions that, when executed by a processor, facilitate performance of operations, the operations comprising:
collecting a collection of timepoints, wherein respective timepoints correspond to respective points in time, and wherein the respective timepoints are mapped to respective content offering graph sets maintained in a data structure;
serving a response, to client request, from a first active content offering graph set maintained in the data structure, wherein the first active content offering graph set is selected when a current time, related to the serving, reaches a first timepoint, indicated by first data mapped to the first content offering graph set, and has not reached a later timepoint that is after the first timepoint; and
serving a response, to a client request, from a second active content offering graph set maintained in the data structure, wherein the second active content offering graph set is selected when the current time, related to the serving, reaches a second timepoint indicated by second data mapped to the second content offering graph set, and has not reached a later timepoint that is after the second timepoint.

17. The machine-readable storage medium of claim 16 , wherein the operations further comprise:
replacing an existing content offering graph set with the second content offering graph set, comprising, before the current time has reached the second timepoint, retaining the second content offering graph set in the data structure, and remapping the second data, indicating the second timepoint from the existing content offering graph set to the second content offering graph set.

18. The machine-readable storage medium of claim 17 , wherein the operations further comprise:
receiving a notification that the existing content offering graph is no longer valid; and
generating the second content offering graph set in response to the notification.

19. The machine-readable storage medium of claim 17 , wherein the operations further comprise:
garbage collecting the existing content offering graph set.

20. The machine-readable storage medium of claim 16 , wherein the operations further comprise:
garbage collecting the first active content offering graph set and the first data indicating the first timepoint a

Assignees

• Home Box Office Inc

Inventors

• Lutz Jonathan David
• Gay Allen Arthur
• Carney Dylan

Classifications

• G06F16/24552 Primary

  Database cache management · CPC title

• G06F16/215

  Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors · CPC title

• G06F16/2365

  Ensuring data consistency and integrity · CPC title

• G06F16/9024

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title

• G06F16/9574

  of access to content, e.g. by caching · CPC title