Hybrid and dynamic representation of data structures

• US 7,328,215 B2
• Filed: 04/30/2002
• Issued: 02/05/2008
• Est. Priority Date: 03/01/2002
• Status: Expired due to Term

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Stumpf, Dirk
• Primary Examiner(s): Truong; Cam Y T
• Application Number:
  US10/137,211
• Publication Number:
  US 20030172078A1
• Time in Patent Office: 2,107 Days
• Field of Search: 707/3, 707/100, 707/102, 707/6, 707/103, 707/104.1, 345853-855
• US Class Current: 707/797
• CPC Class Codes: G06F 16/9027 Trees
• CPC Class Codes: G06F 16/904 Browsing; Visualisation therefor for navigating the web G06F16/954; browsing optimisation for the web G06F16/957
• CPC Class Codes: Y10S 707/954 Relational
• CPC Class Codes: Y10S 707/955 Object-oriented
• CPC Class Codes: Y10S 707/957 Multidimensional
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99953 Recoverability

Abstract

Methods and apparatus for dynamic and hybrid representation of data structures. A computer program product for representing a data structure includes instructions to cause a processor to receive information associated with the data structure, and determine how to represent the data structure as one of a tree representation, a breadcrumb representation, and a hybrid of a tree representation and a breadcrumb representation. The product is tangibly stored on machine-readable media. A method for representing a data structure includes representing the data structure as a hybrid of a tree representation and a breadcrumb representation.

Claims

1. A computer-implemented method for representing a data structure, comprising:

representing the data structure as a first representation of data objects;

buffering data from the data structure in a middleware component;

reusing the buffered data to represent the data structure as a hybrid representation;

receiving user input specifying a portion of the first representation;

representing the data structure as the hybrid representation to display the portion specified by the user input, the hybrid representation comprising second and third representations of the data objects, wherein the first, second and third representations are different and are each selected from a group consisting of a tree, a breadcrumb, a table, and a tabbed folder, wherein representing the data structure as a hybrid representation comprises;

designating one of the second and third representations to be a tree or breadcrumb based on a complexity of data structure and based on a probability that several branches of the data structure are expanded to a predefined level of a hierarchy, the hierarchy having nodes representing the data objects stored in the data structure and connections among the nodes, the connections representing relationships between the data objects,

wherein the second and third representations of data structures are selected according to data within a user profile; and

displaying the portion of the first representation specified by the user input.

2. The method of claim 1, wherein selecting the second, third representations of data structures comprises:

comparing characteristics of the data structure with characteristics of a computing environment.

3. The method of claim 2, wherein the characteristics of the data structure comprise:

one or more of an amount of data associated with the data structure, a number of levels in the data structure, a dimension of the structure, a symmetry of the data structure, and a pattern of the data structure.

4. The method of claim 2, wherein the characteristics of the computing environment comprise:

one or more of a display, an available font, and a color limitation of the display.

5. The method of claim 1, further comprising:

receiving input specifying a data structure representation other than the hybrid representation; and

representing the data structure as the data structure representation specified by the input.

6. The method of claim 1, further comprising:

receiving input specifying a portion of the data structure; and

changing the portion from a tree portion into a breadcrumb portion.

7. The method of claim 1, further comprising:

rearranging the hybrid representation of the data structure into a further data structure representation.

8. The method of claim 7, wherein rearranging the hybrid representation comprises:

reusing information related to the previous representation of the data structure.

9. The method of claim 1, wherein:

representing the data structure as the hybrid representation occurs automatically without a user request.

10. The method of claim 1, wherein representing the data structure as a hybrid representation comprises designated each of the first, second, and third representations as one of a tree, a bread crumb,a table, and a tabbed folder.

11. The method of claim 10, wherein representing the data structure as a first representation comprises representing the data structure as a second hybrid representation, wherein the first representation comprises fourth and fifth representations that are different.

12. The method of claim 11, wherein representing the data structure as a second hybrid representation futher comprises designating each of the fourth and fifth representations as one of a tree, a bread crumb, a table, and a tabbed folder.

13. The method of claim 12, wherein:

representing the data structure as a second hybrid representation further comprises designating fourth and fifth representations as a table amd a bread crumb; and

represention the data structure as a first representation further comprises designating the second and third representations as a table and a tree.

14. The method of claim 1, wherein representing the data structure as a hybrid representation comprises:

designating the first representation as a tree;

designating the second representation as a table; and

designating the third representation as a bread crumb.

20. The product of claim 13, wherein:

the data structure comprises a collection of nodes; and

the hybrid representation of the data structure allows the collection of nodes to be shown in a display area.

15. A computer program product, stored on a machine readable storage device, for representing a data structure, the product comprising instructions to cause a processor to:

receive information associated with the data structure;

represent the data structure as a first representation of data objects;

buffer data from the data structure in a middleware component;

reuse the buffered data to represent the data structure as a hybrid representation;

representing the data structure as the hybrid representation to display the portion specified by the user input, the hybrid representation comprising second and third representations of the data objects, wherein the first, second and third representations are different and are each selected from a group consisting of a tree, a breadcrumb, a table, and a tabbed folder, wherein the instructions to cause the processor to represent the data structure as the hybrid representation comprises further instructions that cause to the processor to;

designate one of the second and third representations to be a tree or breadcrumb based on a complexity of data structure and based on a probability that several branches of the data structure are expanded to a predefined level of a hierarchy, the hierarchy having nodes representing the data objects stored in the data structure and connections among the nodes, the connections representing relationships between the data objects,

wherein the second and third representations of data structures are selected according to data within a user profile; and

display the portion of the first representation specified by the user input.

16. The product of claim 15, wherein the received information comprises:

one or more of data structure information, user information, and user-independent information.

17. The product of claim 15, wherein the received information comprises:

a rule used to determine how to represent the data structure.

18. The product of claim 15, wherein the product comprises instructions to cause the processor to:

receive information assciated with characteristics of a computing environment.

19. The product of claim 18, wherein the information associated with characteristics of the computing environment comprises:

one or more of a size of a display, an available font, and a color limitation of the display.

21. The product of claim 15, wherein the instructions also cause the processor to:

receive a request to represent the data structure, the processor determining how to represent the data structure before receiving the request.

22. The product of claim 15, wherein the instructions also cause the processor to:

receive input specifying, a portion of the data structure; and

determine how to represent the data structure as a second hybrid representation to display the portion specified.

23. The method of claim 15, wherein ach of the first, second, and third representations is one of a tree, a breadcrumb, a table, and a tabbed folder.

24. A system for representing a data structure comprising:

a processor;

a machine-readable component storing criteria used to determine how to represent the data structure as a first data structure representation of data objects; and

a rearrangement logic to

represent the data structure as a first representation of data objects;

buffer data from the data structure in a middleware component;

reuse the buffered data to represent the data structure as a hybrid representation;

receive user input specifying a portion of the first representation;

represent the data structure as the hybrid representation to display the portion specified by the user input, the hybrid representation comprising second and third representations of the data objects, wherein the first, second and third representations are different and are each selected from a group consisting of a tree, a breadcrumb, a table, and a tabbed folder, wherein representing the data structure as a hybrid representation comprises;

designate one of the second and third representations to be a tree or breadcrumb based on a complexity of data structure and based on a probability that several branches of the data structure are expanded to a predefined level of a hierarchy, the hierarchy having nodes representing the data objects stored in the data structure and connections among the nodes, the connections representing relationships between the data objects,

wherein the second and third representations of data structures are selected according to data within a user profile; and

display the portion of the first representation specified by the user input.

25. The system of claim 24, wherein the criteria comprises:

characteristics of the data structure.

26. The system of claim 25, wherein the component further comprises:

extraction logic used to extract the characteristics of the data structure from the data structure.

27. The system of claim 24, wherein the criteria comprises:

one or more of a user preference and a user profile.

28. The system of claim 24, wherein the component includes:

an input device to receive a user request to selectively rearrange the data structure.

29. The system of claim 24, wherein:

the rearrangement logic is further configured to designate each of the first, and second, and third categories of data structures as one of a tree, a bread crumb, a table, and a tabbed folder.

30. The system of claim 24, wherein the system further comprises:

a back-end database used to store the data structure.

31. The system of claim 24, wherein the system further comprises:

a front-end component used to display the data structure representation to a user.

32. The system of claim 24, wherein:

the component is middle ware component.