On Sat, 12 Aug 2006 09:47:03 -0400, Brett Patterson brett@bpatterson.net wrote:
Martin Marques wrote:
I don't share the same thoughts. When is comes to normalizing, and making searches on a huge table, performace will be MAYOR factor if you don't use a normalize relational structure.
Any way, the 2 mayor DB that RC uses (I'm not counting SQLite) are relational, so why not use these feature, which is great.
Let's also not forget that when searches occur, or any lookup for that matter, temporary tables are created. So if you have one central table that links 18 tables of information together, if you query properly and create a temp table before querying, and SELECT INTO
temp_tableyou can then run a secondary select on the temp table and order it as you please.
I would have to look at RC code closely, but I havn't seen it create temp tables to make searches. Or are you just saying it can be done?
Any way, doing it that way you have a great lose of performace, and should only be done when no query can be written to performe at a resonable rate.
Normally DB structure should never be designed thinking that you have temp tables to use in case of disfavourable search scenario. If there's no other way around it, then it's what has to be done. But else, direct searches are the best bet.
--
Lic. Martín Marqués | SELECT 'mmarques' || Centro de Telemática | '@' || 'unl.edu.ar'; Universidad Nacional | DBA, Programador, del Litoral | Administrador