Dictionary for encoding and retrieving hierarchical data processing information for a computer system

• US 5,778,223 A
• Filed: 12/23/1996
• Issued: 07/07/1998
• Est. Priority Date: 03/17/1992
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Velissaropoulos, T. Dora, Shum, Peter K.
• Primary Examiner(s): AMSBURY, WAYNE P
• Application Number:
  US08/773,220
• Time in Patent Office: 561 Days
• Field of Search: 395/611, 395/613, 395/615, 395/60, 395/61, 395/62
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

A data transmission dictionary is provided, which is adapted for use by a computer system for encoding, storing, or retrieving hierarchically related data transmission information. The dictionary is comprised of a group of one or more computer searchable definition trees relating to transmission information of the computer system. The trees are derived from a first definition group which includes characteristics of commands, replies or data usable by the computer system. The characteristics include structure and value properties and restrictions, if any, applying to the commands, replies or data. Each tree represents, respectively, a definition of a the command, reply or data to which it relates. Each tree includes a root node identified by name, e.g., a codepoint. The root node includes information describing the type of definition tree concerned (i.e., whether it relates to a command, reply or data), and may include one or more internal or terminal descendant nodes. These nodes represent components of the definition represented by the tree. The descendent nodes include level information describing the level of the node within its tree. The nodes may include attribute information, and may include value requirements relating to transmission information represented by the nodes.

Claims

1. A method of processing a data transmission using a hierarchical data dictionary, comprising the steps of:

receiving from a source system a data transmission string expressing a tree-structure data in a compacted form, wherein said tree-structure data contains a compacted root node corresponding either to a request type command, a reply type command, or an object type command, followed by one or more compacted parameters corresponding to nodes linked thereto, each said linked node corresponding to data required by said compacted root node for said command, said compacted root node and said one or more compacted parameters expressing said tree-structure data in a linear depth-first manner;

using the hierarchical data dictionary to parse said data transmission string, including said compacted root node and said one or more compacted parameters, to determine whether required information is present and whether relevant rules are obeyed for the type of command specified by said compacted root node, and further ensuring that structural and value rules for said linked nodes corresponding to the type of command specified by said compacted root node are adhered to; and

assembling one or more commands and parameters from said data transmission string.

2. The method of claim 1, wherein said step of parsing said data transmission string further comprises the step of checking said data transmission string for the semantic correctness of a compacted form thereof.

3. The method of claim 1, wherein said one or more commands and parameters assembled from said data transmission string are recognized by a server in a destination system and a executed by a server processor in said destination system.

4. The method of claim 3, wherein said data transmission string is a communications packet.

5. The method of claim 4, wherein subsequent to execution of said one or more commands and parameters assembled from said data transmission string a reply command is returned from said server processor.

6. The method of claim 5, wherein said reply command is translated into a data transmission string expressing said reply command into a compacted reply type tree-structure data, wherein said compacted reply type tree-structure data for said reply command contains a compacted reply type root node, followed by one or more compacted reply type parameters corresponding to reply type nodes linked thereto, each said linked reply type node corresponding to data required by the reply type root node for said reply command, said reply type root node and said one or more compacted reply type parameters expressing said tree-structure data in a linear depth-first manner.

7. A method of encoding a data transmission command using a tree-structure data dictionary, comprising:

submitting either a reply type command, a request type command, or an object type command to an internal processor, said command being recognized by a source system that includes said internal processor;

using said reply type command, said request type command or said object type command to retrieve a tree-type data structure from the tree-structure data dictionary, wherein said tree-type data structure is a data transmission string including a compacted root node located at the head of said tree-type data structure, said compacted root node specifying whether said tree-type structure corresponds either to said request type command, said reply type command, or said object type command, followed by one or more compacted parameters corresponding to nodes linked to said compacted root node in a branched fashion, each said linked node corresponding to data required by the type of command specified by said compacted root node,

wherein said data transmission string includes said compacted root node and said compacted parameters in a linear depth-first manner to provide a flat representation of said tree-type data structure;

transmitting said data transmission string for processing by a server in a destination system.

8. The method of claim 7, wherein said data transmission string is received at a destination system, and

wherein said destination system uses a hierarchical data dictionary to parse said data transmission string, including said compacted root node and said compacted parameters, to determine whether required information is present and whether relevant rules are obeyed for the type of command specified by said compacted root node, and further ensuring that structural and value rules for said linked nodes corresponding to the type of command specified by said compacted root node are adhered to.

9. The method of claim 8, wherein said destination system assembles one or more commands and parameters from said data transmission string.

10. The method of claim 9, wherein said one or more commands and parameters are recognized by a server in said destination system and are executed by a server processor in said destination system.

11. The method of claim 10, wherein said data transmission string is a communications packet.

12. The method of claim 11, wherein subsequent to execution of said one or more commands and parameters assembled from said data transmission string a reply command is returned from said server processor.

13. The method of claim 12, wherein said reply command is translated into a data transmission string expressing said reply command into a compacted rely type tree-structure data, wherein said compacted reply type tree-structure data for said reply command contains a compacted reply type root node, followed by one or more compacted reply type parameters corresponding to reply type nodes linked thereto, each said linked reply type node corresponding to data required by the reply type root node for said reply command, said reply type root node and said one or more compacted reply type parameters expressing said tree-structure data in a linear depth-first manner.

14. A distributed computer system comprising a source system and a destination system, comprising:

means for submitting either a reply type command, a request type command, or an object type command to an internal processor in the source system;

means for using said reply type command, said request type command or said object type command to retrieve a tree-type data structure from a data dictionary, wherein said tree-type data structure is a data transmission string including a compacted root node located at the head of said tree-type data structure, said compacted root node specifying whether said tree-type structure corresponds either to said request type command, said reply type command, or object type command, followed by one or more compacted parameters corresponding to nodes linked to said compacted root node in a branched fashion, each said linked node corresponding to data required by the type of command specified by said compacted root node,

wherein said data transmission string includes said compacted root node and said compacted parameters in a linear depth-first manner to provide a flat representation of said tree-type data structure;

means for transmitting said data transmission string for processing by a server in the destination system.

15. The system of claim 14, wherein said data transmission string is received at the destination system, and

further comprising a parser in the destination system for using a data dictionary to parse said data transmission string, including said compacted root node and said compacted parameters, to determine whether required information is present and whether relevant rules are obeyed for the type of command specified by said compacted root node, and further ensuring that structural and value rules for said linked nodes corresponding to the type of command specified by said compacted root node are adhered to.

16. The system of 15, wherein said destination system further comprises an assembling means, for assembling one or more commands and parameters from said data transmission string.

17. The system of claim 16, wherein said one or more commands and parameters are recognized by a server in the destination system and are executed by a server processor in the destination system.

18. The system of claim 17, wherein said data transmission string is a communications packet.

19. The system of claim 18, wherein subsequent to execution of said one or more commands and parameters assembled from said data transmission string a reply command is returned from said server processor.

20. The system of claim 19, wherein said reply command is translated into a data transmission string expressing said reply command into a compacted rely type tree-structure data, wherein said compacted reply type tree-structure data for said reply command contains a compacted reply type root node, followed by one or more compacted reply type parameters corresponding to reply type nodes linked thereto, each said linked reply type node corresponding to data required by the reply type root node for said reply command, said reply type root node and said one or more compacted reply type parameters expressing said tree-structure data in a linear depth-first manner.

21. A method of processing a data transmission using a data dictionary, comprising the steps of:

receiving a data transmission string in a destination system;

retrieving a definition for a command corresponding to said data transmission string;

using said definition for said command as a reference into the data dictionary to retrieve a tree-structure data corresponding to said command, wherein said tree-structure data contains a compacted root node corresponding either to a request type command, a reply type command, or an object type command, followed by one or more compacted parameters corresponding to nodes linked thereto, each said linked node corresponding to data required by said root node for said command, said root node and said one or more compacted parameters expressing said tree-structure data in a linear depth-first manner;

using said tree-structure data to generate one or more commands and parameter;

recognized by a server in said destination system.

22. The method of claim 21, further comprising:

parsing said data transmission string by checking said data transmission string for the semantic correctness of the compacted form thereof.

23. The method of claim 22, wherein said data transmission string is a communications packet containing one or more commands and data associated therewith recognized by said server in said destination system.

24. A method of encoding a data transmission command using a dictionary, comprising:

using a reply type command, a request type command or an object type command as a reference into a data transmission string dictionary in order to retrieve a root node therefrom;

generating a compacted linear string from said root node, said compacted linear string having a tree-type structure including said root node, corresponding either to a request type command, a reply type command, or an object type command, and one or more parameters corresponding to nodes linked to said root node in a branched fashion, each said linked node corresponding to data required by the type of command specified by said root node;

transmitting said compacted linear string to a destination system for processing.

25. The method of claim 24,

wherein said destination system parses said compacted linear string to determine whether required information is present and whether relevant rules are obeyed for the type of command specified by said root node, and further ensures that structural and value rules for said linked nodes corresponding to the type of command specified by said root node are adhered to.

26. The method of claim 25, wherein said destination system assembles a destination command from said compacted linear string.

27. The method of claim 26, wherein said destination command is recognized by a server in said destination system and is executed by a server processor in said destination system.

28. The method of claim 27, wherein said compacted linear string is mapped into a communications packet.

29. The method of claim 28, wherein subsequent to execution of said destination command a destination reply command compacted linear string is returned to said source system.

30. The method of claim 29, further comprising:

using a destination reply type command as a reference into a destination data stream dictionary in order to retrieve a destination reply command root node therefrom;

generating said destination reply command compacted linear string from said destination reply command root node, said destination reply command compacted linear string having a tree-type structure including said destination reply command root node and one or more destination reply command parameters corresponding to nodes linked to said destination reply command root node in a branched fashion, each said linked node corresponding to data required by the type of command specified by said destination reply command root node;

transmitting said destination reply command compacted linear string to said source system for processing.

31. The method of claim 30, wherein said destination reply type command is received from said destination system server upon execution of said destination command.

32. The method of claim 24, wherein said commands are generated by an internal processor and provided to a source system for generation of said compacted linear string.

33. A distributed computer system comprising a source system and a destination system, comprising:

means for using said reply type command, said request type command or said object type command as a reference into a data transmission string dictionary in order to retrieve a root node therefrom;

means for generating a compacted linear string from said root node, said compacted linear string having a tree-type structure including said root node, corresponding either to a request type command, a reply type command, or an object type command, and one or more parameters corresponding to nodes linked to said root node in a branched fashion, each said linked node corresponding to data required by the type of command specified by said root node;

means for transmitting said compacted linear string to a destination system for processing.

34. The system of claim 33, further comprising:

a parser in the destination system for parsing said compacted linear string to determine whether required information is present and whether relevant rules are obeyed for the type of command specified by said root node, and further ensures that structural and value rules for said linked nodes corresponding to the type of command specified by said root node are adhered to.

40. The system of claim 33, wherein said commands are generated by an internal processor and provided to a source system for generation of said compacted linear string.

35. The system of 34, wherein said destination system further comprises an assembling means for assembling a destination command from said compacted linear data transmission string.

36. The system of claim 35, wherein said destination command is recognized by a server in the destination system and is executed by a server processor in the destination system.

37. The system of claim 36, wherein said compacted linear string is mapped into a communications packet.

38. The system of claim 37, wherein subsequent to execution of said destination command a destination reply command compacted linear string is returned to said source system.

39. The system of claim 38, further comprising:

means for receiving said destination reply type command from said destination system server, said destination reply type command being internally recognized by said destination system;

means for using said destination reply type command as a reference into a destination data stream dictionary in order to retrieve a destination reply command root node therefrom;

means for generating said destination reply command compacted linear string from said destination reply command root node, said destination reply command compacted linear string having a tree-type structure including said destination reply command root node and one or more destination reply command parameters corresponding to nodes linked to said destination reply command root node in a branched fashion, each said linked node corresponding to data required by the type of command specified by said destination reply command root node;

means for transmitting said destination reply command compacted linear string to said source system for processing.