Abstract

Family trees are one of the use efficiency data structures to present and store the information. There are two kinds of mechanisms to present the relationship of the elements: Occidental Family Trees (OFT) and Oriental Family Trees, especially, Chinese Family Trees (CFT). This paper analyzes the efficiency of these two kinds of trees in the context of relationship presentation and extraction of information. Using the developed OFT and CFT presentation models and search algorithms, the paper conducts the comparison of search performance between OFT and CFT search algorithms. The study reveals that the computational cost is higher in CFT model, but it provides a greater gain information and produces in details the relationships between the individuals in the family trees for information retrieval applications.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call