Time-Based Directory Structure for Content Addressable Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing file systems do not efficiently manage storage and retrieval of content units, leading to potential duplication and inefficient access due to lack of time-based organization and indexing, which affects performance and consistency in data storage and retrieval.
Innovation Solution
Implementing a method that uses a hierarchical file system with time-based directories and content addresses to store and retrieve content units, including a single instance storage capability to prevent duplicate copies and a virtual pool structure for logical separation of content units, along with replication management to handle time-based queries effectively.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If traditional file systems store content units without time-based organization, then storage结构简单 (storage structure is simple), but storage efficiency deteriorates due to duplicate content units and inconsistent access
Solution Approach 1:
The patent segments the file system into time-based directories where each directory corresponds to a specific time period. Content units are stored in directories based on their creation or modification time, creating a hierarchical structure that organizes data chronologically. This segmentation enables efficient retrieval by time range and prevents duplicates through systematic organization.
Solution Approach 2:
The patent adds a time dimension to the traditional file system structure by organizing directories according to time periods (years, months, days). This dimensional change transforms the flat storage structure into a multi-level hierarchical system where content units can be efficiently located and managed based on temporal characteristics, resolving the contradiction between storage efficiency and structural complexity.
2Productivity
If content units are retrieved without time-based indexing, then access speed is fast for simple queries, but retrieval efficiency deteriorates when time-based queries are required
Solution Approach 1:
The patent performs preliminary organization of content units into time-based directories during the storage phase. By pre-sorting content units according to their time metadata before retrieval operations, the system enables efficient time-based queries without requiring complex indexing during retrieval. This preliminary action resolves the contradiction by preparing the data structure in advance.
Solution Approach 2:
The patent introduces time-based directories as an intermediary layer between the storage medium and the retrieval operation. These directories act as mediators that organize content units by time period, enabling efficient retrieval without direct complex indexing operations. The intermediary structure simplifies the retrieval process while maintaining high productivity for time-based queries.
3Loss of energy
If duplicate content units are allowed in the file system, then storage capacity utilization is high, but storage efficiency deteriorates due to wasted space and inconsistent data
Solution Approach 1:
The patent implements a feedback mechanism where the file system checks whether content units already exist in the time-based directory structure before storing new content. By comparing content identifiers and checking existing directories, the system provides feedback to prevent duplicate storage. This feedback loop ensures data consistency and eliminates storage waste while maintaining reliable data management.
Data Source
AI summary
One embodiment of the invention is directed to providing a single instance storage capability in a content addressable computer system that stores content units in a time-based directory structure. Another embodiment is directed to managing access to content units that do not include a timestamp in their content addresses, in a time-based directory structure. A further embodiment is directed to accessing replicated content units stored on a computer, based on a time of replication. A further embodiment is directed to employing a bitmap in a time-based directory structure which may be used to indicate whether any content units stored during a specified time range are stored in the directory structure.