From: chris@dickinson.uk.net   
      
   On Thursday, 26 April 2018 16:34:19 UTC+1, Ian Goddard  wrote:   
   > What you really need is something    
   > geared to storing events (A married B, C is father of D) without having    
   > to commit to deciding that A and C are the same person before being able    
   > to fit B and D into the database.   
      
   That's a fairly simple thing to do in a database.   
      
   For instance, you create a (dynamic) list of names (John Smith, Elizabeth   
   Bloggs, etc.) with a (dynamic) sublist of actual individuals for both. All of   
   these have a unique ID number. Similarly in the tree, each node has a   
   (dynamic) sublist of potentials    
   with those IDs. And then you add a decision process to judge who comes first   
   or who can't be in the sublist   
      
   The problem with this comes not so much from memory space but from the ability   
   of the database to access the quantity of data in an efficient and timely way.   
      
   Chris   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)