Distributed Directory Deletion Without Bottom-Up Traversal
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional directory deletion methods in file systems require traversing directories from top-down and deleting contents bottom-up, which is inefficient for solid-state media and incurs significant communication overhead, especially in solid-state drives.
Innovation Solution
A distributed file deletion method that operates across a storage system without concern for order, using iterative search and destroy processes and background deletions to efficiently delete directories and entire directory trees.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional bottom-up directory deletion method is used, then deletion completeness is ensured, but deletion time and communication overhead increase significantly
Solution Approach 1:
The patent inverts the traditional deletion order by deleting directories from top to bottom instead of bottom to top. The system identifies all directories to be deleted and their contents, then deletes parent directories before child directories, eliminating the need to wait for contents to be emptied first. This inversion resolves the contradiction by maintaining deletion completeness through proper dependency tracking while dramatically reducing deletion time.
Solution Approach 2:
The patent performs preliminary identification of all directories and their dependencies before deletion begins. The system traverses the directory tree, identifies all target directories and their contents, and establishes the deletion order in advance. This preliminary action allows the system to execute deletions efficiently without repeated traversal or waiting, resolving the time overhead issue while ensuring completeness through pre-planned dependency management.
2Manufacturing precision
If manual specification of entire directory tree is required, then deletion precision is improved, but ease of operation deteriorates
Solution Approach 1:
The patent implements self-service by enabling the deletion system to automatically identify and traverse the entire directory tree structure starting from a specified root directory. When a user initiates deletion of a parent directory, the system autonomously finds all child directories and contents, determines the proper deletion sequence, and executes the operation without requiring manual specification of the entire tree. This maintains precision through systematic identification while dramatically improving ease of operation.
3Manufacturing precision
If directory tree traversal is performed from top-down, then deletion precision is improved, but communication overhead increases
Solution Approach 1:
The patent merges the directory identification phase and the deletion execution phase into a single efficient traversal process. Instead of separately traversing to identify directories and then again to delete them, the system performs a unified top-down traversal that both identifies all target directories and establishes their deletion order in one pass. This merging eliminates redundant communication and traversal overhead while maintaining the precision benefits of top-down processing.
Data Source
AI summary
A method of distributed file deletion, performed by a storage system, is provided. The method includes receiving, at the storage system, a request to delete a directory and contents of the directory and adding the directory to a first set, listed in a memory in the storage system. The method includes operating on the first set, by examining each directory in the first set to identify subdirectories, adding each identified subdirectory to the first set as a directory, and adding each examined directory to a second set listed in the memory. The method includes deleting in a distributed manner across the storage system without concern for order, contents of directories, and the directories listed in the second set.