US6405217B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
State-based implementation of transactions on a file system
Assignee: Microsoft Technology Licensing LLC
•
Filing: 1998-09-21
•
Granted: 2002-06-11
•
Expires: 2018-09-21
Abstract
Abstract State-based offspring objects are created to correspond to each object in a file system when the corresponding object is opened. Each offspring object contains two fields, an original name field containing the name of the object as opened and a final name field. Each name change made to the object is written to the final name field so that the final name field always reflects the last change made to the name of the object. The various combinations of the fields define the offspring object's state. The offspring objects are arranged in a hierarchical structure that mimics the structure of the file system with the offspring object corresponding to the top level open object as its root. When the changes are committed, the state of the offspring object determines the operation to be performed on the corresponding object. Once the commit is completed, the original name field is overwritten with the final name. If changes are aborted, the original name is written to the final name field to revert the changes. A temporary offspring object is created when necessary to provide for circular renaming situations.
Inventors
- 👤 Henry Lee
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 09:57
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/10
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
95 words
A computerized method for implementing transactions on a file comprising: creating an offspring object in response to a file object being opened, wherein the offspring object contains an original name for the corresponding file object; storing a final name in the offspring object in response to a transaction requesting a first name change to the corresponding file object; modifying the final name in response to the transaction requesting a second name change to the corresponding file object; and applying the final name in the offspring object to the corresponding file object when the transaction commits.
Claim 2
Dependent Claim
95 words
A computerized method for implementing transactions on a file comprising: creating an offspring object in response to a file object being opened, wherein the offspring object contains an original name for the corresponding file object; storing a final name in the offspring object in response to a transaction requesting a first name change to the corresponding file object; modifying the final name in response to the transaction requesting a second name change to the corresponding file object; and applying the final name in the offspring object to the corresponding file object when the transaction commits.
Claim 3
Dependent Claim
36 words
The computerized method of claim 1 , further comprising: determining a state for offspring object by comparing the original name and the final name; and marking the offspring object as reusable when the state is empty.
Claim 4
Dependent Claim
25 words
The computerized method of claim 1 , further comprising: replacing the original name with the final name in the offspring object when the transaction commits.
Claim 5
Dependent Claim
25 words
The computerized method of claim 1 , further comprising: replacing the final name with the original name in the offspring object when the transaction aborts.
Claim 6
Dependent Claim
25 words
The computerized method of claim 1 , further comprising: using the existing offspring object when the corresponding file object is invoked after the transaction commits.
Claim 7
Dependent Claim
19 words
The method of claim 1 , wherein each act is performed in an order recited in claim 1 .
Claim 8
Dependent Claim
18 words
A computer-readable medium having computer-executable instructions to cause a computer to perform the method of claim 1 .
Claim 9
Dependent Claim
172 words
A computerized system comprising: a computer having a processor, a memory, and a persistent storage; a file system executing in the processor to manage a plurality of data elements logically stored in a hierarchical structure on the persistent storage; a plurality of transactions executing in the processor under control of the file system to change the names of the data elements, wherein each transaction operates on a subset of the data elements defined by a specific level of the hierarchy; a plurality of offspring objects created by the file system in a plurality of buffers in the memory to record a state for each of the data elements on persistent storage when the data element is opened by a transaction, each offspring object containing an original name for the corresponding data element when opened by a transaction and a last name change made to the name of the corresponding data element by the transaction, wherein the original name and the last name change collectively determine the state of the corresponding data element.
Claim 10
Dependent Claim
172 words
A computerized system comprising: a computer having a processor, a memory, and a persistent storage; a file system executing in the processor to manage a plurality of data elements logically stored in a hierarchical structure on the persistent storage; a plurality of transactions executing in the processor under control of the file system to change the names of the data elements, wherein each transaction operates on a subset of the data elements defined by a specific level of the hierarchy; a plurality of offspring objects created by the file system in a plurality of buffers in the memory to record a state for each of the data elements on persistent storage when the data element is opened by a transaction, each offspring object containing an original name for the corresponding data element when opened by a transaction and a last name change made to the name of the corresponding data element by the transaction, wherein the original name and the last name change collectively determine the state of the corresponding data element.
Claim 11
Dependent Claim
33 words
The computerized system of claim 8 , wherein a temporary offspring object is created in memory when the file system detects that a transaction has changed a data element in a circular fashion.
Claim 12
Dependent Claim
51 words
The computerized system of claim 8 , wherein each of the buffers is associated with a transaction and a commit performed by a transaction copies the offspring objects in the buffer associated with the committing transaction to the buffer associated with the transaction operating the next higher level in the hierarchy.
Claim 13
Dependent Claim
55 words
The computerized system of claim 10 , wherein the file system modifies the state of the data elements on persistent storage to match the state contained in the corresponding offspring objects in the buffer associated with the transaction operating at the highest level of the hierarchy when the transaction operating at the highest level commits.
Claim 14
Dependent Claim
63 words
The computerized system of claim 10 , wherein the original name in each offspring object in a buffer associated with a transaction operating at a lower level of the hierarchy is overwritten with the last name change in the offspring object when the offspring objects are copied to the buffer associated with the transaction operating at the next high level in the hierarchy.
Claim 15
Dependent Claim
37 words
The computerized system of claim 10 , wherein the last name change in each offspring object in a buffer is overwritten with the original name in the offspring object when the transaction associated with the buffer aborts.
Claim 16
Dependent Claim
17 words
The computerized system of claim 10 , wherein the data elements comprise directory and file data structures.
Claim 17
Dependent Claim
19 words
The computerized system of claim 10 , wherein the data elements comprise storage and stream objects within a file.
Claim 18
Dependent Claim
100 words
A computer-readable medium having computer-executable instructions to cause a computer to perform a method comprising: creating an offspring object in response to a file object being opened, wherein the offspring object contains an original name for the corresponding file object; storing a final name in the offspring object in response to a transaction requesting a first name change to the corresponding file object; modifying the final name in response to the transaction requesting a second name change to the corresponding file object; and applying the final name in the offspring object to the corresponding file object when the transaction commits.
Claim 19
Dependent Claim
100 words
A computer-readable medium having computer-executable instructions to cause a computer to perform a method comprising: creating an offspring object in response to a file object being opened, wherein the offspring object contains an original name for the corresponding file object; storing a final name in the offspring object in response to a transaction requesting a first name change to the corresponding file object; modifying the final name in response to the transaction requesting a second name change to the corresponding file object; and applying the final name in the offspring object to the corresponding file object when the transaction commits.
Claim 20
Dependent Claim
47 words
The computer-readable medium of claim 16 , having computer-executable instructions to cause a computer to perform a method further comprising: determining a state for offspring object by comparing the original name and the final name; and marking the offspring object as reusable when the state is empty.
Claim 21
Dependent Claim
36 words
The computer-readable medium of claim 16 , having computer-executable instructions to cause a computer to perform a method further comprising: replacing the original name with the final name in the offspring object when the transaction commits.
Claim 22
Dependent Claim
36 words
The computer-readable medium of claim 16 , having computer-executable instructions to cause a computer to perform a method further comprising: replacing the final name with the original name in the offspring object when the transaction aborts.
Claim 23
Dependent Claim
36 words
The computer-readable medium of claim 16 , having computer-executable instructions to cause a computer to perform a method further comprising: using the existing offspring object when the corresponding file object is invoked after the transaction commits.
Claim 24
Dependent Claim
20 words
The computer-readable medium of claim 16 , wherein each act is performed in an order recited in claim 16 .
Claim 25
Dependent Claim
104 words
A computer-readable medium having stored thereon an offspring data structure which encodes its own state comprising: a first field comprising one of a null value and data representing an old name for an object; and a second field comprising one of a null value and data representing a new name for the object; wherein a state of the offspring data structure is identified by the contents of both the first and second fields taken together such that the combination of the data and the null values of the first and second fields define the state comprising one of delete, create, empty, open and rename.
Claim 26
Dependent Claim
104 words
A computer-readable medium having stored thereon an offspring data structure which encodes its own state comprising: a first field comprising one of a null value and data representing an old name for an object; and a second field comprising one of a null value and data representing a new name for the object; wherein a state of the offspring data structure is identified by the contents of both the first and second fields taken together such that the combination of the data and the null values of the first and second fields define the state comprising one of delete, create, empty, open and rename.
Claim 27
Dependent Claim
37 words
The computer-readable medium of claim 22 , further comprising: a third field containing data representing a least one pointer to another offspring data structure corresponding to a child object for the object identified by the first field.
Claim 28
Dependent Claim
35 words
The computer-readable medium of claim 22 , wherein the state of the offspring structure is delete when the first field comprises the data representing the old name and the second field comprises the null value.
Claim 29
Dependent Claim
35 words
The computer-readable medium of claim 22 , wherein the state of the offspring structure is create when the first field comprises the null value and the second field comprises the data representing the new name.
Claim 30
Dependent Claim
32 words
The computer-readable medium of claim 22 , wherein the state of the offspring structure is empty when the first field comprises the null value and the second field comprises the null value.
Claim 31
Dependent Claim
48 words
The computer-readable medium of claim 22 , wherein the state of the offspring structure is open when the first field comprises the data representing the old name, the second field comprises the data representing the new name, and the data in the first and second field are identical.
Claim 32
Dependent Claim
49 words
The computer-readable medium of claim 22 , wherein the state of the offspring structure is rename when the first field comprises the data representing the old name, the second field comprises the data representing the new name, and the data in the first and second field are not identical.
References Cited (Backward Citations)
US4935869A
Cited
US5623666A
Cited
US5455947A
Cited
US5465365A
Cited
US5794252A
Cited
US6009266A
Cited
US5729696A
Cited
US5941947A
Cited
US5835689A
Cited
US5857204A
Cited
US5918229A
Cited
US5909540A
Cited
US6026474A
Cited
US6161125A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-06-10 | 2005-12-10 | 2006-06-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-06-10 | 2009-12-10 | 2010-06-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-06-10 | 2013-12-10 | 2014-06-11 | $7700.00 | Window Closed / Lapsed |