Dismiss
The Prior Art Database and Publishing service will be updated on Sunday, February 25th, from 1-3pm ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

# Entity Relation Finding Algorithm

IP.com Disclosure Number: IPCOM000014124D
Original Publication Date: 2001-Apr-01
Included in the Prior Art Database: 2003-Jun-19
Document File: 2 page(s) / 53K

IBM

## Abstract

This invention discloses is a solution to express the relationship among entities simply and easily by using symbols. In response to input of data items of entities, the inventions method finds and checks the common items among tntities, and creates the relationship by symbols. The types of relationship are 1:1 , 1:m , m:1 ,and m:m . These are symbolized ,for example , as follows : , , and .

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 2

Entity Relation Finding Algorithm

This invention discloses is a solution to express the relationship among entities simply and
easily by using symbols.

In response to input of data items of entities, the inventions method finds and checks the
common items among
tntities, and creates the relationship by symbols.

The types of relationship are 1:1 , 1:m , m:1 ,and m:m . These are symbolized ,for example
, as follows :

+-+ , +-< , >-+ and >-< .

Sample explanations are :

entity_1 entity 2 relation Symbol (relationship)
------------------------------------------------

order orderLeg +-< ( 1:m

orderLegItem Item >-+ ( m:1 )
orderGroup order >-< ( m:m )
Item ItemAttribute +-+ ( 1:1 )
refered ER-Diagram is as follows :

)

order /

PK1 orderN o

1

m

orderLeg /

Item /

orderG roup /

PK1 orderN o PK2 legN o

PK1 Item N o Item N am e

m

1PK1 orderN o PK2 date
PK3 groupN o

m

m

PK3 date

1

1

Item N o

Item Attribute /

PK1 Item N o Item U nit

1

Page 2 of 2

2