DETAILED DESCRIPTION

[0035] Turning first to FIG. 1, a preferred computer system 100 for implementing the methods of the present invention is illustrated. This computer system 100 comprises a finite data storage medium 110 . The finite data storage medium 110 is typically a hard drive or hard disk, a floppy disk, a magnetic tape, a CD, DVD, and any other optical/laser read/write disk, or any other device or medium to which computer data is capable of being written and from which data is capable of being read or retrieved. As shown, a percentage or portion 112 of the data storage medium 110 is dedicated to storage of backup or snapshot data sets with the remaining portion 114 of the storage medium 110 available for storage of primary or current data. The system 100 further comprises a central processor 120 , which contains the operating system of the computer system 100 and which interacts with other peripheral devices (not shown) of a conventional computer system, such as user or data interfaces (e.g. terminals, monitors, keyboards, mouse(s), scanners), output devices (e.g., printers), and I/O devices (e.g. modems). The central processor 120 interacts with the finite data storage medium 110 by means of a data manager 130 . The data manager 130 comprises software and/or hardware for managing the transfer of data between the processor 120 and the finite data storage medium 110 and for controlling the recordation and deletion of data to the finite data storage medium 110 .

[0036] Turning briefly to FIG. 2 , an alternative computer system 200 for implementing the methods of the present invention is illustrated. This computer system 200 , which also comprises a conventional processor 220 and conventional peripheral devices (not shown), is essentially identical to the computer system 100 of FIG. 1 ; however, it comprises two separate finite data storage media 210 , 240 . The first finite data storage medium 210 is dedicated to the storage of the primary or current data. While the other, separate finite data storage medium 240 is dedicated to the storage of the backup or snapshot data sets. The central processor 220 interacts with both finite data storage media 210 , 240 by means of a data manager 230 . The data manager 230 comprises software and/or hardware for managing the transfer of data between the processor 120 and both storage media 210 , 240 and for controlling the recordation and deletion of data to both storage media 210 , 240 .

[0037] Regardless of whether data sets are being recorded to or deleted from the dedicated portion 112 of the particular finite data storage medium 110 , as shown in FIG. 1 , or to the dedicated finite storage medium 240 as a whole, as shown in FIG. 2 , for performance reasons and, in some cases, to prevent system failure, it is necessary to ensure that 100% capacity (“maximum capacity”) of the data storage space available for or allotted to the data sets is not reached. Preferably, for conventional finite data storage media, no more than 90% of the capacity (“effective capacity”) of the available data storage space should be used. To continue recording data sets to a finite data storage medium that has reached or exceeded its effective capacity, there must be a system and methodology in place to determine what data sets are recorded, what data sets are kept, and what data sets are deleted or overwritten.

[0038] Turning now to FIG. 3, a method 300 for managing the recordation of data sets to a finite data storage medium is illustrated. First, the system captures (Step 310 ) or obtains (if captured by an external component and merely provided to the system) a new data set for potential recordation into the finite data storage medium. The time of creation of the new data set is then assigned (Step 320 ) or obtained (again, if provided by an external component that already assigned a time of creation at the time of capture) by the system. A preservation weight is then associated (Step 330 ) with the new data set.

[0039] The value of the preservation weight is preferably within a predetermined range of possible preservation weights. Preferably, the lower the preservation weight, the less important it is that the new data set be preserved by the system for a long time. Likewise, the higher the preservation weight, the greater the importance of preservation of the new data set. In one embodiment, the highest preservation weight indicates that the new data set should be kept in the finite data storage medium permanently (i.e., it should never be deleted, if possible). Obviously, a system that merely reverses the scale such that the lowest preservation weight indicates the greater importance of the data set and vice versa is within the scope of the present invention.

[0040] The specific value of the preservation weight may be assigned by default, by a system administrator, or by a user with access to the underlying computer system and with rights to assign the preservation weight to the particular data set. In another embodiment, the specific value of the preservation weight is assigned based on the grouping to which the new data set belongs. Groupings, as discussed in greater detail hereinafter, may be established based on the time of creation of the data set. Data sets may also be grouped by the type of data contained therein or by the type of user for the data set.

[0041] Next, the capacity of the finite data storage medium is checked (Step 340 ). If the effective capacity (preferably set to approximately 90% of the maximum capacity for conventional data storage devices, such as hard drives) of the finite data storage medium has not been reached or exceeded (as determined at Step 350 ), then the new data set is recorded (Step 360 ) in or to the finite data storage medium.

[0042] If the effective capacity of the finite data storage medium has been reached or exceeded (as determined at Step 350 ), then the system proceeds (Step 400 ) to “create space” on the finite data storage medium, as described with reference to FIG. 4 .

[0043] Turning now to FIG. 4 , the steps of the “create space” function 400 are illustrated. First, all data sets on the finite data storage medium are sorted (Step 410 ) by their associated preservation weight. Next, all data sets on the finite data storage medium are sorted (Step 420 ) by their date of creation within each particular grouping of preservation weight. For example, all data sets having a preservation weight of 1 (i.e., within the same “grouping” of preservation weights) are sorted by date, all data sets with a preservation weight of 2 are sorted by date, and so on up to all data sets with the highest allowable preservation weight. Then, the data set with the lowest preservation weight and with the earliest data of creation (i.e., the “oldest” data set within that grouping) is deleted (Step 430 ) from the finite data storage medium. It should be understood that the step of “deleting” can mean actual “removal” of the data set from the data storage medium or, more likely, merely designating the space occupied by the data set as “available” for recordation of new data. Typically, data on data storage medium is not actually deleted or lost until new data is written over that physical space. Once that data set has been deleted (or its storage space has been made available), the system determines (Step 44 ) whether the capacity of the finite data storage medium is now below a “threshold” capacity. Preferably, the “threshold” capacity is established at or below the “effective” capacity of the finite data storage medium. Thus, if the deletion of the previous data set freed up sufficient capacity on the finite data storage medium, the create space function end and the method returns Step 360 and records the new data set. On the other hand, if the deletion of the previous data set did not free up sufficient capacity on the finite data storage medium to fall below the “threshold” capacity that has been established, the system returns to Step 430 to delete the oldest remaining data set in the lowest preservation weight grouping.

[0044] FIG. 5 illustrates an alternative flowchart to that of FIG. 4 . In particular, for those embodiments in which data sets can be designated as “permanent” or not allowed to be deleted, it is possible for there to be a situation in which the capacity of the finite data storage medium is still at or above its “effective” capacity and the only data sets still remaining on the finite data storage medium—potentially available for deletion—are those that have designated as permanent and not allowed to be deleted. As discussed previously, in one embodiment, the highest available or allowed preservation weight may be used to designate those particular data sets that are to be considered permanent. In this situation, the “create space” function 400 proceeds with its sorting steps (Step 410 and 420 ), as described previously, then the system determines (Step 424 ) whether all of the data sets remaining on the finite data storage medium are designated as “permanent.” If not, then the system proceeds with the step of deleting (Step 430 ) the oldest data set of the lowest preservation weight grouping, as discussed in FIG. 4 . However, in situations where the determination in Step 424 is positive, the system preferably returns (Step 428 ) an error message or other error indication. Such an error message or indication could be a notification to the administrator of the error, a notification that no new data sets are being recorded, or causing the system to crash or go to a blue screen. As indicated by the A in the circle jumper, if any of these errors occurs, the process returns to FIG. 3 and simply ends without recording the new data set to the finite data storage medium.

[0045] In yet another alternative embodiment, not shown, if the determination in Step 424 is positive, the system either (i) re-designates all data sets with the highest allowed preservation weight from being “permanent” (i.e., non-deleteable) to being “non-permanent” (i.e., having the highest priority but eligible for deletion) or (ii) re-designates the oldest data set as “non-permanent.” Then, the method would continue to Step 430 and delete the oldest non-permanent data set.

[0046] In a second aspect of the present invention, it is desirable to manage data sets that have been organized into or associated with “predetermined groups.” Although the capacity of the finite data storage medium may be, but is not necessarily, the primary issue of concern, it is generally desirable to limit the number of data sets associated with a particular group and stored in a finite data storage medium to a manageable level.

[0047] As briefly described earlier, a data set “group” may be established based on the time of creation of the data set. For example, data sets that are periodic backups of files or hard drives may be grouped (or associated with a predetermined group) based on the “time” in which each periodic backup occurs, such as end of the day, end of the week, end of the month, etc. Data sets may also be grouped by the type of data contained therein or by the user(s) to which the data set is relevant. For example, data sets may belong to a company-wide group (e.g., a full network server backup), to a department level group (e.g., Administrative Department file directory backup), or to an individual level group (e.g., single file backup or snapshot). Data sets may also be grouped by combinations of any of the above (e.g., month end snapshot of Accounting Department files). Likewise, it should be understood that in some cases, a particular data set may be grouped or associated with a plurality of different groups.

[0048] For data management reasons, it may be desirable to maintain only a specific number of backups, snapshots, or other data sets associated with a particular data set group. For example, it may be desirable to maintain data sets of only the last five days of all work saved to a server, the last twelve months of month-end reports for the Accounting Department, the last ten “end of the week” account receivable reports, and so on.

[0049] Turning now to FIG. 6, a method 600 of managing groups of data sets recorded to a finite data storage medium is illustrated. First, the system captures (Step 610 ) or obtains (if captured by an external component and merely provided to the system) a new data set for recordation into the finite data storage medium. The time of creation of the new data set is then assigned (Step 620 ) or obtained (again, if provided by an external component that already assigned a time of creation at the time of capture) by the system.

[0050] The new data set is then associated (Step 630 ) with a predetermined group of data sets. Determining which predetermined group to associate the new data set with may be done automatically by the system (e.g., a periodic timed backup of a regular file or set of files), it may be determined by who requested the recordation of the new data set (e.g., whether the request came from the system administrator or from a particular user), it may be specifically designated by a system administrator or user, who requested the recordation, or it may be assigned by default. Once the new data set has been associated with an appropriate predetermined group, the system determines (Step 640 ) the maximum number of data sets associated with the predetermined group that may be maintained in the finite data storage medium. Such maximum number is set by the system administrator, by a user with rights to the underlying data set or to the predetermined group of data sets, or by default. Such maximum number is set at the time the predetermined group is created or when the process of recording the new data set is initiated or requested.

[0051] The new data set is then recorded (Step 650 ) to the finite data storage medium. Although identified as occurring at this point in the process, it should be understood that this step of recording may alternatively occur after Step 660 or after Steps 670 and 680 , which are described hereinafter, as long as the new data set is taken into account.

[0052] The system counts (Step 660 ) the number of data sets associated with the predetermined group currently stored in the finite data storage medium and then determines (Step 670 ) whether the number counted exceeds the maximum number of allowed data sets for this particular group. If not, then the process ends.

[0053] If the determination in Step 670 is positive, then the oldest data set associated with the particular group is deleted. Again, deletion means that the data set is actually removed or that the memory space allocated to the “deleted: data set is made available for rewriting of new data. In this manner, groups of data sets are maintained at or below their maximum allowed number in the finite data storage medium.

[0054] In view of the foregoing detailed description of preferred embodiments of the present invention, it readily will be understood by those persons skilled in the art that the present invention is susceptible of broad utility and application. While various aspects have been described in the context of HTML and web page uses, the aspects may be useful in other contexts as well. Many embodiments and adaptations of the present invention other than those herein described, as well as many variations, modifications, and equivalent arrangements, will be apparent from or reasonably suggested by the present invention and the foregoing description thereof, without departing from the substance or scope of the present invention. Furthermore, any sequence(s) and/or temporal order of steps of various processes described and claimed herein are those considered to be the best mode contemplated for carrying out the present invention. It should also be understood that, although steps of various processes may be shown and described as being in a preferred sequence or temporal order, the steps of any such processes are not limited to being carried out in any particular sequence or order, absent a specific indication of such to achieve a particular intended result. In most cases, the steps of such processes may be carried out in various different sequences and orders, while still falling within the scope of the present inventions. In addition, some steps may be carried out simultaneously. Accordingly, while the present invention has been described herein in detail in relation to preferred embodiments, it is to be understood that this disclosure is only illustrative and exemplary of the present invention and is made merely for purposes of providing a full and enabling disclosure of the invention. The foregoing disclosure is not intended nor is to be construed to limit the present invention or otherwise to exclude any such other embodiments, adaptations, variations, modifications and equivalent arrangements, the present invention being limited only by the claims appended hereto and the equivalents thereof.