Garbage collection of preloaded time-based graph data
AssigneeHome Box Office, Inc.
InventorsJonathan David Lutz, Allen Arthur Gay, Dylan Carney
Life of this patent
Estimating the term…
Abstract
The described technology is generally directed towards garbage collecting content selection graphs and related data from in an in-memory content selection graph data store. When a set of content selection graphs expire, a more current content selection graph set becomes active, and the storage space (e.g., in a Redis cache) used by the expired content selection graphs is reclaimed via garbage collection. Some graphs can be replaced before use, referred to as orphaned graphs, and the storage space for any such orphaned graphs is also reclaimed during garbage collection. Also garbage collected is storage space including related data structures used to generate and validate graphs.
Claims20
A method comprising:
- determining, by a system comprising a processor, that a content selection graph preloaded into a memory is no longer in use;
- determining that an orphaned graph in the memory is not mapped to a timepoint and is not an outstanding graph that is not yet built or is not yet validated;
- and
- garbage collecting, by the system, the content selection graph and the orphaned graph from the memory.
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:
- in response to determining that a content selection graph preloaded into the memory is no longer in use, garbage collecting the content selection graph from the memory, wherein the garbage collecting the content selection graph comprises setting a write mutex on the memory during the garbage collecting, and unlocking the write mutex after the garbage collecting.
A non-transitory machine-readable medium, comprising executable instructions that, when executed by a processor, facilitate performance of operations, the operations comprising:
- in response to determining that a content selection graph preloaded into a memory is no longer in use, garbage collecting the content selection graph from the memory, wherein the garbage collecting the content selection graph comprises:
- determining that an unused entity key in the memory is unused based on evaluating a set of referenced entity keys against a full set of entity keys scanned from the memory, and
- garbage collecting the unused entity key from the memory.
Dependencies are inferred from the claim text.