Data management appliance

• US 20030135783A1
• Filed: 12/28/2001
• Published: 07/17/2003
• Est. Priority Date: 12/28/2001
• Status: Active Grant

• Current Assignee: Oracle America, Inc. (Oracle Corporation)
• Original Assignee: Storage Technologies Corporation (Oracle Corporation)
• Inventors: Rafert, James Lee, Madigan, Michael William, Martin, Marcia Reid, Gehr, Charles Royal
• Granted Patent: US 6,898,688 B2
• Time in Patent Office: Days
• US Class Current: 714/13
• CPC Class Codes: G06F 11/1448 Management of the data involved in backup or backup restore
• CPC Class Codes: G06F 11/1471 involving logging of persistent data for recovery
• CPC Class Codes: G06F 2201/84 Using snapshots, i.e. a logical point-in-time copy of the data

Abstract

The present invention is directed toward a data management appliance and ancillary technologies for replicating data written to a primary storage system. The data management appliance is a random-access storage system that at the logical block level replicates the contents of a primary storage system over time.

Claims

1. A method comprising:

attaching a first physical extent list to a node within a tree data structure, wherein the first physical extent list contains at least one entry, the at least one entry contains a first logical address range and a starting physical address, the node has a first key, and the first key is a second logical address range, whereby a mapping relation that maps logical addresses into physical addresses on at least one storage device is achieved.

2. The method of claim 1, wherein the first logical address range includes a starting logical address and a length.

3. The method of claim 1, wherein the second logical address range corresponds to a portion of a physical copy of a storage volume.

4. The method of claim 3, wherein the physical copy of the storage volume is a mirror-in-the-middle (MIM).

5. The method of claim 1, wherein the second logical address range corresponds to an extent recorded in a journal.

6. The method of claim 1, wherein the first physical extent list has a plurality of entries and the at least one entry is one of the plurality of entries.

7. The method of claim 6, wherein the plurality of entries in the first physical extent list is sorted.

8. The method of claim 6, wherein the plurality of entries together represent a contiguous range of logical addresses.

9. The method of claim 6, wherein each of the plurality of entries has an associated pointer and one of the associated pointers points to another node.

10. The method of claim 1, wherein the starting physical address corresponds to a physical address of an entry in a journal.

11. The method of claim 10, wherein the journal is one of a backward journal and a forward journal.

12. The method of claim 1, wherein attaching the physical extent list includes incorporating the physical extent list within the node.

13. The method of claim 1, wherein attaching the physical extent list includes setting a pointer within the node to point to the physical extent list.

14. A computer program product in a computer readable medium comprising functional descriptive material that when executed by a computer enables the computer to perform acts including:

attaching a first physical extent list to a node within a tree data structure, wherein the first physical extent list contains at least one entry, the at least one entry contains a first logical address range and a starting physical address, the node has a first key, and the first key is a second logical address range, whereby a mapping relation that maps logical addresses into physical addresses on at least one storage device is achieved.

15. The computer program product of claim 14, wherein the first logical address range includes a starting logical address and a length.

16. The computer program product of claim 14, wherein the second logical address range corresponds to a portion of a physical copy of a storage volume.

17. The computer program product of claim 16, wherein the physical copy of the storage volume is a mirror-in-the-middle (MIM).

18. The computer program product of claim 14, wherein the second logical address range corresponds to an extent recorded in a journal.

19. The computer program product of claim 14, wherein the first physical extent list has a plurality of entries and the at least one entry is one of the plurality of entries.

20. The computer program product of claim 19, wherein the plurality of entries in the first physical extent list is sorted.

21. The computer program product of claim 19, wherein the plurality of entries together represent a contiguous range of logical addresses.

22. The computer program product of claim 19, wherein each of the plurality of entries has an associated pointer and one of the associated pointers points to another node.

23. The computer program product of claim 14, wherein the starting physical address corresponds to a physical address of an entry in a journal.

24. The computer program product of claim 23, wherein the journal is one of a backward journal and a forward journal.

25. The computer program product of claim 14, wherein attaching the physical extent list includes incorporating the physical extent list within the node.

26. The computer program product of claim 14, wherein attaching the physical extent list includes setting a pointer within the node to point to the physical extent list.

27. A data management appliance comprising:

means for attaching a first physical extent list to a node within a tree data structure, wherein the first physical extent list contains at least one entry, the at least one entry contains a first logical address range and a starting physical address, the node has a first key, and the first key is a second logical address range, whereby a mapping relation that maps logical addresses into physical addresses on at least one storage device is achieved.

28. The data management appliance of claim 27, wherein the first logical address range includes a starting logical address and a length.

29. The data management appliance of claim 27, wherein the second logical address range corresponds to a portion of a physical copy of a storage volume.

30. The data management appliance of claim 29, wherein the physical copy of the storage volume is a mirror-in-the-middle (MIM).

31. The data management appliance of claim 27, wherein the second logical address range corresponds to an extent recorded in a journal.

32. The data management appliance of claim 27, wherein the first physical extent list has a plurality of entries and the at least one entry is one of the plurality of entries.

33. The data management appliance of claim 32, wherein the plurality of entries in the first physical extent list is sorted.

34. The data management appliance of claim 32, wherein the plurality of entries together represent a contiguous range of logical addresses.

35. The data management appliance of claim 32, wherein each of the plurality of entries has a n associated pointer and one of the associated pointers points to another node.

36. The data management appliance of claim 27, wherein the starting physical address corresponds to a physical address of an entry in a journal.

37. The data management appliance of claim 36, wherein the journal is one of a backward journal and a forward journal.

38. The data management appliance of claim 27, wherein attaching the physical extent list includes incorporating the physical extent list within the node.

39. The data management appliance of claim 27, wherein attaching the physical extent list includes setting a pointer within the node to point to the physical extent list.

40. A computer readable medium encoded with a data structure, the data structure comprising:

a plurality of nodes; and

at least one physical extent list,

wherein each of the plurality of nodes contains a plurality of pointers,

wherein each of the plurality of pointers points to one of a node and a physical extent list,

wherein each of the nodes represents a range of logical addresses, and

wherein the at least one physical extent list contains entries and the entries represent addresses of physical extents stored on at least one storage device, whereby the data structure stores a mapping relation that maps logical addresses into physical addresses on at least one storage device.

41. The computer readable medium of claim 40, wherein the range of logical addresses is divided into subranges and each of the plurality of pointers is associated with one of the subranges.

42. The computer readable medium of claim 40, wherein the range of logical addresses represents data that is stored on a physical copy of a storage device.

43. The computer readable medium of claim 42, wherein the physical copy is a mirror-in-the-middle (MIM).

44. The computer readable medium of claim 40, wherein the range of logical addresses represents data that is stored within a journal.