Sorry for the test email, but I had typed a long response submitted it
and google said that it was sent, but it never posted. So that is why
I sent the test message.
Ok back to business.
The project is an online auction system. Since the types of items
will be changing all the time I wanted to
Testing
On Jun 8, 4:29 pm, Joshua Benner <[EMAIL PROTECTED]> wrote:
> Well, the most direct answer:
>
> Items belongsTo Types
> Types hasAndBelongsToMany Questions
> Questions hasAndBelongsToMany Answers
> (you can add relations in the other direction, too)
>
> Then when you retrieve an item, you
Well, the most direct answer:
Items belongsTo Types
Types hasAndBelongsToMany Questions
Questions hasAndBelongsToMany Answers
(you can add relations in the other direction, too)
Then when you retrieve an item, you would need recursive=3, and you'd
have access to all the data in an array followi
Ok here is the scenario.
There will be "Items" that are of a "Type" and each "Type" has it own
"Questions" and the "Questions" have their own "Answers". So how do I
store the "Answers" chosen for each "Question" for each "Item".
The table structure so far is below. Let me know if this doesn't
