Systems, methods, and computer program products to display and select hierarchical database segments and fields
First Claim
1. A computer-implemented method for presenting a valid path in a hierarchical tree structure, wherein said computer includes at least one database description, said database description having at least one segment and at least one field, said method comprising:
- describing said database description in said hierarchical tree structure, thereby establishing a relationship between said at least one segment and said at least one database description field;
placing said at least one segment into said hierarchical tree structure;
placing said at least one database description field into said hierarchical tree structure;
accepting valid input to select said at least one segment;
accepting valid input to select said at least one database description field;
creating said valid path that includes said selected at least one segment and said selected at least one database description field;
representing mutual exclusivity of said selected at least one segment in said valid path; and
presenting said valid path concisely within said hierarchical tree structure.
1 Assignment
0 Petitions
Accused Products
Abstract
Systems, methods, and computer products that efficiently share and move data between different types of data storage formats. More particularly, the preferred embodiment of the present invention provides an easy to use graphical user interface (GUI) for displaying, navigating, and selecting hierarchical database segments and fields. The preferred embodiment of the present invention novelly uses a hierarchical tree structure that clearly represents the structures of a database and their mutual exclusivity, for easy understanding of and navigation through the various database structures. The user is prevented from selecting segments and fields that are not valid for the selected path thereby ensuring accuracy in the representation of the database data structures. Also, the user may select a path from the top of the hierarchical tree, the root, to a specific segment or field.
53 Citations
30 Claims
-
1. A computer-implemented method for presenting a valid path in a hierarchical tree structure, wherein said computer includes at least one database description, said database description having at least one segment and at least one field, said method comprising:
-
describing said database description in said hierarchical tree structure, thereby establishing a relationship between said at least one segment and said at least one database description field;
placing said at least one segment into said hierarchical tree structure;
placing said at least one database description field into said hierarchical tree structure;
accepting valid input to select said at least one segment;
accepting valid input to select said at least one database description field;
creating said valid path that includes said selected at least one segment and said selected at least one database description field;
representing mutual exclusivity of said selected at least one segment in said valid path; and
presenting said valid path concisely within said hierarchical tree structure. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A computer-implemented method for presenting a valid path in a hierarchical tree structure, wherein said computer includes at least one programming language data structure, said programming language data structure having at least one segment and at least one field;
- said method comprising;
describing said programming language data structure in said hierarchical tree structure, thereby establishing a relationship between said at least one segment and said at least one programming language data structure field;
placing said at least one segment into said hierarchical tree structure;
placing said at least one programming language data structure field into said hierarchical tree structure;
accepting valid input to select said at least one segment;
accepting valid input to select said at least one programming language data structure field;
creating said valid path that includes said selected at least one segment and said selected at least one programming language data structure field;
representing mutual exclusivity of said selected at least one segment in said valid path; and
presenting said valid path concisely within said hierarchical tree structure. - View Dependent Claims (7, 8, 9, 10)
- said method comprising;
-
11. A computer-implemented method for presenting a valid path in a hierarchical tree structure, wherein said computer includes at least one database description and at least one programming language data structure, said database description having at least one segment, and said programming language data structure having at least one field;
- said method comprising;
describing said database description and said programming language data structure in said hierarchical tree structure, thereby establishing a relationship between said at least one segment and said at least one programming language data structure field;
placing said at least one segment into said hierarchical tree structure;
placing said at least one programming language data structure field into said hierarchical tree structure;
accepting valid input to select said at least one segment;
accepting valid input to select said at least one programming language data structure field;
creating said valid path that includes said selected at least one segment and said selected at least one programming language data structure field;
representing mutual exclusivity of said selected at least one segment in said valid path; and
presenting said valid path concisely within said hierarchical tree structure. - View Dependent Claims (12, 13)
- said method comprising;
-
14. A computer system for presenting a valid path in a hierarchical tree structure, wherein said computer system includes at least one database description, said database description having at least one segment and at least one field, said computer system comprising:
-
said database description that is described in said hierarchical tree structure, thereby establishing a relationship between said at least one segment and said at least one database description field;
said at least one segment that is included in said hierarchical tree structure;
said at least one database description field that is included in said hierarchical tree structure;
said at least one segment that is selected via valid input;
said at least one database description field that is selected via valid input;
said valid path that is that includes said selected at least one segment and said selected at least one database description field;
said valid path that represents mutual exclusivity of said selected at least one segment; and
said valid path that is presented concisely within said hierarchical tree structure. - View Dependent Claims (15, 16, 17, 18)
-
-
19. A computer system for presenting a valid path in a hierarchical tree structure, wherein said computer system includes at least one programming language data structure, said programming language data structure having at least one segment and at least one field;
- said computer system comprising;
said programming language data structure that is described in said hierarchical tree structure, thereby establishing a relationship between said at least one segment and said at least one programming language data structure field;
said at least one segment that is included in said hierarchical tree structure;
said at least one programming language data structure field that is included in said hierarchical tree structure;
said at least one segment that is selected via valid input;
at least one programming language data structure field that is selected via valid input;
said valid path that includes said selected at least one segment and said selected at least one programming language data structure field;
said valid path that represents mutual exclusivity of said selected at least one segment; and
said valid path that is presented concisely within said hierarchical tree structure. - View Dependent Claims (20, 21, 22, 23)
- said computer system comprising;
-
24. A computer system for presenting a valid path in a hierarchical tree structure, wherein said computer system includes at least one database description and at least one programming language data structure, said database description having at least one segment, and said programming language data structure having at least one field;
- said computer system comprising;
said database description and said programming language data structure that are described in said hierarchical tree structure, thereby establishing a relationship between said at least one segment and said at least one programming language data structure field;
said at least one segment that is included in said hierarchical tree structure;
said at least one programming language data structure field that is included in said hierarchical tree structure;
said at least one segment that is selected via valid input;
said at least one programming language data structure field that is selected via valid input;
said valid path that includes said selected at least one segment and said selected at least one programming language data structure field;
said valid path that represents mutual exclusivity of said selected at least one segment; and
said valid path that is presented concisely within said hierarchical tree structure. - View Dependent Claims (25, 26)
- said computer system comprising;
-
27. An article of manufacture comprising a computer usable medium embodying one or more instructions executable by said computer for presenting a valid path in a hierarchical tree structure, wherein said computer includes at least one database description, said database description having at least one segment and at least one field, wherein:
-
said computer executable instructions describe said database description in said hierarchical tree structure, thereby establishing a relationship between said at least one segment and said at least one database description field;
said computer executable instructions place said at least one segment into said hierarchical tree structure;
said computer executable instructions place said at least one database description field into said hierarchical tree structure;
said computer executable instructions accept valid input to select said at least one segment;
said computer executable instructions accept valid input to select said at least one database description field;
said computer executable instructions create said valid path that includes said selected at least one segment and said selected at least one database description field;
said computer executable instructions represent mutual exclusivity of said selected at least one segment in said valid path; and
said computer executable instructions present said valid path concisely within said hierarchical tree structure. - View Dependent Claims (28)
-
-
29. An article of manufacture comprising a computer usable medium embodying one or more instructions executable by said computer for presenting a valid path in a hierarchical tree structure, wherein said computer includes at least one programming language data structure, said programming language data structure having at least one segment and at least one field;
- wherein;
said computer executable instructions describe said programming language data structure in said hierarchical tree structure, thereby establishing a relationship between said at least one segment and said at least one programming language data structure field;
said computer executable instructions place said at least one segment into said hierarchical tree structure;
said computer executable instructions place said at least one programming language data structure field into said hierarchical tree structure;
said computer executable instructions accept valid input to select said at least one segment;
said computer executable instructions accept valid input to select said at least one programming language data structure field;
said computer executable instructions create said valid path that includes said selected at least one segment and said selected at least one programming language data structure field;
said computer executable instructions represent mutual exclusivity of said selected at least one segment; and
said computer executable instructions present said valid path concisely within said hierarchical tree structure.
- wherein;
-
30. An article of manufacture comprising a computer usable medium embodying one or more instructions executable by said computer for presenting a valid path in a hierarchical tree structure, wherein said computer includes at least one database description and at least one programming language data structure, said database description having at least one segment, and said programming language data structure having at least one field;
- wherein;
said computer executable instructions describe said database description and said programming language data structure in said hierarchical tree structure, thereby establishing a relationship between said at least one segment and said at least one programming language data structure field;
said computer executable instructions place said at least one segment into said hierarchical tree structure;
said computer executable instructions place said at least one programming language data structure field into said hierarchical tree structure;
said computer executable instructions accept valid input to select said at least one segment;
said computer executable instructions accept valid input to select said at least one programming language data structure field;
said computer executable instructions create said valid path that includes said selected at least one segment and said selected at least one programming language data structure field;
said computer executable instructions represent mutual exclusivity of said selected at least one segment; and
said computer executable instructions present said valid path concisely within said hierarchical tree structure.
- wherein;
Specification