Directory Tree Search Using Path Index Overlay

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Searching through large numbers of files in data processing systems is resource intensive due to the need for calls to the underlying operating system, slowing down the search process, even with indexing to facilitate faster retrieval.

Innovation Solution

The implementation of a directory tree search method using path indices and inverted indices to identify files containing specific terms without relying on the operating system, along with an overlay data structure for path updates and reverse lookup structures to manage directory relationships and file movements.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If indexing is used to facilitate faster retrieval, then search speed is improved, but the need for operating system calls slows down the search process

Engineering Contradiction:
Improvesearch speedVSAvoidtime for operating system calls
Core Design Contradiction:
SpeedVSLoss of time

Solution Approach 1:

The patent pre-computes and stores directory path information in an overlay data structure during file system operations. This preliminary action eliminates the need for operating system calls during search execution, as the path information is already available in memory for immediate processing.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent introduces an overlay data structure as an intermediary layer between the file system and the search index. This overlay caches directory path information and file locations, allowing the search process to retrieve path information without invoking operating system system calls, thus bridging the gap between file system operations and search operations.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If traditional searching methods are used, then accuracy is maintained, but resource consumption increases

Engineering Contradiction:
Improvesearch accuracyVSAvoidresource consumption
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent segments the search process into two independent parts: (1) retrieving document IDs matching the search term from the index, and (2) using the overlay to filter results based on directory path information. This segmentation allows accurate filtering without re-scanning entire files or making additional operating system calls, reducing resource consumption while maintaining accuracy.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs partial searching by first retrieving all documents containing the search term, then applying a secondary filter using the overlay's path information to keep only documents in the specified directory. This two-stage approach consumes fewer resources than traditional methods that would require complete file system traversal and multiple operating system calls to verify directory locations.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS9058124B2Directory tree search
Publication Date: 2015.06.16 APPLE INC
  • US9058124B2 patent drawing
  • US9058124B2 patent drawing
  • US9058124B2 patent drawing

AI summary

Directory tree searching uses a path index to determine a set of documents for a directory path portion of a search query. The set of documents for the directory path portion is evaluated with a set of document for an indexed term portion of the search query to determine common documents.