Storage manager for computer system

• US 5,857,207 A
• Filed: 04/21/1998
• Issued: 01/05/1999
• Est. Priority Date: 05/12/1993
• Status: Expired due to Term

• Current Assignee: Apple Inc.
• Original Assignee: Apple Computer Incorporated (Apple Inc.)
• Inventors: Austin, David J., Szymanski, Steven J., Celik, Tantek I., Harris, Jed, Lo, Shui Wing
• Primary Examiner(s): Von Buhr, Maria N.
• Application Number:
  US09/063,846
• Time in Patent Office: 259 Days
• Field of Search: 364/DIG. 1, 364/DIG. 2, 395/155-161, 395/600, 395/619, 707/100, 707/101, 707/202, 707/203, 707/511, 707/513, 707/514, 707/515
• US Class Current: 1/1
• CPC Class Codes: G06F 16/00 Information retrieval; Database structures therefor; File system structures therefor
• CPC Class Codes: Y10S 707/99944 Object-oriented database structure
• CPC Class Codes: Y10S 707/99954 Version management

Abstract

A data structure and associated data management methods for highly flexible storage of data for a wide variety of application programs. Data is stored as a plurality of Blops, each of which has a list of Properties associated with it. Each Property contains zero or more elements. Elements are Values, each of which has a Basic Type and consists of a variable length sequence of bytes. The Basic Type defines the format of the Value, as well as meta-information such as compression and encryption. Elements can also be Compound Types, which nestably refer to another list of Properties. Blops are stored in Containers, which map to the physical medium on which the data is stored. Containers associate respective Container Handlers which are specific to the Container'"'"'s physical medium. Related Blops in a Container are organized into Pools of Blops. Each Container contains one or more Pools, each Pool having a unique name within the Container. A Pool contains multiple versions of a Blop. Versions of different Blops are grouped together in Layers in a Pool and each Layer contains at most one version of a Blop. Layers are related to each other as an acyclic digraph, where each Layer is above one or more Base Layers and has zero or more Layers above it. Each Layer presents a "view" to a user of the Blops in a pool, and thereby provides a mechanism to manipulate which versions of which Blops are to be used at any given time.

Claims

1. A method of managing a data structure for the revision of a work, said data structure supporting a plurality of versions of said work and further supporting the association of a name with each of said versions, comprising the steps of:

preparing a first version of said work in said data structure;

associating a predefined name with said first version;

preparing a second version of said work in said data structure; and

in response to a call to a set-name procedure for said second version with said predefined name and an identification of said first version, performing the further steps of;

(a) determining whether said predefined name is still assigned to said first version;

(b) and if so, then moving said predefined name from said first version to said second version,

said set-name procedure preventing interruptions between said step of determining and said step of moving, by any procedure which modifies the association of names with said first or second versions.

2. A method according to claim 1, wherein said data structure supports a plurality of blops, each of said versions of said work including at least one of the blops in said data structure,

and wherein at least one of the blops included in said second version of said work is also included in said first version of said work, and wherein at least one of the blops included in said second version of said work is not included in said first version of said work.

3. A method of managing a data structure for the revision of a work, said data structure supporting a plurality of blops and a plurality of layers each having a view of at least one of said blops, comprising the steps of:

preparing a first version of said work in said data structure, said first version of said work being divided into the blops which are in the view of a first one of said layers, each of said blops which are in the view of said first one of said layers having a portion of said first version of said work;

preparing a second version of said work in said data structure, said second version being divided into the blops which are in the view of a second one of said layers, each of said blops in the view of said second layer having a portion of said second version of said work; and

calling an integrate-layers procedure with a reference to a call-back procedure, to form a third version of said work, said integrate-layers procedure performing the steps of;

(a) determining whether a given blop in the view of said first layer is the same as a corresponding blop in the view of said second layer, but a different version of said corresponding blop; and

if so, then

(b) (1) calling said call-back procedure with an identification of said given blop and an identification of said corresponding blop, said call-back procedure returning an identification of a blop to be added to the view of said third layer; and

(b)(2) adding said blop identified by said call-back procedure to the view of said third layer.

4. A method according to claim 3, wherein each blop in each of said versions has respective contents, and wherein said integrate-layers procedure performs the further step of including in said third version each blop from one of said first and second versions for which there is a matching blop, in both identity and contents, in the other of said first and second versions.

5. A method according to claim 3, wherein said integrate-layers procedure performs the further step of including unchanged in said third version each blop which is in exactly one of said first and second versions.

6. A method of managing a data structure for the revision of a work, said data structure supporting a plurality of blops and a plurality of layers each having a view of at least one of said blops, comprising the steps of:

preparing a first version of said work in said data structure, said first version of said work being divided into the blops which are in the view of a first one of said layers, each of said blops which are in the view of said first one of said layers having a portion of said first version of said work;

preparing a second version of said work in said data structure, said second version being divided into the blops which are in the view of said second layer, each of said blops in the view of said second layer having a portion of said second version of said work;

providing on a first data storage medium, all of said blops which are in the view of said first layer, and none of the blops which are in the view of said second layer and not in the view of said first layer, the blops which are in the view of said second layer and not in the view of said first layer being provided my means other than on said first data storage medium.

7. A method according to claim 6, further comprising the step of providing on a second medium all of the blops which are in the view of said second layer and not in the view of said first layer, and an identification of each of the blops in the view of said first layer which have been deleted from the view of second layer.

8. A method according to claim 7, wherein said first data storage medium is a read-only data storage medium.

9. A method according to claim 6, wherein said first data storage medium is a read-only data storage medium.

10. A method according to claim 6, wherein said step of preparing a second version of said work comprises the step of revising said work from said first version.

11. A method according to claim 10, wherein said step of revising said work from said first version comprises the steps of:

(a) including in the view of said second layer initially all of said blops which are in the view of said first layer; and

(b) at least one of the steps of;

(1) adding an additional blop to the view of said second layer,

(2) deleting a blop from the view of said second layer, and

(3) creating a copy of a particular one of the blops which are in the view of said first layer to create a second instantiation of said particular blop in the view of said second layer, said second instantiation of said particular blop substituting for said particular blop in the view of said second layer.

12. A method according to claim 6, further comprising the steps of:

providing on a second medium all of the blops which are in the view of said second layer and not in the view of said first layer;

operatively coupling said first medium to a computer such that all of the blops in the view of said first layer are readable; and

subsequently

operatively coupling said second medium to said computer; and

reading blops in the view of said second layer, all of the blops in the view of said second layer which are not in the view of said first layer being read from said second medium, all of the blops in the view of said second layer which have substituted for blops in the view of said first layer being read from said second medium, and all of the blops which are in the view of both said first and second layers being read from said first medium.

13. A method of managing a data structure for the revision of a work, said data structure supporting a plurality of blops and a plurality of layers each having a view of at least one of said blops, comprising the steps of:

preparing a first version of said work in said data structure, said first version of said work being divided into the blops which are in the view of a first one of said layers, each of said blops which are in the view of said first one of said layers having a portion of said first version of said work;

revising said work from said first version to create a second version of said work in said data structure, said second version being divided into the blops which are in the view of a second one of said layers, each of said blops in the view of said second layer having a portion of said second version of said work; and

subsequently performing the Move-All-Changes-Down steps of;

(a) deleting from the view of said first layer all blops in the view of said first layer which are not in the view of said second layer;

(b) adding to the view of said first layer all of the blops in the view of said second layer which are not already in the view of said first layer; and

(c) substituting in the view of said first layer, for any particular blop in the view of said first layer having a corresponding blop in the view of said second layer which is a revision of said particular blop, said corresponding blop.