EP0578204B1 - Procédé pour stocker des objets - Google Patents

Procédé pour stocker des objets Download PDF

Info

Publication number
EP0578204B1
EP0578204B1 EP93110796A EP93110796A EP0578204B1 EP 0578204 B1 EP0578204 B1 EP 0578204B1 EP 93110796 A EP93110796 A EP 93110796A EP 93110796 A EP93110796 A EP 93110796A EP 0578204 B1 EP0578204 B1 EP 0578204B1
Authority
EP
European Patent Office
Prior art keywords
instance
istorage
istream
storage
stream
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP93110796A
Other languages
German (de)
English (en)
Other versions
EP0578204A2 (fr
EP0578204A3 (fr
Inventor
Robert G. Atkinson
Andrew L. Bliss
Philip J. Lafornara
Philip Ljubicich
Alexander G. Tilles
Antony S. Williams
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Microsoft Corp
Original Assignee
Microsoft Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Microsoft Corp filed Critical Microsoft Corp
Priority to EP00105871A priority Critical patent/EP1006456A3/fr
Priority to EP98118766A priority patent/EP0892355B1/fr
Priority to EP00105872A priority patent/EP1006457A3/fr
Publication of EP0578204A2 publication Critical patent/EP0578204A2/fr
Publication of EP0578204A3 publication Critical patent/EP0578204A3/xx
Application granted granted Critical
Publication of EP0578204B1 publication Critical patent/EP0578204B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/22—Microcontrol or microprogram arrangements
    • G06F9/24—Loading of the microprogram
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0673—Single storage device
    • G06F3/0674—Disk device
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9017—Indexing; Data structures therefor; Storage structures using directory or table look-up
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/93—Document management systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604—Improving or facilitating administration, e.g. storage management
    • G06F3/0605—Improving or facilitating administration, e.g. storage management by facilitating the interaction with a user or administrator
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G06F3/0643—Management of files
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/953—Organization of data
    • Y10S707/956—Hierarchical
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99931—Database or file accessing

Definitions

  • This invention relates to a method and system for data storage and, more particularly, to a method and system for storing and accessing data in a compound document.
  • Computer operating systems typically include a sub-system called a file system.
  • a file system stores data in files.
  • a file system provides an application programming interface (API) to facilitate accessing data stored on disk or other long-term storage medium.
  • API application programming interface
  • a file system API provides various functions that are invoked by an application program to access the data.
  • Application programs control the internal format of a file and determine which data to store in which files.
  • a file system typically allows files to be grouped into directories. Each directory may contain many files and many sub-directories. The sub-directories may also contain files and other sub-directories.
  • a file system that groups files into directories and sub-directories is referred to as hierarchical file system.
  • word processing programs may combine data that is in text, graph, and spreadsheet format into a single document.
  • a text format is known as the native format for word processing programs.
  • a user of a word processing program may specify that graph or spreadsheet data that is stored in a file is to be included in the document.
  • word processing programs may import data from files generated by a graph program or a spreadsheet program.
  • Word processing programs typically need to know not only the internal format of the graphic and spreadsheet files, but also how to display or print the graph and spreadsheet data.
  • the marketability of a word processing program is enhanced by its ability to import data stored in many formats. However, it can be very time-consuming and expensive to adapt a word processing program to access data in a specific non-text format.
  • the developer would need a complete description of the specific format and then develop code to print, display, and possibly store the data.
  • the effort needed to adapt a word processing program to a specific format is increased when the format is defined by another vendor.
  • the vendor may not publish a complete specification of the format or may change the format without notice. Consequently, an application program developer may choose to support only a few of the more popular file formats other than the native file format.
  • word processing programs invoke the application program that generated the data in the specific non-text format to display or print the non-text data that is part of a word processing document. For example, if a document incorporates a graph, then the word processing program would invoke the graph program that generated the data to print or display the graph or to perform some other task using the data. However, unless the graph program was developed specifically to be invoked by a particular word processing program, it may not be practicable to invoke the graph program. Graph programs typically expect data to be stored in a certain format and in a file with only graph data.
  • a first approach modifies each of the programs that generate the non-text data so that they know the internal format of the word processing document, can retrieve the non-text data from the document, and can process the retrieved data. This approach can be expensive because the programs would need to know the internal format for each word processing program.
  • a second approach stores each component of the word processing document in a separate file. Using this approach, data would be stored in the native format of each application program. Thus, the application program could be invoked to process the native data directly. However, this second approach jeopardizes the integrity of the word processing document. Users typically can delete a file using the operating system commands. A user could delete one of the files that is part of a word processing document. The word processing document would then have a link to a deleted file.
  • a word processing document can contain a spreadsheet table which in turn contains a sound annotation. If a user wishes to edit the sound annotation, the word processing program invokes the spreadsheet program and tells it to invoke the sound editor. The sound editor must be able to locate its non-text data.
  • One approach is to modify each program to support a flag telling the program to save all changes to a designated temporary file.
  • the word processing program is then responsible for overwriting the file containing the non-text data with the temporary file when it chooses to save the complete set of modifications to the word processing document.
  • Another approach is for the word processing program to save a snapshot of the non-text data file before it invokes the program to modify this data.
  • the word processing program can then overwrite any changes made by the program invoked to process the non-text data if the user decides not to save the changes to the word processing document.
  • a known high performance file system is described in the document : Microsoft Systems Journal, vol. 4, no. 5, New York, US, pages 1-13, "Design Goals and Implementation of the New High Performance File System".
  • a fundamental file system object called an Fnode is the anchor-point for every file or directory on a volume.
  • the Fnode becomes the root also for a Bt tree of allocation sectors, which in turn contain the actual pointers to the file's sector runs.
  • Figure 1 is an object hierarchy for a sample compound document.
  • Figure 2 is a block diagram showing the relationship between the multistream interface and the file system and application programs.
  • Figure 3 is a flow diagram showing the creation of a compound document according to the present invention.
  • Figure 4 is a block diagram showing an overview of a preferred implementation of the present invention.
  • Figure 5 is a block diagram showing the IStorage and IStream layers.
  • Figure 6 shows a typical object hierarchy.
  • Figure 7 is a block diagram illustrating the transaction levels in a preferred embodiment.
  • Figure 8 is a sample object hierarchy diagram.
  • Figure 9 is a block diagram illustrating the transaction levels in a preferred embodiment.
  • Figure 10 is a block diagram showing the various layers of an IStorage instance.
  • Figure 11 is a block diagram of C++ classes which support an IStream instance.
  • Figure 12 is a diagram of the layout of the sectors in one document file.
  • Figure 13 is a diagram showing the allocation structures of the MSFF.
  • Figure 14 is a block diagram showing the layout of a sample directory stream.
  • Figure 15 is the sample object hierarchy illustrated by Figure 14.
  • Figure 16 is a flow diagram showing a procedure to update a data stream in a robust manner.
  • Figure 17 is a diagram illustrating the shadowing methods of the present invention.
  • Figure 18 is a block diagram showing the layout of the MiniStream and MiniFAT.
  • objects are stored within a compound document in an object hierarchy.
  • Objects are encapsulated, linked or embedded data that is created typically by an application other than the one used to create the compound document.
  • the object hierarchy allows objects to contain subobjects to an arbitrary nesting level.
  • the object hierarchy is analogous to the typical file system hierarchy.
  • the present invention provides two abstract classes for manipulating objects within an object hierarchy. The first abstract class is referred to as the IStorage interface.
  • the IStorage interface provides methods for grouping objects in conceptually the same way as a file system directory groups files and subdirectories.
  • An IStorage instance is an interface to a storage.
  • the second abstract class is referred to as the IStream interface.
  • the IStream interface provides methods for reading and writing data in conceptually the same way as a file system file reads and writes data.
  • a storage can contain storage instances and streams.
  • An IStream instance is an interface to a stream.
  • the present invention maps an object hierarchy into a single file system file.
  • multiple objects can be stored within a single file.
  • the present invention provides a multiple stream (multistream) interface to the file.
  • a stream is an input/output handle to a file, which can be thought of as mapping to a unique seek pointer.
  • Each object within a single file conceptually has an entire storage to itself, which may contain multiple streams and storages.
  • the multiple stream interface takes care of mapping these streams of each object into the single file system stream.
  • the present invention allows each object to have multiple streams.
  • An object is conceptually stored in a storage instance and its data is stored in one or more stream or storage instances within the storage.
  • Figure 1 is an object hierarchy for a sample compound document.
  • the IStorage instances are indicated by the oblong blocks, and the IStream instances are indicated by the square blocks.
  • the sample compound document is a word processing document, which has an embedded graph.
  • the compound document contains a root IStorage instance 101, which contains an IStream instance 102 and an IStorage instance 103.
  • the IStream instance 102 contains data in the native format of the word processing program.
  • the IStorage instance 103 corresponds to the embedded graph and contains IStream instances 104 and 105.
  • IStream instance 104 contains XY data for the graph, and the IStream instance 105 contains the graph title.
  • IStream instances 104 and 105 store the data in the native format of the graph program.
  • FIG. 2 is a block diagram showing the relationship between the MultiStream interface and the file system and application programs.
  • the word processing program 201 and the graph program 202 interact with the MultiStream interface 203.
  • the MultiStream interface 203 interacts with the file system 204 to affect the storage of the object hierarchy in a compound document 205.
  • the word processing program 201 through standard interprocess communication means, sends messages to the graph program 202 identifying the graph object within the compound document and the action to perform in the object. A typical action might be to display or to edit the graph object.
  • the graph program 202 would then access the graph object through the MultiStream interface 203.
  • FIG. 3 is a flow diagram showing the creation of a compound document according to the present invention.
  • a user enters text data using the word processing program (client) and then requests that the graph object be inserted in the document.
  • the graph object program (server) is sent a message indicating where to store the graph object.
  • the user then inputs graph data using the graph server, and the graph server stores the graph object as indicated and returns.
  • the word processing program creates a compound document file (document file) and stores text data input by the user.
  • the word processing program receives text data from the user.
  • the word processing program creates a document file by invoking the function StgCreateDocfile provided by the MultiStream interface.
  • This function creates a document file and returns a pointer to an IStorage instance, which is the root IStorage instance for the document file.
  • the word processing program creates a stream within the root IStorage instance to store the text data.
  • the word processing program invokes the method CreateStream of the root IStorage instance which returns a pointer to the IStream instance for the created stream.
  • the word processing program writes the text data to the newly created stream using the Write method of the IStream instance.
  • the word processing program then waits to receive the next event from the user. Steps 305 and 306 are performed when the user indicates that a graph object should be inserted.
  • the word processing program creates an IStorage instance within the root IStorage instance in which to store the graph object by invoking the CreateStorage method of the root IStorage instance.
  • the word processing program invokes the graph server specifying the newly created IStorage instance that is to hold the graph object.
  • the graph server creates a graph object and stores it in the storage of the specified IStorage instance.
  • the graph server inputs graph data from the user.
  • the graph server creates a stream for the graph data by invoking the CreateStream method for the specified IStorage instance.
  • the graph server creates a stream for the title data by invoking the CreateStream method of the specified IStorage instance.
  • step 310 the graph server writes the graph data to the newly created stream by invoking the Write method of the IStream instance for the graph data.
  • step 311 the graph server writes the title data into the newly created stream by invoking the Write method of the IStream instance for the title data.
  • the graph server then returns to the word processing program. The word processing program then waits for the user to enter the next event.
  • the MultiStream Interface defines an IStorage and IStream interface.
  • the IStorage interface and IStream interface define a set of pure virtual methods which implement the hierarchical storage of the present invention.
  • a pure virtual method is a function that has a declaration but no code implementation.
  • the IStorage and IStream interfaces are described below. Also described are two functions that support the creation and opening of document files.
  • the present invention allows the storages and the streams to be opened with various access modes.
  • the access modes control whether the element (storage or stream) is opened in transacted mode, read or write mode, and denyread or denywrite mode.
  • transacted mode When an element is opened in transacted mode, changes to it are buffered until either a transaction commit or revert is specified. Conversely, when an element is opened in direct mode, no buffering occurs.
  • direct mode is functionally equivalent to a transaction mode in which every change is immediately followed by a commit.
  • transacted mode committing of changes are subject to the transaction mode of the parent storage. Each element is nested within the transactions of its parent storage. Thus, a commit of the root storage actually changes the file system file.
  • the act of committing a transaction on an element passes the changes to its parent storage instance.
  • the parent storage instance if opened in transacted mode, accumulates the committed changes of its elements. Thus, the changes percolate upwards toward the root storage.
  • transacted mode all changes to the elements are buffered. In particular, the creation or destruction of elements within a storage is transacted.
  • the present invention allows for various levels in the object hierarchy to be opened in transacted or direct mode. As discussed below in detail, when a storage is opened in direct mode and it contains an element opened in transacted mode, then when the element commits its transaction, those changes pass through the parent IStorage instance to the parent instance above.
  • a storage or stream may be opened in read and/or write mode. When a stream is not opened in read mode, then an attempt to read the stream returns an error. When a storage is opened in read mode, then the enumerate methods (described below) are enabled. If a storage is not opened in read mode, then its elements cannot be opened in a read mode.
  • an element is opened in write mode, then its changes can be committed. Specifically, unless an element is opened in write mode, an attempt to commit will return an error. As discussed above, when an element is opened in direct mode, a commit is done after every change. Thus, in direct mode, the write mode must be specified in order to affect the change.
  • denywrite mode If a storage or a stream is opened in denywrite mode, then subsequent requests to open the stream or storage in write mode are prohibited.
  • the denywrite mode is only effective for other openings of the element through the same parent IStorage instance.
  • the StgCreateDocfile function creates a file in the file system as a compound document using the designated name, creates a root storage within the file, and opens the root storage in the designated access mode.
  • the parameter dwIfThere designates the behavior of the function when a file of the designated name exists. If such a file exists, the function optionally returns an error, deletes it and creates a new file, or replaces the file with a file that contains a root storage containing a stream named "CONTENTS.” The stream contains the data that was in the old file. If the designated name is NULL, then a temporary document file with a unique name is created.
  • the function instantiates an IStorage instance for the root storage and returns a pointer to it.
  • the StgOpenStorage function opens an existing compound document of the designated named in the designated access mode. If the file does not exist, or if it is not a storage, then an error is returned. The function returns a pointer to the open IStorage instance.
  • Table 1 defines the IStorage interface.
  • the parameters of the methods of the IStorage interface are described in Table 2.
  • the behavior of each of the methods is specified following the tables.
  • An IStorage instance can contain an IStream instance and IStorage instance, which are referred to as elements of the parent IStorage instance.
  • Argument Description lpszName the name of a stream or storage (All elements within an IStorage instance are within the same name space.)
  • grfMode the access mode for an IStream or IStorage instance dwIfThere when creating an IStorage or IStream instance, dwIfThere indicates the behavior when an element of the same name already exists reserved must be zero ppstm a pointer to an IStream instance ppstg a pointer to an IStorage instance
  • the Release method closes the specified IStorage instance, which makes the instance invalid.
  • the term "specified” refers to the instance for which the method is invoked, and the term “designated” refers to a parameter.
  • the IStorage interface includes a method that increments a reference counter. The Release method decrements the reference counter and only invalidates the specified instance when the count goes to 0.
  • the CreateStream method creates a new stream of the designated name within the storage of the specified IStorage instance and opens the stream in the designated access mode.
  • the parameter dwIfThere indicates the behavior of the method when an element of the designated name already exists. If such a element exists, the method optionally returns an error or deletes the existing element and creates a new stream.
  • the method instantiates an IStream instance for the created stream and returns a pointer to it.
  • the OpenStream method opens an existing stream of the designated name within the storage of the specified IStorage instance in the designated access mode. If a stream of the designated name does not exist within the storage, or it cannot be opened in the designated access mode, an error is returned.
  • the access mode is discussed in detail below.
  • the method instantiates an IStream instance for the open stream and returns a pointer to it.
  • the method CreateStorage creates a new storage of the designated name within the specified IStorage instance and opens the new storage in the designated access mode.
  • the parameter dwIfThere indicates the behavior of the method when an element of the designated name already exists. If an element of the same name exists, the method optionally returns an error or deletes the existing element and creates a new storage. If a stream of the same name exists, then the stream is replaced by a new storage that contains one stream named "CONTENTS.” This stream contains the data that was in the old stream.
  • the method instantiates an IStorage instance (and an IStream instance, if necessary) for the created storage and returns a pointer to it.
  • the OpenStorage method opens an existing storage of the designated name within the specified Istorage instance in the designated access mode. If a storage of the designated name does not exist or it cannot be opened in the designated access mode, an error is returned.
  • the method CopyTo copies the entire contents of the storage of the specified IStorage instance into the designated storage. This method replaces the contents of the designated storage.
  • the designated storage may be a different implementation than the specified storage. Thus, the CopyTo implementation should only use the methods of the designated storage.
  • the Commit method commits any transactions for the specified storage.
  • the behavior of the Commit method depends upon the access mode in which the specified storage was opened. If the specified storage was opened in direct mode, then this method has no effect, with one exception. If the specified IStorage instance is a root storage, then this method acts like a traditional "flush" operation, which ensures that any internal memory buffers are written out to the underlying storage device.
  • this method causes any changes that have been made to the specified storage since it was opened or last committed (whichever is later) to be reflected in the parent of the specified storage. Permanent update of these changes is subject to the transaction mode of the parent storage. That is, the parent storage may be transacted, in which case a commit would need to be done on the parent storage before the changes are actually written to the storage device.
  • This method has no effect on uncommitted transactions of the currently opened elements of specified storage. In particular, this method does not automatically commit changes within the elements of the specified storage.
  • the action of committing in essence "publishes" the changes that occur in the specified storage to the parent storage.
  • the committed changes are written to the storage device in a robust manner.
  • the data within the storage device can be overwritten with the committed changes.
  • all changes are written to unused space in the underlying storage device.
  • the storage device is enlarged as necessary. Once this has been completed, a single write is performed on the storage device to indicate that the new data is to be used in place of the old data. The old data becomes free space that can be used during the next commit.
  • a third commit mode indicates that the commit should be made only if the current persistent content of the storage device is the same content as that upon which the changes are based. If the content is not the same, then an error code is returned.
  • the Revert method discards all changes that have been committed to the storage by its elements, since the specified storage was opened or last committed (whichever is later). After completion of this method, any elements that are opened for the specified storage are invalid (an error is returned by all methods of these elements except Release).
  • the EnumElements method enumerates the elements immediately contained within the storage for the specified IStorage instance.
  • the specified storage must be opened in read mode.
  • the DestroyElement method removes the element of the designated name from the specified storage instance. Any openings of the destroyed element (through the specified storage) become invalid. If the element does not exist, then an error is returned.
  • the RenameElement method renames the designated element in the specified storage from the old name to the new name. If the new name already exists or if the old name does not exist, an error is returned.
  • the method Stat returns statistical information about the storage specified Istorage instance.
  • Table 3 defines the IStream interface.
  • the parameters of the methods of the IStream interface are described in Table 4.
  • the IStream interface defines a seek pointer that is used as the location in the stream for each read and write.
  • the behavior of each of the methods is specified in the following.
  • Argument Description pv pointer to a buffer to read or write.
  • cb the number of bytes.
  • ppstm pointer to an IStream instance pcbWritten number of bytes actually written to stream, may be NULL if caller not interested.
  • pcbRead number of bytes actually read from a stream may be NULL if caller not interested.
  • the Release method closes the stream of the specified IStream instance.
  • the IStream interface includes a method that increments a reference counter. The Release method decrements the reference counter and invalidates the specified IStream instance when the count goes to 0.
  • the Read method reads the designated number of bytes into the designated buffer from the stream of the specified IStream instance starting at the current seek pointer.
  • the method returns the number of bytes actually read.
  • the method adjusts the seek pointer by the number of bytes actually read. If the stream is not open in read mode, then an error is returned.
  • the number of bytes actually read may be fewer than requested if the end of the stream is encountered during the read.
  • the Write method writes the designated number of bytes from the designated buffer into the stream of the specified IStream instance starting at the current seek pointer.
  • the size of the stream is increased to reach the seek pointer.
  • the added bytes are not initialized. If the stream is not open in the appropriate mode, then an error is returned. The number of bytes actually written is returned. The seek pointer is adjusted by the number of bytes actually written.
  • the Seek method adjusts the location of the seek pointer for the stream of the specified IStream instance. It is an error to seek before the beginning of the stream. It is not an error to seek past the end of the stream.
  • the parameter dlibMove indicates the displacement from either the beginning of the stream, the current seek pointer, or the end of the stream, as designated by parameter dwOrigin.
  • the new seek pointer is returned in parameter plibNewPosition, which may be null if the caller is not interested in the new seek pointer.
  • the SetSize method changes the size of the stream of the specified IStream instance to be that designated by the parameter libNewSize.
  • the seek pointer is not affected by this operation.
  • the stream is either increased in size or decreased in size. If the stream is increased in size, the contents of the new bytes are undefined.
  • the Clone method creates a new IStream instance that points to the same underlying stream as the specified IStream instance. Changes to the stream through one IStream instance are immediately visible through the other IStream instance. The locking state (discussed below) is shared between the two IStream instances. However, the cloned IStream instance does have its own seek pointer, which is independent of the seek pointer of the specified IStream instance. The initial setting of the seek pointer in the cloned IStream instance is the same as the current setting of the seek pointer in the specified IStream instance at the time of the Clone method is invoked.
  • the CopyTo method copies the designated number of bytes from the stream of the specified IStream instance starting at its current seek pointer to the stream of the designated IStream instance starting at its current seek pointer.
  • the number of bytes actually read or written is returned.
  • the seek pointer for each IStream instance is adjusted by the number of bytes actually read or written. If the IStream instances are not open with the appropriate access modes, an error is returned.
  • This method is semantically equivalent to a read followed by a write.
  • the Commit method behavior depends upon the mode in which the IStream instance is open. In direct mode, this method has no behavior. In transacted mode, this method causes changes that have been made to the IStream instance since it was opened or last committed, whichever is later, to be reflected in the parent storage.
  • the designated commit mode operates in an analogous way to the description in the IStorage::Commit method.
  • the method Revert has a behavior that depends upon the mode in which the stream of the specified IStream instance is open. In direct mode, this method performs no operation. In transacted mode, all changes that have been made to the IStream instance since the IStream instance was opened or last committed, whichever is later, are discarded.
  • the LockRegion method attempts to lock a region of the stream of the specified IStream instance.
  • the region begins with the current seek pointer and extends for the designated number of bytes toward the end of the stream. It is legal to indicate a region that extends past the current end of the stream.
  • the supporting of region locking on stream is optional. This method supports two types of locking: locking to exclude other writers (write lock) and locking to exclude other writers and readers (exclusive lock). If a write lock is granted, then the designated region of the stream may be accessed by the Read method from any IStream instance of the underlying stream. However, if a Write method is invoked through any IStream instance, except the specified IStream instance and its clones, then an error is returned.
  • the UnlockRegion method unlocks a previously locked region of the stream of the specified IStream instance.
  • the Stat method returns information about the stream of the specified IStream instance.
  • FIG. 4 is a block diagram showing an overview of a preferred implementation of the present invention.
  • the preferred implementation uses a layered approach comprising an IStorage/IStream Implementation 401, a Docfile Implementation 402, and an ILockBytes Implementation 403.
  • the preferred implementation is in the C++ language, which is an object-oriented language. Consequently, the implementation is described in object-oriented terms.
  • the IStorage/IStream Implementation 401 provides functions to create and open a document file and methods of the IStorage and IStream interfaces.
  • the support IStorage/IStream Implementation 401 implements transaction and invokes the services of the Docfile Implementation 402.
  • the DocFile Implementation 402 provides an interface to the persistent storage of the storages and streams within a document file.
  • the DocFile Implementation 402 maps the storages and streams within a document file.
  • the DocFile Implementation 402 maps the storages and streams to the underlying persistent storage using the ILockBytes interface.
  • the ILockBytes interface is defined as an abstract class that defines methods for manipulating persistent storage.
  • the ILockBytes Implementation 403 uses the underlying file system to store data.
  • implementation of the ILockBytes interface could use other underlying storage media, such as a data base, as indicated by Other Storage 405.
  • the IStorage/IStream Implementation 401 uses a layered approach to organize the data and methods needed to support the IStorage and IStream interfaces.
  • the preferred implementation organizes the IStorage and IStream instances into three layers: an exposed layer, a public layer, and a wrapped layer.
  • Figure 5 is a block diagram showing the IStorage and IStream layers. Each layer is implemented as an instance of a C++ class.
  • the exposed layer 511 of the IStorage instance 510 provides the methods of the IStorage interface.
  • the methods of the exposed layer 511 validate the parameters and invoke the methods of the public layer 512.
  • the public layer 512 maintains a list of the storage elements, enforces the access modes, and invokes the methods of the wrapped layer when in transacted mode and invokes the methods a direct layer when in direct mode.
  • the wrapped layer 513 implements the transaction support.
  • the exposed layer 521 of the IStream instance 520 provides the methods of the IStream interface.
  • the methods of the exposed layer 521 validate the parameters, maintain the seek pointer for the stream, and invoke the methods of public layer 522.
  • the public layer 522 enforces the access modes and invokes the methods of the wrapped layer 523 when in transacted mode, and invokes the methods of a direct layer when in direct mode.
  • the wrapped layer 523 implements the transaction support.
  • the IStream interface is implemented without transaction support. That is, the IStream::Write method writes directly to the next level in the transaction hierarchy.
  • the layers of the IStorage and IStream implementation are described below in detail.
  • the exposed layer is the outermost layer and implements the methods of the IStorage and IStream interfaces.
  • the exposed layer validates the parameters of the IStorage and IStream methods.
  • the seek pointer for streams is not transacted.
  • the only layer that is aware of seek pointers is the exposed layer.
  • the exposed layer of the IStream implementation maintains the seek pointer.
  • the exposed layer points to the public layer.
  • the public layer enforces most of the access modes for the instance.
  • the public layer maintains a list of all its elements and their access modes. It uses this list to determine whether to allow or deny a particular access to an element. If an instance is in transacted mode, then the public layer invokes the methods of the wrapped layer, which it points to. Otherwise, the public layer invokes the direct layer.
  • the wrapped and direct layer both support the same interface and can be used in a polymorphic manner. This allows the public layer to invoke the methods of an abstract interface and not worry about whether it is invoking the wrapped layer or the direct layer.
  • the wrapped layer supports buffering of changes until commit or revert time.
  • the wrapped layer communicates with the direct layer for managing its dirty information (data buffered for a transaction) and for managing its base information (data in the persistent storage).
  • the wrapped layer also enforces certain access modes. For example, the IStorage interface specifies that the write access mode can be requested for any instance, regardless of the access mode of its parent. This means that an instance can be in write mode while its parent is in read-only access. However, the commits of the instance with write access will fail because the parent has read-only access.
  • the direct layer invokes the methods of the DocFile Implementation directly to alter the persistent storage.
  • each IStorage and IStream instance may be opened in direct or transacted mode.
  • IStorage and IStream instances are instantiated with a wrapped layer when open in transacted mode.
  • the wrapped layer tracks the changes made to its elements and either commits or reverts upon request.
  • each level of the hierarchy of instances can be open in a different mode.
  • Figure 6 shows a typical object hierarchy. If the root IStorage instance 601 and the graph object IStorage instance 602 are open in a transacted mode, then the root IStorage instance 601 and the graph instance 602 each buffer the changes made to the stream of the XY data 603 and the stream of the title data 604. For example, if a change is made to the title data 604, then the graph object instance 602 buffers these changes in a scratch file. When the graph object storage instance commits its changes, then the root IStorage instance buffers these committed changes in a scratch file.
  • the present invention implements transactioning by maintaining a set of changes (referred to as a transaction level) for each IStorage and IStream instance. These transaction levels buffer committed changes for each element that descends from the instance and the uncommitted changes of the instance itself.
  • a transaction level comprises a linked list of instances of transaction set members.
  • a transaction set member buffers the changes for one element of the IStorage or IStream instance itself.
  • Each transaction level includes a transaction set member for the IStorage or IStream instance itself to buffer the changes to the instance. Additional transaction set members are created when elements are instantiated.
  • Transaction set members can be either direct or wrapped.
  • a direct transaction set member does not buffer changes that have been made to it. Rather, direct transaction set member allows persistent storage to be directly manipulated.
  • Wrapped transaction set members buffer changes and point to the data upon which the changes are based. For each element, the base data is what its parent thinks is the current state of the element.
  • Each wrapped transaction set member contains two pointers: one pointer points to a direct member manipulating the scratch where the change information is buffered (called the dirty pointer) and the other pointer points to a directed or wrapped member which identifies the base data (called the base pointer).
  • the base pointers of a transaction set members form a chain of transacted versions of a stream or storage.
  • the parent IStorage instance When a stream or storage is opened, its parent IStorage instance is requested to get its base pointer. If the parent does not have a transaction set member for the element, it will instantiate a transaction set member for its element. The parent IStorage instance then requests its parent to get a base pointer for the element and instantiates a transaction set member if needed. Thus, the request may percolate to the root IStorage instance which has access to the persistent file.
  • Figure 7 is a block diagram illustrating the transaction levels in a preferred embodiment.
  • Figure 6 is a sample object hierarchy diagram.
  • the root object and the graph object are open in transacted mode.
  • IStorage instance 710 and XSM instance 711 are instantiated.
  • the XSM instance 711 buffers the changes made to the root storage.
  • the XSM instance 711 contains a dirty pointer and a base pointer.
  • the dirty pointer points to a stream in a scratch file where the buffered changes are stored.
  • the base pointer points to the persistent storage.
  • the IStorage instance 720 and the XSM instance 721 are instantiated.
  • the instance When initializing the XSM instance 721, the instance requests a base pointer from its parent storage.
  • IStorage instance 710 creates XSM instance 712 and initializes the dirty pointer to point to a scratch stream and the base pointer to point to the persistent storage.
  • the IStorage instance 710 returns the pointer to XSM instance 712 to the instance 721, which stores the pointer as the base pointer.
  • the XY data stream is opened in direct mode, the XY data IStream instance 730 is instantiated.
  • the initialization method for the IStream instance requests the parent IStorage for the pointer to its base.
  • the graph object IStorage instance 730 creates a transaction set member for the XY data stream.
  • the XSM instance 722 then requests its parent storage, root IStorage instance 710, for a base pointer.
  • the root IStorage instance 710 instantiates XSM instance 710 for the XY data stream.
  • the root IStorage instance 710 initializes the base pointer of XSM instance 713 to point to the persistent storage and returns a pointer to itself to the XSM instance 722, which stores the pointer as its base.
  • the XSM instance 722 then returns the pointer to itself to the XY data IStream instance 730.
  • the XY data IStream instance 730 stores that pointer as its base.
  • Figure 9 is a block diagram illustrating the transaction levels in a preferred embodiment.
  • Figure 8 is a sample object hierarchy diagram.
  • Figures 7 and 9 illustrate the transaction levels when a storage is opened in transacted and direct modes, respectively.
  • the IStorage instance 920 requests the root IStorage instance 910 for a pointer to its base.
  • the root IStorage instance 910 instantiates XSM instance 912 and sets its base to point to persistent storage.
  • the root IStorage instance 910 returns a pointer to the graph object IStorage instance 920, which stores the pointer as its base.
  • the XY data and title data streams are instantiated, they are returned pointers to XSM instances of the root IStorage 910. Since the graph object storage is not transacted, it has no corresponding transaction level and all changes made to the graph object are sent to the root storage transaction set members.
  • FIG. 10 is a block diagram showing the various layers of an IStorage instance. Each block represents a member C++ class with member methods.
  • An IStorage instance as discussed above comprises an exposed, public, and a wrapped layer. These layers are represented by class instances CExposedStorage 1010, CPubStorage 1020, and CWrappedStorage 1030.
  • the exposed storage layer contains a pointer to the public storage layer and base and dirty pointers, which it would use if the instance is not in transacted mode.
  • the public layer contains a pointer to the wrapped layer, a pointer to the parent public layer, a pointer to a link list containing the access modes of its children, and the access modes corresponding to the IStorage instance.
  • the wrapped layer contains a pointer to a transaction level instance, a pointer to an update list, and dirty and base pointers.
  • the transaction level instance contains a pointer to a linked list of transaction set members, a pointer indicating which transaction set member corresponds to this IStorage instance, and information indicating where to store the transacted data.
  • the update list contains the transactions on the names of the elements of the IStorage instance.
  • the transaction set member points to a corresponding transacted stream data structure, which stores the changes to a stream.
  • FIG 11 is a block diagram of C++ classes which support an IStream instance.
  • IStream instances are not transacted. Consequently, IStream instance has only an exposed layer 1101 and a public layer 1103.
  • the exposed layer 1101 points to the seek pointer 1102. If an IStream instance is cloned, a new exposed layer 1105 is created along with a new seek pointer 1106.
  • the new exposed layer 1105 points to the public layer 1103 of the cloned instance and points to the new seek pointer 1106.
  • the Docfile Implementation maps the object hierarchy of the IStorage and IStream interfaces into the persistent storage using the ILockBytes interface.
  • the ILockBytes interface as described below presents a view of persistent storage as an array of bytes.
  • the DocFile Implementation logically divides the array into a header and the plurality of fixed length sectors.
  • Figure 12 is a diagram of the layout of the sectors in one document file.
  • the format of this implementation is referred to as the multistream file format (MSFF).
  • the header is 512 bytes.
  • the sector size is stored in the header and is typically a multiple of 512 bytes.
  • the sectors are typed according to the type of information each contains.
  • the types are FAT, directory, MiniFAT, DIF, and data.
  • the MSFF uses a file allocation table (FAT) and a doubly indirect file allocation table (DIF) to link sectors of the same type to form a logically contiguous stream.
  • FAT file allocation table
  • DIF
  • FIG. 13 is a diagram showing the allocation structures of the MSFF. This example assumes the sector size is 512 bytes and the pointers to sectors are 4 bytes.
  • the header, 1301 points to a link list of DIF sectors 1302-1304.
  • the DIF sectors form a linked list using links 1302A, 1303A, and 1304A.
  • Each DIF sector contains a table 1302B, 1303B, and 1304B of pointers to FAT sectors. The number of pointers in the table depends on the sector size. As shown in Figure 13, each DIF sector table contains 127 pointers to FAT sectors.
  • the FAT sectors contain a logically contiguous array of FAT entries. There is one FAT entry for each sector in the persistent storage array. Each FAT sector contains 128 FAT entries. The FAT entries contain pointers that link together the sectors that form MSFF streams. An MSFF stream is a logically contiguous set of sectors of the same type. For each sector in a stream, the FAT entry corresponding to that sector contains a pointer to the next logically contiguous sector in the stream.
  • the data stream 1307-1310 contains four data sectors. Sector 1307 is stored in sector 3; sector 1308 is stored in sector 129; sector 1309 is stored in sector 140; and sector 1310 is stored in sector 2.
  • FAT entries link this stream together in the following way: Since sector 3 contains the first sector in the stream, FAT entry 3 (FAT[3]) contains 129, which is the sector that contains the second sector in the data stream. FAT entry 129 (FAT[129]) contains 140, which is the sector that contains the third sector in the data stream. FAT entry 140 (FAT[140]) contains 2, which is the sector that contains the last sector in the data stream. Since sector 2 contains the last sector in the data stream, FAT entry 2 (FAT[2]) contains an end of the data stream indicator. Once the start sector for a stream is given, the other sectors in the stream can be located by traversing the linked list in the FAT.
  • the entries of the DIF sectors indicate where each FAT sector is actually stored.
  • the first DIF sector contains the sector locations of the first 127 FAT sectors; the second DIF sector contains the sector location of the second 127 FAT sectors; etc. Thus, given the location of the first DIF sector, which is stored in the header, all FAT sectors can be located.
  • the MSFF header contains a pointer to a directory stream.
  • the directory stream contains the directory structure for the MSFF.
  • Figure 14 is a block diagram showing the layout of a sample directory stream.
  • Figure 15 is the sample object hierarchy illustrated by Figure 14.
  • a directory corresponds to an IStorage instance, and a data stream corresponds to an IStream instance.
  • the directory contains a root directory and sub-directories B, C, and D, and data streams B1 and B2 within sub-directory B.
  • the MSFF preferably stores four directory entries within each directory sector.
  • Template 1401 shows the structure of each directory entry. Each entry contains name and status information. If the entry corresponds to a data stream, it contains the start sector of that data stream.
  • Each directory entry also contains the directory entry index of its parent, its left-most child, its previous sibling, and its next sibling.
  • the header A02 contains the sector number of the first directory sector 1403.
  • the directory sectors are linked by the FAT.
  • the directory entries of the hierarchy are stored in directory sectors 1405, 1404, and The directory entries 1406-1411 1405. each correspond to a storage stream in the hierarchy.
  • Directory entry 0 (DIR[0]) 1406 corresponds to the root storage and indicates that its left-most child is stored in directory entry 2 (DIR[2]).
  • Directory entry 2 (DIR[2]) 1407 contains the entry for sub-directory B.
  • Directory entry 2 indicates that its parent is the root node (DIR[0]), it has a child stored in directory entry 4 (Dir[4]), it has no previous sibling, and its next sibling is stored in directory entry 5 (DIR[5]).
  • Directory entry 4 (DIR[4]) 1408 corresponds to data stream B1, and contains the starting sector number (not shown) of data stream B1.
  • Directory entry 4 indicates that its parent is stored in directory entry 2 (DIR[2]), it has no children, it has no previous sibling, and its next sibling is stored in directory entry 6 (DIR[6]).
  • Directory entry 6 (Dir[6]) 1410 corresponds to data stream B2, and contains the starting sector number for data stream B2.
  • Directory entry 6 indicates that its parent is stored in directory entry 2, it has no children, its previous sibling is stored in directory entry 4, and it has no next sibling.
  • Directory entry 5 (DIR[5]) 1409 contains the entry for sub-directory C.
  • Directory entry 5 indicates that its parent is stored in directory entry 0, it has no children, its previous sibling is stored in directory entry 2, and its next sibling is stored in directory entry 9.
  • Directory entry 9 (DIR[9]) 1411 contains the entry for sub-directory D. Directory entry 9 indicates that its parent is stored in directory entry 0, it has no children, its previous sibling is stored in directory entry 5, and it has no next sibling.
  • the MSFF is designed to facilitate the updating of the persistent storage in a robust manner. This robust manner helps ensure that the persistent storage will not be left in an inconsistent state.
  • the persistent storage is updated in a robust manner, existing data is not overwritten, rather updated sectors of information are written to free blocks. The process of writing an updated sector to a free block is referred to as "shadowing.” Once all the sectors that need to be modified are shadowed, then the header is overwritten to link the new data into the directory hierarchy.
  • the updating of the persistent storage in a robust manner tends to minimize the risk that the file will be left in an inconsistent state due to a system failure.
  • Figure 16 is a flow diagram showing a procedure to update a data stream in a robust manner.
  • the routine writes the new data to free sectors within the file. The file is extended if there are no free sectors.
  • the routine reads the FAT sectors that contain the FAT entries corresponding to the sectors containing the old and new data, modifies the FAT entries to indicate which sectors are now part of the data stream, and writes the FAT sectors to a free block.
  • the routine reads each DIF sector that corresponds to a FAT sector that has been shadowed, updates the DIF sector to point to the new sector of the FAT sector, and writes the DIF sector to a free block.
  • the routine also shadows every DIF sector that is logically prior to the one that was just shadowed. This shadowing of the DIF sectors is used to update the pointers in the linked list of DIF sectors.
  • the routine determines whether the updates to the data stream result in information to the directory being changed (which it always will if the directory entry contains time of last modification). If a change is needed, the routine continues at step 1605 or else the routine continues at step 1608. In steps 1605 through steps 1607, the routine shadows the directory sector containing the directory entry corresponding to the updated data stream, shadows the FAT sectors that correspond to the old and new directory sectors, and shadows the appropriated DIF sectors. Finally, in step 1608, the routine updates the header data to point to the new shadowed sectors by modifying the pointer to the DIF.
  • FIG 17 is a diagram illustrating the shadowing methods of the present invention.
  • Structure 1701 represents to storage array before being updated.
  • the data shown in this file corresponds to the data stream example of Figure 13.
  • the data in sector 140 is updated.
  • DIF sector 0 ((DIF[0]) is stored in sector 139.
  • DIF entry 1 (DIF[1]) indicates that FAT sector 1 is stored in sector 141.
  • FAT sector 1 contains FAT entry 129 (FAT[129]), which indicates that sector 140 contains the next sector in the data stream, and contains FAT entry 140 (FAT[140]), which indicates that sector 2 contains the next sector in the data stream.
  • File 1702 illustrates shadowing when the data in sector 140 is updated. The shadow sectors are indicated by dash lines.
  • the new data is written to sector 152.
  • the FAT sector 1 from sector 141 is retrieved and FAT entry 129 is modified to point to sector 152, FAT entry 152 is modified to point to sector is 2, and FAT entry 140 is modified to indicate that sector 140 is no longer in the data stream and is free.
  • the modified FAT sector 1 is then written to sector 153.
  • DIF sector [0] is retrieved and modified to indicate that FAT sector [1] is now stored in sector 152, and written to sector 154.
  • the persistent storage is in a consistent state because the old data is left intact and the new data has just been added to the end of the file (or stored within free sectors).
  • a new header sector as shown in block 1703 indicating that the DIF sector 0 is now in sector 154.
  • the sector size is 512 bytes.
  • a sector can contain data for only one data stream, a significant portion of a persistent storage may contain "unused" space.
  • the present invention stores "small" data streams in special sectors referred to as MiniStream sectors, a stream is designated whose allocation is tracked by data stored in MiniFAT sectors.
  • MiniStream each sector is logically divided into 64-byte minisectors.
  • the MiniFAT which is analogous to the FAT, contains the linking information for the MiniStream.
  • the header points to the first sector in the MiniFAT, and the root directory entry (Dir[0]) points to the first sector in the MiniStream.
  • the FAT is used to link the sectors in the MiniFAT and MiniStream.
  • the directory entry in the directory stream for the data stream points to the first minisector for the data stream. Subsequent, minisectors in the data stream are linked through the MiniFAT.
  • Figure 18 is a block diagram showing the layout of the MiniStream and MiniFAT.
  • very small data streams can be stored in the directory entry itself. If a very small data stream were to grow too large for the directory entry, the data stream would then be stored in the MiniStream. If a data stream stored in the MiniStream grew to be larger than a specified size, it would then be stored in a data stream.
  • the header information can contain the locations of the first few FAT sectors to improve performance when accessing a small persistent storage.
  • the ILockBytes Implementation 403 implements the ILockBytes interface.
  • the ILockBytes interface as described below provides a model of the underlying storage media.
  • the ILockBytes Implementation 403 operates on the underlying file system.
  • other implementation could be developed to operate in other media.
  • multiple instances of the ILockBytes interface are used. One instance points to the scratch file and another is used to point to the actual document file.
  • an additional parameter can be added to the StgCreateDocFile and StgOpenDocFile function to allow the application program to specify an ILockBytes instance.
  • Table 5 defines the ILockBytes interface.
  • the parameters of the methods of the ILockBytes interface are described in Table 6.
  • the behavior of each method is specified in the following.
  • the ReadAt method reads the designated number of bytes into the designated buffer from the storage array of the specified ILockBytes instance starting at the designated offset.
  • the number of bytes actually read is returned.
  • the number of bytes actually read may be fewer than requested if the end of the storage array is encountered during the read. If the read overlaps a read locked region of the storage array, an error is returned.
  • the WriteAt method writes the designated number of bytes from the designated buffer to storage array of the ILockBytes instance starting at the designated offset. If the offset is past the current end of the storage array, then the storage array is increased in size with uninitialized bytes. The number of bytes actually written is returned in pcbWritten. If the write overlaps a locked region, then an error is returned.
  • the Flush method writes any internal buffers maintained by the implementation of the specified ILockBytes instance to the storage array.
  • the SetSize method changes the size of the storage array of the specified ILockBytes instance to the designated number of bytes.
  • the storage array is either increased in size or decreased in size. If the storage array is increased in size, the contents of the new bytes are undefined.
  • the LockRegion method attempts to lock a region of the storage array of the specified ILockBytes instance.
  • the region begins with the designated offset and extends for the designated number of bytes towards the end of the storage array. It is legal to indicate a range of bytes that extends past the current end of the storage array.
  • the locking behavior of this method is analogous to that of the IStream::LockRegion method.
  • the UnlockRegion method unlocks a previously locked region of the storage array of the specified ILockBytes instance.
  • the Stat method returns information about the storage array of the specified ILockBytes instance.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Human Computer Interaction (AREA)
  • Software Systems (AREA)
  • Business, Economics & Management (AREA)
  • General Business, Economics & Management (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Document Processing Apparatus (AREA)
  • Computer And Data Communications (AREA)
  • Transition And Organic Metals Composition Catalysts For Addition Polymerization (AREA)
  • Warehouses Or Storage Devices (AREA)

Claims (1)

  1. Procédé pour mémoriser les données d'un document complexe, comprenant les étapes suivantes :
    mémoriser des données qui sont logiquement contiguës dans une pluralité de zones physiquement non-contiguës d'un dispositif de mémorisation, caractérisé par les étapes suivantes :
    mémoriser des informations d'en-tête comportant un pointeur vers une table d'allocation de fichier doublement indirecte ;
    mémoriser une table d'allocation de fichier doublement indirecte pointant vers une table d'allocation de fichier ;
    mémoriser une table d'allocation de fichier qui lie des zones physiquement non-contiguës d'une façon logiquement contiguë.
EP93110796A 1992-07-06 1993-07-06 Procédé pour stocker des objets Expired - Lifetime EP0578204B1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP00105871A EP1006456A3 (fr) 1992-07-06 1993-07-06 Méthode et système de stockage et d'accés à des données dans un document composé avec liaison d'objets
EP98118766A EP0892355B1 (fr) 1992-07-06 1993-07-06 Méthode et système de validation de modifications de données structurées hiérarchiquement
EP00105872A EP1006457A3 (fr) 1992-07-06 1993-07-06 Méthode et système de stockage d'objets de données utilisant un flux de données de petits objets

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US909533 1992-07-06
US07/909,533 US5506983A (en) 1992-07-06 1992-07-06 Method and system for transactioning of modifications to a tree structured file

Related Child Applications (1)

Application Number Title Priority Date Filing Date
EP98118766A Division EP0892355B1 (fr) 1992-07-06 1993-07-06 Méthode et système de validation de modifications de données structurées hiérarchiquement

Publications (3)

Publication Number Publication Date
EP0578204A2 EP0578204A2 (fr) 1994-01-12
EP0578204A3 EP0578204A3 (fr) 1994-03-23
EP0578204B1 true EP0578204B1 (fr) 1999-04-14

Family

ID=25427396

Family Applications (4)

Application Number Title Priority Date Filing Date
EP00105871A Ceased EP1006456A3 (fr) 1992-07-06 1993-07-06 Méthode et système de stockage et d'accés à des données dans un document composé avec liaison d'objets
EP93110796A Expired - Lifetime EP0578204B1 (fr) 1992-07-06 1993-07-06 Procédé pour stocker des objets
EP98118766A Expired - Lifetime EP0892355B1 (fr) 1992-07-06 1993-07-06 Méthode et système de validation de modifications de données structurées hiérarchiquement
EP00105872A Withdrawn EP1006457A3 (fr) 1992-07-06 1993-07-06 Méthode et système de stockage d'objets de données utilisant un flux de données de petits objets

Family Applications Before (1)

Application Number Title Priority Date Filing Date
EP00105871A Ceased EP1006456A3 (fr) 1992-07-06 1993-07-06 Méthode et système de stockage et d'accés à des données dans un document composé avec liaison d'objets

Family Applications After (2)

Application Number Title Priority Date Filing Date
EP98118766A Expired - Lifetime EP0892355B1 (fr) 1992-07-06 1993-07-06 Méthode et système de validation de modifications de données structurées hiérarchiquement
EP00105872A Withdrawn EP1006457A3 (fr) 1992-07-06 1993-07-06 Méthode et système de stockage d'objets de données utilisant un flux de données de petits objets

Country Status (7)

Country Link
US (3) US5506983A (fr)
EP (4) EP1006456A3 (fr)
JP (3) JP3672582B2 (fr)
KR (1) KR100287046B1 (fr)
AT (2) ATE179003T1 (fr)
CA (3) CA2320675C (fr)
DE (2) DE69332672T2 (fr)

Families Citing this family (109)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5506983A (en) * 1992-07-06 1996-04-09 Microsoft Corporation Method and system for transactioning of modifications to a tree structured file
US5812862A (en) * 1993-05-10 1998-09-22 Apple Computer, Inc. Computer-human interface system for compound documents
WO1994027229A1 (fr) * 1993-05-10 1994-11-24 Apple Computer, Inc. Systeme d'interface ordinateur/homme a manipulation d'elements entre un bureau et un document
EP0698242A1 (fr) * 1993-05-10 1996-02-28 Apple Computer, Inc. Systeme de determination automatique de l'etat de contenus ajoutes a un document
US5873097A (en) * 1993-05-12 1999-02-16 Apple Computer, Inc. Update mechanism for computer storage container manager
US5870764A (en) * 1993-05-12 1999-02-09 Apple Computer, Inc. Method of managing a data structure for concurrent serial and parallel revision of a work
US5652879A (en) * 1993-05-12 1997-07-29 Apple Computer, Inc. Dynamic value mechanism for computer storage container manager enabling access of objects by multiple application programs
CA2124752C (fr) * 1993-06-30 2005-04-12 Mark Zbikowski Structure de meta-donnees et manipulation de ces dernieres
CA2124754C (fr) * 1993-06-30 2005-06-28 Mark Zbikowski Stockage de donnees sur disque en representations multiples
US5922054A (en) * 1994-08-19 1999-07-13 Canon Kabushiki Kaisha System for managing external applications and files
EP0769169B1 (fr) 1995-05-05 2004-09-22 Apple Computer, Inc. Systeme modulaire de reseau
US5740455A (en) * 1995-05-16 1998-04-14 Apple Computer, Inc. Enhanced compound document processing architectures and methods therefor
US5664208A (en) * 1995-05-16 1997-09-02 Apple Computer, Inc. Methods and apparatuses for seamless compound document processing
JP3635765B2 (ja) * 1996-02-23 2005-04-06 ブラザー工業株式会社 印刷特性表示装置
US5842219A (en) * 1996-03-14 1998-11-24 International Business Machines Corporation Method and system for providing a multiple property searching capability within an object-oriented distributed computing network
US6119130A (en) * 1996-03-28 2000-09-12 Oracle Corporation Method and apparatus for providing schema evolution without recompilation
US6434598B1 (en) 1996-07-01 2002-08-13 Sun Microsystems, Inc. Object-oriented system, method and article of manufacture for a client-server graphical user interface (#9) framework in an interprise computing framework system
US6038590A (en) 1996-07-01 2000-03-14 Sun Microsystems, Inc. Object-oriented system, method and article of manufacture for a client-server state machine in an interprise computing framework system
US6266709B1 (en) 1996-07-01 2001-07-24 Sun Microsystems, Inc. Object-oriented system, method and article of manufacture for a client-server failure reporting process
US5848246A (en) 1996-07-01 1998-12-08 Sun Microsystems, Inc. Object-oriented system, method and article of manufacture for a client-server session manager in an interprise computing framework system
US6424991B1 (en) 1996-07-01 2002-07-23 Sun Microsystems, Inc. Object-oriented system, method and article of manufacture for a client-server communication framework
US5999972A (en) 1996-07-01 1999-12-07 Sun Microsystems, Inc. System, method and article of manufacture for a distributed computer system framework
US6272555B1 (en) 1996-07-01 2001-08-07 Sun Microsystems, Inc. Object-oriented system, method and article of manufacture for a client-server-centric interprise computing framework system
US5987245A (en) 1996-07-01 1999-11-16 Sun Microsystems, Inc. Object-oriented system, method and article of manufacture (#12) for a client-server state machine framework
US6304893B1 (en) 1996-07-01 2001-10-16 Sun Microsystems, Inc. Object-oriented system, method and article of manufacture for a client-server event driven message framework in an interprise computing framework system
US6049832A (en) * 1996-11-15 2000-04-11 Wall Data Incorporated Method for accessing information on a host computer from a client computer through an intelligent virtual host component
US5878206A (en) * 1997-03-25 1999-03-02 Hewlett-Packard Company Commit scope control in hierarchical information processes
US6061696A (en) * 1997-04-28 2000-05-09 Computer Associates Think, Inc. Generating multimedia documents
DE69831229T2 (de) * 1997-05-14 2006-04-13 Biosite Diagnostics Inc., San Diego Schnelle bestimmung des verhältnisses von biologischen molekülen
US7284187B1 (en) * 1997-05-30 2007-10-16 Aol Llc, A Delaware Limited Liability Company Encapsulated document and format system
US6182279B1 (en) * 1997-08-12 2001-01-30 International Business Machines Corporation Method and apparatus for storing templates in a component system
US5970252A (en) * 1997-08-12 1999-10-19 International Business Machines Corporation Method and apparatus for loading components in a component system
US6093215A (en) * 1997-08-12 2000-07-25 International Business Machines Corporation Method and apparatus for building templates in a component system
US6195794B1 (en) 1997-08-12 2001-02-27 International Business Machines Corporation Method and apparatus for distributing templates in a component system
US5978579A (en) * 1997-08-12 1999-11-02 International Business Machines Corporation Architecture for customizable component system
US6067541A (en) * 1997-09-17 2000-05-23 Microsoft Corporation Monitoring document changes in a file system of documents with the document change information stored in a persistent log
US6240414B1 (en) 1997-09-28 2001-05-29 Eisolutions, Inc. Method of resolving data conflicts in a shared data environment
US7447712B2 (en) 1997-09-28 2008-11-04 Global 360, Inc. Structured workfolder
US6237011B1 (en) * 1997-10-08 2001-05-22 Caere Corporation Computer-based document management system
US6070254A (en) * 1997-10-17 2000-05-30 International Business Machines Corporation Advanced method for checking the integrity of node-based file systems
US6018789A (en) * 1997-11-24 2000-01-25 Western Digital Corporation Disk drive with cache segment providing adaptively managed chunks
US6269362B1 (en) * 1997-12-19 2001-07-31 Alta Vista Company System and method for monitoring web pages by comparing generated abstracts
US6163776A (en) * 1998-03-23 2000-12-19 Software Tree, Inc. System and method for exchanging data and commands between an object oriented system and relational system
US6614433B1 (en) * 1998-06-05 2003-09-02 Unisys Corporation Method and system for distributed, dynamic generation of graphics files
US6272607B1 (en) * 1998-08-28 2001-08-07 International Business Machines Corporation Method and apparatus for transactional writing of data into a persistent memory
US6266682B1 (en) 1998-08-31 2001-07-24 Xerox Corporation Tagging related files in a document management system
US6562076B2 (en) 1998-08-31 2003-05-13 Xerox Corporation Extending application behavior through active properties attached to a document in a document management system
US6549918B1 (en) 1998-09-21 2003-04-15 Microsoft Corporation Dynamic information format conversion
US6192376B1 (en) 1998-11-13 2001-02-20 International Business Machines Corporation Method and apparatus for shadowing a hierarchical file system index structure to enable error recovery
JP3756352B2 (ja) * 1999-06-29 2006-03-15 富士通株式会社 コンパイラ装置およびコンパイラを記録したコンピュータ読み取り可能な記録媒体
US20060031746A1 (en) * 1999-11-11 2006-02-09 Toepfer John R Publishing architecture system and method
US20020069214A1 (en) * 1999-12-02 2002-06-06 Smith John M. Document services architecture
US6856993B1 (en) * 2000-03-30 2005-02-15 Microsoft Corporation Transactional file system
US20020087579A1 (en) * 2000-06-23 2002-07-04 Alan Chasanoff Object universe
FR2811101B1 (fr) * 2000-07-03 2002-09-20 Axicare Procede de traitement de donnees structurees utilisant un langage informatique oriente objet
SG146434A1 (en) * 2000-11-29 2008-10-30 British Telecomm Transmitting and receiving real-time data
US7386792B1 (en) * 2001-03-07 2008-06-10 Thomas Layne Bascom System and method for collecting, storing, managing and providing categorized information related to a document object
US6618736B1 (en) * 2001-03-09 2003-09-09 Ensim Corporation Template-based creation and archival of file systems
WO2003017567A1 (fr) * 2001-08-15 2003-02-27 Bentley Systems, Incorporated Procede et systeme permettant de stocker des fichiers de donnees de grande taille
US7428548B2 (en) * 2001-08-15 2008-09-23 Bentley Systems, Inc. Computer readable medium for storing large data files
EP1428357A1 (fr) * 2001-09-21 2004-06-16 British Telecommunications Public Limited Company Procede et systeme de communication de donnees dans lesquels la capacite de la memoire-tampon de reception est utilisee pour le calcul de la vitesse de transmission en vue de la regulation de l'encombrement
EP1449331B1 (fr) * 2001-11-30 2007-09-19 British Telecommunications Public Limited Company Transmission de donnees
US7134020B2 (en) * 2002-01-31 2006-11-07 Peraogulne Corp. System and method for securely duplicating digital documents
ATE363809T1 (de) * 2002-03-27 2007-06-15 British Telecomm Datenstruktur für ein datenübertragungssystem
EP1359722A1 (fr) * 2002-03-27 2003-11-05 BRITISH TELECOMMUNICATIONS public limited company Système et procédé pour transmettre des flux de données
KR100804945B1 (ko) * 2002-04-29 2008-02-20 주식회사 포스코 롤의 넥크부 정도 유지장치
US7548935B2 (en) * 2002-05-09 2009-06-16 Robert Pecherer Method of recursive objects for representing hierarchies in relational database systems
US7234109B2 (en) * 2002-11-19 2007-06-19 Microsoft Corp. Equality of extensible markup language structures
GB0306296D0 (en) * 2003-03-19 2003-04-23 British Telecomm Data transmission
US20030191681A1 (en) * 2003-05-06 2003-10-09 Gallion Kirk P. Method for managing a business process related to a document publishing project
US8238696B2 (en) 2003-08-21 2012-08-07 Microsoft Corporation Systems and methods for the implementation of a digital images schema for organizing units of information manageable by a hardware/software interface system
US8166101B2 (en) 2003-08-21 2012-04-24 Microsoft Corporation Systems and methods for the implementation of a synchronization schemas for units of information manageable by a hardware/software interface system
US7676481B2 (en) * 2005-02-24 2010-03-09 Microsoft Corporation Serialization of file system item(s) and associated entity(ies)
US8271541B2 (en) * 2004-03-31 2012-09-18 Fusionops Corporation Method and apparatus for developing composite applications
US8683318B1 (en) * 2004-07-14 2014-03-25 American Express Travel Related Services Company, Inc. Methods and apparatus for processing markup language documents
US7457826B2 (en) * 2004-12-20 2008-11-25 Microsoft Corporation Systems and methods for synchronization of items without snapshots
US8521752B2 (en) * 2005-06-03 2013-08-27 Osr Open Systems Resources, Inc. Systems and methods for arbitrary data transformations
US7630998B2 (en) * 2005-06-10 2009-12-08 Microsoft Corporation Performing a deletion of a node in a tree data storage structure
RU2005124030A (ru) * 2005-07-28 2007-02-10 Александр Михайлович Юров (RU) Способ визуальной адресации команд в дереве
CN101000610B (zh) * 2006-01-11 2010-09-29 鸿富锦精密工业（深圳）有限公司 文件分散式储存系统及方法
US8538931B2 (en) 2006-04-28 2013-09-17 International Business Machines Corporation Protecting the integrity of dependent multi-tiered transactions
GB2440357B (en) 2006-06-30 2011-12-07 Data Equation Ltd Data processing
GB2439576B (en) * 2006-06-30 2011-05-04 Data Equation Ltd Storing related data fragments in the same block
GB2439578B (en) * 2006-06-30 2011-11-09 Data Equation Ltd Data processing
GB2439577B (en) * 2006-06-30 2011-12-14 Data Equation Ltd Data processing
GB2439752B (en) * 2006-06-30 2011-11-02 Data Equation Ltd Storing and Modifying Data
US7512748B1 (en) 2006-08-17 2009-03-31 Osr Open Systems Resources, Inc. Managing lock rankings
US8539228B1 (en) 2006-08-24 2013-09-17 Osr Open Systems Resources, Inc. Managing access to a resource
JP2008077173A (ja) * 2006-09-19 2008-04-03 Sony Computer Entertainment Inc コンテンツ表示処理装置およびコンテンツ内広告表示方法
US8453284B2 (en) * 2007-02-06 2013-06-04 Zodiac Pool Care South Africa (Pty) Limited Swimming pool cleaner
US8024433B2 (en) 2007-04-24 2011-09-20 Osr Open Systems Resources, Inc. Managing application resources
US7949693B1 (en) 2007-08-23 2011-05-24 Osr Open Systems Resources, Inc. Log-structured host data storage
US20100169092A1 (en) * 2008-11-26 2010-07-01 Backes Steven J Voice interface ocx
US8307891B2 (en) * 2009-01-28 2012-11-13 Baker Hughes Incorporated Retractable downhole backup assembly for circumferential seal support
US8134733B2 (en) * 2009-04-24 2012-03-13 Xerox Corporation Pre-concatenation execution method and system for automated prepress process nodes
CN102122284B (zh) 2010-01-08 2014-07-02 腾讯科技（深圳）有限公司 一种复合文档存储、读写方法和装置
US9965224B2 (en) * 2010-02-24 2018-05-08 Veritas Technologies Llc Systems and methods for enabling replication targets to reclaim unused storage space on thin-provisioned storage systems
US9430470B2 (en) * 2010-05-26 2016-08-30 Content Catalyst Limited Automated report service tracking system and method
US8769392B2 (en) * 2010-05-26 2014-07-01 Content Catalyst Limited Searching and selecting content from multiple source documents having a plurality of native formats, indexing and aggregating the selected content into customized reports
US8843814B2 (en) * 2010-05-26 2014-09-23 Content Catalyst Limited Automated report service tracking system and method
US10911550B2 (en) 2010-11-09 2021-02-02 Microsoft Technology Licensing, Llc Partial loading and editing of documents from a server
US10338947B2 (en) 2011-03-15 2019-07-02 Microsoft Technology Licensing, Llc Extent virtualization
US8903874B2 (en) 2011-11-03 2014-12-02 Osr Open Systems Resources, Inc. File system directory attribute correction
US8868531B2 (en) * 2012-09-10 2014-10-21 Apple Inc. Concurrent access methods for tree data structures
US9830329B2 (en) 2014-01-15 2017-11-28 W. Anthony Mason Methods and systems for data storage
US10437564B1 (en) 2016-09-16 2019-10-08 Software Tree, LLC Object mapping and conversion system
DE102018126546A1 (de) * 2017-12-22 2019-06-27 Odass Gbr Verfahren zur Reduzierung der Rechenzeit einer Datenverarbeitungseinrichtung
US10997153B2 (en) * 2018-04-20 2021-05-04 Hewlett Packard Enterprise Development Lp Transaction encoding and transaction persistence according to type of persistent storage
US11243703B2 (en) 2018-04-27 2022-02-08 Hewlett Packard Enterprise Development Lp Expandable index with pages to store object records

Family Cites Families (37)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4536837A (en) * 1982-05-25 1985-08-20 Elxsi Improved disk file allocation and mapping system utilizing cylinder control blocks and file map having unbalanced tree structure
US4723209A (en) * 1984-08-30 1988-02-02 International Business Machines Corp. Flow attribute for text objects
US4739477A (en) * 1984-08-30 1988-04-19 International Business Machines Corp. Implicit creation of a superblock data structure
JPS6410353A (en) * 1987-07-03 1989-01-13 Hitachi Ltd Computer file system
US4899299A (en) * 1987-12-23 1990-02-06 International Business Machines Corporation Method for managing the retention of electronic documents in an interactive information handling system
JPH01237757A (ja) * 1987-12-23 1989-09-22 Internatl Business Mach Corp <Ibm> 情報処理システム中の文書オブジエクトを検索する方法
JPH01211067A (ja) * 1988-02-19 1989-08-24 Hitachi Ltd 文書編集装置
US4953080A (en) * 1988-04-25 1990-08-28 Hewlett-Packard Company Object management facility for maintaining data in a computer system
US4933880A (en) * 1988-06-15 1990-06-12 International Business Machines Corp. Method for dynamically processing non-text components in compound documents
US5359708A (en) * 1988-06-15 1994-10-25 International Business Machines Corp. Dynamic in a document processing system for dynamically locating format controls and determining formatting information in effect before and after each format control
JPH0277872A (ja) * 1988-09-14 1990-03-16 Hitachi Ltd 文書処理プログラムを格納した記憶媒体と文書処理装置
US4907151A (en) * 1988-09-30 1990-03-06 Digital Equipment Corporation System and method for garbage collection with ambiguous roots
US5029125A (en) * 1989-03-07 1991-07-02 Drexler Technology Corporation Method of reading and writing files on nonerasable storage media
US5339392A (en) * 1989-07-27 1994-08-16 Risberg Jeffrey S Apparatus and method for creation of a user definable video displayed document showing changes in real time data
US5371885A (en) * 1989-08-29 1994-12-06 Microsoft Corporation High performance file system
US5247520A (en) * 1989-10-13 1993-09-21 International Business Machines Corporation Communications architecture interface
JPH03232029A (ja) * 1989-12-08 1991-10-16 Fuji Photo Film Co Ltd メモリカードの記憶管理方式
GB9005697D0 (en) * 1990-03-14 1990-05-09 Digital Equipment Int Data format conversion
US5535319A (en) * 1990-04-13 1996-07-09 International Business Machines Corporation Method of creating and detecting device independent controls in a presentation data stream
US5297279A (en) * 1990-05-30 1994-03-22 Texas Instruments Incorporated System and method for database management supporting object-oriented programming
US5317730A (en) * 1991-01-11 1994-05-31 International Business Machines Corporation System for modifying persistent database based upon set of data elements formed after selective insertion or deletion
JPH04275684A (ja) * 1991-03-01 1992-10-01 Fuji Xerox Co Ltd 図形情報データベース構築方法およびその方法が適用される装置
US5269019A (en) * 1991-04-08 1993-12-07 Storage Technology Corporation Non-volatile memory storage and bilevel index structure for fast retrieval of modified records of a disk track
US5448727A (en) * 1991-04-30 1995-09-05 Hewlett-Packard Company Domain based partitioning and reclustering of relations in object-oriented relational database management systems
US5243518A (en) * 1991-05-03 1993-09-07 Xerox Corporation Document services architecture
US5349658A (en) * 1991-11-01 1994-09-20 Rourke Thomas C O Graphical user interface
US5335290A (en) * 1992-04-06 1994-08-02 Ricoh Corporation Segmentation of text, picture and lines of a document image
US5479656A (en) * 1992-05-13 1995-12-26 Rawlings, Iii; Joseph H. Method and system for maximizing data files stored in a random access memory of a computer file system and optimization therefor
US5423034A (en) * 1992-06-10 1995-06-06 Cohen-Levy; Leon Network file management with user determined hierarchical file structures and means for intercepting application program open and save commands for inputting and displaying user inputted descriptions of the location and content of files
CA2099916C (fr) * 1992-07-06 2002-12-24 Steven J. Sinofsky Methode et systeme pour organiser la structure interne d'un fichier
JP3613401B2 (ja) * 1992-07-06 2005-01-26 マイクロソフト コーポレーション オブジェクトの名称を付けて結び付ける方法及びシステム
US5506983A (en) * 1992-07-06 1996-04-09 Microsoft Corporation Method and system for transactioning of modifications to a tree structured file
US5515536A (en) * 1992-11-13 1996-05-07 Microsoft Corporation Method and system for invoking methods of an object through a dispatching interface
WO1994014115A2 (fr) * 1992-12-01 1994-06-23 Microsoft Corporation Procede et systeme d'interaction sur place avec des objets integres
US5537526A (en) * 1993-11-12 1996-07-16 Taugent, Inc. Method and apparatus for processing a display document utilizing a system level document framework
US5467472A (en) * 1994-04-15 1995-11-14 Microsoft Corporation Method and system for generating and maintaining property sets with unique format identifiers
US5608909A (en) * 1994-04-15 1997-03-04 Microsoft Corporation Method and system for caching presentation data of a source object in a presentation cache

Also Published As

Publication number Publication date
US5506983A (en) 1996-04-09
CA2320674C (fr) 2004-04-27
JP2004355660A (ja) 2004-12-16
EP0892355A1 (fr) 1999-01-20
DE69324410T2 (de) 1999-08-05
CA2099911A1 (fr) 1994-01-07
DE69332672D1 (de) 2003-03-06
DE69332672T2 (de) 2003-07-10
EP0578204A2 (fr) 1994-01-12
EP1006457A3 (fr) 2009-11-25
CA2099911C (fr) 2001-11-27
JP4318305B2 (ja) 2009-08-19
CA2320674A1 (fr) 1994-01-07
EP1006456A2 (fr) 2000-06-07
EP1006457A2 (fr) 2000-06-07
ATE231997T1 (de) 2003-02-15
US5715441A (en) 1998-02-03
ATE179003T1 (de) 1999-04-15
JP2005018803A (ja) 2005-01-20
EP0578204A3 (fr) 1994-03-23
EP0892355B1 (fr) 2003-01-29
JP3984983B2 (ja) 2007-10-03
CA2320675A1 (fr) 1994-01-07
KR940006025A (ko) 1994-03-22
JPH06161849A (ja) 1994-06-10
KR100287046B1 (ko) 2001-04-16
US5706504A (en) 1998-01-06
CA2320675C (fr) 2004-04-13
DE69324410D1 (de) 1999-05-20
EP1006456A3 (fr) 2009-12-02
JP3672582B2 (ja) 2005-07-20

Similar Documents

Publication Publication Date Title
EP0578204B1 (fr) Procédé pour stocker des objets
US5537592A (en) System and method for reading and writing disks formatted for an operating system foreign to the host computer
US5664178A (en) Method and system for organizing internal structure of a file
US5870764A (en) Method of managing a data structure for concurrent serial and parallel revision of a work
US5008820A (en) Method of rapidly opening disk files identified by path names
US6826582B1 (en) Method and system for using file systems for content management
US6453383B1 (en) Manipulation of computer volume segments
US8204871B1 (en) Extended file mapping cache for fast input-output
US8341123B2 (en) Event structured file system (ESFS)
US20080154840A1 (en) Methods of processing files in a multiple quality of service file system
JPH04504018A (ja) 消去不可能な記憶媒体上にファイルを読出しかつ書込む方法
US4855907A (en) Method for moving VSAM base clusters while maintaining alternate indices into the cluster
WO2007085083A1 (fr) Système de fichiers structuré par événements
Howells Fs-cache: A network filesystem caching facility
US20210342293A1 (en) Pointer-based dynamic data structures in key-value stores
US6405217B1 (en) State-based implementation of transactions on a file system
Stuart An O (1) Method for Storage Snapshots
RU105770U1 (ru) Архитектура для хранения и представления данных в эмуляторе
Howell et al. Integrating the Spiralog File System into the OpenVMS operating system

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH DE DK ES FR GB GR IE IT LI LU MC NL PT SE

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

RIN1 Information on inventor provided before grant (corrected)

Inventor name: WILLIAMS, ANTONY S.

Inventor name: TILLES, ALEXANDER G.

Inventor name: LJUBICICH, PHILIP

Inventor name: LAFORNARA, PHILIP J.

Inventor name: BLISS, ANDREW L.

Inventor name: ATKINSON, ROBERT G.

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): AT BE CH DE DK ES FR GB GR IE IT LI LU MC NL PT SE

17P Request for examination filed

Effective date: 19940909

GRAG Despatch of communication of intention to grant

Free format text: ORIGINAL CODE: EPIDOS AGRA

17Q First examination report despatched

Effective date: 19980527

GRAG Despatch of communication of intention to grant

Free format text: ORIGINAL CODE: EPIDOS AGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE CH DE DK ES FR GB GR IE IT LI LU MC NL PT SE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: THE PATENT HAS BEEN ANNULLED BY A DECISION OF A NATIONAL AUTHORITY

Effective date: 19990414

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 19990414

Ref country code: LI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 19990414

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 19990414

Ref country code: GR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990414

Ref country code: ES

Free format text: THE PATENT HAS BEEN ANNULLED BY A DECISION OF A NATIONAL AUTHORITY

Effective date: 19990414

Ref country code: CH

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 19990414

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 19990414

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 19990414

REF Corresponds to:

Ref document number: 179003

Country of ref document: AT

Date of ref document: 19990415

Kind code of ref document: T

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 69324410

Country of ref document: DE

Date of ref document: 19990520

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990706

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990706

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 19990714

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 19990714

ET Fr: translation filed
NLV1 Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act
REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20000131

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

REG Reference to a national code

Ref country code: GB

Ref legal event code: IF02

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20120704

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20120704

Year of fee payment: 20

Ref country code: FR

Payment date: 20120719

Year of fee payment: 20

REG Reference to a national code

Ref country code: DE

Ref legal event code: R071

Ref document number: 69324410

Country of ref document: DE

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20130705

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20130709

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20130705

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20150312 AND 20150318