File Allocation Table Cluster Chain Division
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for managing and editing large volumes of data in electronic devices are inefficient, as they require extensive storage space and slow data editing processes, particularly when dealing with files stored across multiple clusters.
Innovation Solution
A method utilizing a file allocation table (FAT) to divide or merge files by selectively copying data from one cluster to another, creating new cluster chains and adding dummy data to maintain file integrity and alignment, allowing for efficient reading and editing of files without requiring the entire file to be copied.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional file copying methods are used to edit files, then file editing can be performed, but extensive storage space is required and data editing is slow
Solution Approach 1:
The patent segments the file into multiple clusters and uses the File Allocation Table (FAT) to manage cluster chains. By dividing the file into readable units (clusters) and manipulating individual cluster chains, the system enables partial file editing without copying entire files, thus improving editing speed and reducing time loss.
Solution Approach 2:
The patent introduces the File Allocation Table (FAT) as an intermediary data structure to manage file clusters. The FAT enables efficient cluster chain manipulation, allowing the system to perform file editing operations by modifying FAT entries rather than physically copying large amounts of data, thereby improving productivity and reducing editing time.
2Productivity
If traditional file copying methods are used to edit files, then file editing can be performed, but the process is slow
Solution Approach 1:
The patent segments the file into multiple clusters and uses the File Allocation Table (FAT) to manage cluster chains. By dividing the file into readable units (clusters) and manipulating individual cluster chains, the system enables partial file editing without copying entire files, thus improving editing speed and reducing time loss.
Solution Approach 2:
The patent uses selective copying of only the necessary cluster chains required for editing operations, rather than copying entire files. This selective copying approach, managed through FAT manipulation, significantly reduces data transfer time and improves editing efficiency while minimizing time delays.
3Quantity of substance
If files are stored across multiple clusters, then storage capacity is optimized, but file reading and editing becomes more complex
Solution Approach 1:
The patent implements a universal File Allocation Table (FAT) structure that can manage files of any size distributed across multiple clusters. The FAT provides a standardized method for tracking cluster chains, making file management consistent whether files occupy one cluster or many, thereby optimizing storage capacity without proportionally increasing management complexity.
Solution Approach 2:
The patent introduces the File Allocation Table (FAT) as an intermediary data structure to manage file clusters. The FAT enables efficient cluster chain manipulation, allowing the system to perform file editing operations by modifying FAT entries rather than physically copying large amounts of data, thereby improving productivity and reducing editing time.
Data Source
AI summary
A method to divide a file or merge files using a file allocation table (FAT) in which the method to divide a file includes storing data of a first cluster, among data intended to be separated from the file, into a second cluster, and generating a first cluster chain and a second cluster chain using a file allocation table (FAT), the first cluster chain containing data remaining in the first cluster, and the second cluster containing data existing in the second cluster. As a result, time delay due to a file copy process and shortening of a lifespan of NAND flash are prevented, and a reserve capacity for editing purposes is minimized.