Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A data clearing method, comprising: acquiring a white list from a cloud when a system storing data to be cleared is started, and compressing the white list and locally storing compressed white list; updating the white list from the cloud in real time; determining whether a difference between a latest access time of the data to be cleared which is stored in a currently scanned node in a data structure, and a current time is greater than a predetermined threshold, wherein the data structure comprises a plurality of nodes and each node stores a latest access time and file information of respective data to be cleared; if the difference is greater than the predetermined threshold, determining whether the data to be cleared which is stored in the currently scanned node in the data structure, is in the white list; continuing to scan a next node in the data structure, if the data to be cleared corresponding to the currently scanned node in the data structure is in the white list; and clearing the data to be cleared corresponding to the currently scanned node, if the data to be cleared corresponding to the currently scanned node in the data structure is not in the white list.
This invention relates to a data clearing method designed to efficiently manage and remove outdated or unused data from a system while preserving critical data. The method addresses the challenge of selectively clearing data without disrupting essential operations, ensuring compliance with data retention policies, and optimizing storage resources. The system acquires a white list of protected data from a cloud-based source when initialized, compresses it for local storage, and updates it in real time to reflect changes. The method scans a data structure containing nodes, each storing the latest access time and file information of data to be cleared. For each node, the system checks if the time elapsed since the last access exceeds a predetermined threshold. If it does, the system verifies whether the data is in the white list. If the data is listed, the system proceeds to the next node; if not, the data is cleared. This approach ensures that only non-protected, outdated data is removed, maintaining system efficiency while safeguarding important files. The method dynamically adapts to updates in the white list, ensuring continuous compliance with data retention rules.
2. The method of claim 1 , wherein the white list comprises information of all system files and all system folders.
Technical Summary: This invention relates to cybersecurity, specifically to methods for enhancing system security by managing access to system files and folders. The problem addressed is the vulnerability of systems to unauthorized access or malicious attacks, which can compromise system integrity and data security. The method involves maintaining a whitelist that includes detailed information about all system files and all system folders. This whitelist serves as a reference to determine which files and folders are legitimate and should be permitted access. By comparing access requests against this whitelist, the system can identify and block unauthorized or suspicious activities. The whitelist ensures that only trusted system components can interact with critical system resources, reducing the risk of malware infections, unauthorized modifications, or other security breaches. The whitelist may be dynamically updated to reflect changes in the system, such as the addition or removal of files or folders, ensuring that the security measures remain current and effective. This approach provides a robust defense mechanism by enforcing strict access controls based on predefined, trusted system components. The method is particularly useful in environments where system integrity is paramount, such as in enterprise networks, critical infrastructure, or sensitive data environments. By maintaining an accurate and up-to-date whitelist, the system can effectively mitigate risks associated with unauthorized access and malicious activities.
3. The method of claim 1 , wherein the data structure is a pre-created linked list, and the data to be cleared is a file or a folder.
A method for efficiently clearing data from a computing system involves using a pre-created linked list to manage the data deletion process. The linked list is structured to store references to files or folders that need to be cleared, allowing for organized and systematic removal. The method ensures that the linked list is pre-configured before the deletion operation begins, which optimizes the process by reducing the overhead of dynamically creating or modifying the list during execution. By targeting files or folders, the method provides a flexible approach to data clearance, accommodating both individual files and entire directory structures. The linked list may include metadata or additional attributes associated with the files or folders, such as access permissions, timestamps, or storage locations, to facilitate efficient deletion. This approach enhances performance and reliability in data management tasks, particularly in systems where large volumes of data need to be cleared systematically. The method may also include validation steps to confirm successful deletion and handle errors, ensuring data integrity throughout the process.
4. The method of claim 3 , further comprising: creating the linked list, wherein each node of the linked list stores information of a respective file other than system files or a respective folder other than system folders, according to a chronological sequence of latest access times of the respective files or folders.
A method for managing file and folder access information in a computing system involves creating a linked list where each node stores data about a file or folder, excluding system files or system folders. The nodes are organized in a chronological sequence based on the latest access times of the respective files or folders. This approach allows for efficient tracking and retrieval of user-accessed files and folders, improving system performance by prioritizing frequently accessed items. The linked list structure enables quick updates and traversal, ensuring that the most recently accessed files and folders are readily available. This method enhances user experience by reducing search times and optimizing resource allocation in the system. The exclusion of system files and folders ensures that only relevant user data is managed, preventing unnecessary overhead and maintaining system stability. The chronological organization ensures that the most up-to-date access information is always accessible, supporting efficient file management and retrieval operations.
5. The method of claim 4 , further comprising: if a file or a folder is updated, moving a node corresponding to the file or the folder to a corresponding position in the linked list according to the current access time of the file or the folder; if the file or the folder is deleted, deleting the node corresponding to the file or the folder from the linked list.
This invention relates to file system management, specifically optimizing access time tracking for files and folders. The problem addressed is inefficient file access time management, which can lead to degraded system performance and inaccurate usage analytics. The solution involves a linked list structure that dynamically updates based on file or folder modifications. The system maintains a linked list where each node represents a file or folder, ordered by their most recent access time. When a file or folder is updated, its corresponding node is moved to a new position in the linked list to reflect the current access time. If a file or folder is deleted, its node is removed from the linked list entirely. This ensures the list remains accurate and up-to-date, allowing for efficient access time tracking and retrieval. The linked list structure enables quick updates and deletions, maintaining performance even with frequent file modifications. This approach improves system efficiency by reducing the overhead of managing access times and provides a reliable way to track and analyze file usage patterns. The dynamic updating mechanism ensures that the most recently accessed files and folders are prioritized, enhancing overall system responsiveness.
6. The method of claim 2 , further comprising: if a file or a folder is updated, moving a node corresponding to the file or the folder to a corresponding position in the linked list according to the current access time of the file or the folder; if the file or the folder is deleted, deleting the node corresponding to the file or the folder from the linked list.
A system and method for managing file and folder access tracking in a computing environment. The invention addresses the problem of efficiently tracking and organizing file and folder access times to optimize system performance and resource management. The system maintains a linked list structure where each node represents a file or folder, ordered by their most recent access time. When a file or folder is updated, the corresponding node in the linked list is moved to a position that reflects its current access time, ensuring the list remains sorted by recency. If a file or folder is deleted, the corresponding node is removed from the linked list. This dynamic updating mechanism allows the system to quickly access the most recently used files and folders, improving efficiency in file management operations. The linked list structure enables fast insertion, deletion, and reordering operations, which are critical for maintaining an up-to-date access history. The invention enhances system performance by reducing the overhead associated with tracking and retrieving file access information, particularly in environments with frequent file updates and deletions.
7. The method of claim 1 , wherein clearing the data to be cleared corresponding to the currently scanned node, if the data to be cleared corresponding to the currently scanned node in the data structure is not in the white list, comprises: if the data to be cleared corresponding to the currently scanned node is a file, taking the file as a to-be-cleared object; if the data to be cleared corresponding to the currently scanned node is an empty folder, taking the folder as the to-be-cleared object.
This invention relates to data management systems, specifically methods for selectively clearing data from a data structure based on a whitelist. The problem addressed is the need to efficiently and accurately identify and clear data that is not protected or authorized, while preserving data that should be retained. The method involves scanning a data structure to identify nodes containing data to be cleared. For each scanned node, the system checks whether the corresponding data is listed in a predefined whitelist. If the data is not in the whitelist, the system determines whether the data is a file or an empty folder. If the data is a file, the file itself is designated as the to-be-cleared object. If the data is an empty folder, the folder is designated as the to-be-cleared object. This selective clearing process ensures that only unauthorized or unprotected data is removed, while whitelisted data remains intact. The method improves data management by automating the identification and clearing of non-whitelisted data, reducing manual intervention and potential errors.
8. The method of claim 7 , wherein clearing the data to be cleared corresponding to the currently scanned node, if the data to be cleared corresponding to the currently scanned node in the data structure is not in the white list, further comprises: after scanning all the nodes in the data structure, providing all to-be-cleared objects to a user; and receiving an instruction from the user, and clearing the to-be-cleared objects according to the instruction from the user.
This invention relates to data management systems, specifically methods for selectively clearing data in a data structure. The problem addressed is the need for a controlled and user-approved process to remove data from a data structure, ensuring that only unintended or unnecessary data is deleted while preserving important information. The method involves scanning nodes within a data structure to identify data marked for clearing. Before deletion, the system checks whether the data corresponds to entries in a predefined white list. If the data is not in the white list, the system collects all such to-be-cleared objects and presents them to a user for review. The user then provides an instruction, either approving or modifying the deletion, and the system clears the objects accordingly. This ensures that no data is removed without explicit user confirmation, reducing the risk of accidental deletion. The approach enhances data integrity by introducing a verification step before final deletion, making it suitable for systems where data retention policies require user oversight. The method is particularly useful in environments where automated data clearing might inadvertently remove critical information.
9. The method of claim 1 , wherein the file information comprises a name or a directory of a file or a folder.
A system and method for managing file information in a computing environment addresses the challenge of efficiently organizing and retrieving file metadata. The invention provides a structured approach to storing and accessing file attributes, including names, directories, and folder locations, to enhance file management and retrieval processes. The method involves capturing file information, such as the name or directory path of a file or folder, and integrating this data into a centralized system for improved organization and accessibility. By associating file identifiers with their respective names or directory structures, the system enables users to quickly locate and manage files based on their metadata. This solution is particularly useful in environments where large volumes of files are stored, ensuring that users can efficiently navigate and retrieve files without extensive manual searching. The invention may also include additional features, such as indexing or categorizing files based on their directory paths, to further streamline file management tasks. Overall, the system enhances productivity by reducing the time and effort required to locate and manage files within a computing system.
10. A data clearing apparatus, comprising: a processor; and a memory configured to store instructions executable by the processor, wherein the processor is configured to: acquire a white list from a cloud when a system storing data to be cleared is started, and compressing the white list and locally storing compressed white list; updating the white list from the cloud in real time; determine whether a difference between a latest access time of the data to be cleared which is stored in a currently scanned node in a data structure, and a current time is greater than a predetermined threshold, wherein the data structure comprises a plurality of nodes and each node stores a latest access time and file information of respective data to be cleared; if the difference is greater than the predetermined threshold, determine whether the data to be cleared, which is stored in the currently scanned node in the data structure, is in the white list; if the data to be cleared corresponding to the currently scanned node in the data structure is in the white list, continue to scan a next node in the data structure; and if the data to be cleared corresponding to the currently scanned node in the data structure is not in the white list, clear the data to be cleared corresponding to the currently scanned node.
This invention relates to a data clearing apparatus designed to manage and remove outdated or unused data from a system while preserving critical files. The apparatus addresses the challenge of efficiently identifying and deleting data that has not been accessed within a specified timeframe, while ensuring that important files listed in a white list are protected from deletion. The apparatus includes a processor and memory storing executable instructions. Upon system startup, the apparatus acquires a white list of protected files from a cloud-based source, compresses it, and stores the compressed version locally. The white list is periodically updated in real time from the cloud to ensure it remains current. The system scans a data structure containing nodes, each of which stores metadata about data to be cleared, including the latest access time and file information. During scanning, the apparatus checks whether the difference between the latest access time of the data in the current node and the current time exceeds a predetermined threshold. If the data is outdated, the apparatus checks if it is listed in the white list. If the data is not in the white list, it is cleared. If the data is in the white list, the apparatus moves to the next node. This process ensures that only non-critical, outdated data is removed, while protected files remain intact. The system efficiently manages storage by automating the deletion of unused data while maintaining compliance with predefined retention policies.
11. The data clearing apparatus according to claim 10 , wherein the white list comprises information of all system files and all system folders.
A data clearing apparatus is designed to securely erase data from a storage device while preserving essential system files and folders. The apparatus includes a white list that contains detailed information about all system files and system folders, ensuring these critical components remain intact during the data clearing process. This selective erasure prevents the loss of operating system files, applications, or other necessary data that are required for the proper functioning of the device. The white list acts as a reference to identify and protect these system elements, allowing the apparatus to target only non-system data for deletion. By maintaining the integrity of system files and folders, the apparatus ensures the device remains operational after the clearing process, avoiding system corruption or failure. This approach is particularly useful in scenarios where data must be securely erased while retaining the ability to use the device for its intended purpose. The apparatus may also include additional features such as user interface elements for managing the clearing process, encryption mechanisms for added security, and methods for verifying the completeness of the data erasure. The overall system provides a reliable solution for securely clearing data while preserving the functionality of the storage device.
12. The data clearing apparatus according to claim 10 , wherein the data structure is a pre-created linked list, and the data to be cleared is a file or a folder.
A data clearing apparatus is designed to efficiently manage and remove data from storage systems. The apparatus addresses the problem of securely and systematically clearing data, such as files or folders, from storage devices to prevent unauthorized access or data recovery. The apparatus utilizes a pre-created linked list data structure to organize and track the data to be cleared. This linked list allows for efficient traversal and deletion of the data entries, ensuring that the data is properly removed from the storage system. The apparatus may also include a data processing unit that processes the data to be cleared, such as encrypting or overwriting the data before deletion, to further enhance security. Additionally, the apparatus may include a user interface for selecting and managing the data to be cleared, providing flexibility in how the data is handled. The linked list structure ensures that the data clearing process is both efficient and reliable, reducing the risk of incomplete or failed deletions. This apparatus is particularly useful in environments where data security and integrity are critical, such as in enterprise systems or regulated industries.
13. The data clearing apparatus according to claim 12 , wherein the processor is further configured to: create the linked list, wherein each node of the linked list stores information of a respective file other than system files or a respective folder other than system folders, according to a chronological sequence of latest access times of the respective files or folders.
A data clearing apparatus is designed to manage and remove data from a storage device, particularly focusing on user-generated files and folders while excluding system files and folders. The apparatus includes a processor that organizes data into a linked list structure, where each node in the list represents a file or folder. The linked list is arranged chronologically based on the latest access times of the files or folders, allowing the system to prioritize data that has not been recently accessed. This chronological organization helps in identifying and clearing outdated or unused data efficiently. The apparatus ensures that system files and folders, which are critical for system operations, are not included in the clearing process. By maintaining a linked list sorted by access times, the system can systematically target files and folders that are least likely to be needed, optimizing storage space while preserving essential system components. The apparatus may also include a display for user interaction, allowing users to confirm or modify the data clearing process before execution. This approach enhances data management by automating the identification and removal of inactive data, reducing manual intervention and improving storage efficiency.
14. The data clearing apparatus according to claim 10 , wherein the processor is further configured to: if a file or a folder is updated, move a node corresponding to the file or the folder to a corresponding position in the linked list according to the current access time of the file or the folder; if the file or the folder is deleted, delete the node corresponding to the file or the folder from the linked list.
A data clearing apparatus is designed to manage and optimize storage by tracking file and folder access times using a linked list structure. The apparatus includes a processor that monitors file and folder updates, deletions, and access times. When a file or folder is updated, the processor moves the corresponding node in the linked list to a position that reflects the current access time, ensuring the most recently accessed items are prioritized. If a file or folder is deleted, the processor removes the associated node from the linked list. This system helps maintain an organized and efficient storage structure by dynamically adjusting the linked list based on real-time access patterns. The apparatus ensures that frequently accessed files remain easily accessible while older, less frequently used files are managed accordingly. The linked list structure allows for quick updates and deletions, improving overall system performance and storage management. This approach is particularly useful in environments where storage optimization and fast access to recent files are critical.
15. The data clearing apparatus according to claim 10 , wherein clearing the data to be cleared corresponding to the currently scanned node, if the data to be cleared corresponding to the currently scanned node in the data structure is not in the white list, comprises: if the data to be cleared corresponding to the currently scanned node is a file, taking the file as a to-be-cleared object; if the data to be cleared corresponding to the currently scanned node is an empty folder, taking the folder as the to-be-cleared object.
A data clearing apparatus is designed to selectively remove data from a data structure based on predefined criteria. The apparatus scans nodes within the data structure to identify data marked for clearing. When a node is scanned, the apparatus checks whether the corresponding data is listed in a white list. If the data is not in the white list, the apparatus proceeds to clear it. For files, the apparatus treats the file itself as the to-be-cleared object. For empty folders, the apparatus treats the folder as the to-be-cleared object. This selective clearing process ensures that only unauthorized or unwanted data is removed, while protected data remains intact. The apparatus operates within a broader system that includes a data structure, a white list, and a scanning mechanism to traverse the nodes. The white list contains entries that exempt certain data from clearing, allowing for controlled and selective data removal. The apparatus efficiently processes both files and folders, ensuring comprehensive data management while maintaining system integrity.
16. The data clearing apparatus according to claim 15 , wherein clearing the data to be cleared corresponding to the currently scanned node, if the data to be cleared corresponding to the currently scanned node in the data structure is not in the white list, further comprises: after scanning all the nodes in the data structure, providing all to-be-cleared objects to a user; and receiving an instruction from the user, and clearing the to-be-cleared objects according to the instruction from the user.
This invention relates to a data clearing apparatus designed to manage and remove data from a data structure, particularly focusing on selective data deletion based on user input. The apparatus scans nodes within a data structure to identify data marked for clearing. If the data associated with a scanned node is not listed in a predefined white list, the apparatus collects all such data into a set of to-be-cleared objects. After scanning all nodes, the apparatus presents these objects to a user for review. The user can then provide instructions to selectively clear the data, ensuring only authorized or intended deletions occur. This approach prevents accidental or unauthorized data removal by requiring explicit user confirmation before finalizing the clearing process. The system enhances data management by combining automated scanning with user oversight, balancing efficiency with control. The apparatus is particularly useful in environments where data integrity and user consent are critical, such as in secure systems or compliance-driven applications.
17. The data clearing apparatus according to claim 10 , wherein the file information comprises a name or a directory of a file or a folder.
A data clearing apparatus is designed to securely erase data from storage devices by overwriting or deleting files and folders. The apparatus includes a file information extraction unit that identifies files or folders to be cleared, where the file information includes the name or directory path of the file or folder. A data clearing unit then processes this information to perform the deletion or overwriting operation. The apparatus may also include a user interface for selecting files or folders, a storage device interface for accessing the target storage medium, and a control unit to manage the clearing process. The system ensures that sensitive data is permanently removed, preventing recovery by unauthorized parties. The apparatus may operate on various storage devices, including hard drives, SSDs, or removable media, and can be integrated into software or hardware solutions for data sanitization. The invention addresses the need for secure data disposal in environments where residual data could pose privacy or security risks.
18. A non-transitory computer-readable storage medium having stored therein instructions that, when executed by a processor of a mobile terminal, cause the mobile terminal to perform: acquiring a white list from a cloud when a system storing data to be cleared is started, and compressing the white list and locally storing compressed white list; updating the white list from the cloud in real time; determining whether a difference between a latest access time of the data to be cleared which is stored in a currently scanned node in a data structure, and a current time is greater than a predetermined threshold, wherein the data structure includes a plurality of nodes and each node stores a latest access time and file information of respective data to be cleared; if the difference is greater than the predetermined threshold, determining whether the data to be cleared, which is stored in the currently scanned node in the data structure, is in the white list; continuing to scan a next node in the data structure, if the data to be cleared corresponding to the currently scanned node in the data structure is in the white list; and clearing the data to be cleared corresponding to the currently scanned node, if the data to be cleared corresponding to the currently scanned node in the data structure is not in the white list.
This invention relates to data management in mobile terminals, specifically a system for selectively clearing data based on access time and a whitelist. The problem addressed is the need to efficiently manage storage by automatically removing unused data while preserving important files. The solution involves a mobile terminal that acquires a whitelist of protected files from a cloud server when the system starts, compresses it for local storage, and updates it in real time. The system scans a data structure containing nodes, each storing file information and the latest access time of data to be cleared. For each node, it checks if the time since the last access exceeds a predetermined threshold. If so, it verifies whether the file is in the whitelist. Files not in the whitelist are cleared, while those in the whitelist are skipped. This ensures only unused, non-protected data is removed, optimizing storage without losing critical files. The system dynamically adapts to changes in the whitelist, maintaining up-to-date protection status.
Unknown
October 20, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.