|Publication number||US5043876 A|
|Application number||US 07/199,437|
|Publication date||Aug 27, 1991|
|Filing date||May 27, 1988|
|Priority date||May 27, 1988|
|Also published as||EP0348614A2, EP0348614A3|
|Publication number||07199437, 199437, US 5043876 A, US 5043876A, US-A-5043876, US5043876 A, US5043876A|
|Inventors||Charles R. Terry|
|Original Assignee||International Business Machines Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (16), Non-Patent Citations (3), Referenced by (120), Classifications (10), Legal Events (5)|
|External Links: USPTO, USPTO Assignment, Espacenet|
1. Field of the Invention
The present invention generally relates to improvements in data processing systems supporting shared files and, more particularly, to a process which allows direct and immediate access of a file by one or more readers while the file is being updated by an updater.
2. Description of the Prior Art
In large data processing systems running a data base application program there are typically multiple users which are simultaneously accessing files of the data base. Moreover, a single file of the data base may be simultaneously accessed by more than one user. Such multiple access of a single file is permitted where each of the users are merely reading the file. There is a problem, however, where one of the users accesses the file for purposes of editing or updating the file. In such a case, the updater locks out other users until the update is completed or committed. This can cause significant delays to those users who need to access the file to perform a read operation.
In such a shared file environment, it is desirable that multiple users be permitted to read a file that is being updated concurrently. The readers should not have to wait on the updater of the file nor should they see any updates being made until the unit of work containing the updates is committed. Thus, each reader that opens a file would see the latest committed level of the file.
It is therefore an object of the present invention to provide a shared file environment in which multiple users may read a file that is being updated concurrently.
It is a further object of the invention to provide a process for maintaining N level shadows for a file to allow multiple users to read a file even though that file may be updated by one or more updaters in succession.
According to the invention, a reader of a file does not need to wait on an updater of the file nor does the reader see any updates as they are being made. Each reader that opens the file will see the latest committed level of the file; that is, if reader A opens the file for read before updater B commits his changes, then there will exist one level shadow for the file after B commits. Further, the invention contemplates a process of maintaining N level shadows for a file, although in the preferred implementation of the invention, only one updater of a file is allowed at a time.
The invention introduces a new construct, referred to as the Not Available Yet (NAY) structure, which contains entries for all files that are currently open for read. More particularly, the NAY structure has an entry for each level of a file that is open for read. A counter associated with the entry indicates the number of readers of that level of the file. These entries are anchors for a list of block numbers of shadow blocks that cannot be unallocated because there is at least one reader of that level. The invention contemplates a logging procedure of allocation and unallocation of blocks to track the N-level shadow blocks.
The foregoing and other objects, aspects and advantages of the invention will be better understood from the following detailed description of a preferred embodiment of the invention with reference to the drawings, in which:
FIG. 1 is a block diagram showing the form of description of a file in an entry in a Shared File System catalog called OBJECTCAT;
FIG. 2 block diagram showing the Not Available Yet (NAY) construct;
FIG. 3 is a flow diagram showing the logic of the block allocation/unallocation process according to the invention;
FIG. 4 is a flow diagram showing the logic of the commit process according to the invention; and
FIG. 5 is a flow diagram showing the logic of the close process according to the invention.
In order to describe the method used to achieve N-level file shadowing according to the invention, some constructs used within the shared file system must be described.
The description of a file exists in a shared file system catalog called OBJECTCAT. An OBJECTCAT entry is illustrated in FIG. 1, and there is an entry of this type for each file that exists in the shared file system. Within the entry are the block numbers 10 on disk where the file data resides. The block numbers are an internal referencing mechanism used to locate a 4K block on a given physical direct access storage device (DASD) managed by the shared file system. This mechanism is not relevant to the subject invention but is conventional and, therefore, is not described. The block numbers within an entry for a file are stored in logical file block sequence; that is, the first entry corresponds to the first block of the file, the second entry corresponds to the second block, and so on.
When a unit of work updates a file, those file blocks are not updated in place. Instead, another block is allocated to contain the updates. The original blocks of the file are referred to as shadow blocks. When the updater commits his changes, the shadow blocks are unallocated and the OBJECTCAT entry is updated to reflect the updated block numbers.
Associated with the file entry in OBJECTCAT is a commit level 12 for the file. This contains the latest committed level of the file; that is, each time the file is updated, the commit level of the file is incremented during commit processing.
A Not Available Yet (NAY) structure, illustrated in FIG. 2, contains entries for all files that are currently open for read. It actually has an entry for each level of a file that is open for read. There is a counter associated with the entry to indicate the number of readers of that level of the file. These entries are anchors for a list of block numbers of shadow blocks that cannot be unallocated because there because there is at least one reader of that level.
The NAY structure illustrated in FIG. 2 consists of a set of equal size control blocks that can be one of the following:
1. A NAY header block (NAYHBLK) 22,
2. A NAYGATE 24 which identifies the file/commit level that is currently opened for read, or
3. A NAYPBNE 26 which contains the physical block number of the block that has been modified by an updater but is still being read by this reader.
There is only one NAYHBLK 22. This control block is the anchor for a free queue of unused NAY blocks (NAYBLKs) 27. There is also a hash table (NAYHASHT) 28 which optimizes access to the NAY structure when searching for a file that is open for read.
The recovery process consists of logging block allocations and unallocations. The user data of the file is not logged. Allocations are logged as they occur, but the unallocations are logged as part of the commit log record. This is done at that time to ensure that the blocks are available in case the work unit rolls back.
Also part of the recovery process is checkpoint. A checkpoint takes a snapshot of the system regardless of the state of the work units in progress. The fact that a checkpoint has been taken is recorded in the log. When the shared file system is restarted after shutdown, whether expected or unexpected, the system will appear as it did at the last checkpoint. The log is synchronized to that point via the checkpoint log record and recovery processing will begin from that point.
In order to maintain consistency of file data, a second block is allocated to contain updates to a file by a logical unit of work. When the updates are committed, the OBJECTCAT entry (see FIG. 1) for the file is updated with the block numbers containing the updates and the shadow block (the last committed picture of the block) is released. Also, the commit level for the file is incremented.
If the file was never shared by readers and updaters, then the processing would be quite simple. When the file is opened and the file blocks are retrieved, the block numbers to the data would be obtained from the OBJECTCAT entry, and the data read from DASD. When the file blocks are updated and written back, second blocks are allocated for the updated file blocks, and those block numbers replace the corresponding OBJECTCAT entries. But things are not simple in the shared environment.
When a file is opened for read, a copy of the OBJECTCAT entry for the file is cached. Also, an entry is made in the new construct called the Not Available Yet (NAY) structure, shown in FIG. 2, indicating that this level of the file has been opened for read. An updater of a file also has a copy of the OBJECTCAT entry cached but no entry is made in the NAY structure. Now the system has a record of all readers of any level of any file. It uses this list to maintain that level of the file until all readers of that level have closed the file.
The updater of the latest level (always the latest because there can be only one updater at a time) commits the updates, the OBJECTCAT entry for the file will be updated to reflect the new block numbers containing the updates and the commit level of the file will be incremented. The commit process will check to see if there are any readers of the prior level of the file by interrogating the NAY structure. If there are readers of that level, the shadow blocks (the previous version) will be chained from the NAY entry for that file level and not released at this time. When the last reader of the file closes, the close processing will delete the NAY structure entry for this level of the file and if there are any blocks chained from the entry, it will unallocate them.
It should be mentioned that blocks that are allocated and unallocated are logged in the shared file system log as part of the logging performed for the unit of work. New block allocations are logged as new record types and block releases are logged as part of the commit log record. The reason for not releasing blocks until commit is to maintain file consistency in case the unit of work rolls back. Otherwise, the blocks may be allocated to other updated files. If the unit of work does roll back, the newly allocated blocks are released (by reading the log) and the shadow blocks are left allocated.
Another consideration to be made is the interaction with multiple levels of a file and the shared file system checkpoint process. As stated in the description of the recovery process, a checkpoint takes a snapshot of the system regardless of any units of work in progress. Now we do not want to record the fact that there are blocks still allocated due to readers of a file as those readers will not exist after restart and there would be no way to unallocate those blocks. Thus, the checkpoint process will interrogate the NAY structure and record in its picture that these blocks are unallocated.
Another new construct that is employed in this process is a list of block numbers that have been released due to updates. These lists are anchored from a table containing entries for each file and level updated by the unit of work. Thus, for each block unallocated for any file being updated by the unit of work, the table is scanned for the proper file entry and the block number is added to the appropriate list. This centralized all the blocks to be released for efficient processing by the commit process.
The logic of the processes described are illustrated in the flow diagrams of FIGS. 3, 4 and 5. Beginning with FIG. 3, the block allocation/unallocation process begins by writing an updated block in function block 30. A test is made in decision block 31 to determine if this is the first time this block has been updated. If not, the updated block is written in function block 32 and the process ends. However, if this is the first time the block is updated, then a new block is allocated in function block 33. The updated block is written to the new block in function block 34, and then the old block number is entered on the unallocated list in function block 35 before the process ends.
FIG. 4 shows the commit process which begins by making a test in decision block 40 to determine if there are any unallocated list entries. If not, the user is determined to be a reader only, and the process ends. Assuming that there are unallocated list entries, a test is made in decision block 41 to determine if there are any readers. If not, the old blocks are unallocated in function block 42 and control goes to function block 44; otherwise, old block numbers are added to the NAY structure in function block 43 before control goes to function block 44. In function block 44, the old block numbers are logged. Then, in function block 45, OBJECTCAT is updated with block numbers, and in function block 46, the commit level is incremented before the process ends.
The close process is illustrated in FIG. 5 and begins by testing in decision block 50 to determine if the user is a reader. If not, the process ends; otherwise, a test is made in decision block 51 to determine if the reader is the last reader of the file. If not, the process ends; otherwise, a test is made in decision block 52 to determine if the file has been updated. If not, the process ends; otherwise, the old blocks are unallocated in function block 53 before the process ends.
The following pseudocode, written in Program Design Language (PDL), implements the detailed logic illustrated in the flow diagrams of FIGS. 3, 4 and 5 required to maintain the N-level shadowing according to the invention. A programmer skilled in the art can write source code from the pseudocode in any programming language, such as Pascal or C, from which object code may be derived by a suitable compiler.
______________________________________OPEN FOR READ PROCESSINGHash FILEID and COMMIT LEVEL for the fileIf NAYHASHT entry = EMPTY, ThenDoAcquire NAYBLOCK from NAYFREEL (freelist)Build NAYGATE consisting of FILEID/COMMITLEVELChain to NAYHASHT entryEndElseDoScan NAYGATES chained from NAYHASHT entryIf NAYGATE for FILEID/COMMIT LEVEL notfound, ThenDoAcquire NAYBLOCK from NAYHASHT entryBuild NAYGATE consisting of FILEID/COMMITLEVELChain to NAYHASHT entryEndElse (NAYGATE found)Increment open count in NAYGATEEndWRITE BLOCK PROCESSINGIf the block is being updated for the firsttime in this unit of work, ThenDoAllocate a new block to contain updatesLog block numberAdd old block number to UNALLOCATE LIST (tobe unallocated at COMMIT)Store the newly allocated block number inthe cached OBJECTCAT for the file to beupdated at COMMITEndNote: The UNALLOCATE LIST is organized by FILEID/COMMIT LEVEL. Block numbers are chained to theirappropriate file entry.CLOSE FOR READ PROCESSINGDecrement open count in NAYGATEIf open count = 0, ThenDoUnallocate blocks chained to NAYGATEReturn NAYBLOCKs to NAYFREEL (freelist)EndCOMMIT PROCESSINGFor each file entry in the UNALLOCATE LISTDoHash FILEID and COMMIT LEVELIf NAYHASHT entry = empty, Then (case forno readers)DoUnallocate blocks in UNALLOCATE LISTentryEndElseDo for each update blockAcquire a NAYBLOCK of NAYFREEL (freelist)for NAYPBNEStore block number in the NAYPBNEChain off NAYGATEEndLog block numbers in COMMIT log recordUpdate OBJECTCAT for this file with newblock numbers and increment commit level(so new readers will see updates)EndCHECKPOINT PROCESSINGScan NAY structureFor each NAYPBNEDoUnallocate block in checkpointed copy ofblock allocation mapEnd______________________________________
While the invention has been described in terms of a single preferred embodiment, those skilled in the art will recognize that the invention can be practiced with modification within the spirit and scope of the appended claims.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4399504 *||Oct 6, 1980||Aug 16, 1983||International Business Machines Corporation||Method and means for the sharing of data resources in a multiprocessing, multiprogramming environment|
|US4400773 *||Dec 31, 1980||Aug 23, 1983||International Business Machines Corp.||Independent handling of I/O interrupt requests and associated status information transfers|
|US4432057 *||Nov 27, 1981||Feb 14, 1984||International Business Machines Corporation||Method for the dynamic replication of data under distributed system control to control utilization of resources in a multiprocessing, distributed data base system|
|US4480304 *||Oct 6, 1980||Oct 30, 1984||International Business Machines Corporation||Method and means for the retention of locks across system, subsystem, and communication failures in a multiprocessing, multiprogramming, shared data environment|
|US4498145 *||Jun 30, 1982||Feb 5, 1985||International Business Machines Corporation||Method for assuring atomicity of multi-row update operations in a database system|
|US4558413 *||Nov 21, 1983||Dec 10, 1985||Xerox Corporation||Software version management system|
|US4627019 *||Jul 8, 1982||Dec 2, 1986||At&T Bell Laboratories||Database management system for controlling concurrent access to a database|
|US4646229 *||Nov 15, 1982||Feb 24, 1987||At&T Bell Laboratories||Time-ordered data base|
|US4648036 *||Mar 6, 1985||Mar 3, 1987||At&T Bell Laboratories||Method for controlling query and update processing in a database system|
|US4714992 *||Nov 26, 1985||Dec 22, 1987||International Business Machines Corporation||Communication for version management in a distributed information service|
|US4716528 *||Feb 3, 1986||Dec 29, 1987||International Business Machines Corporation||Method for managing lock escalation in a multiprocessing, multiprogramming environment|
|US4823310 *||Aug 10, 1987||Apr 18, 1989||Wang Laboratories, Inc.||Device for enabling concurrent access of indexed sequential data files|
|US4853843 *||Dec 18, 1987||Aug 1, 1989||Tektronix, Inc.||System for merging virtual partitions of a distributed database|
|US4875159 *||Dec 22, 1987||Oct 17, 1989||Amdahl Corporation||Version management system using plural control fields for synchronizing two versions of files in a multiprocessor system|
|US4914569 *||Oct 30, 1987||Apr 3, 1990||International Business Machines Corporation||Method for concurrent record access, insertion, deletion and alteration using an index tree|
|WO1984000426A1 *||Jan 24, 1983||Feb 2, 1984||Western Electric Co||Database management system for controlling concurrent access to a database|
|1||Carey, J. J., "Improving the Performance of an Optimistic Concurrency Control Algorithm Through Timestampe & Versions", Jun. 1987, IEEE Transactions on Software Engineering, vol. SE-13, No. 6.|
|2||*||Carey, J. J., Improving the Performance of an Optimistic Concurrency Control Algorithm Through Timestampe & Versions , Jun. 1987, IEEE Transactions on Software Engineering, vol. SE 13, No. 6.|
|3||*||IBM Tech. Disclosure Bull., vol. 28, No. 3, Aug. 1985, A. M. Herzik et al., pp. 942 to 947.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US5276871 *||Mar 18, 1991||Jan 4, 1994||Bull Hn Information Systems Inc.||Method of file shadowing among peer systems|
|US5280612 *||Nov 26, 1991||Jan 18, 1994||International Business Machines Corporation||Multiple version database concurrency control system|
|US5317749 *||Sep 25, 1992||May 31, 1994||International Business Machines Corporation||Method and apparatus for controlling access by a plurality of processors to a shared resource|
|US5355477 *||Dec 23, 1991||Oct 11, 1994||International Business Machines Corporation||Method for updating a block using record-level locks by committing the update if the block has not been updated by another process otherwise spinning|
|US5408653 *||Apr 15, 1992||Apr 18, 1995||International Business Machines Corporation||Efficient data base access using a shared electronic store in a multi-system environment with shared disks|
|US5469567 *||Mar 16, 1992||Nov 21, 1995||Nec Corporation||System for secondary database data block buffering with block save generations and read/write access and with separate management|
|US5479615 *||Dec 8, 1992||Dec 26, 1995||Nec Corporation||Buffer asynchronous output apparatus capable of referring to or renewing a previously renewed buffer area by another renewal processing program|
|US5504857 *||Mar 4, 1993||Apr 2, 1996||International Business Machines||Highly available fault tolerant relocation of storage with atomicity|
|US5511177 *||May 27, 1994||Apr 23, 1996||Hitachi, Ltd.||File data multiplexing method and data processing system|
|US5555388 *||Aug 20, 1992||Sep 10, 1996||Borland International, Inc.||Multi-user system and methods providing improved file management by reading|
|US5557792 *||Jan 3, 1995||Sep 17, 1996||International Business Machines Corporation||Efficient data base access using a shared electronic store in a multi-system environment with shared disks|
|US5586219 *||Sep 30, 1994||Dec 17, 1996||Yufik; Yan M.||Probabilistic resource allocation system with self-adaptive capability|
|US5664186 *||May 8, 1995||Sep 2, 1997||International Business Machines Corporation||Computer file management and backup system|
|US5692178 *||Jul 16, 1996||Nov 25, 1997||Borland International, Inc.||System and methods for improved file management in a multi-user environment|
|US5729735 *||Feb 8, 1995||Mar 17, 1998||Meyering; Samuel C.||Remote database file synchronizer|
|US5761660 *||Aug 1, 1996||Jun 2, 1998||International Business Machines Corporation||Computer program product and program storage device for database access using a shared electronic store in a multi-system environment having shared disks|
|US5794224 *||Sep 29, 1995||Aug 11, 1998||Yufik; Yan M.||Probabilistic resource allocation system with self-adaptive capability|
|US5819292 *||May 31, 1995||Oct 6, 1998||Network Appliance, Inc.||Method for maintaining consistent states of a file system and for creating user-accessible read-only copies of a file system|
|US5878434 *||Jul 18, 1996||Mar 2, 1999||Novell, Inc||Transaction clash management in a disconnectable computer and network|
|US5893086 *||Jul 11, 1997||Apr 6, 1999||International Business Machines Corporation||Parallel file system and method with extensible hashing|
|US5917998 *||Jul 26, 1996||Jun 29, 1999||International Business Machines Corporation||Method and apparatus for establishing and maintaining the status of membership sets used in mirrored read and write input/output without logging|
|US5940838 *||Jul 11, 1997||Aug 17, 1999||International Business Machines Corporation||Parallel file system and method anticipating cache usage patterns|
|US5940841 *||Jul 11, 1997||Aug 17, 1999||International Business Machines Corporation||Parallel file system with extended file attributes|
|US5946686 *||Jul 11, 1997||Aug 31, 1999||International Business Machines Corporation||Parallel file system and method with quota allocation|
|US5950199 *||Jul 11, 1997||Sep 7, 1999||International Business Machines Corporation||Parallel file system and method for granting byte range tokens|
|US5956734 *||Jul 11, 1997||Sep 21, 1999||International Business Machines Corporation||Parallel file system with a quota check utility|
|US5960446 *||Jul 11, 1997||Sep 28, 1999||International Business Machines Corporation||Parallel file system and method with allocation map|
|US5963963 *||Jul 11, 1997||Oct 5, 1999||International Business Machines Corporation||Parallel file system and buffer management arbitration|
|US5974424 *||Jul 11, 1997||Oct 26, 1999||International Business Machines Corporation||Parallel file system and method with a metadata node|
|US5987477 *||Jul 11, 1997||Nov 16, 1999||International Business Machines Corporation||Parallel file system and method for parallel write sharing|
|US5991771 *||Jul 18, 1996||Nov 23, 1999||Novell, Inc.||Transaction synchronization in a disconnectable computer and network|
|US5999976 *||Jul 11, 1997||Dec 7, 1999||International Business Machines Corporation||Parallel file system and method with byte range API locking|
|US6021508 *||Jul 11, 1997||Feb 1, 2000||International Business Machines Corporation||Parallel file system and method for independent metadata loggin|
|US6032216 *||Jul 11, 1997||Feb 29, 2000||International Business Machines Corporation||Parallel file system with method using tokens for locking modes|
|US6175837||Jun 29, 1998||Jan 16, 2001||Sun Microsystems, Inc.||Object-relational mapping toll that processes views|
|US6192365||Jul 18, 1996||Feb 20, 2001||Novell, Inc.||Transaction log management in a disconnectable computer and network|
|US6240413 *||Jun 29, 1998||May 29, 2001||Sun Microsystems, Inc.||Fine-grained consistency mechanism for optimistic concurrency control using lock groups|
|US6260040||Jan 5, 1998||Jul 10, 2001||International Business Machines Corporation||Shared file system for digital content|
|US6268850||Jun 29, 1998||Jul 31, 2001||Sun Microsystems, Inc.||User interface for the specification of lock groups|
|US6289356 *||Sep 14, 1998||Sep 11, 2001||Network Appliance, Inc.||Write anywhere file-system layout|
|US6317844||Mar 10, 1998||Nov 13, 2001||Network Appliance, Inc.||File server storage arrangement|
|US6343984||Nov 30, 1998||Feb 5, 2002||Network Appliance, Inc.||Laminar flow duct cooling system|
|US6360223||Jun 29, 1998||Mar 19, 2002||Sun Microsystems, Inc.||Rule-based approach to object-relational mapping strategies|
|US6374256||Jun 29, 1998||Apr 16, 2002||Sun Microsystems, Inc.||Method and apparatus for creating indexes in a relational database corresponding to classes in an object-oriented application|
|US6385618||Jun 29, 1998||May 7, 2002||Sun Microsystems, Inc.||Integrating both modifications to an object model and modifications to a database into source code by an object-relational mapping tool|
|US6411970 *||May 21, 1999||Jun 25, 2002||Intergraph Corporation||Methods and apparatus for an automatic file indexer|
|US6418456 *||Nov 24, 1998||Jul 9, 2002||International Business Machines Corporation||Clean-up of files in a network system|
|US6453337||Jan 12, 2001||Sep 17, 2002||Zaplet, Inc.||Methods and systems to manage and track the states of electronic media|
|US6457045||Jan 14, 2000||Sep 24, 2002||Zaplet, Inc.||System and method for group choice making|
|US6457130||Mar 3, 1998||Sep 24, 2002||Network Appliance, Inc.||File access control in a multi-protocol file server|
|US6463461||Oct 25, 1999||Oct 8, 2002||Zaplet, Inc.||System for communicating information among a group of participants|
|US6468150||Mar 30, 2001||Oct 22, 2002||Network Appliance, Inc.||Laminar flow duct cooling system|
|US6505233||Oct 25, 1999||Jan 7, 2003||Zaplet, Inc.||Method for communicating information among a group of participants|
|US6507865||Jan 14, 2000||Jan 14, 2003||Zaplet, Inc.||Method and system for group content collaboration|
|US6516351||Oct 21, 1998||Feb 4, 2003||Network Appliance, Inc.||Enforcing uniform file-locking for diverse file-locking protocols|
|US6523063||Jan 14, 2000||Feb 18, 2003||Zaplet, Inc.||Method system and program product for accessing a file using values from a redirect message string for each change of the link identifier|
|US6591275||Jun 2, 2000||Jul 8, 2003||Sun Microsystems, Inc.||Object-relational mapping for tables without primary keys|
|US6604118||Jul 31, 1998||Aug 5, 2003||Network Appliance, Inc.||File system image transfer|
|US6609133||Jan 5, 2001||Aug 19, 2003||Sun Microsystems, Inc.||Integrating both modifications to an object model and modifications to a database into source code by an object-relational mapping tool|
|US6636879||Aug 18, 2000||Oct 21, 2003||Network Appliance, Inc.||Space allocation in a write anywhere file system|
|US6665675||Sep 7, 2000||Dec 16, 2003||Omneon Video Networks||Shared file system having a token-ring style protocol for managing meta-data|
|US6668264||Apr 3, 2001||Dec 23, 2003||Network Appliance, Inc.||Resynchronization of a target volume with a source volume|
|US6691153||Jan 14, 2000||Feb 10, 2004||Zaplet, Inc.||Method and system for process interaction among a group|
|US6697846||Mar 20, 1998||Feb 24, 2004||Dataplow, Inc.||Shared file system|
|US6721764 *||Sep 11, 2001||Apr 13, 2004||Network Appliance, Inc.||Copy on write file system consistency and block usage|
|US6728922||Aug 18, 2000||Apr 27, 2004||Network Appliance, Inc.||Dynamic data space|
|US6763423||Nov 30, 2001||Jul 13, 2004||International Business Machines Corporation||Storage area network methods and apparatus for logical-to-physical block address mapping|
|US6871216||Sep 16, 2002||Mar 22, 2005||Zaplet, Inc.||Methods and systems to manage and track the states of electronic media|
|US7072916||Aug 18, 2000||Jul 4, 2006||Network Appliance, Inc.||Instant snapshot|
|US7076490 *||Oct 11, 2002||Jul 11, 2006||Electronics And Telecommunications Research Institute||Object-relational database management system and method for deleting class instance for the same|
|US7130885||Sep 5, 2001||Oct 31, 2006||Zaplet, Inc.||Methods and apparatus providing electronic messages that are linked and aggregated|
|US7165096||Dec 21, 2001||Jan 16, 2007||Data Plow, Inc.||Storage area network file system|
|US7174352||May 10, 2001||Feb 6, 2007||Network Appliance, Inc.||File system image transfer|
|US7293097||Aug 28, 2002||Nov 6, 2007||Network Appliance, Inc.||Enforcing uniform file-locking for diverse file-locking protocols|
|US7305393 *||Apr 29, 2003||Dec 4, 2007||International Business Machines Corporation||Mounted filesystem integrity checking and salvage|
|US7552197||Dec 12, 2006||Jun 23, 2009||Dataplow, Inc.||Storage area network file system|
|US7653664 *||Nov 3, 2006||Jan 26, 2010||Microsoft Corporation||Anchor for database synchronization excluding uncommitted transaction modifications|
|US7685169||Feb 14, 2005||Mar 23, 2010||Netapp, Inc.||Multiple concurrent active file systems|
|US7730033||Jun 13, 2003||Jun 1, 2010||Microsoft Corporation||Mechanism for exposing shadow copies in a networked environment|
|US7743111||Dec 16, 2003||Jun 22, 2010||Data Plow, Inc.||Shared file system|
|US7930326||Oct 3, 2007||Apr 19, 2011||Network Appliance, Inc.||Space allocation in a write anywhere file system|
|US7934056||Jan 15, 2008||Apr 26, 2011||International Business Machines Corporation||Allocating space on data storage devices in proportion to weights associated with the devices|
|US7962531||Feb 2, 2010||Jun 14, 2011||Netapp, Inc.||Multiple concurrent active file systems|
|US8122286||Jan 17, 2006||Feb 21, 2012||Netapp, Inc.||Technique for increasing the number of persistent consistency point images in a file system|
|US8131782 *||Sep 29, 2008||Mar 6, 2012||Hewlett-Packard Development Company, L.P.||Shadow directory structure in a distributed segmented file system|
|US8171000||Jul 11, 2007||May 1, 2012||International Business Machines Corporation||Mounted filesystem integrity checking and salvage|
|US8219639||May 28, 2009||Jul 10, 2012||Soltis Steven R||Storage area network file system|
|US8335903||Mar 21, 2008||Dec 18, 2012||Samsung Electronics Co., Ltd.||Method and system for processing access to disk block|
|US8521776||Dec 5, 2008||Aug 27, 2013||International Business Machines Corporation||Accessing data in a multi-generation database|
|US9009168||Feb 21, 2012||Apr 14, 2015||Netapp, Inc.||Technique for increasing the number of persistent consistency point images in a file system|
|US9098474||Aug 20, 2012||Aug 4, 2015||Box, Inc.||Preview pre-generation based on heuristics and algorithmic prediction/assessment of predicted user behavior for enhancement of user experience|
|US9117087||Feb 25, 2013||Aug 25, 2015||Box, Inc.||System and method for creating a secure channel for inter-application communication based on intents|
|US9396216||May 6, 2013||Jul 19, 2016||Box, Inc.||Repository redundancy implementation of a system which incrementally updates clients with events that occurred via a cloud-enabled platform|
|US9396245||Jan 2, 2014||Jul 19, 2016||Box, Inc.||Race condition handling in a system which incrementally updates clients with events that occurred in a cloud-based collaboration platform|
|US9495364||Oct 4, 2013||Nov 15, 2016||Box, Inc.||Enhanced quick search features, low-barrier commenting/interactive features in a collaboration platform|
|US9507795||Jan 13, 2014||Nov 29, 2016||Box, Inc.||Functionalities, features, and user interface of a synchronization client to a cloud-based environment|
|US9535924||Feb 28, 2014||Jan 3, 2017||Box, Inc.||Scalability improvement in a system which incrementally updates clients with events that occurred in a cloud-based collaboration platform|
|US9558202||Aug 27, 2013||Jan 31, 2017||Box, Inc.||Server side techniques for reducing database workload in implementing selective subfolder synchronization in a cloud-based environment|
|US9575981 *||Sep 14, 2012||Feb 21, 2017||Box, Inc.||Cloud service enabled to handle a set of files depicted to a user as a single file in a native operating system|
|US9633037||Jun 13, 2014||Apr 25, 2017||Box, Inc||Systems and methods for synchronization event building and/or collapsing by a synchronization component of a cloud-based platform|
|US9652741||Oct 26, 2011||May 16, 2017||Box, Inc.||Desktop application for access and interaction with workspaces in a cloud-based content management system and synchronization mechanisms thereof|
|US9665349||Oct 7, 2013||May 30, 2017||Box, Inc.||System and method for generating embeddable widgets which enable access to a cloud-based collaboration platform|
|US20020083120 *||Dec 21, 2001||Jun 27, 2002||Soltis Steven R.||Storage area network file system|
|US20030028607 *||Sep 16, 2002||Feb 6, 2003||Graham Miller||Methods and systems to manage and track the states of electronic media|
|US20030065796 *||Aug 28, 2002||Apr 3, 2003||Network Appliance, Inc.||Enforcing uniform file-locking for diverse file-locking protocols|
|US20030074371 *||Oct 11, 2002||Apr 17, 2003||Yoo-Mi Park||Object-relational database management system and method for deleting class instance for the same|
|US20040133570 *||Dec 16, 2003||Jul 8, 2004||Steven Soltis||Shared file system|
|US20040220932 *||Apr 29, 2003||Nov 4, 2004||Seeger James J||Mounted filesystem integrity checking and salvage|
|US20040254936 *||Jun 13, 2003||Dec 16, 2004||Microsoft Corporation||Mechanism for evaluating security risks|
|US20050182799 *||Feb 14, 2005||Aug 18, 2005||Network Appliance, Inc.||Multiple concurrent active file systems|
|US20070094354 *||Dec 12, 2006||Apr 26, 2007||Soltis Steven R||Storage area network file system|
|US20080028011 *||Oct 3, 2007||Jan 31, 2008||Network Appliance, Inc.||Space allocation in a write anywhere file system|
|US20080109494 *||Nov 3, 2006||May 8, 2008||Microsoft Corporation||Anchor for database synchronization excluding uncommitted transaction modifications|
|US20080126451 *||Jan 15, 2008||May 29, 2008||International Business Machines Corporation||Allocating space on data storage devices in proportion to weights associated with the devices|
|US20080235474 *||Mar 21, 2008||Sep 25, 2008||Samsung Electronics Co., Ltd.||Method and system for processing access to disk block|
|US20090240784 *||May 28, 2009||Sep 24, 2009||Soltis Steven R||Storage Area Network File System|
|US20100138394 *||Feb 2, 2010||Jun 3, 2010||David Hitz||Multiple concurrent active file systems|
|US20100145996 *||Dec 5, 2008||Jun 10, 2010||International Business Machines Corporation||Accessing Data in a Multi-Generation Database|
|US20130275398 *||Sep 14, 2012||Oct 17, 2013||Box, Inc.||Cloud service enabled to handle a set of files depicted to a user as a single file in a native operating system|
|WO1994029807A1 *||Jun 2, 1994||Dec 22, 1994||Network Appliance Corporation||Write anywhere file-system layout|
|U.S. Classification||707/649, 707/E17.007, 707/674, 707/999.201, 707/822|
|International Classification||G06F17/30, G06F12/00|
|Cooperative Classification||Y10S707/99952, G06F17/30168|
|May 27, 1988||AS||Assignment|
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, ARMON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNOR:TERRY, CHARLES R.;REEL/FRAME:004900/0762
Effective date: 19880520
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, A COR
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TERRY, CHARLES R.;REEL/FRAME:004900/0762
Effective date: 19880520
|Jan 10, 1995||FPAY||Fee payment|
Year of fee payment: 4
|Mar 23, 1999||REMI||Maintenance fee reminder mailed|
|Aug 29, 1999||LAPS||Lapse for failure to pay maintenance fees|
|Nov 9, 1999||FP||Expired due to failure to pay maintenance fee|
Effective date: 19990827