Patents by Inventor Dylan Carney
Dylan Carney has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11907165Abstract: 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.Type: GrantFiled: September 27, 2022Date of Patent: February 20, 2024Assignee: HOME BOX OFFICE, INC.Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Patent number: 11829294Abstract: The described technology is generally directed towards generating content selection graphs in an in-memory content selection graph data store in association with respective start times that indicate when the respective graphs become active. When a content selection graph is needed for a given timepoint, a node identifier is used to obtain response data that is cached for that node identifier and timepoint. Edge data associated with the node identifier is used to determine a next node for obtaining its response data for caching, and so on. The response data can be prebuilt, e.g., generated in a set of active graphs for different client types, so that a response can be returned generally as is from the active graph in the set for the node identifier and that particular client type. For efficiency, operations can be used to avoid processing a node identifier more than once when generating a graph.Type: GrantFiled: December 19, 2019Date of Patent: November 28, 2023Assignee: HOME BOX OFFICE, INC.Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Patent number: 11748355Abstract: 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.Type: GrantFiled: December 13, 2021Date of Patent: September 5, 2023Assignee: Home Box Office, Inc.Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Patent number: 11720488Abstract: 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.Type: GrantFiled: January 21, 2022Date of Patent: August 8, 2023Assignee: HOME BOX OFFICE, INC.Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Publication number: 20230023208Abstract: The described technology is generally directed towards validating content selection graphs for use in an in-memory content selection graph data store. When a content selection graph data is generated, the graph nodes can correspond to prebuilt response data. The response data for any of the nodes can be verified against rules based on the type of a node, for example, as well as based on client-specific information for types of clients. The overall validation process can validate the content selection graph for subsequent use, can result in errors or warnings being logged (which may or may not render the graph unusable, e.g., depending on severity), or can fail the content selection graph. If validated, the content selection graph can be used to rapidly return response data when content from the graph is requested.Type: ApplicationFiled: September 29, 2022Publication date: January 26, 2023Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Publication number: 20230016909Abstract: 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.Type: ApplicationFiled: September 27, 2022Publication date: January 19, 2023Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Publication number: 20220414012Abstract: 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.Type: ApplicationFiled: August 31, 2022Publication date: December 29, 2022Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Patent number: 11475092Abstract: The described technology is generally directed towards validating content selection graphs for use in an in-memory content selection graph data store. When a content selection graph data is generated, the graph nodes can correspond to prebuilt response data. The response data for any of the nodes can be verified against rules based on the type of a node, for example, as well as based on client-specific information for types of clients. The overall validation process can validate the content selection graph for subsequent use, can result in errors or warnings being logged (which may or may not render the graph unusable, e.g., depending on severity), or can fail the content selection graph. If validated, the content selection graph can be used to rapidly return response data when content from the graph is requested.Type: GrantFiled: December 19, 2019Date of Patent: October 18, 2022Assignee: HOME BOX OFFICE, INC.Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Patent number: 11474943Abstract: 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.Type: GrantFiled: December 19, 2019Date of Patent: October 18, 2022Assignee: HOME BOX OFFICE, INC.Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Patent number: 11474974Abstract: 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.Type: GrantFiled: December 19, 2019Date of Patent: October 18, 2022Assignee: HOME BOX OFFICE, INC.Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Publication number: 20220147447Abstract: 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.Type: ApplicationFiled: January 21, 2022Publication date: May 12, 2022Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Publication number: 20220100764Abstract: 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.Type: ApplicationFiled: December 13, 2021Publication date: March 31, 2022Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Patent number: 11269768Abstract: 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.Type: GrantFiled: December 19, 2019Date of Patent: March 8, 2022Assignee: HOME BOX OFFICE, INC.Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Patent number: 11204924Abstract: 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.Type: GrantFiled: December 19, 2019Date of Patent: December 21, 2021Assignee: Home Box Office, Inc.Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Publication number: 20200201862Abstract: 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.Type: ApplicationFiled: December 19, 2019Publication date: June 25, 2020Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Publication number: 20200201820Abstract: 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.Type: ApplicationFiled: December 19, 2019Publication date: June 25, 2020Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Publication number: 20200201770Abstract: The described technology is generally directed towards generating content selection graphs in an in-memory content selection graph data store in association with respective start times that indicate when the respective graphs become active. When a content selection graph is needed for a given timepoint, a node identifier is used to obtain response data that is cached for that node identifier and timepoint. Edge data associated with the node identifier is used to determine a next node for obtaining its response data for caching, and so on. The response data can be prebuilt, e.g., generated in a set of active graphs for different client types, so that a response can be returned generally as is from the active graph in the set for the node identifier and that particular client type. For efficiency, operations can be used to avoid processing a node identifier more than once when generating a graph.Type: ApplicationFiled: December 19, 2019Publication date: June 25, 2020Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Publication number: 20200201769Abstract: 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.Type: ApplicationFiled: December 19, 2019Publication date: June 25, 2020Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Publication number: 20200201930Abstract: The described technology is generally directed towards validating content selection graphs for use in an in-memory content selection graph data store. When a content selection graph data is generated, the graph nodes can correspond to prebuilt response data. The response data for any of the nodes can be verified against rules based on the type of a node, for example, as well as based on client-specific information for types of clients. The overall validation process can validate the content selection graph for subsequent use, can result in errors or warnings being logged (which may or may not render the graph unusable, e.g., depending on severity), or can fail the content selection graph. If validated, the content selection graph can be used to rapidly return response data when content from the graph is requested.Type: ApplicationFiled: December 19, 2019Publication date: June 25, 2020Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney
-
Publication number: 20200201756Abstract: 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.Type: ApplicationFiled: December 19, 2019Publication date: June 25, 2020Inventors: Jonathan David Lutz, Allen Arthur Gay, Dylan Carney