Think of a binary tree. Parent_id auto increment Child_id
Details of the famly The head of the family has a child_id == parent_id All members of the family have different child_ids but the same parent_id Then you can do some really cool recursive fast searches. - Dathan Vance Pattishall - Sr. Programmer and mySQL DBA for FriendFinder Inc. - http://friendfinder.com/go/p40688 -->-----Original Message----- -->From: Nitin [mailto:[EMAIL PROTECTED] -->Sent: Monday, October 27, 2003 10:46 PM -->To: [EMAIL PROTECTED] -->Subject: Ancestry program --> -->Hi all, --> -->I'm developing a web based ancestry program. The user wants it to be -->static, that means, it isn't for all to use, but his family. Better to -->say, it'll contain only his family tree. --> -->Now, I cant think of the proper db design, which will help any user to -->find his or her relationship with any other person in the tree. Though, I -->can design a simple database, where everything will have to be done -->through queries and scripts, but I want those queries to keep as simple -->as possible. --> -->Any help will be appreciated, as I'm new to such a problem. --> -->Thanx in advance -->Nitin -- MySQL General Mailing List For list archives: http://lists.mysql.com/mysql To unsubscribe: http://lists.mysql.com/[EMAIL PROTECTED]
