dc.description.abstract |
Searching relationship among persons is more
and more growing importance to acquire related
information, genealogical relationship and personnel
history. In this paper, the framework with three
portions is proposed for exploring peoples’
relationship from their personnel information. The first
portion focuses on storage structure to store data in
Graph database by representing persons as nodes and
their attributes as properties. There are no predefined
relationships or edges between person nodes. The
second part focuses on searching relationships among
persons. Graph database searching algorithm called
Personnel Relationship Searching Algorithm is
proposed. The last portion proposes Deductive
Reasoning Algorithm to define two persons’
relationship based on search results of match domain
(or) attributes. For example, if the match domain is
relatives, the relation may be consanguine, such
asGrandFather,Eldest_Son,Youngest_Son_In_Law,
Khame_Khamet, etc. If the match domain is
organization (or) hobby (or) religion, the relation may
work in same organization, etc. |
en_US |