Hashed Directory Hierarchy for File System Performance

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current file systems face performance degradation when storing large numbers of files, as the architecture can lead to issues such as time-consuming and limited access to files, especially when a large number of files are stored in one directory, requiring resource-intensive solutions like folder management and defragmentation to maintain performance.

Innovation Solution

A method that generates a hashed identifier for each content item request, using information like date, time, IP address, and random number counts to create a hierarchy of containers, allowing content items to be automatically stored in a randomized and equitable manner throughout the directory structure, avoiding the need for folder limits and resource-heavy monitoring.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If a large number of files are stored in a single directory, then the storage capacity is increased, but the file system performance deteriorates and access time increases

Engineering Contradiction:
Improvenumber of files storedVSAvoidfile system performance
Core Design Contradiction:
Quantity of substanceVSProductivity

Solution Approach 1:

The patent divides the single directory into multiple subdirectories organized in a hierarchical structure. When files are stored, they are automatically distributed across these subdirectories based on hashing algorithms, preventing any single directory from becoming overloaded and maintaining optimal file system performance while enabling storage of large numbers of files.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transitions from a flat single-directory structure to a multi-dimensional hierarchical directory structure with multiple levels and subdirectories. This dimensional expansion allows files to be distributed across multiple paths and levels, improving both storage capacity and access efficiency simultaneously.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Productivity

If manual folder management and defragmentation are implemented to maintain performance, then file system performance is maintained, but resource consumption and system complexity increase

Engineering Contradiction:
Improvefile system performanceVSAvoidfolder management complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent implements automatic file distribution mechanisms that self-regulate directory contents without requiring manual intervention. The system automatically monitors directory file counts and redistributes files as needed, eliminating the need for manual folder management, defragmentation operations, and associated resource consumption.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent establishes predetermined rules and thresholds for file distribution before problems occur. When directories approach capacity limits or performance degradation thresholds, the system proactively redistributes files according to predefined criteria, preventing performance issues before they arise rather than requiring reactive management.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS9268779B2Methods, computer program products, and apparatuses for dispersing content items
Publication Date: 2016.02.23 HYLAND SOFTWARE INC
  • US9268779B2 patent drawing
  • US9268779B2 patent drawing
  • US9268779B2 patent drawing

AI summary

An apparatus for dispersing content may include a processor. The processor may be configured to receive a request associated with a content item and generate a hashed identifier based at least in part on the request associated with the content item. The processor may further be configured to generate a respective container within a hierarchy of one or more containers based at least in part on the hashed identifier and store the content item in one of the one or more containers based at least in part on the hashed identifier. Associated methods and computer program products may also be provided.