Claim 40. The apparatus of claim 39, further comprising:
means for reinitiating said fragment storage structure after said interspersed fragments are
written to said composite file.
Claim 41. The apparatus of claim 39, wherein means for processing
original data file matters further comprises:
means for finalizing input matters when said input data being stored in one of a plurality of
original data storage structures exceeds or equals a threshold value.
Claim 42. The apparatus of claim 39, wherein means for processing
original data file matters further comprises:
means for replenishing an original data storage structure when input data being stored in said
original data storage structure is less than a threshold value.
Claim 43. The apparatus of claim 42, further comprising:
means for closing one of said plurality of original data files if no input data is being
stored in said corresponding original data storage structure.
Claim 44. The apparatus of claim 43, further comprising:
means for marking said closed original data file inactive if no input data exists therein.
Claim 45. The apparatus of claim 39, wherein said means for
processing random table matters comprises:
means for accessing a random table having a predetermined number of randomized bytes, wherein
first two bytes are binary integers identifying said random table.
Claim 46. The apparatus of claim 39, wherein said means for
obtaining one of said fragments further comprises:
means for reading and writing data from each of said plurality of original data files to a
corresponding original data storage structure, wherein said fragments are drawn from each of
said original data storage structures.
