Computer system and method for storing and displaying of a semantically structured entity relationship diagram

• US 5,386,571 A
• Filed: 09/17/1993
• Issued: 01/31/1995
• Est. Priority Date: 09/19/1992
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Kurz, Wolfgang
• Primary Examiner(s): Heckler, Thomas M.
• Application Number:
  US08/123,391
• Time in Patent Office: 501 Days
• Field of Search: 395/600, 395/700, 395/157
• US Class Current: 1/1
• CPC Class Codes: G06F 16/288 Entity relationship models

Abstract

The invention concerns a method and system for storing and displaying an entity relationship diagram. The entity relationship diagram of the invention is composed of only four different classes of allowed entity types. Thereby redundancy is eliminated and less storage locations are needed to store the diagram. The diagram comprises kernel entity sets K, attributive entity sets A, role entity sets P and relation entity sets R which are displayed on a display 9.

Claims

1. A method for storing and displaying of an entity relationship diagram in a computer system comprising storage means, said method comprising the steps of

a) storing of first data representative of a sequence of kernel entity sets K_i, where a kernel entity set K_i is a class of kernel entities e_i ;

b) storing of second data representative of relation entity sets R_i, where a relation entity set R_i is a class of relations among a number n of kernel entities e_i, each taken from a kernel entity set K_i according to the definition D ##EQU2## and where the kernel entity sets K_i in the definition D may not be distinct, whereby said second data comprise information as to the assignment of each of said relation entity sets R_i to at least one of said kernel entity sets;

c) logically partitioning a display into at least a first and a second section;

d) displaying of the kernel entity sets K_i represented by a first class of symbols in said first section of said display; and

displaying of the relation entity sets R_i represented by a second class of symbols in said second section.

2. A method for storing of an entity relationship diagram according to claim 1, said method further comprising the steps of

storing of third data representative of role entity sets P_i, where a role entity set P_i is a class of roles of entities e_i comprised in a kernel entity set K_i, whereby said third data comprise information to which one of said kernel entity sets K_i a role entity set P_i belongs;

and

displaying at least one of said role entity sets by a third class of symbols in said first section.

3. A method for storing of an entity relationship diagram according to claim 2, said method further comprising the steps of

storing of fourth data representative of attributive entity sets A_i, where each attributive entity set A_i has an attribute associated thereto and an attribute is defined as a function f which maps from a kernel entity set K_i or a role entity set P_i into an attributive entity set A_i or a cartesian product of attributive entity sets A_i

4. A method according to claim 3, wherein the order of kernel entity sets K_i in said sequence is defined by an index x_i which is assigned to each of said kernel entity sets K_i, said index x_i being comprised in said first data.

5. A method according to claim 4, wherein said step of logically dividing said display into two sections is along a horizontal or vertical line and said method further comprising the steps of

storing of further first data representative of a further kernel entity set K_i, whereby the position of said further kernel entity set K_i in said sequence is defined by assigning an index x_i ;

and

displaying said kernel entry sets K_i along said line.

6. A method for displaying of an entity relationship diagram on the display of a computer system, said entity relationship diagram being stored in said computer system, characterized by the steps of

a) logically partitioning said display into at least a first and a second section;

b) displaying of kernel entity sets K_i represented by a first class of symbols in said first section of said display, where a kernel entity set K_i is a class of kernel entities e_i ;

c) displaying of relation entity sets R_i represented by a second class of symbols in said second section, where a relations entity set R_i is a class of relations among a number n of kernel entities e_i, each taken from a kernel entity set K_i according to the definition D ##EQU3## whereby the kernel entity sets K_i in the definition D may not be distinct.

7. A method according to claim 6, said kernel entity sets K_i comprising role entity sets P_i, where a role entity set P_i is a class of roles of entities e_i comprised in a kernel entity set K_i, said method further comprising a step of displaying at least one of said role entity sets represented by a third class of symbols in said first section.

8. A method according to claim 7, said kernel entity sets K_i comprising attributive entity sets A_i, where each attributive entity set has an attribute associated thereto and an attribute is defined as a function f which maps from a kernel entity set K_i or a role entity set P_i into an attributive entity set A_i or a cartesian product of attributive entity sets A_i

9. A method according to claim 8, said method further comprising the steps of

defining an array of allowable positions on said display;

and

arranging said symbols in said positions.

10. A method according to claim 9, said partitioning step comprising a step of logically dividing said display into two sections along a horizontal or vertical line, whereby said kernel entity sets K_i are displayed along that line.

11. A method according to claim 10, wherein said entity relationship diagram is stored as a vectorgraph.

12. A method according to claim 10, wherein said entity relationship diagram is stored in a computer system comprising storage means, said method further comprising the steps of

a) storing of first data representative of a sequence of kernel entity sets K_i, where a kernel entity set K_i is a class of kernel entities e_i ;

b) storing of second data representative of relation entity sets R_i, where a relation entity set R_i is a class of relations among a number n of kernel entities e_i, each taken from a kernel entity set K_i according to the definition D ##EQU4## and where the kernel entity sets K_i in the definition D may not be distinct, whereby said second data comprise information as to the assignment of each of said relation entity sets R_i to at least one of said kernel entity sets.

13. A method according to claim 10, wherein the absolute and/or relative position of each kernel entity set K_i which is displayed along that line is determined by the order of kernel entity sets K_i in said sequence.

14. A method according to claim 6, wherein symbols belonging to different ones of said classes of symbols have a different shape and symbols belonging to the same class of symbols may only differ as to their size.

15. A method according to claim 14, wherein relations within said class of relations are mathematical relations.

16. A computer system for displaying of an entity relationship diagram, said system comprising

a) means for storing of first data representative of a sequence of kernel entity sets K_i, where a kernel entity set is a class of kernel entities e_i and for storing of second data representative of relation entity sets R_i, where a relation entity set R_i is a class of relations among a number n of kernel entities e_i, each taken from a kernel entity set K_i according to the definition D ##EQU5## and where the kernel entity sets K_i in the definition D may not be distinct, whereby said second data comprise information as to the assignment of each of said relation entity sets R_i to at least one of said kernel entity sets,

b) display means logically partitioned into at least a first and a second section,

c) means for generating a first class of symbols to display a representation of said kernel entity sets in said first section and for generating a second class of symbols to display a representation of said relation entity sets R_i in said second section,

whereby said means for generating are interconnected to said means for storing and to said display means.

17. A computer system according to claim 16, wherein said means for storing stores third data representative of role entity sets P_i, where a role entity set P_i is a class of roles of entities e_i comprised in a kernel entity set K_i, whereby said third data comprise information to which one of said kernel entity sets K_i a role entity set P_i belongs, and said means for generating is adapted to generate a third class of symbols to display a representation of said kernel entity sets in said first section.

18. A computer system according to claim 17, wherein said means for storing stores fourth data representative of attributive entity sets A_i, where each attributive entity set has an attribute associated thereto and an attribute is defined as a function f which maps from a kernel entity set K_i or a role entity set P_i into an attributive entity set A_i or a cartesian product of attributive entity sets A_i

19. A computer system according to claim 16, said system comprising input means, such as a mouse, especially to define the partitioning of said display means.