EP0214536A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Automatic data restructurisation method
Assignee: International Business Machines Corp
•
Filing: 1986-08-22
•
Granted: —
•
Expires: 2006-08-22
Abstract
Abstract A method for generating object code which represents a conformance of input data structures into that of a prespecified output data structure such that at runtime data in the input structures can be embedded into the output structure. At least some of the input and output structures have some common fields but differ in the distribution of the hierarchical and repeated groups of said fields. The method utilises graphical models for characterising the prespecified forms and a series of operations based upon the difference in the complexity and distribution of the graphs for conforming the input structure to that of the output.
Inventors
- 👤 Nan-Chiang Shu
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-01 14:22
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/10; G06F40/00; G06F40/10; G06F40/12; G06F40/151; G06F8/30; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99942
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
130 words
In an information processing system where input and output data structures are prespecified, a method for generating object code, which object code conforms the input data into the output data structure at execution time, comprising the steps of: (a) ascertaining the shape of a given input and output data structure as being either (1) of a flat form, (2) of a one-branch form, or (3) of a tree form; (b) determining the minimal operations selected from the set of trimming, flattening, grafting, or stretching for conforming the input into the output data structure according to the difference in ascertained shapes; (c) determining each instance when a selected operation is to be invoked; and (d) executing the order of operations specified by steps (a) through (c) upon said input data structure.
Claim 2
Dependent Claim
130 words
In an information processing system where input and output data structures are prespecified, a method for generating object code, which object code conforms the input data into the output data structure at execution time, comprising the steps of: (a) ascertaining the shape of a given input and output data structure as being either (1) of a flat form, (2) of a one-branch form, or (3) of a tree form; (b) determining the minimal operations selected from the set of trimming, flattening, grafting, or stretching for conforming the input into the output data structure according to the difference in ascertained shapes; (c) determining each instance when a selected operation is to be invoked; and (d) executing the order of operations specified by steps (a) through (c) upon said input data structure.
Claim 3
Dependent Claim
54 words
A method according to claim 1, wherein in step (c) where the output data structure is more complex than the input, then recursively decomposing the output structure into its component flat, one-branch, or tree forms; and wherein in step (d) the decomposed forms being combined, step by step, to synthesise the output data structure.
Claim 4
Dependent Claim
78 words
A method according to claim 1, wherein in order to invoke the trimming operation, the complexity ranking of the input must be greater than or equal to that of the output data structure, for all components of the output structure their hierarchical level must be the same as the corresponding component in the input structure, and, the parent of each component in the output must be the same as the parent of the corresponding component in the input.
Claim 5
Dependent Claim
60 words
A method according to claim 1, wherein in order to invoke the flattening operation, the output structure must have fields all of the same nonhierarchical order, all components required for producing the output are members of one branch of the input structure, and there does not exist any skipping of hierarchical levels among the required components of the input structure.
Claim 6
Dependent Claim
39 words
A method according to claim 1, wherein in order to invoke the stretching operation, the output components constitute a branch and all the components required to produce the output structure are at the root level of the input structure.
Claim 7
Dependent Claim
44 words
A method according to claim 1, wherein in order to invoke the stretching operation, the root level components of the input form new hierarchical relationships in the output, whereas all other components maintain parent-child relationships "consistent" among corresponding components of input and output structures.
Claim 8
Dependent Claim
44 words
A method according to claim 1, wherein in order to invoke the grafting operation, two appropriate input structures, matched on prespecified fields, are combined side by side, wherein each of the appropriate input structures being either the prespecified input structure or a transformed structure.
Claim 9
Dependent Claim
52 words
A method according to claim 2, wherein in the decomposition phase, the steps include decomposing the output structure into its subtrees (repeating groups of fields), concatenating each of the subtrees with its parent key fields; forming an intermediate file thereof; and comparing said intermediate file with its counterpart in the input structure.
Claim 10
Dependent Claim
49 words
A method according to claim 2, wherein during the synthesis phase, the steps include ordering the operations to produce an intermediate file from the input structure in a top-to-bottom, left-to-right order; and grafting the intermediate files in a pairwise bottom-up, right-to-left order until the desired output structure is produced.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.