Database utilities
View Patent ↗A system and methods for rapid unloading and reorganization of hierarchical databases. Overflow and a window of blocks are progressively read into memory. Unloading proceeds as the scan cylinders window moves ahead. The reading of blocks stays about scan cylinders ahead of the unload. As a segment is unloaded, its space is converted to free IMS space and when appropriate, combined with adjacent free space already in the block. Thus about a window behind the unload point in the database, all of the segments in a block will have been converted to free space making the block one unit of free space.
1. A physical computer-readable storage medium embedded with instructions that operate in an IMS computer environment to
resolve, correlate and order present and future relative addresses for plural segments in a dataset under reorganization;
scan a database to determine for a selected segment, whether that selected segment participates in a logical relationship with a segment in the dataset under reorganization;
upon finding a segment that participates in a logical relationship with a segment in the dataset under reorganization, compare the logical pointer of the found segment with the correlation of present and future relative addresses for plural segments in the dataset under reorganization to find the present relative address that corresponds to the logical pointer of the found segment; and
upon finding the corresponding present relative address, replace the logical pointer of the found segment with the future relative address that is correlated with the corresponding present relative address.
2. The storage medium of claim 1 being magnetic tape.
3. The storage medium of claim 1 being a read only memory storage medium.
4. The storage medium of claim 1 being a disk.
5. A physical computer-readable storage medium embedded with instructions that operate in an IMS computer environment to
determine in a first selected algorithmic order, a future relative address of each of the plural segments in relation to a database location if the segments were to be positioned sequentially according to the selected first algorithmic order, the selected first algorithmic order being expressive of a selected hierarchical relationship of the plural segments;
record the determined future relative address of each of the plural segments;
record the present relative address of each of the plural segments;
replace of the present relative address with the determined future relative address for each of the plural segments;
correlate the present and determined future relative addresses for each of the plural segments;
order the correlation of the present and determined future relative addresses according to the present relative addresses; and
load a database with the plural segments to improve the physical to hierarchical correspondence for a plurality of segments in a dataset of a hierarchical database.
6. The storage medium of claim 5 being magnetic tape.
7. The storage medium of claim 5 being a read only memory storage medium.
8. The storage medium of claim 5 being a disk.
9. The storage medium of claim 5 being further embedded with instructions to load the plural segments in the data space in a second algorithmic order.
10. The storage medium of claim 9 being magnetic tape.
11. The storage medium of claim 9 being a read only memory storage medium.
12. The storage medium of claim 9 being a disk.
13. The storage medium of claim 9 being further embedded with instructions
in which the second algorithmic order expresses an algorithm expressed in the selected first algorithmic order.
14. The storage medium of claim 13 being magnetic tape.
15. The storage medium of claim 13 being a read only memory storage medium.
16. The storage medium of claim 13 being a disk.
17. The storage medium of claim 5 being further embedded with instructions to
scan a database having segments that participate in logical relations with one or more of the plural segments in the dataset;
after finding in the scanned database, a segment that participates in a logical relationship with a segment in the dataset, compare the logical pointer of the found segment with the correlation of present and future relative addresses for the plural segments in the dataset to find the present relative address that corresponds to the logical pointer of the found segment; and
after finding the present relative address that corresponds to the logical pointer of the found segment, replace the logical pointer of the found segment with the future relative address that is correlated with the present relative address that corresponds to the logical pointer of the found segment.
18. The storage medium of claim 17 being magnetic tape.
19. The storage medium of claim 17 being a read only memory storage medium.
20. The storage medium of claim 17 being a disk.
21. The storage medium of claim 17 being further embedded with instructions to load the plural segments in the data space in a second algorithmic order.
22. The storage medium of claim 21 being magnetic tape.
23. The storage medium of claim 21 being a read only memory storage medium.
24. The storage medium of claim 21 being a disk.
25. The storage medium of claim 21 being further embedded with instructions
in which the second algorithmic order expresses an algorithm expressed in the first selected algorithmic order.
26. The storage medium of claim 25 being magnetic tape.
27. The storage medium of claim 25 being a read only memory storage medium.
28. The storage medium of claim 25 being a disk.
29. A physical computer-readable storage medium embedded with instructions that operate in an IMS computer environment to
establish a counter having a state indicative of a location in a proxy dataset that correlates to the size of a block to be loaded, the state of the counter being used to determine a relative byte address (RBA) for a segment;
read, according to an algorithmic order, each of a plurality of segments taken from a disorganized dataset of a hierarchical database;
in correspondence with an unload of a read segment of the plurality of segments, revise the state of the counter to contemplate the size of the read segment, the state of the counter used to determine the future RBA of the next read segment in the reorganized dataset;
record of the future RBA of the segment next to be read in the algorithmic order; and
record of the read segment present RBA.
30. The storage medium of claim 29 being magnetic tape.
31. The storage medium of claim 29 being a read only memory storage medium.
32. The storage medium of claim 29 being a disk.
33. The storage medium of claim 29 being further embedded with instructions to record future RBAs and present RBAs in a table.
34. The storage medium of claim 33 being magnetic tape.
35. The storage medium of claim 33 being a read only memory storage medium.
36. The storage medium of claim 33 being a disk.
37. The storage medium of claim 33 being further embedded with instructions to sort the table by present RBAs.
38. The storage medium of claim 37 being magnetic tape.
39. The storage medium of claim 37 being a read only memory storage medium.
40. The storage medium of claim 37 being a disk.