A data structure for family relations

Abstract
A data structure is proposed which enables efficient determination of family relations of common interest with the minimum amount of information on each individual. The problem of updating information due to births, deaths, marriages and divorces is considered. Algorithms for determining the immediate relatives of each individual are given and a framework is established for writing procedures to determine other relatives.

This publication has 0 references indexed in Scilit: