Hi Danny --
At 03:01 PM 10/19/2004 +0200, you wrote:
Sure, but the "irreducible
n-order predicate" bit would suggest that
it isn't possible to go the other way, to store RDBMS data as
in the general case.
Actually, you can just "shred" any n-ary relation down
to a ternary one, using pointers in the ternary relational table, so that
the n-ary relation can be reconstituted as needed.
There's a little example of how to do this, called "ForDanny",
that you can run at
On your other point, yes, SQL views can help to reduce the difficulty of correct query writing over triples. However, it would be interesting to see what percentage of students could correctly write the 14 test queries in the example RDQueryLangComparison1 (also online at the same site.) Moreover, consider justifying or explaining the results from those queries to a non-techie person. It would be difficult, and that's just an academic test example.
Cheers, -- Adrian
INTERNET BUSINESS LOGIC (R)
Dr. Adrian Walker
PO Box 1412
CT 06011-1412 USA
Phone: USA 860 583 9677
Cell: USA 860 830 2085
Fax: USA 860 314 1029