METHOD AND APPARATUS FOR A PHYSICAL STORAGE ARCHITECTURE FOR A SHARED FILE ENVIRONMENT

Abstract: A distributed storage system provides a method and apparatus for storing, retrieving, and sharing data items across multiple physical storage devices that may not always be connected with one another. The distributed storage system of the present invention comprises one or more "partitions" on distinct storage devices, with each partition comprising a group of associated data files. Partitions can be of various types. Journal partitions may be written to by a user and contain the user's updates to shared files. In the preferred embodiment, journal partitions reside on a storage device associated with a client computer in a client-server architecture. Other types of partitions, library and archive partitions, may reside on storage devices associated with a server computer in a client-server architecture. The files on the journal partitions of the various clients may, at various times, be merged into a file resident within the library partition. If two more clients attempt to update or alter data related to the same file, the system resolves the conflict between the clients to determine which updates, if any, should be stored in the library partition. The merge operation may occur at various time intervals or be event driven. The archive partition stores files from the library partition.

Description: METHOD AND APPARATUS FOR A PHYSICAL STORAGE ARCHITECTURE FOR A SHARED FILE ENVIRONMENT BACKGROUND OF THE INVENTION 1. Field of the Invention: The present invention relates generally to a method and apparatus for storing, retrieving, and distributing various kinds of data. More specifically, the present invention relates to a physical storage architecture for a shared file environment such as a client-server network. 2. Art Background: Over the last 30 years, computers have become increasingly important in storing and managing information. This has lead, in turn, to the widespread sharing and communication of data such as electronic mail and documents over computer networks. To support the sharing of data, client-server architectures have become increasingly commonplace which allow users to access files on a server. In particular, it has become common to enable many users to access the same database that resides in a server or servers. Most current database architectures are designed for continuous access to a single set of data files. The single set of files can be shared directly or indirectly as in a client-server network. This approach encounters difficulties when users at many physical sites need to access the same data simultaneously at different client computers. There are three common approaches to the problem of simultaneous access. According to die first approach, all the users must access a single site, typically a computer mainframe. According to the second approach, each site has an exact copy of the data at die other sites, all of which copies are kept synchronized in real-time using algorithms such as two-phase commit. The third method dictates that each site has a copy of the data at the other sites, that the copies are not always the same, and a synchronization of the copies must occur at some regular interval. This is known as asynchronous replication. Current database architectures are designed for continuous access to all data files, and hence work well with the mainframe and two-phase commit approach. In situations when continuous access is not guaranteed, however, d e systems operating according to these approaches do not function properly. Client-server systems designed for desktop information management and local area networks uniformly use one of the first two approaches described above. These approaches tend to provide an imbalanced load on die server and typically require locking of the shared files on die remote server which further hampers performance. In addition, die files resident on die server typically require a connection to the client and thus updates may not occur without such a connection. The first two approaches also tend to be relatively slow for updates as updates must be synchronized in real-time. The present invention overcomes the limitations of the prior art by providing a flexible, efficient and fast physical storage system mat combines the advantages of asynchronous replication with the need for direct access to central data. It is designed to be used as a file system that allows users to share files on networks and across different storage media such as hard-drives, CD-ROMS and WORM drives. Current physical storage systems suffer from limitations in addition to the synchronization problems previously discussed. A physical storage system must store data items, such as a database record, in a non-volatile memory until such time as an application requires access to such data. This process typically involves 'flattening' the contents of data items and writing diem to the storage medium. The storage medium is generally divided into fixed size blocks, each of which has a location. According to prior art storage systems, there are two restrictions that can ease the design of such a system. The first restriction is that each data item be a fixed length. The second restriction is that only the most recent version of each data item need be stored. Prior art storage systems generally operate according to one or bodi of these restrictions. In a typical storage system, a block of memory is found that is large enough to hold a data item, which is men written to that block. When an item is deleted, die other items in the block are reorganized to free up the maximum amount of space, ready for another data item. A new block is created only when no existing block has enough space for a new data item. The prior art approach has numerous disadvantages. Prior art systems do not readily support variable length data and previous versions of a data item are not available, so mat no 'undo' function is available to the user. Further, the prior art methods may not be used in conjunction with append-only media such as write-once read-many (WORM) disks. As will be described, die present invention overcomes the limitations of prior art storage systems by providing a system mat easily supports variable length data items widiout erasing older versions of data items while occupying a relative minimum of disk space. SUMMARY OF THE INVENTION The distributed storage system of the present invention provides a memod and apparatus for storing, retrieving, and sharing data items across multiple physical storage devices that may not always be connected widi one another. The distributed storage system of the present invention comprises one or more 'partitions' on distinct storage devices, with each partition comprising a group of associated data files which in turn contain a collection of data items, each of which can be accessed individually. Partitions can be of various types. Journal partitions may be written to by a user and contain the user's updates to shared data items. In the preferred embodiment, journal partitions reside on a storage device associated with a client computer in a client-server architecture. Other types of partitions, library and archive partitions, may reside on storage devices associated with a server computer in a client-server architecture. The data items on the journal partitions of the various clients may, at various times, be merged into a data item resident within the library partition. If two or more clients attempt to update or alter data related to the same data item, the system resolves the conflict between the clients to determine which updates, if any, should be stored in the library partition. The merge operation may occur at various time intervals or be event driven. The archive partition stores older versions of data items from the library partition. In the preferred embodiment, the journal partition of die present invention comprises a series of objects that are written sequentially to physical memory. The journal partition stores older versions of objects such that a user may retrieve data that had been changed. The objects correspond to data items, such as a record in a database or a text file. A table is stored to track die location of objects within the journal partition. BRIEF DESCRIPTION OF THE DRAWINGS FIGURE 1 is a functional block diagram illustrating one possible computer system incorporating the teachings of the present invention. FIGURE 2 is a block diagram illustrating the partition structure of the present invention in a client-server architecture. FIGURE 3 illustrates the linkage between the partitions of Figure 2 and shows how files are transferred from one partition to another. FIGURE 4a illustrates the structure of an appendable list data item mat may exist within more than one partition. FIGURE 4h illustrates the structure of an appendable text data item that may exist within more than one partition. FIGURE 5 is a flow chart for reading and writing data items according to die teachings of the present invention. FIGURE 6 is an illustration of an operation for merging files located in a journal portion to a file located in a library partition. FIGURE 7 is a flow chart illustrating the sequence of steps of the present invention for writing data to a consolidation file. FIGURE 8 is a flow chart illustrating the sequence of steps of the present invention for consolidating the consolidation file. FIGURE 9 is a flow chart illustrating the sequence of steps of the present invention for merging the consolidation file into a library file. FIGURE 10 illustrates the structure of a journal partition file in the preferred embodiment. FIGURE 11 illustrates the structure of an object stored in the journal partition. FIGURE 12 is a flow chart for inserting, updating, and deleting data items from the journal file. FIGURE 13 illustrates the "sentinel" feature of the present invention for storing tables that map objects stored in the journal file to blocks of physical memory. NOTATION AND NOMENCLATURE The detailed descriptions which follow are presented largely in terms of algorithms and symbolic representations of operations on data bits widiin a computer memory. These descriptions and representations are die means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. These steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It proves convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Further, the manipulations performed are often referred to in terms, such as adding or comparing, which are commonly associated with mental operations performed by a human operator. No such capability of a human operator is necessary, or desirable in most cases, in any of the operations described herein which form part of the present invention: the operations are machine operations. Useful machines for performing the operations of the present invention include general purpose digital computers or other similar digital devices. In all cases there should be borne in mind the distinction between the mediod operations in operating a computer and the mediod of computation itself. The present invention relates to method steps for operating a computer in processing electrical or other (e.g., mechanical, chemical) physical signals to generate other desired physical signals. The present invention also relates to apparatus for performing these operations. This apparatus may be specially constructed for the required purposes or it may comprise a general purpose computer as selectively activated or reconfigured by a computer program stored in the computer. The algorithms presented herein are not inherently related to a particular computer or o er apparatus. In particular, various general purpose machines may be used widi programs written in accordance with the teachings herein, or it may prove more convenient to construct more specialized apparatus to perform the required mediod steps. The required structure for a variety of these machines will appear from the description given below. A data item as referred to herein corresponds to a discrete element of data diat a user may wish to access. For example, a data item may comprise a particular record of a database or a particular field widiin a record of a database. A data item may comprise a word processing file or any odier type of file. A data object as referred to herein stores a version of a data item. Different versions of the same data item may be stored in different data objects. For example, an original version of a text file and an updated version will be stored in two different data objects that each correspond to die same data item, the actual text file. A domain describes the type of a particular data item and is used consistently widi the terminology in the copending Application entitled "Mediod and Apparatus for Improved Information Storage and Retrieval System." Thus, for example, a particular data item may be of d e text, number or Boolean domains, or a user defined domain. DETAILED DESCRIPTION OF THE INVENTION The present invention discloses methods and apparatus for data storage, manipulation and retrieval. Although the present invention is described widi reference to specific block diagrams, and table entries, etc., it will be appreciated by one of ordinary skill in the art that such details are disclosed simply to provide a more thorough understanding of the present invention. It will therefore be apparent to one skilled in the art that the present invention may be practiced without these specific details. Moreover, certain terms such as "knows", "verifies", "stores", "finds", "replaces", "examines", "determines", etc. may be used in this Specification and are considered to be terms of art. The use of these terms, which to a casual reader may be considered personifications of computer or electronic systems, refers to the functions of the system as having human like attributes, for simplicity. For example, a reference herein to an electronic system or computer program "determining" something is simply a shorthand method of describing that the electronic system has been programmed or otherwise modified in accordance with the teachings herein. The reader is cautioned not to confuse the functions described with every day human attributes. These functions are machine functions in every sense. Local System Hardware Referring to Figure 1, one representative information storage and retrieval hardware configuration incorporating the teachings of the present invention is conceptually illustrated. As shown, the information storage and retrieval system includes a computer 23 which comprises four major components. The first of these is an input/output (I/O) circuit 22, which is used to communicate information in appropriately structured form to and from other portions of the computer 23. In addition, computer 20 includes a central processing unit (CPU) 24 coupled to the I/O circuit 22 and to a memory 26. These elements are those typically found in most computers and, in fact, computer 23 is intended to be representative of a broad category of data processing devices. Also shown in Figure 1 is a keyboard 30 for inputting data and commands into computer 23 through the I/O circuit 22, as is well known. Similarly, a CD ROM 34 is coupled to the I/O circuit 22 for providing additional programming capacity to the system illustrated in Figure 1. It will be appreciated that additional devices may be coupled to the computer 20 for storing data, such as magnetic tape drives, buffer memory devices, and die like. A device control 36 is coupled to bodi die memory 26 and die I/O circuit 22, to permit the computer 23 to communicate with multi-media system resources. The device control 36 controls operation of die multi-media resources to interface the multi-media resources to die computer 23. A display monitor 43 is coupled to the computer 20 through the I/O circuit 22. A cursor control device 45 includes switches 47 and 49 for signally die CPU 24 in accordance widi die teachings of die present invention. Cursor control device 45 (commonly referred to as a "mouse") permits a user to select various command modes, modify graphic data, and input other data utilizing switches 47 and 49. More particularly, die cursor control device 45 permits a user to selectively position a cursor 39 at any desired location on a display screen 37 of die display 43. Aldiough Figure 1 illustrates a mouse and keyboard as input devices, it will be appreciated diat a variety of odier input devices including trackballs, data gloves, touch screens and die like may be used as functionally equivalent input devices by die present invention. System Structure The present invention comprises two main components. The first component is a distributed file architecture that permits two or more users to access a common file. The second component is die physical storage system widiin the local computer 23 that supports variable length data items and maintains previous versions of the data items. The Specification will discuss these components in turn. Distributed Architecture Figure 2 illustrates an overview of the physical storage architecture of the present invention. As shown, the computer 23, commonly known as a client, communicates with a remote computer 56, commonly known as a server, that contains database files and other files that the computers 23 and odier computers may access. Difficulties arise where two users simultaneously attempt to update the same file mat resides on the server 56. To avoid the difficulties typically associated with simultaneous access, the present invention divides the physical storage system into partitions where each physical device contains at least one partition. Each partition comprises one or more associated data files. As illustrated in Figure 2, the client computer 23 includes a journal partition 58 stored on the disk 32 while the server 56 includes a library partition 60 and an archive partition 62 that reside on the same or different storage devices widiin the server 56. As will he readily appreciated. Figure 2 illustrates one type of architecture structured according to the teachings of the present invention. For example, the library partition 60 may reside on a CD-ROM or all three partitions may reside on the client computer 23. A particular list of linked partitions is called a 'partition chain', as illustrated by partitions 58, 60 and 62 in Figure 2. A partition chain may contain any number of partitions, including one. In the preferred embodiment, the partition 58 nearest the user is called the 'update partition' and must be a journal partition and is the only partition in the chain that can be updated directly. The other partitions, 60 and 62. are 'remote partitions' and are read¬ only partitions such mat they can be read from but not written to directly. Partitions may be classified according to various types, depending upon the function of the partition. A journal partition such as the partition 58 comprises at least one append-only journal file as will be described more fully below. A library partition, such as the partition 60, stores a 'packed' version of the journal partition, containing only a single version of each data item. An archive partition, such as the partition 62, stores multiple historical versions of the data. Odier types of partitions are possible. Generally, journal, library and archive partitions are linked together as illustrated in Figure 2. Updates to files, such as database and word processing files, are not written directly to the library partition 60. Instead, updates are stored in die journal partition 58 immediately and then provided to the server 56 and merged into the library partition 60 at some later time. Figure 3 illustrates the linkage between the journal partition 58, the library partition 60 and the archive partition 62. A journal file 70 residing widiin the journal partition 58 includes various data objects, for example database records, and the file may also contain unused memory. At a later time, the journal file 70 is consolidated and may also be packed and then stored in a library file 72 stored within the library partition 60. In turn, the server 52 may write the library file 72 to an archive tile 74, stored within ie archive partition 62. The archive file 74 contains multiple versions of the same data object. Appendable data items In many applications, the library may contain a large data item such as an item which stores a list of 10,000 pointers to objects or a large text document. In these cases, updating the value of the data item would cause an unnecessary duplication of the data. The physical storage system of the present inventions supports 'appendable' data items, which distribute the storage of their contents across multiple partitions. An appendable data item keeps track of the changes to the original data and stores only the changes to the original data in die journal. The internal structure of an appendable data item comprises two parts, a 'remote' section, where the original data is stored, and a 'local' section, where the changes are kept. Figures 4a and 4b show two implementations of appendable items for a list and text data, respectively. Figure 4a illustrates a list data item, which comprises an original list stored a remote partition and additions and removals from the list stored in a local partition. The original list is a read only list and any updates must be written to the update list. Changes might be stored as identification numbers to add to the original list, and identification numbers to remove from the original list. Similarly, Figure 4b illustrates a text data item stored as an appendable list 82, which comprises original text stored in a remote partition and additions and deletions from the text stored in a local partition. The original text is stored such that it is read only text and any updates must be written to the local partition. The changes might be stored as a series of editing actions such as insertions, deletions, and formatting actions. The use of appendable data items is advantageous. They allow the storage requirements for updates to be minimized since the original information need not be stored in the local partition. Further, they reduce synchronization problems since the local partition stores only the changes to the original data and not the original data itself. Finally, the use of appendable data items allows read-only media such as CD-ROMs and one-way electronic publishing services to be annotated. Merging As previously described, the system provides the consolidated contents of the journal partition 58 to the library partition 60 according to clock intervals or the occurrence of events. The user of the system may define those conditions that trigger such a merge operation such as when the journal partition 58 contains a specified amount of data or when a certain amount of transactions have occurred since the most recent merge operation. When the updates are merged into the library partition 60, older versions from the library partition 60 are relocated to the archive partition 62. Figure 6 illustrates a merge operation, where a plurality of data items 120, 122 and 124 in different locations within the journal partition 58 are copied and die copies provided to the library partition 60 where they are consolidated and merged widi the other data in the library partition 60. To decrease transmission time from the journal partition 58 to the library partition 60, the data items may be compressed according to a data compression algorithm. Figure 7 is a flow chart for a merge operation. At blocks 140 and 142, data is written to a file in the journal partition 58. At block 144, the system determines whether the device on which the library partition 60 resides may be written to. If the device is a read-only device such as a CD-ROM, dien the merge process cannot occur, and the routine halts at block 146. Otherwise, the system branches to block 148 where data is provided to the library partition 60 from the journal partition 58. At block 150, the system determines whedier other journal files need to be merged. If so, the system branches back to block 148. Otherwise, the system consolidates multiple data items from the journal partition 60 into a single consolidation file and the file is merged into die library file, as illustrated in block 152. Subsequently, the routine exits, as illustrated in block 154. When two or more users attempt to modify the same file, a conflict will emerge during a merge operation. The system must decide whedier bodi updates may be permitted, and, if not, which of the two updates, if either, should be stored. The consolidation procedure as previously described must resolve diese conflicts. Figure 8 is a flow chart for the consolidation procedure. At block 160, die routine initializes and a new 'consolidated' file is created which will eventually contain all the data from the journal files. For each journal file in turn, and each data item in each journal file, the routine attempts to add die data item to the consolidation file. At block 162, the routine determines whether another version of die data item from another source, usually a device associated with a different user, already exists within a consolidation file. If not. the new data is added to the consolidation file at block 184 and the routine exits at block 186. If anodier version of the data item from another source already exists within the consolidation file, block 162 branches to block 164 and the conflict between the versions is resolved by applying the rules specified by the user or specified by the type of data object. In certain instances, the conflict may be resolved by a merge operation. For example, two changes to a text document mat do not overlap can be merged. If the routine solved the conflict in block 164, block 166 branches to block 174 where the new data is merged with the data from another source using the method defined by the user or object type (domain). The system then retrieves the next item at block 182. If the routine did not solve the conflict in block 164, block 166 branches to block 168 where the system determines whether the new item or die item from another source will be stored. If the new item wins the conflict and will dius be stored, block 168 branches to block 176 where the item from anodier source is removed from the consolidation file and a message provided to die user that created the item from another source to inform that user mat the data item will not be stored. Subsequently, the routine branches to block 182. The winner of the conflict may be determined by a number of rules, including but not limited to, which item had the most recent timestamp or the higher value. Alternatively, the routine may give priority to the user with a higher status journal file or the user who entered the information. If the new item does not win the conflict in block 168, block 168 branches to 170 where the system determines whether the item from anodier source wins the conflict. If so, block 170 branches to block 178 and the new data item is removed from the consolidation file and a message provided to die user that created the new data item and the routine branches to block 182. Finally, if neither the new item nor the item from anodier source wins the conflict, both data items are removed from the consolidation file and a message provided to the users of both items. Subsequently, the routine branches to block 182. Figure 9 is a flow chart for merging a consolidation file with a library file. At block 190, the routine determines whether an older version of die data item already exists in the library file, and, if not. the routine branches to block 194. Otherwise, block 192 determines whether the older version is to be preserved. If so, the older version is transferred to the archive file as illustrated in block 196. If the older version is not to be preserved, it is deleted, and block 192 branches to block 194. At block 194, the system determines whether the new item comprises an appendable record that must be stored with its parent. If so, the new data item is merged with the existing older version using the merge method defined by the domain and the routine exits at block 202. According to the present invention, data may be merged from multiple sources, none of which need to be connected to the device upon which the library partition resides. If the new item is not an appendable record, block 194 branches to block 198 and the new data item is added to the library file, overwriting any older version. At block 198, as an option, the old version may be archived. Subsequently, the routine exits at block 202. Reading and Writing Data Items Since a appendable data item contains data residing within different partitions, reading and writing appendable data items requires that the system access the relevant partitions. When a user modifies an appendable data item through inputs from the keyboard 30 into the memory 26, the original contents are stored separately in die memory 26 from the changes and an 'append flag' is set for the item. When data items are written to permanent storage, such as die partition 58 within the memory 32, the system determines whether the 'append flag' is set, and, if so, only the changed part of the appendable item is written. The original data already resident on a different partition is not written since it can be reconstructed from the original read-only partition. However, to ensure the integrity of the system, a unique identification number representing the original data is also stored so that the system can detect if the original data is missing or changed. When reading a data item, the system determines whedier the item's 'append' flag is set. If so, the system attempts to read the original data from a partition containing the original data, and merge the original data with the changes. Figure 5 is a flow chart for reading data according to the teachings of the present invention. At block 90, the system first searches any local journal partitions and then searches remote partitions in order, such as die library partition and then the archive partition, to find a data item with the identification number of the data item being read. If the system cannot locate any data items, block 92 branches to block 94 and a "NULL" or default value is returned. Conversely, if the system finds a data item, block 92 branches to block 96, and the system determines whether the data item is a "tombstone," mat is, whether the particular data item has been deleted. If so, the system branches to block 94. Otherwise, at block 98 the system determines whether the append flag of the item is set and. if not, the system returns the data item as shown in block 100. If the append flag is set, indicating a appendable item, at block 102, the system searches other partitions to find other data items with the same identification number. If no parent data item is found, the system branches from block 104 to block 106 where the system indicates an error since an append flag implies that a parent data item exists. If the system finds a parent data item, the system determines whedier die parent data item's append flag is set at block 108, which indicates whedier die parent has its own parent. If so, the routine branches back to block 102 where the next partition, in order, is searched. When the routine locates all related data items, they are merged into one item and returned, as illustrated in block 110. Journal File This section describes the preferred embodiment of the journal partition 58. The journal partition 58 can store variable length data items, such as a free text database record, on a storage medium such that prior versions of these same items can be retained. Figure 10 illustrates the structure of the journal partition 58. The journal partition may reside on die mass memory 32 of Figure 1. As illustrated in Figure 10, the memory that includes the journal partition 58 is divided into physical storage device blocks 250, 252 and 254. Data objects, including data objects 256, 258 and 262, are stored within the blocks 250, 252 and 254. As illustrated in Figure 10, data objects to be stored in the journal partition 58 are appended serially to the memory and the blocks 250, 252 and 254 are not overwritten. Thus, the journal partition 58 may include older versions of the same data object. For example, a data object 256 may comprise a database cell including information about a company's employees and data object 258 may represent that cell after a user has updated it. The system creates a new block when needed and the system stores a table 260 that relates objects to their respective blocks. The table 260 is updated each time an object is written to a block. Figure 11 shows the contents of the object 262. In the preferred embodiment, the object 262 comprises five fields, a status field 264, an identifier field 266, a data field 268, a pointer field 268 and a timestamp field 272. Apart from the status field 264, the object 262 need not contain all of the odier fields and the status field 264 contains flags that indicate those fields that an object contains. The data field 268 stores data such as text and numbers corresponding to the object 262 and the pointer field 268 contains a pointer to a prior version of the object 262. The timestamp field 272 indicates when the object 262 was created and the identifier field 266 contains a number identifying the object 262 that is used in the table 260. Because prior versions of the data item cannot be removed, deleting a data item must be handled specially. To delete a data item, a special marker called a 'tombstone' is written to the journal partition to signify that the data item was deleted. The tombstone comprises an object with a data field diat has no value and a special status flag is set to show that the item is a tombstone. The tombstone object stores a pointer to an object that contains the last version of the data item to be deleted. To read a data item, the most recent version of the data item is retrieved by looking up the appropriate block in the table 260. Once the most recent version of a data item has been retrieved by retrieving the item's associated most recent object, prior versions can be retrieved by using the pointer stored widiin die retrieved object. Eventually, a user may wish to discard older versions of the data items. This is done by copying the desired data items, generally the most recent, to another file, and discarding the original file. Figure 12 is a flow chart for inserting items to the journal partition 58, updating items within the journal partition 58 and deleting data items from die journal partition 58. According to the routine illustrated in Figure 12, inserting, updating and deleting are performed by a similar method and status flags indicate the difference between the actions. All three operations include writing a new object to the journal partition 58. In the case of updating an existing data item, the new object includes die updated data and points to the previous version, as previously described. In die case of deleting a data item, a tombstone object is written to the journal partition 58 indicating the deleted data item, as previously described. At block 280, an insert operation begins and branches to block 282, where the prior address flag is set to FALSE since the insertion of an item implies that there is no prior address to point to. Conversely, when updating an existing data item as indicated in block 300. the system stores the address of the object containing the item to he updated and sets its prior address flag to TRUE as shown in block 302. To delete a data item, as illustrated in block 314, die routine sets the "tombstone" flag to TRUE and the "data value" flag to FALSE, indicating that there is no data in the object being written, and that the object being written implies the deletion of a data item, as shown in block 316. The system then writes the new object to the journal partition 58. Before writing, the routine may process the new object according to various options. For example, at block 284, the routine determines whether it will store an object identifier in the object identifier field. Storing the identifier is not necessary for retrieval, but can be used to recover data in case of file corruption. If the identifier is not to be stored, block 284 branches to block 304 and the identifier flag is set OFF. Block 304 branches to block 286 where the status flags are written to the journal partition 58. At block 288, the routine determines whether the identifier flag is TRUE. If so, the system branches to block 306 and the identifier is written to the journal partition 58. The system then branches to block 290, to determine whedier the value flag is TRUE. If so, the system writes the data value to die journal partition 58. Similarly, at block 292, the routine determines whedier die prior address flag is TRUE. If so, the system branches to block 310 and die prior address is written to the pointer field in the new data object created in die journal partition 58. The system then branches to block 294, to determine whether the timestamp flag is TRUE. If so, the system writes the timestamp to the timestamp field of the new object created in the journal partition 58. Finally, the table 260 is updated to reflect the new location of the data item on disk corresponding to the new object written to the journal partition 58. This approach allows for various options. For example, for all items, it is optional to store the identifier. If the identifier, timestamp, and prior pointer are not stored, the required storage size of the data item is minimal. Data Recovery In the preferred embodiment, the structure of the table 260 is a standard extendible hash table data structure. As previously described, the table 262 is updated every time a new object is written to the journal partition 58. Since the table 260 may become quite large, to avoid saving it, by writing it to a non¬ volatile memory, every time it is updated, a checkpoint approach is used whereby the table 260 is saved at certain user-defined intervals. For example, a user may specify that the table should be saved after every 50 updates. After the table 262 is saved, a "sentinel" is written to the journal partition 58. Figure 13 illustrates "sentinel" data object. "Sentinel" objects 350 and 352 each contain a timestamp and pointers to tables 354 and table 356 respectively. The tables 354 and 356 comprise versions of the table 260 and are stored in non-volatile memory when the "sentinel" objects are written to die journal partition 58. If a crash occurs, the system need only reconstructed die table 260 since die actual data is already stored on the journal partition 58. Reconstructing the table 260 can start from the last valid sentinel, rather than from the beginning of the file, which greatly increases the speed of recovery. According to the preferred embodiment of the routine for reconstructing die table 260, the most recent "sentinel" object is located by reading backward from the end of the journal. This will be the last point at which the table 260 was still valid. The sentinel will contain a pointer to the disk file that stores the table 262 and die table 262 may then be loaded from this file. If the table 262 is missing or damaged, the routine then attempts to find a "sentinel" object check point that is earlier in the journal file. This process continues until a valid "sentinel" object is found or die beginning of the journal file is reached. Next, die journal partition 58 is read, starting at die next object written to the journal partition 58 after the "sentinel," if any, is located diat points to a valid table. For each subsequent object in die journal partition 58, the table 260 is updated. Finally, a new "sentinel" is created and die new table 260 is saved. Optimization The object orientation of this storage system enhances the efficiency of various operations. For example, the copending Application entitled "Mediod and Apparatus for Improved Information Storage and Retrieval System," discloses a database diat comprises a table with rows and columns. The rows correspond to records and die columns correspond to fields. The intersection of the rows and die columns comprise cells, which correspond to the data items of ie present invention. Thus, a cell is stored as a data object according to die teachings of the present invention. Certain database operations, such as searching down a single column across all records, are enhanced by storing die database of the copending application according to die teachings of the present invention. Furthermore, the physical arrangement of cells on the storage medium is flexible and can be adjusted for various requirements. For example, if a particular column or set of columns is searched regularly, the cells comprising these columns may be kept adjacent to each odier in a partition. Alternatively, the cells may be separated from die main storage file and stored in a distinct file, called a 'stripe'. The information contained in some data items is redundant and can be reconstructed from 'original' information corresponding to parent data items, as previously described. Widi reference to die copending Application entitled "Method and Apparatus for Improved Information Storage and Retrieval System," for example, the contents of a folder, which is a record that points to a group of records, can be reconstructed by gathering all of the 'parent folder' attributes of the data items. Similarly, indexes and other navigation structures can often be reconstructed. For diese kinds of reconstructible data items, a special storage technique can be used. The contents of the data item are stored in a special location, distinct from die journal partition. This location may be reused every time the reconstructible data item is written which saves memory space and time. The journal then contains a pointer to this external location, instead of the actual data itself. If, for some reason, the external location is missing or damaged, die data item can be reconstructed using an appropriate method. Summary While the invention has been described in conjunction widi die preferred embodiment illustrated in Figures 1-13, it is evident that numerous alternatives, modifications, variations and uses will be apparent to diose skilled in die art in light of the foregoing description. For example, die present invention may be employed for network topologies other than client-server architectures such as ring topologies. Many other adaptations of die present invention are possible.

Claims: What is claimed is: 1. A physical storage system for a computer network wherein at least two users may simultaneously access a common file, said system comprising: at least two local computers, each said local computer further including a memory, said memory including at least one local partition that stores updates to said file and transmission means for transmitting said updates; at least one remote computer coupled to each of said at least two local computers, said remote computer further including: receiving means for receiving said updates from each of said at least two local computers; a memory, said memory including at least one remote partition that stores said updates from said at least two local computers; and merging means for merging said updates from said at least two local computers into said remote partition. 2. The physical storage system of Claim 1 wherein said local partitions include journal partitions and said remote partition includes a library partition for storing a current version of said file. 3. The physical storage system of Claim 2 wherein said memory of said at least one remote computer further includes an archive partition coupled to receive data from said library partition, said archive partition storing older versions of said file. 4. The physical storage system of Claim 1 wherein said transmission means further includes means for transmitting said updates at clock intervals. 5. The physical storage system of Claim 1 wherein said transmission means further includes means for transmitting said updates upon the occurrence of specified events. 6. The physical storage system of Claim 5 wherein said specified events include said local partition reaching a certain size. 7. The physical storage system of Claim 5 wherein said specified events include a certain number of transactions having transpired since a previous transmission. 8. The physical storage system of Claim 1 wherein said updates are stored in said local partitions in the form of data objects, said data objects corresponding to a data item and indicating die version of said data item. 9. The physical storage system of Claim 1 wherein said merging means further includes conflict resolving means for resolving conflicts between a first update from one of said at least two local computers and a second update from a different one of said at least two local computers. 10. The physical storage system of Claim 9 wherein said conflict resolving means further includes combining means for combining said first update widi said second update, said combining means operable when said first and second updates are not inconsistent widi one anodier. 11. The physical storage system of Claim 10 wherein said conflict resolving means further includes selecting means for selecting said first update over said second update for writing to said remote partition according to specified criteria. 12. The physical storage system of Claim 10 wherein said selecting means selects said first update based upon a timestamp. 13. The physical storage system of Claim 10 wherein said selecting means selects said first update based upon a status level associated widi said first update. 14. The physical storage system of Claim 3 wherein said merging means further includes archiving means for transferring an older version of a data item from said library partition to said archive partition when a newer version of said data item is merged into said library partition from said journal partition. 15. The physical storage system of Claim 1 wherein said local computers include personal computers and said remote computer includes a server. 16. The physical storage system of Claim 1 wherein said file includes a database. 17. The physical storage system of Claim 2 wherein said journal file includes variable length data objects. 18. The physical storage system of Claim 17 further including writing means for writing data objects to said journal file without overwriting odier data objects. 19. The physical storage system of Claim 18 wherein said data objects include object identification numbers and said system further includes a table for storing a mapping that relates said data objects to physical storage locations. 20. A method for providing simultaneous access to a common file on a computer network, said network including at least two local computers and at least one remote computer coupled to each of said at least two local computers, said method including the steps of: providing an element for partitioning memories on said local computers into local partitions at store updates to said file; providing an element for transmitting said updates; providing an element for receiving said updates on said remote computer from each of said at least two local computers; providing an element for partitioning a memory on said remote computer into a remote partition that stores said updates from said at least two local computers; and providing an element for merging said updates from said at least two local computers into said remote partition. 21. The method of Claim 20 wherein said local partitions include journal partitions and said remote partition includes a library partition for storing a current version of said file. 22. The method of Claim 21 further including the steps of: providing an element for partitioning said remote memory into an archive partition; and providing an element for transferring data from said library partition to said archive partition. 23. The method of Claim 20 wherein said step of providing an element for transmitting said updates further includes die step of providing an element for transmitting said updates at clock intervals. 24. The method of Claim 20 wherein said step of providing an element for transmitting said updates further includes die step of providing an element for transmitting said updates upon die occurrence of specified events. 25. The method of Claim 24 wherein said specified events include said local partition reaching a certain size. 26. The method of Claim 24 wherein said specified events include a certain number of transactions having transpired since a previous transmission. 27. The method of Claim 20 further including die step of providing an element for storing said updates in said local partitions in die form of data objects, said data objects corresponding to a data item and indicating the version of said data item. 28. The method of Claim 20 wherein said step of providing an element for merging further includes die step of providing an element for resolving conflicts between a first update from one of said at least two local computers and a second update from a different one of said at least two local computers. 29. The method of Claim 28 wherein said step of providing an element for resolving conflicts further includes die step of providing an element for combining said first update wi i said second update when said first and second updates are consistent widi one another. 30. The method of Claim 29 wherein said step of providing an element for resolving conflicts further includes die step of providing an element for selecting said first update over said second update for writing to said remote partition according to specified criteria. 31. The method of Claim 29 wherein said step of providing an element for selecting said first update further includes die step of providing an element for selecting said first update based upon a timestamp. 32. The method of Claim 29 wherein said step of providing an element for selecting said first update further includes die step of providing an element for selecting said first update based upon a status level associated with said first update. 33. The method of Claim 21 wherein said journal file includes variable length data objects. 34. The method of Claim 33 further including the step of providing an element for writing data objects to said journal file widiout overwriting other data objects. 35. The method of Claim 34 wherein said data objects include object identification numbers and said mediod further includes die step of providing an element for storing a table that relates said data objects to physical storage locations. 36. The method of Claim 29 wherein said step of providing an element for merging further includes the step of providing an element for transferring an older version of a data item from said library partition to said archive partition when a newer version of said data item is merged into said library partition from said journal partition. 37. The method of Claim 20 wherein said local computers include personal computers and said remote computer includes a server. 38. The method of Claim 20 wherein said file includes a database. 39. A physical storage system for a computer network, comprising: a first memory including a first partition, said first partition configured to store updates to a data item, said updates being stored in an update data object; a second memory including a second partition, said second partition configured to store a previous version of said data item, said previous version of said data item being stored in a previous version data object; combining means for combining said updates to said data item in said update data object widi said previous version of said data item in said previous version data object to form an updated version of said data item; and storing means for storing said updated data. 40. The system of claim 39 wherein said first partition comprises a journal partition and said second partition comprises a library partition. 41. The system of claim 39 wherein said first memory and said second memory reside on die same physical device. 42. The system of claim 39 wherein said first memory resides in a local computer and said second memory resides on a remote computer. 43. The system of claim 39 wherein said data item comprises a text data item and said updates comprise a series of editing actions. 44. The system of claim 39 wherein said data item comprises a list data item and said updates comprise additions or removals to said list. 45. The system of claim 39 wherein said second partition is configured to store said updated data. 46. The system of claim 39 wherein said second partition resides on a read¬ only device. 47. The system of claim 46 wherein said read-only device comprises a CD- ROM. 48. The system of claim 39 wherein said update data object includes a flag indicating that said data item comprises an appendable data item. 49. The system of claim 48 further comprising reading means for reading said update data object and said previous version data object. 50. A mediod for storing data items comprising the steps of: providing an element for configuring a first partition in a first memory to store updates to a data item; providing an element for storing said updates in an update data object; providing an element for configuring a second partition in a second memory to store a previous version of said data item; providing an element for storing said previous version of said data item in a previous version data object; providing an element for combining said updates to said data item in said update data object widi said previous version of said data item in said previous version data object to form an updated version of said data item; and providing an element for storing said updated data. 51. The method of claim 50 wherein said first partition comprises a journal partition and said second partition comprises a library partition. 52. The method of claim 50 wherein said first memory and said second memory reside on die same physical device. 53. The method of claim 50 wherein said first memory resides in a local computer and said second memory resides on a remote computer. 54. The method of claim 50 wherein said data item comprises a text data item and said updates comprise a series of editing actions. 55. The method of claim 50 wherein said data item comprises a list data item and said updates comprise additions or removals to said list. 56. The method of claim 50 further including die step of providing an element for configuring said second partition to store said updated data. 57. The method of claim 50 wherein said second partition resides on a read¬ only device. 58. The method of claim 57 wherein said read-only device comprises a CD- ROM. 59. The method of claim 58 wherein said update data object includes a flag indicating diat said data item comprises an appendable data item. 60. The method of claim 59 further comprising the step of providing an element for reading said update data object and said previous version data object.

Inventors: WLASCHIN SCOTT, WLASCHIN, SCOTT
Applicants: DEX INFORMATION SYSTEMS
Application year: 1996
Main classification: G06F17
IPC codes: G06F17