SYSTEM AND METHOD FOR MANAGEMENT OF DATA BASED BOOKMARKS

• US 20150317403A1
• Filed: 05/04/2015
• Published: 11/05/2015
• Est. Priority Date: 05/04/2014
• Status: Abandoned Application

• Current Assignee: ReduxIO Systems Ltd. (Reduxio Systems, Inc.)
• Original Assignee: ReduxIO Systems Ltd. (Reduxio Systems, Inc.)
• Inventors: VOITIZ, Erez, HOFFNER, Robert
• Application Number:
  US14/703,193
• Publication Number:
  US 20150317403A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/162 Delete operations erasing in storage systems G06F3/0652
• CPC Class Codes: G06F 16/9562 Bookmark management
• CPC Class Codes: G06F 3/0608 Saving storage space on storage systems
• CPC Class Codes: G06F 3/0652 Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
• CPC Class Codes: G06F 3/0673 Single storage device

Abstract

A method and a data based bookmark management system for data based bookmark management in a storage unit are provided. The method includes performing an analysis of a plurality of bookmarks assigned in at least one logical unit number (LUN) of the storage unit to identify at least one bookmark having an expiration time that has been reached; deleting the identified at least one bookmark; determining that data referred by the deleted bookmark is not referred by at least another bookmark of the plurality of bookmarks having an expiration time that has not been reached; and removing from the storage unit the data respective of the deleted at least one bookmark, upon determination that the data is not referred to by the at least another bookmark.

Claims

1. A method for data based bookmark management in a storage unit, comprising:

performing an analysis of a plurality of bookmarks assigned in at least one logical unit number (LUN) of the storage unit to identify at least one bookmark having an expiration time that has been reached;

deleting the identified at least one bookmark;

determining that data referred by the deleted bookmark is not referred by at least another bookmark of the plurality of bookmarks having an expiration time that has not been reached;

removing from the storage unit the data respective of the deleted at least one bookmark, upon determination that the data is not referred to by the at least another bookmark.

2. The method in claim 1, wherein the analysis is performed respective of any one of:

a request received through an interface to remove outdated data and a volume of data of the at least one LUN exceeded a predefined threshold.

3. The method of claim 1, wherein each bookmark of the plurality of bookmarks includes a creation time and expiration time.

4. The method of claim 1, wherein the analysis of the plurality of bookmarks is performed over bookmarks in a continuous time frame.

5. The method of claim 1, further comprising:

generating a new bookmark of the plurality of bookmarks; and

retrieving data respective of at least one point in time associated with the generation of at least one bookmark.

6. The method of claim 5, wherein generating the new bookmark further comprises:

generating the new bookmark respective of at least one of;

user interaction with the stored data, usage patterns of the stored data, and a user defined rule.

7. The method of claim 1, wherein removing the data from the storage unit further comprises:

determining that an amount of free space of the at least one LUN is below a predetermined threshold; and

removing the data of from the storage unit, upon determination that an amount of free space of the at least one LUN is below a predetermined threshold.

8. A computer software product containing instructions embodied in a tangible memory that when executed on a computing device performs the method of claim 1.

9. A data based bookmark management system, the system comprises:

at least one storage unit communicatively connected to a processing unit, wherein the at least one storage unit including at least one logical unit number (LUN);

a memory communicatively connected to the processing unit, the memory maintains instructions that when executed configures the system to;

perform an analysis of a plurality of bookmarks assigned in the at least one logical unit number (LUN) of the at least one storage unit to identify at least one bookmark having an expiration time that has been reached;

delete the identified at least one bookmark;

determine that data referred by the deleted bookmark is not referred by at least another bookmark of the plurality of bookmarks having an expiration time that has not been reached; and

remove from the at least one storage unit the data respective of the deleted at least one bookmark, upon determination that the data is not referred to by the at least another bookmark.

10. The system of claim 9, wherein the system is further configured to analyze the plurality of bookmarks respective of any one of:

a request received through an interface to remove outdated data, and volume of data of the at least one LUN reached above a predefined threshold.

11. The system of claim 9, wherein each bookmark of the plurality of bookmarks includes a creation time and the expiration time.

12. The system of claim 9, wherein the analysis of the plurality of bookmarks is performed over bookmarks in a continuous time frame.

13. The system of claim 9, wherein the system is further configured to:

generate a new bookmark of the plurality of bookmarks; and

retrieve data respective of at least one point in time associated with the generation of at least one bookmark.

14. The system of claim 13, wherein the system is further configured to:

generate the new bookmark respective of at least one of;

user interaction with the stored data, usage patterns of the stored data, and a user defined rule.

15. The system of claim 9, wherein the system is further configured to:

determine when an amount of free space of the at least one LUN is below a predetermined threshold; and

remove the data from the storage unit, upon determination that an amount of free space of the at least one LUN is below a predetermined threshold.