Directed Acyclic Graph Search Paths for Parallel Execution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing search systems suffer from slow performance, high latencies, and instability due to inefficient parallelization and rigid code architectures, leading to excessive computational resource consumption and security vulnerabilities.
Innovation Solution
A directed acyclic graph (DAG) framework that enables massive parallelization of search operations by constructing a DAG with interconnected nodes, allowing for dynamic determination of parallelizable operations based on resource availability and execution times, thereby optimizing node paths for fast and stable data searches.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If existing search systems use sequential operations architecture, then code simplicity is maintained, but system latency increases and productivity decreases
Solution Approach 1:
The patent segments search operations into discrete, independent tasks that can be executed in parallel. By breaking down the monolithic sequential code into modular operation units, the system enables concurrent execution while maintaining manageable complexity through clear task boundaries and interfaces.
Solution Approach 2:
The patent transitions from a one-dimensional sequential execution model to a multi-dimensional parallel execution model. By introducing temporal parallelism across multiple operation streams and spatial distribution across computing resources, the system achieves dimensionality expansion that simultaneously improves speed and manages complexity.
2Loss of time
If existing search systems apply one-size-fits-all operation sequences, then ease of operation is maintained, but loss of time increases due to redundant operations
Solution Approach 1:
The patent implements dynamic operation sequencing where the execution plan is generated adaptively based on specific search requirements, data characteristics, and resource availability. This dynamic approach eliminates redundant operations by selecting only necessary tasks while maintaining ease of operation through automated plan generation that adapts to different scenarios.
3Reliability
If existing search systems use series-based operations, then device complexity is reduced, but reliability deteriorates at large scales
Solution Approach 1:
The patent segments the monolithic code architecture into modular, independent operation units with well-defined interfaces. This segmentation isolates failures to specific tasks rather than causing system-wide crashes, thereby improving reliability while the modular structure keeps complexity manageable through reusable components.
Solution Approach 2:
The patent introduces intermediary layers including task scheduling mechanisms, resource management interfaces, and error handling mediators that coordinate between parallel operations and the core system. These intermediaries buffer complexity and protect the core system from failures, enhancing reliability without exposing the full complexity to users.
4Productivity
If existing search systems execute operations sequentially, then ease of operation is maintained, but productivity decreases due to excessive computational resource consumption
Solution Approach 1:
The patent implements self-service parallelization where the system automatically identifies, schedules, and executes parallel operations without requiring manual intervention or complex configuration. The operational code autonomously manages task distribution and resource allocation, improving productivity while keeping parallelization complexity hidden from users through automated management.
Data Source
AI summary
The present disclosure is directed toward systems, methods, and non-transitory computer-readable media for performing a data search for a search request by utilizing a directed acyclic graph. For example, the disclosed systems receive a search request at a search engine of a content management system. In addition, the disclosed systems determine (e.g., in response to the search request) a node path from a directed acyclic graph that includes a plurality of interconnected nodes defining computer operations. Further, the determined node path includes a set of nodes that corresponds to the search request. Moreover, the disclosed systems perform the data search for the search request by executing operations defined by nodes along the node path within the directed acyclic graph.