公开(公告)号：US12197333B2

公开(公告)日：2025-01-14

申请号：US17823694

申请日：2022-08-31

Applicant: Home Box Office, Inc.

Inventor： Jonathan David Lutz ,  Allen Arthur Gay ,  Dylan Carney

IPC: G06F12/0862 ,  G06F16/901 ,  G06F16/957

Abstract: The described technology is generally directed towards maintaining content selection graphs in an in-memory content selection graph data store in association with respective start times that indicates when the respective graphs become active. When a request to return content selection data is received, an active graph that corresponds to the request and the current time is accessed to obtain the requested content selection data. The response data can be prebuilt, e.g., in a set of active graphs for different client types, so that the response can be returned generally as is from the active graph in the set for that particular client type. 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.

公开(公告)号：US11979474B2

公开(公告)日：2024-05-07

申请号：US16818109

申请日：2020-03-13

Applicant: Home Box Office, Inc.

Inventor： Sata Busayarat ,  Allen Arthur Gay ,  Brandon C. Furtwangler ,  Steven N. Furtwangler

IPC: H04L67/568 ,  G06F16/951 ,  G06T1/20 ,  G06T1/60 ,  G06T11/20 ,  H04L41/5054 ,  H04L43/045 ,  H04L43/10 ,  H04L43/55 ,  H04L65/1045 ,  H04L67/00 ,  H04L67/01 ,  H04L67/02 ,  H04L67/10 ,  H04L67/51 ,  H04L67/56 ,  H04L67/566 ,  H04L67/5682 ,  H04L67/60 ,  H04N21/25 ,  H04N21/43 ,  H04N21/433 ,  H04N21/482

CPC classification number: H04L67/568 ,  G06F16/951 ,  G06T1/20 ,  G06T1/60 ,  G06T11/206 ,  H04L41/5054 ,  H04L43/045 ,  H04L43/10 ,  H04L43/55 ,  H04L65/1045 ,  H04L67/01 ,  H04L67/02 ,  H04L67/10 ,  H04L67/34 ,  H04L67/51 ,  H04L67/56 ,  H04L67/566 ,  H04L67/5682 ,  H04L67/60 ,  H04N21/251 ,  H04N21/43 ,  H04N21/4332 ,  H04N21/4821 ,  H04N21/4826

Abstract: The described technology is directed towards returning expanded data, beyond the data that was specifically requested, to a client, in order to reduce or eliminate likely subsequent requests for more data. Client requests for data items are processed by expansion rule logic to find an expansion rule set (e.g., file) corresponding to the identified data item. The rule set is used to expand requests for certain data items into expanded requests that return more data items than those requested. Client devices receive, cache and (often) use the cached expanded data items, which thereby reduces the overall number of requests to the data service. Expansion rules may be based upon observations (e.g., machine learned and/or manual) of request patterns, so as to reasonably predict which data item or items clients will likely next need, and return those as expanded data items in anticipation of their need.

公开(公告)号：US20220147447A1

公开(公告)日：2022-05-12

申请号：US17648555

申请日：2022-01-21

Applicant: Home Box Office, Inc.

Inventor： Jonathan David Lutz ,  Allen Arthur Gay ,  Dylan Carney

IPC: G06F12/02 ,  G06F16/901 ,  G06F12/0862

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.

公开(公告)号：US11269768B2

公开(公告)日：2022-03-08

申请号：US16720838

申请日：2019-12-19

Applicant: Home Box Office, Inc.

Inventor： Jonathan David Lutz ,  Allen Arthur Gay ,  Dylan Carney

IPC: G06F12/00 ,  G06F12/02 ,  G06F16/901 ,  G06F12/0862

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.

公开(公告)号：US10425672B2

公开(公告)日：2019-09-24

申请号：US15148943

申请日：2016-05-06

Applicant: Home Box Office, Inc.

Inventor： Allen Arthur Gay ,  Sata Busayarat

IPC: H04N21/266 ,  H04L29/08 ,  H04N21/231 ,  H04N21/258 ,  H04N21/454

Abstract: The described technology is directed towards obtaining and returning time offset data instead of current data in response to a data request. The time offset data may be limited to privileged clients only, and only provided thereto when desired, using a time offset value set by the client, for example. For example, a privileged user may request time offset data corresponding to a future time so as to preview how the data may be presented at a future time. Time offset data may be used by a system entity to fill a cache, e.g., as secondary cached data that may be used once primary cached data expires.

公开(公告)号：US20180322176A1

公开(公告)日：2018-11-08

申请号：US15584134

申请日：2017-05-02

Applicant: Home Box Office, Inc.

Inventor： Sata Busayarat ,  Brandon C. Furtwangler ,  Allen Arthur Gay ,  Jonathan David Lutz ,  Steven N. Furtwangler

IPC: G06F17/30

CPC classification number: G06F16/254 ,  G06F16/168 ,  G06F16/738 ,  G06F16/9024 ,  H04L65/604

Abstract: The described technology is directed towards a data transformation pipeline architecture of a data service that processes generalized datasets into datasets (e.g., video data or graph nodes) customized for a particular client device. Described herein is maintaining a set of data transformation models at a data service, and upon receiving a client request for data, selecting a relevant subset of the transformation models and arranging the subset into a data transformation pipeline. In general, the pipeline of transformation models transforms the generalized data into the format and shape that each client device expects. The subset may be selected based upon device type, device class and/or software version information (and possibly state data) sent with each data request. The transformation models may be maintained in a hierarchical data store such as files in a file system to facilitate retrieval by searching the hierarchy for appropriate transformation models.

公开(公告)号：US20170105049A1

公开(公告)日：2017-04-13

申请号：US15285439

申请日：2016-10-04

Applicant: Home Box Office, Inc.

Inventor： Sata Busayarat ,  Allen Arthur Gay ,  Brandon C. Furtwangler ,  Steven N. Furtwangler

IPC: H04N21/482 ,  H04N21/433 ,  H04N21/25

CPC classification number: H04L67/2842 ,  G06F16/951 ,  G06T1/20 ,  G06T1/60 ,  G06T11/206 ,  H04L41/5038 ,  H04L41/5054 ,  H04L43/045 ,  H04L43/10 ,  H04L65/105 ,  H04L67/02 ,  H04L67/10 ,  H04L67/16 ,  H04L67/28 ,  H04L67/2833 ,  H04L67/2852 ,  H04L67/32 ,  H04L67/34 ,  H04L67/42 ,  H04N21/251 ,  H04N21/43 ,  H04N21/4332 ,  H04N21/4821 ,  H04N21/4826

Abstract: The described technology is directed towards returning expanded data, beyond the data that was specifically requested, to a client, in order to reduce or eliminate likely subsequent requests for more data. Client requests for data items are processed by expansion rule logic to find an expansion rule set (e.g., file) corresponding to the identified data item. The rule set is used to expand requests for certain data items into expanded requests that return more data items than those requested. Client devices receive, cache and (often) use the cached expanded data items, which thereby reduces the overall number of requests to the data service. Expansion rules may be based upon observations (e.g., machine learned and/or manual) of request patterns, so as to reasonably predict which data item or items clients will likely next need, and return those as expanded data items in anticipation of their need.

公开(公告)号：US12041286B2

公开(公告)日：2024-07-16

申请号：US17363075

申请日：2021-06-30

Applicant: Home Box Office, Inc.

Inventor： Allen Arthur Gay ,  Sata Busayarat

IPC: H04N21/266 ,  H04L67/1036 ,  H04N21/231 ,  H04N21/258 ,  H04N21/454

CPC classification number: H04N21/266 ,  H04L67/1036 ,  H04N21/23106 ,  H04N21/25816 ,  H04N21/4542

Abstract: The described technology is directed towards obtaining and returning time offset data instead of current data in response to a data request. The time offset data may be limited to privileged clients only, and only provided thereto when desired, using a time offset value set by the client, for example. For example, a privileged user may request time offset data corresponding to a future time so as to preview how the data may be presented at a future time. Time offset data may be used by a system entity to fill a cache, e.g., as secondary cached data that may be used once primary cached data expires.

公开(公告)号：US11748355B2

公开(公告)日：2023-09-05

申请号：US17549593

申请日：2021-12-13

Applicant: Home Box Office, Inc.

Inventor： Jonathan David Lutz ,  Allen Arthur Gay ,  Dylan Carney

IPC: G06F16/00 ,  G06F16/2455 ,  G06F16/957 ,  G06F16/215 ,  G06F16/23 ,  G06F16/901

CPC classification number: G06F16/24552 ,  G06F16/215 ,  G06F16/2365 ,  G06F16/9024 ,  G06F16/9574

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.

公开(公告)号：US20230016909A1

公开(公告)日：2023-01-19

申请号：US17935766

申请日：2022-09-27

Applicant: Home Box Office, Inc.

Inventor： Jonathan David Lutz ,  Allen Arthur Gay ,  Dylan Carney

IPC: G06F16/172 ,  G06F16/17 ,  H04N21/431 ,  G06F16/901

Abstract: The described technology is generally directed towards coordinating the generation, validation and enabling of content selection graphs in an in-memory content selection graph data store. When a set of content selection graphs is requested, a coordinator starts the generation of the relevant graphs. Upon successful generation, the coordinator starts a validation of the generated graphs against rules for the nodes/response data in the graphs. If the generated graphs pass validation, the coordinator enables the graph set for use in an in-memory cache, whereby when a request to return content selection data is received, an active graph that corresponds to the request and the current time is accessed to obtain and return the response data as the requested content selection data.