FREEING DISK SPACE IN A FILE SYSTEM
    12.
    发明公开
    FREEING DISK SPACE IN A FILE SYSTEM 失效
    方法在文件系统中进行免费的磁盘

    公开(公告)号:EP0916131A2

    公开(公告)日:1999-05-19

    申请号:EP98910256

    申请日:1998-03-06

    Applicant: MICROSOFT CORP

    Abstract: A method and mechanism for rapidly freeing storage space allocated to any logical portion of a file. An application program (30) provides the file system (28) with information indicating a block of logical data to free. The file system (28) converts the information to the physical allocation units such as the clusters corresponding to the logical block of data, and manipulates the file's meta data to indicate that the physical space is no longer allocated to the file. The file system (28) then adds the space to disk free space. Applications (30) such as merge applications and those managing FIFO queues may use the method and mechanism to shrink a file from the start of the file toward the end thereof without copying the logical data or adjusting internal pointers relative to the logical file data (42n).

    FREEING DISK SPACE IN A FILE SYSTEM
    13.
    发明公开
    FREEING DISK SPACE IN A FILE SYSTEM 失效
    方法在文件系统中进行免费的磁盘

    公开(公告)号:EP0916131A4

    公开(公告)日:2005-09-07

    申请号:EP98910256

    申请日:1998-03-06

    Applicant: MICROSOFT CORP

    Abstract: A method and mechanism for rapidly freeing storage space allocated to any logical portion of a file. An application program (30) provides the file system (28) with information indicating a block of logical data to free. The file system (28) converts the information to the physical allocation units such as the clusters corresponding to the logical block of data, and manipulates the file's meta data to indicate that the physical space is no longer allocated to the file. The file system (28) then adds the space to disk free space. Applications (30) such as merge applications and those managing FIFO queues may use the method and mechanism to shrink a file from the start of the file toward the end thereof without copying the logical data or adjusting internal pointers relative to the logical file data (42n).

    Method and system for synthetic backup and restore

    公开(公告)号:AU2005203663B2

    公开(公告)日:2011-06-16

    申请号:AU2005203663

    申请日:2005-08-16

    Applicant: MICROSOFT CORP

    Abstract: A method and system for backing up and restoring data. First, a full backup is performed to create a full dataset. Thereafter, incremental or differential datasets may be created by incremental or differential backups, respectively. When a new full dataset is needed, instead of performing a full backup, a previous full dataset may be combined with subsequent incremental or differential datasets to create the new full dataset. The new full dataset may be created on a computer other than the computer which hosts the data of the previous full dataset. The new full dataset may be used for offsite storage or to quickly restore data in the event of a failure or corruption of a computer's file system.

    17.
    发明专利
    未知

    公开(公告)号:DE69430027D1

    公开(公告)日:2002-04-11

    申请号:DE69430027

    申请日:1994-06-28

    Applicant: MICROSOFT CORP

    Abstract: A file system provides a hierarchical approach to storage of file data. Logically contiguous bytes of file data are stored in stream data structures, and streams which hold related file data are stored in a variable sized onode data structures on disk. The variable-sized onode data structures are stored in fixed sized buckets, and the buckets are organized into a variable sized array. Thus, the file system provides a combination of variable-sized storage with fixed-sized storage to provide a very efficient approach to storing file data. In addition, indexes may be provided within the structures to allow quick access to onodes and streams.

    18.
    发明专利
    未知

    公开(公告)号:DE69330993T2

    公开(公告)日:2002-04-04

    申请号:DE69330993

    申请日:1993-12-08

    Applicant: MICROSOFT CORP

    Abstract: A method is disclosed for recording a text index wherein the text index comprises a plurality of data key fields. Each data key field includes a data key identifier, document identifier data, and an offset field. The document identifier data is provided to identify each document in which the data key identifier appears. The offset field includes a plurality of offset sequences wherein each offset sequence is associated with a respective document identified by the document identifier data and wherein each offset sequence identifies the location of each data key within its associated document by identifying the offset of the data key from the preceding data key. In accordance with the subject invention, the document identifier data and the offset data field are compressed by disclosed methods.

    COMPUTER METHOD AND SYSTEM FOR B-TREE OPTIMIZATION

    公开(公告)号:CA2131968A1

    公开(公告)日:1995-03-18

    申请号:CA2131968

    申请日:1994-09-13

    Applicant: MICROSOFT CORP

    Abstract: 23 COMPUTER METHOD AND SYSTEM FOR B-TREE OPTIMIZATION A B-tree optimizer mechanism is provided for optimizing a B-tree stored in a storage device of a computer system. The B-tree optimizer monitors the type and amount of activity occurring within the B-tree. Based upon the type and amount of activity, the B-tree optimizer determines whether the B-tree should be reorganized. When it is determined that the B-tree should be reorganized, the B-tree optimizer computes an optimal fill factor for the pages within the B-tree, and reorganizes the B-tree by filling each page with key values according to the optimal fill factor.

Patent Agency Ranking