Try doing a web search for the program geneweb. It's done by someone in
France but there are English versions as well. It's freeware. It's a
web based genealogy program and has a built-in database. No need to
reinvent the wheel.
--
MySQL General Mailing List
For list archives:
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
-
well... when I do db design, I tend to start with the objects of my system. The one
that comes to mind in your case is people.
so you'll need a people table.
well what are the details of a person?
first_name
Last_name
Middle_name1
Middle_name2
Maiden_name
[any other basic bio data]
so
-Original Message-
From: Dan Greene [mailto:[EMAIL PROTECTED]
Sent: Tuesday, October 28, 2003 12:49 PM
To: Nitin; [EMAIL PROTECTED]
Subject: RE: Ancestry program
well... when I do db design, I tend to start with the objects of my system.
The one that comes to mind in your case is people
Around Tue,Oct 28 2003, at 12:15, Nitin, wrote:
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
/55gctoc.htm
Brad
-Original Message-
From: Dan Greene [mailto:[EMAIL PROTECTED]
Sent: Tuesday, October 28, 2003 12:49 PM
To: Nitin; [EMAIL PROTECTED]
Subject: RE: Ancestry program
well... when I do db design, I tend to start with the objects of my
system.
The one that comes to mind
On Tuesday 28 October 2003 11:24 am, Dathan Vance Pattishall wrote:
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
