Source: https://patents.google.com/patent/US8805780B2/en
Timestamp: 2019-04-19 23:06:02+00:00

Document:
2014-05-29 Assigned to MICROSOFT CORPORATION reassignment MICROSOFT CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: PUDIPEDDI, RAVISANKAR V., ZBIKOWSKI, MARK J., GHOTGE, VISHAL V., HAVEWALA, SAROSH C., THIND, RAVINDER S.
2014-05-29 Assigned to MICROSOFT CORPORATION reassignment MICROSOFT CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: GOEBEL, DAVID A.
An extensible file system format for portable storage media is provided. The extensible file system format includes the specification of primary and secondary directory entry types that may be custom defined. The primary and secondary directory entry types can be further classified as critical and benign directory entries. The directory entry types can define whether a cluster chain corresponding to a file can be contiguously allocated.
This application is a continuation of U.S. application Ser. No. 13/006,063 filed Jan. 13, 2011, entitled “Extending Cluster Allocations In An Extensible File System” (now U.S. Pat. No. 8,452,729), which is a divisional of Ser. No. 11/752,872, filed May 23, 2007, entitled “Extending Cluster Allocations In An Extensible File System” (now U.S. Pat. No. 7,873,596), which claims the benefit of U.S. Provisional Application No. 60/802,922, entitled “Naming Protocol for Extensible File System,” filed May 23, 2006, each of which is incorporated herein by reference in its entirety.
Generally described, there are a number of portable computing devices, such as digital still cameras, digital video cameras, media players, mobile phones, mobile computing devices, personal digital assistants, and the like that maintain data on a storage media, such as a portable storage media. The continued development of more complex portable computing devices and larger storage capacity portable storage media places a greater demand for flexibility on the file system format used on the storage media. Current file system format approaches can become deficient in that they do not provide adequate flexibility for increasing storage size capacities and/or storage media applications.
In one embodiment, extensible file systems may be utilized in these embodiments to allow for increased storage size capacities and application to storage media application. In one embodiment of an extensible file system, data may be stored in allocated clusters within a file system. As the amount of data increases, the number of allocated clusters may also increase. Accordingly, in these embodiments, each new allocated cluster would likely be added as a new entry in the file system, such as an additional entry in a file allocation table. The additional allocation and management of each separate cluster in an allocation can become inefficient for file system management.
A computer-readable medium having computer-executable components for storing data is provided. The components include a boot parameters component for specifying boot parameters for a file system. The components also include a file allocation table component for defining a file allocation table associated with the file system. The components further include two or more primary directory entry components for specifying data in a root directory of the file system. At least one primary directory entry component includes a flag corresponding to an indication of a contiguous cluster chain. Finally, the components include at least one secondary entry component corresponding to the primary directory entry component and defining meta data associated with the primary directory entry component.
In accordance with another aspect, a method for managing data organized into a plurality of clusters is provided. In accordance with the method, a request for an extension of a plurality of clusters is obtained. A determination is made whether the set of clusters can be contiguously allocated. If the set of clusters can be contiguously allocated, a cluster chain size allocation is updated in accordance with the size of the request for the extension. If the set of clusters cannot be contiguously allocated, entries are made in the file allocation table for each cluster in the cluster chain.
FIG. 13 is a flow diagram of a cluster chain deletion routine for an extensible file system format in accordance with an aspect of the present invention.
Generally described, the present invention relates to an extensible file system format and various processes associated with the extensible file system format. In an illustrative embodiment, the extensible file system format corresponds to an extensible file system format for portable storage media and various processes associated with the extensible file system format on the portable storage media. More specifically, in an embodiment, processes and data structures are provided for facilitating the storage and management of file data in contiguous data clusters. Although the present invention will be described with regard to a portable storage media file system format, one skilled in the relevant art will appreciate that the disclosed embodiments are illustrative in nature and should not be construed as limiting. Additionally, one skilled in the relevant art will appreciate that the data structures and data layouts used in the illustrative examples may require additional information related to performance, security, and the like.
FIGS. 1A-1C are block diagrams illustrative of various operating environments 100 for the extensible file system format of the present invention. With reference to FIG. 1A, in an illustrative embodiment, the extensible file system format is utilized to store data from a computing device, such as a mobile computing device 102, and a storage media, such as a portable storage media 104. In an illustrative embodiment, the mobile computing device 102 can correspond to any one of a variety of computing devices, including but not limited to, portable computing devices, mobile telephones, personal digital assistants, music players, media players. The portable storage media can also include, but is not limited to, hard drives, flash media, micro-drives and other storage media. In an illustrative embodiment, the extensible file system on the portable storage media 104 does not have to include any type of executable or readable software components, such as an operating environment, utilized by the mobile computing device 102. Alternatively, the extensible file system on the portable storage media 104 may include executable or readable software components used by the mobile device 102.
In an illustrative embodiment, the mobile computing device 102 may be in communication with other computing devices for collecting/exchanging data to be stored on the portable storage media 104. With reference to FIG. 1B, the mobile computing device 102 may be in direct communication with another computing device 106 and storage media 108. In an illustrative embodiment, the direct communication can correspond to various wired and wireless communication methods. In an illustrative embodiment, the other storage media 108 is not required to be formatted in accordance with the extensible file system format of the present invention. With reference to FIG. 1C, in a similar manner, the mobile computing device 102 may also be in communication with another computing device 110 and storage media 112, via a network connection. In an illustrative embodiment, the network connection can correspond to local area network (LAN) and wide area network (WAN) connections.
With reference now to FIG. 2, an illustrative embodiment volume layout 200 for an extensible file system format will be described. The volume layout 200 includes a boot parameters component 202 that include various information related to a description of the file system parameters of the partition. In an illustrative embodiment, the boot parameters component 202 can include code for bootstrapping from a defined partition, fundamental file system parameters for the defined partition, and various error checking information. A data structure for defining at least a portion of the boot parameters will be described below with regard to FIG. 4.
The volume layout 200 also includes an extensible parameters component, designated as OEM parameters 204, that define various additional data structures used in conjunction with the file system. In an illustrative embodiment, an original equipment manufacture (OEM) may specify various extensible data structures, such as performance parameters for a storage medium, that can be defined at time of manufacture. The volume layout 200 can further include a file allocation table component 206 that defines file and directory allocations. In an illustrative embodiment, each entry in the file allocation table component 206 corresponds to a 32-bit entry that represents an allocated cluster, an unallocated cluster or an unusable cluster. As will be explained in greater detail below, in an illustrative embodiment, contiguously allocated clusters will not require a separate entry for each allocated cluster in the file allocation table component 206. The volume layout 200 can still further include series of file data components 208A-208X that correspond to the data stored according to the file system format. Various data structures for defining a portion of the file data components 208A-208X will be defined with regard to FIGS. 3-10.
Turning now to FIG. 3, in one aspect, the file data components 208 may include one or more directory entries according to a directory structure 300. In an illustrative embodiment, the directory structure 300 is organized into primary directory entries 302 and secondary directory entries 304. Each directory entry in the primary and secondary entries is typed. For example, in an illustrative embodiment, type values for the primary and secondary directory entries can correspond to a range of 1-255. Primary directory entries 302 correspond to the entries in the root directory of the file system. Secondary directory entries 304 follow a primary directory entry and are associated with the primary directory entry. Secondary directory entries extend the metadata associated with the correlated primary directory entry.
With continued reference to FIG. 3, in an illustrative embodiment, the primary directory entries 302 can be further classified as critical primary directory entries 306 and benign primary directory entries 308. Critical primary directory entries 306 define potentially different formats for each directory entry. In an illustrative embodiment, an operating environment will not mount a volume corresponding to the extensible file system format with an unknown critical primary directory entry, as will be described below. Examples of known primary directory entries 306 can include allocation bitmaps, up-case tables, volume labels, encryption keys, and normal directory entries. Benign primary directory entries 308 also define potential different formats for each directory entry, but can be ignored by the file system if a particular benign primary directory entry is not understood. Benign primary directory entries 308 can be associated with another cluster chain in the volume and can be contiguously allocated. For example, a contiguously allocated benign primary directory entry can be identified through the setting of a corresponding flag. Additionally, benign primary directory entries 308 can also be associated with a number of secondary directory entries 304.
In a manner similar to primary directory entries 302, secondary directory entries 304 may also be further classified as critical secondary directory entries 310 and benign secondary directory entries 312. As described above, the critical secondary directory entries 310 and benign secondary directory entries 312 are associated with a benign primary directory entry and extend the metadata associated with the primary directory entry. Both the critical secondary directory entries 310 and the benign secondary directory entries 312 can be associated with another cluster chain in the volume and can be contiguously allocated.
To mount a volume corresponding to the extensible file system format, the file system implements a mount volume procedure. In an illustrative embodiment, the mount volume procedure attempts to look at a version number for the volume. If the version number is not understood (e.g., the version number is higher), the volume will not be mounted. During a normal directory enumeration, any critical primary directory entries not known by the file system will prevent the volume from being mounted. Thereafter, various user-initiated processes, such as a file open, will cause the file system to enumerate the secondary directory entries. If the critical secondary directory entries 310 are not known by a file system, the entire directory entry will be skipped. Additionally, if benign secondary directory entries 312 are not known by the file system, the particular unknown benign secondary directory entry will be ignored.
With reference now to FIG. 4, a block diagram illustrative of data components 400 for implementing a boot process block in the boot parameters component 202 (FIG. 2) will be described. The data components 400 include an OEM name component 402 for specifying a name for the file system format of the storage media. The data components 400 also include a data size descriptor component 404 for specifying various characteristics of the data stored in the file system. For example, the data size descriptor component 404 can specify a count of bytes per sector, a number of sectors per allocation unit, a file allocation table (“FAT”) table offset, and a count of sectors for all data structures. The data components include an active FAT flags component 406 for specifying a number of active FATs on the file system. In an illustrative embodiment, a file system may support multiple FATs for utilization with some operating system environments. The data components 400 can further include a volume identification component 408 for identifying a volume serial number and/or version number. Still further, the data components 400 can include a file system type for specifying the file system format for the file system. One skilled in the relevant art will appreciate that the data components 400 can include a number of additional/alternative rows for implementing the above-identified components 402-410 and additional components.
Turning now to FIG. 5, a block diagram illustrative of data components 500 for implementing directory entries in an extensible file system format will be described. The data components 500 include an in use component 502 for specifying whether the particular directory entry is in use. In an illustrative embodiment, the high bit of the data components will be set to “1” if the directory entry is in use. The data components 500 further include a type designation component 504 for specifying that the directory entry is associated with a normal directory entry. The data components 500 further include a secondary directory entries component 504 for specifying a number of secondary entries associated with the normal directory entry. The data components 500 also include a file attributes component 508 for specifying various file system attributes for the directory entry. Still further, the data components 500 include a time component 510 for specifying various time information such as a creation timestamp, modification time stamp and other time information. Additionally, the data components 500 further include a time zone component 512 for specifying a time zone for the last created time stamp. One skilled in the relevant art will appreciate that the data components 500 can include a number of additional/alternative rows for implementing the above-identified components 502-512 and additional components.
Turning now to FIG. 6, a block diagram illustrative of data components 600 for implementing a file name and extensions will be described. The data components 600 include an in use component 602 for specifying whether the particular directory entry is in use. In an illustrative embodiment, the high bit of the data components will be set to “1” if the directory entry is in use. The data components 600 further include a type designation component 604 for specifying that the directory entry is associated with a file system name. The data components further include a file name length component 606 and a file name hash component 608. The utilization of the file name hash component 608 will be described below. The data components 600 also include a file name component 610 for specifying the file name. One skilled in the relevant art will appreciate that the data components 600 can include a number of additional/alternative rows for implementing the above-identified components 602-610 and additional components. Additionally, file name directory entries may be extended by secondary directory entries.
Turning now to FIG. 7, a block diagram illustrative of data components 700 for implementing a volume identifier in an extensible file system format is provided. The data components 700 include an in use component 702 for specifying whether the particular directory entry is in use. In an illustrative embodiment, the high bit of the data components will be set to “1” if the directory entry is in use. The data components 700 further include a type designation component 704 for specifying that the directory entry is associated with a volume identifier. The data components 700 further include a secondary directory entries component 706 for specifying a number of secondary entries associated with the volume identifier. The data components 700 also include a volume identifier 708, such as a global unique identifier. One skilled in the relevant art will appreciate that the data components 700 can include a number of additional/alternative rows for implementing the above-identified components 702-708 and additional components. Additionally, in an illustrative embodiment, the data components 700 correspond to a benign directory entry that can be ignored by a file system that does not support volume identifiers.
With reference now to FIGS. 8 and 9, in an illustrative embodiment, parties, such as an OEM, may be able to define specific benign primary directory entry types 308 and benign secondary directory entry types 312. As discussed above, in the event the file system would not recognize or understand either the specific benign primary directory entry types 308 or benign secondary directory entry types 312, the file system could ignore the defined directory entry types.
With reference to FIG. 8, a block diagram illustrative of data components 800 for implementing an extensible benign primary directory entry 308 in an extensible file system format will be described. The data components 800 include an in use component 802 for specifying whether the particular directory entry is in use. In an illustrative embodiment, the high bit of the data components will be set to “1” if the directory entry is in use. The data components 800 further include a type designation component 804 for specifying that the directory entry is a benign primary directory entry. The data components 800 further include a secondary directory entries component 806 for specifying a number of secondary entries associated with the volume identifier. The data components 800 also include a volume identifier 808, such as a global unique identifier. The data components 800 can further include a flag component 810 that corresponds to an indication of whether contiguous allocation of a cluster chain is to be implemented. The data components 800 can still further include additional information 812, such as verification information and a starting cluster. As will be explained in greater detail below, cluster chains utilizing contiguous allocation can be defined according to cluster chain size and a starting cluster for the first cluster in the cluster chain. One skilled in the relevant art will appreciate that the data components 800 can include a number of additional/alternative rows for implementing the above-identified components 802-812 and additional components.
With reference to FIG. 9, a block diagram illustrative of data components 900 for implementing a benign secondary directory entry in an extensible file system format will be described. The data components 900 include an in use component 902 for specifying whether the particular directory entry is in use. In an illustrative embodiment, the high bit of the data components will be set to “1” if the directory entry is in use. The data components 900 further include a type designation component 904 for specifying that the directory entry is a benign primary directory entry. The data components 900 further include a secondary directory entries component 906 for specifying a number of secondary entries associated with the volume identifier. The data components 900 also include a volume identifier 908, such as a global unique identifier. The data components 900 can further include a flag component 910 that corresponds to an indication of whether contiguous allocation of a cluster chain is to be implemented. The data components 900 can further include additional information 912, such as verification information and a starting cluster. One skilled in the relevant art will appreciate that the data components 900 can include a number of additional/alternative rows for implementing the above-identified components 902-912 and additional components.
In an illustrative embodiment, a benign primary directory entry and/or secondary directory entries may be associated with access control list (ACL) information. FIG. 10 is a block diagram illustrative of data components 1000 for implementing an access control list in an extensible file system format. The data components 1000 include an in use component 1002 for specifying whether the particular directory entry is in use. In an illustrative embodiment, the high bit of the data components will be set to “1” if the directory entry is in use. The data components 1000 further include a type designation component 1004 for specifying that the directory entry is an ACL directory entry. The data components 1000 further include a number of ACL fields 1006, such as ACL flags, pointers to ACL databases, and the like. One skilled in the relevant art will appreciate that the data components 1000 can include a number of additional/alternative rows for implementing the above-identified components 1002-1006 and additional components.
In accordance with an aspect of the invention, the utilization of contiguously allocated clusters in a cluster chain mitigates the need for traversing the file allocation table component 206 to identify the clusters in the cluster chain. Because the clusters will be contiguously allocated, each cluster in the chain can be identified with knowledge of the starting location of the first cluster in the chain and the total cluster chain size. For example, assume that each cluster has a size of 4K of data and that the total allocation for a cluster chain is 18 K of data. The cluster chain will require five clusters to capture the data. If the first cluster begins at cluster position 40, then cluster positions 41, 42, 43 and 44 would be taken by the remaining four contiguously allocated clusters in the cluster chain.
In addition to the storage and processing of contiguously allocated clusters, additional processes may be utilized in the extension of a cluster chain. With reference now to FIG. 11, a cluster chain extension routine 1100 for an extensible file system format will be described. At block 1102, a request for extending or modifying the cluster chain is obtained. In an illustrative embodiment, the request for the extension of the cluster chain can correspond to the addition, substitution, modification or rewriting of data.
At decision block 1104, a test is conducted to determine whether the contiguous allocation is available for the cluster chain associated with the request. In an illustrative embodiment, the determination of whether contiguous allocation is available can correspond to a determination of whether the first cluster in the cluster chain includes the contiguous allocation flag set in the flag components (810 or 910). In another embodiment, the determination of whether contiguous allocation is available can correspond to a determination of whether additional contiguous clusters are available. In this embodiment, the last cluster in the cluster chain can be located by identifying the first cluster in the cluster chain and determining the cluster chain size. The determination can check whether contiguous clusters are available, such as by referring to the allocation bitmap.
If contiguous allocation is not available, at block 1106, the entire cluster chain is subject to a noncontiguous allocation. A subroutine for allocating a cluster chain in a noncontiguous manner will be described below with regard to FIG. 12. Alternatively, if contiguous allocation is available, at block 1108, the cluster chain size is updated to reflect the additional cluster. The routine 1100 terminates at block 1110.
With reference now to FIG. 12, a subroutine for making a noncontiguous allocation of a cluster chain (corresponding to block 1106) will be described. At block 1202, an entry for each existing cluster in the cluster chain is created in the FAT table component 206. Each cluster will also have the flag component 806/906 set to indicate no contiguous allocations. At block 1204, an entry for each cluster to be added will be created in the FAT table component 206. At block 1206, the bitmap allocation will be updated to reflect that allocation of each cluster in the cluster chain. At block 1208, the subroutine returns.
With reference now to FIG. 13, a routine 1300 for cluster chain deletion will be described. At block 1302, a request for extending or modifying the cluster chain is obtained. In an illustrative embodiment, the request for the extension of the cluster chain can correspond to the substitution, modification or rewriting of data. At block 1304, the starting cluster associated with the identified cluster chain is identified. Additionally, the allocation size of the cluster chain is also obtained. At block 1306, the FAT allocation bitmap entries for each cluster corresponding to the allocated cluster chain are cleared. At block 1308, the routine 1300 terminates. In an illustrative embodiment, the bitmap entries for each cluster can be cleared without having to traverse the FAT entry for each allocated cluster in the cluster chain.
identify the clusters of the contiguous cluster chain that store the data without traversing a file allocation table associated with the file system based on other information, the other information comprising information within the directory entry specifying a starting cluster and information indicative of a size of the cluster chain.
identify the other data by traversing the file allocation table based on the determination that indicates the other data is not stored in the another contiguous cluster chain.
read the data in the file system by reading from the starting cluster to an ending cluster determined from the size of the cluster chain.
4. The computer-readable storage medium recited in claim 1, wherein the contiguous cluster chain is associated with a plurality of contiguously allocated clusters of a storage medium.
access a secondary directory entry for specifying information concerning data in a file system, the secondary directory entry corresponding to the primary directory entry and defining additional information associated with the primary directory entry.
identifying each cluster in the contiguous cluster chain that stores the data in the file system without traversing a file allocation table associated with the file system based on the determination that the data is stored in the contiguous cluster chain, the starting cluster information, and the cluster chain size.
identifying the other data in the file system by traversing the file allocation table based on the determination that indicates the other data is not stored in the another contiguous cluster chain.
reading the data in the file system by reading from the starting cluster to an ending cluster determined from the cluster chain size.
9. The method of claim 6, wherein the contiguous cluster chain is associated with a plurality of contiguously allocated clusters of a storage medium.
accessing a secondary directory entry for specifying information concerning data in a file system, the secondary directory entry corresponding to the primary directory entry and defining additional information associated with the primary directory entry.
identify each cluster in the contiguous cluster chain that store the data without traversing a file allocation table associated with the file system based on other information, the other information comprising information within the directory entry specifying a starting cluster and information indicative of a size of the cluster chain.
identify the other data in the directory by traversing the file allocation table based on the determination that indicates the other data is not stored in the another contiguous cluster chain.
read the data in the directory by reading from the starting cluster to an ending cluster determined from the size of the cluster chain.
14. The computing device of claim 11, wherein the contiguous cluster chain is associated with a plurality of contiguously allocated clusters of a storage medium.
NL8303535A (en) 1983-10-14 1985-05-01 Philips Nv Nuclear magnetic resonance apparatus.
"Above Software Introduces Golden Retriever 2.0b", News Release, Dateline: Irvine California, Mar. 29, 1993, 1 page.
"File Sharing Protocol", Microsoft Corporation, Nov. 7, 1988, 71 pages.
"Long Filenames", Article 15, Windows 95 Beta 2 Release SDK, Oct. 28, 1994, 19-47.
"The Intelligent Way to Search", News Release, Dateline: Burlington Massachusetts, Oct. 1987, 1 page.
"Transactional file access", Date: Jun. 2, 2005, http://jakarta.apache.org/commons/transaction/file/index.html.
"Transaction-Safe FAT File System", http://msdn.microsoft.com/library/default.asp?url=/library/en-us/wcemain4-/html/cmcontransaction-safefatfilesystem.asp, last updated May 30, 2006.
"World Software Corporation (WSC) Launches Extend-a-Name in Europe", Lexis Nexis, Computer Product Update, Jul. 27, 1990, 2 pages.
Australian Patent Application No. 2005229678: Rejection dated May 17, 2010, 1 page.
Barreto et al., "A Highly Available Replicated File System for Resource-Constrained Windows CE .Net Devices", In 3rd International Conference on .Net Technologies, May 2005.
Bonner, "Build a Document Manager Under Windows", PC Computing, Dec. 1991, 4(12), 275-284.
Bonner, "What's in a Name?", PC Computing, Gale Group, Sep. 1989, 2(9), 169-170.
Chen, et al., "The Rio File Cache: Surviving Operating System Crashes", Date: Oct. 1996, http://www.cs.ucsd.edu/classes/wi01/cse221/chen,ng,rajamani,aycock.the.su- b.-rio-file.sub.-cache.surviving.sub.-operating.sub.-system.sub.-cras- hes.pdf.
Chen, et al., "The Rio File Cache: Surviving Operating System Crashes", Date: Oct. 1996, http://www.cs.ucsd.edu/classes/wi01/cse221/chen,ng,rajamani,aycock.the.su- b.—rio-file.sub.—cache.surviving.sub.—operating.sub.—system.sub.—cras- hes.pdf.
Chile Patent Application No. 2936-05: Rejection dated Nov. 11, 2005, 6 pages.
China Patent Application No. 200510125054.1: Rejection dated Jul. 4, 2008, 8 pages.
China Patent Office Application No. 200510125054.1: Rejection dated Jan. 15, 2010, 9 pages.
De Jonge, et al., "The Logical Disk: A New Approach to Improving File Systems", ACM, 1993, pp. 15-28.
Duncan, "Design Goals and Implementation of the New High Performance File Systems", Microsoft Systems Journal, Sep. 1989, 4(5), 1-13.
Duncan, "Power Programming Using Long Filenames and Extended Attributes, Part I", PC Magazine, Apr. 24, 1990, 9(8), 317-322.
Duncan, "Power Programming Using Long Filenames and Extended Attributes, Part II", PC Magazine, May 15, 1990, 9(9), 305-310.
EP Patent Application No. 05111554.1: Rejection dated Jun. 24, 2009, 4 pages.
Farr, et al., "An Optimum Disc Organization for a Virtual Memory System", Computer Design, Jun. 1971, pp. 49-54.
Glass, "Create Your Own Environment", PC Computing, Oct. 1990, 3(10), 106-110.
Hiroo Shirasaki, "Observe the Boot Process of FreeBSD 14," UNIX Magazine, vol. 20, No. 2, pp. 91-99, ASCII Corporation, Japan, Feb. 1, 2005.
Hurwicz, "MS-DOS 3.1 Makes it Easy to Use IBM PCs on a Network", Data Communications, Nov. 1985, 223-237.
Israel Patent Application No. 172014: Rejection dated Dec. 17, 2009, 2 pages.
Japanese Patent Application No. 2012-040595: English translation of Notice of Rejection mailed on Mar. 26, 2013, 2 pages.
Karpovich et al., "Extensible File System (ELFS): An Object-Oriented Approach to High Performance File I/O", OOPSLA 1994-Proceedings of the Ninth Annual Conference on Object-Oriented Programming Systems, Language and Applications, ACM SIGPLAN Notices, Oct. 1994, 29(10), 191-204.
Kashyap, Aditya, "File System Extensibility and Reliability Using an in-Kernel Database", Date: Dec. 2004, http://www.am-utils.org/docs/kbdbfs-msthesis/index.html.
Khalidi et al., "Extensible File System in Spring", Sun Microsystems Laboratories, Inc., Sep. 1993, 1-18.
Lee, "Server-Based Maintenance Approach for Computer Classroom Workstations", IEICE Trans. Inf. & Syst., vol. E83-D, No. 4, Apr. 2000, pp. 807-815.
Leffler et al., "The Design and and Implementation of the 4.3BSD UNIX Operating System", Addison-Wesley Publishing Company, 1989, Chapter 2, 'Design Overview of 4.3BSD, 34-36.
Lent et al., "New, Improved Windows", PC World, Dec. 1993, 11(12), 252-269.
Mallory, "Breakthrough on DOS Filename Limites", Newsbytes News Network, Apr. 12, 1993, 1 page.
McCormick, "Presentation Manager Under OS/2 Encourages Lengthy Name-Calling", Government Computer News, May 14, 1990, 9(10), 16 and 18.
Mexican Patent Application No. PA/a/2005/012405: Rejection dated Mar. 10, 2010, 4 pages.
Mexican Patent Application No. PA/a/2005/012405: Rejection dated May 6, 2009, 2 pages.
O'Malley, "Fetching Desktop Files: Standalone Document Managers", Window Sources, Mar. 1993, 1(2), 443-444.
Otoo et al., "Non-shared disk cluster-a fault tolerant, commodity approach to hi-bandwidth data analysis", Sep. 2001, available at http://www.ihep.ac.cn/.about.chep0l/paper/4-026.pdf.
Otoo et al., "Non-shared disk cluster—a fault tolerant, commodity approach to hi-bandwidth data analysis", Sep. 2001, available at http://www.ihep.ac.cn/.about.chep0l/paper/4-026.pdf.
Rich, Amy, "ZFS, Sun's Cutting-Edge File System (Part 1: Storage Integrity, Security, and Scalability)", Date: Aug. 2006, http://www.sun.com/bigadmin/features/articles/zfs.sub.part1.scalable.html- #transaction.
Rohan, "Golden Retriever Fetches Files in Windows", Computer Shopper, Nov. 1992, 12(11), 947.
Russian Patent Application No. 2005134810/09: Rejection dated Sep. 11, 2005, 5 pages.
Sivathanu et al., "Life or Death at Block-Level", In Proceedings of the 6th Symposium on Operating Systems Design and Implementation (OSDI '04), Dec. 2004.
Takenori Yamamori, "Guide to Rise Higher than a Novice, PC UNIX Deciphered from Boot Files," Software Design, No. 131, pp. 110-121, Gijutsu-Hyohron Co., Ltd., Japan, Sep. 18, 2001.
Tanenbaum, "MINIX Operating System", Keiichiro Sakamoto, Tokyo, Japan, 1989, Chapter 5, "File System", 310-313 (English Translation of Japanese Publication).
Tanenbaum, "Modern Operating Systems", 2nd ed., Prentice Hall, Englewood Cliffs, NJ, 2001, 442-445, 830-834, 835-839.
Trivette, "Utility Provides 60-Character Filenames", PC Magazine, Sep. 27, 1988, 7(16), 56.
U.S. Appl. No. 12/389,391, Final Office Action dated Feb. 21, 2013, 9 pages.
U.S. Appl. No. 12/389,391, Non-Final Office Action dated Apr. 14, 2011, 12 pages.
U.S. Appl. No. 12/389,391, Non-Final Office Action dated Jul. 31, 2012, 7 pages.
U.S. Appl. No. 12/389,391, Notice of Allowance dated Aug. 7, 2013, 14 pages.
Wang, "Universal-File-Names for Ada", Ada Letters, Jan./Feb. 1990, 10(1), 111-117.
Wang, "Universal—File—Names for Ada", Ada Letters, Jan./Feb. 1990, 10(1), 111-117.

References: Application No. 60
 Application No. 2005229678
 Application No. 2936
 Application No. 200510125054
 Application No. 200510125054
 Application No. 05111554
 Application No. 172014
 Application No. 2012
 Application No. 2005134810