File System Search Proxying for Concurrent Vulnerability Scanning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current file system search methods are resource-intensive and time-consuming, especially when performing multiple searches on a single endpoint, leading to impractical costs and inefficiencies in identifying vulnerabilities across a network.
Innovation Solution
A method and system for concurrently performing multiple file system searches by identifying a common set of search roots, generating a window function, enumerating candidates, and evaluating them based on search criteria using a configured processor, which reduces redundant traversals and improves efficiency through the use of directed acyclic word graphs (DAWGs) and asymmetric coroutines.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple individual file system searches are performed on an endpoint, then comprehensive vulnerability identification is achieved, but resource consumption and time requirements increase significantly
Solution Approach 1:
The patent combines multiple individual file system searches into a single unified search operation by identifying common search roots across multiple vulnerability patterns. Instead of executing separate traversals for each vulnerability type, the system merges them into one traversal that simultaneously evaluates multiple search criteria, thereby maintaining comprehensive vulnerability identification while dramatically improving search efficiency and reducing resource consumption.
Solution Approach 2:
The unified search mechanism serves multiple functions simultaneously: it traverses the file system once while evaluating multiple vulnerability patterns, applies multiple search criteria to the same candidate set, and returns comprehensive results for all vulnerability types. This multi-functionality eliminates redundant operations and maximizes the utility of each file system traversal.
2Reliability
If the entire file system is traversed multiple times for different vulnerability searches, then all known vulnerabilities are searched, but the process becomes impractical for network-wide deployment
Solution Approach 1:
The patent merges multiple file system traversals into a single traversal by identifying common search roots. The system consolidates the search paths for multiple vulnerability patterns and executes one unified traversal that covers all required directories, thereby maintaining complete vulnerability search coverage while reducing total search time from multiple full traversals to a single optimized traversal.
Solution Approach 2:
The system performs preliminary analysis to identify common search roots before executing the unified search. By pre-processing the search requests to determine the intersection of search paths across multiple vulnerability patterns, the system prepares an optimized traversal plan that minimizes redundant operations and ensures comprehensive coverage in a single pass.
3Reliability
If multiple searches are performed on the same file system, then thorough vulnerability assessment is achieved, but resource intensity increases
Solution Approach 1:
The patent merges multiple computationally intensive file system searches into a single resource-efficient operation. By combining the search logic for multiple vulnerability patterns into one unified traversal with shared candidate evaluation, the system maintains thorough vulnerability assessment while significantly reducing CPU usage, memory consumption, and I/O operations compared to executing separate searches.
Solution Approach 2:
The system creates a unified search model that replicates the functionality of multiple individual searches within a single operational framework. Rather than duplicating entire search processes, the patent copies and integrates the search criteria and evaluation logic into one coordinated operation that achieves the same thoroughness with fraction of the resources.
Data Source
AI summary
Systems and methods for concurrently performing multiple searches of a file system based on a plurality of search requests. Each search request belonging to the plurality of search requests has a search root. A common set of search roots is identified from the plurality of search roots. A first window function is generated based upon a first search root belonging to the common set of search roots. Candidates located in a plurality of directory trees are enumerated. Each of the directory trees belonging to the plurality of directory trees begins in a search root in the common set of search roots. The candidates are evaluated based upon a first search criteria and the first window function. And, the candidates that satisfy both the first search criteria and the first window function are reported as a result.