Patent ID: 8990198
Filing Date: 2015-03-24
Classification: G06F,Y10S

Abstract:
1. A method for automatic computerized identification of mergeable family trees stored in one or more databases, wherein each family tree comprises nodes representing individuals and connecting links connecting nodes defining a relationship sequence, each said node comprising data items on the individual represented thereby and each said node being linked to at least one other node, the method comprising: directing a computer to find matching nodes satisfying at least one of the following (i) a match in a majority of data items, (ii) a match in predetermined data items, (iii) having matched data items, said matched data items having pre-assigned weighting factors of respective data pieces about the individual, for which the average or total weighting factors satisfy a certain threshold condition; directing a computer to determine that two family trees are mergeable only if there are a predetermined number of matching nodes and connecting links therebetween common to each of the two family trees, said step of directing a computer to determine that two family trees are mergeable comprising-providing a plurality of first matrices associated with one of the two family trees and a plurality of second matrices associated with the other of the two family trees, each matrix comprising attributes on individuals that are linked to one another by a predetermined link; identifying substantially identical first and second matrices in said pluralities of first and second matrices; and generating data indicative of a merge of the family trees to one another if a number of the substantially identical matrices exceeds a predefined number; and