US 12,332,882 B1
Directed acyclic graph framework for executing search function operations
Harrison Engel, El Paso, TX (US); Ivan Traus, San Francisco, CA (US); Jongmin Baek, Foster City, CA (US); and Sarah Andrabi, Seattle, WA (US)
Assigned to Dropbox, Inc., San Francisco, CA (US)
Filed by Dropbox, Inc., San Francisco, CA (US)
Filed on Feb. 6, 2024, as Appl. No. 18/434,508.
Int. Cl. G06F 16/24 (2019.01); G06F 9/52 (2006.01); G06F 16/2453 (2019.01); G06F 21/62 (2013.01)
CPC G06F 16/24532 (2019.01) [G06F 9/524 (2013.01); G06F 21/6218 (2013.01); G06F 2221/2141 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A system comprising:
at least one processor; and
a non-transitory computer-readable medium storing instructions which, when executed by the at least one processor, cause the system to:
receive a search request at a search engine of a content management system;
in response to the search request, determine, within a directed acyclic graph comprising a plurality of nodes defining computer operations for performing data searches within the content management system, an initial node and a final node in a node path comprising a set of nodes from the directed acyclic graph corresponding to the search request;
determine two or more nodes of the set of nodes to execute in parallel between the initial node and the final node; and
perform a data search for the search request by executing operations defined by the two or more nodes along the node path within the directed acyclic graph.