Tag Info

New answers tagged

2

Both designs are technically 3NF, depending on your data population. What a lot of people who have only a cursory understanding of formal normalization theory don't understand is that redundancy in foreign keys isn't really redundancy by definition. Transitive dependencies and partial dependencies apply to the way non-key attributes relate to key ...


1

Normalization to Boyce-Codd Normal Form, 5NF or 6NF (and therefore to any "lesser" NFs) certainly can be automated. Google for Bernstein's alogrithm for a simple example of how. There is frequently more than one way in which a set of dependencies can be normalized to any given Normal Form. Again, there are formal methods that can help you choose. Typically ...


2

First, if it ain't broke, don't fix it. If no-one is complaining about the speed of the system then leave it alone. Spend time and money on other things. Second, no, I don't think it is possible to over-normalise. That is, I think it is possible to spend more time on the normalisation process than your application might need, but unless you've spent tens ...


0

You have pretty much 4 choices: NoSQL - definition Every record is stored as a set of Key/Value pairs. It is very flexible and fast. Not all of the report writers out there support this style of storage. There are many example database implementations of NoSQL. The one that seems to be most popular right now, is MongoDB. EAV - definition This is where you ...


0

Can you enumerate all the scenarios for which you would like to store this data? if there is a finite number of columns combinations that may be applied to the table, then try to model a "base table" with common columns that are gpoing to apply to all scenarios, then create more tables (to implement some kind of inheritance; this is known as subtype / ...



Top 50 recent answers are included