Patent US3858071A successfully refreshed from Google Patents.
Patent EP0547992A2 successfully refreshed from Google Patents.
EP0547992A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method and system for enhanced efficiency of data recovery in balanced tree memory structures
Assignee: International Business Machines Corp
•
Filing: 1992-11-19
•
Granted: —
•
Expires: 2012-11-19
Abstract
Abstract A method and system for enhancing the efficiency of data recovery in a multilevel balanced tree memory structure having a root node and multiple leaf nodes stored within a data processing system. After checking to determine if the multilevel balanced tree memory structure is of sufficient size and complexity to warrant optimization, and after determining that sufficient memory space is available within the data processing system, the entire multilevel balanced tree memory structure is recopied within the data processing system utilizing a post order visitation process. This process is accomplished in a manner such that adjacent leaves are as closely located as possible within memory, thereby minimizing the amount of memory which must be traversed during a data search. In one embodiment of the present invention, a virtual memory data processing system is utilized and the entire multilevel balanced tree memory structure is recopied in a manner such that as many adjacent leaves as possible are stored within each page of memory therein.
Inventors
- 👤 Robert S. Keller
- 👤 Michael O. Mitchell
- 👤 Dale B. Stringfellow, Jr.
- 👤 Marvin L. Williams
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-31 06:24
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/901; G06F16/9027
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
86 words
A method of enhancing the efficiency of data recovery from a multilevel balanced binary tree memory structure having a plurality of leaves stored in a first memory area within a data processing system, said method comprising the step of: periodically recopying all of said multilevel balanced binary tree memory structure into a second memory area within said data processing system such that a maximum number of adjacent ones of said plurality of leaves are stored within substantially adjacent memory areas, wherein data recovery is substantially enhanced.
Claim 2
Independent Claim
86 words
A method of enhancing the efficiency of data recovery from a multilevel balanced binary tree memory structure having a plurality of leaves stored in a first memory area within a data processing system, said method comprising the step of: periodically recopying all of said multilevel balanced binary tree memory structure into a second memory area within said data processing system such that a maximum number of adjacent ones of said plurality of leaves are stored within substantially adjacent memory areas, wherein data recovery is substantially enhanced.
Claim 3
Dependent Claim
52 words
The method according to Claim 1, wherein said multilevel balanced binary memory tree structure is stored in a virtual memory system within a data processing system and wherein a maximum number of adjacent ones of said plurality of leaves are stored within each single page of memory within said virtual memory system.
Claim 4
Dependent Claim
47 words
The method according to Claim 2, further including the step of determining if at least two of said plurality of leaves may be stored within each single page of memory within said virtual memory system prior to recopying all of said multilevel balanced binary tree memory structure.
Claim 5
Dependent Claim
32 words
The method according to Claim 1, further including the step of determining if said second memory area includes sufficient area to store all of said multi level balanced binary tree memory structure.
Claim 6
Dependent Claim
63 words
The method of enhancing the efficiency of data recovery from a multilevel balanced binary tree memory structure according to Claim 1, wherein said step of periodically recopying all of said multilevel balanced binary tree memory structure into a second memory area within said data processing system further includes performing a post order visitation of each of said plurality of leaves during said recopying.
Claim 7
Dependent Claim
115 words
A virtual memory data processing system for enhancing data recovery from a multilevel balanced binary tree memory structure having a plurality of leaves stored in a first plurality of memory pages within said virtual memory data processing system, said virtual memory data processing system comprising: means for determining if a second plurality of memory pages within said virtual memory data processing system may be utilized to store said multilevel balanced binary tree memory structure; and means for recopying all of said multilevel balanced binary tree memory structure into said second plurality of memory pages such that a maximum number of adjacent ones- of said plurality of leaves are stored within each single page of memory.
Claim 8
Dependent Claim
115 words
A virtual memory data processing system for enhancing data recovery from a multilevel balanced binary tree memory structure having a plurality of leaves stored in a first plurality of memory pages within said virtual memory data processing system, said virtual memory data processing system comprising: means for determining if a second plurality of memory pages within said virtual memory data processing system may be utilized to store said multilevel balanced binary tree memory structure; and means for recopying all of said multilevel balanced binary tree memory structure into said second plurality of memory pages such that a maximum number of adjacent ones- of said plurality of leaves are stored within each single page of memory.
Claim 9
Dependent Claim
36 words
The system according to Claim 6, further including means for determining if at least two of said plurality of leaves may be stored within each single page of memory within said virtual memory data processing system.
Claim 10
Dependent Claim
46 words
The system according to Claim 6, wherein said means for recopying all of said multilevel balanced binary tree memory structure into said second plurality of memory pages further includes means for performing a post order visitation of each of said plurality of leaves during said recopying.
Claim 11
Dependent Claim
114 words
Adata processing program product for enhancing data recovery from a multilevel balanced binary tree memory structure having a plurality of leaves stored in a first plurality of memory pages within a virtual memory data processing system, said data processing program product comprising: instruction means for determining if a second plurality of memory pages within said virtual memory data processing system may be utilized to store said multilevel balanced binary tree memory structure; and instruction means for recopying all of said multilevel balanced binary tree memory structure into said second plurality of memory pages such that a maximum number of adjacent ones of said plurality of leaves are stored within each single page of memory.
Claim 12
Dependent Claim
114 words
Adata processing program product for enhancing data recovery from a multilevel balanced binary tree memory structure having a plurality of leaves stored in a first plurality of memory pages within a virtual memory data processing system, said data processing program product comprising: instruction means for determining if a second plurality of memory pages within said virtual memory data processing system may be utilized to store said multilevel balanced binary tree memory structure; and instruction means for recopying all of said multilevel balanced binary tree memory structure into said second plurality of memory pages such that a maximum number of adjacent ones of said plurality of leaves are stored within each single page of memory.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.