![]() | |
#1
| |||
| |||
|
#2
| |||
| |||
|
|
Is there a term in database theory for the principle of breaking the data down into its smallest constituent parts rather than putting data that might need to be processed separately in the same field? The example that is usually used is names. When storing people's names in a database, it is generally better to make separate fields for First_Name, Last_Name, Middle_Name, etc., rather than just having one Name field. Is there a technical term for that? |
|
Is it part of one of the normalization levels? |
#3
| |||
| |||
|
|
Is there a term in database theory for the principle of breaking the data down into its smallest constituent parts rather than putting data that might need to be processed separately in the same field? |
|
The example that is usually used is names. When storing people's names in a database, it is generally better to make separate fields for First_Name, Last_Name, Middle_Name, etc., rather than just having one Name field. |
#4
| |||
| |||
|
|
Prof Wonmug <wonmug@e.mcc> writes: It's not at all clear that people's names are a good target for functional decomposition. A better example is street addresses (though, of course, there are some locations that make this not as simple as it might first appear). Country, state or province, postal code, city or town, street, property number, unit number, addressee's full name. That's much less ambiguous and more reliably queried and re-composed. |
#5
| |||
| |||
|
|
On Mon, 21 Jun 2010 18:47:41 -0700, Prof Wonmug <wonmug@e.mcc> wrote: Is there a term in database theory for the principle of breaking the data down into its smallest constituent parts rather than putting data that might need to be processed separately in the same field? The example that is usually used is names. When storing people's names in a database, it is generally better to make separate fields for First_Name, Last_Name, Middle_Name, etc., rather than just having one Name field. Is there a technical term for that? Normalisation? Is it part of one of the normalization levels? I think so. There was a genealogy program, called Personal Ancestral File, which had fields for four names, one of which was the surname. But what you entered in those fields was not stored in those fields. What was sotred was a pinter to the names database, so that, for example, the name "Peter" was stored only once in the database. And when it appeared in any of the name fields, there would be a pointer to it from that field. |
|
That is part of the normalisation principle of having no redundant data. |
#6
| |||
| |||
|
|
Prof Wonmug <wonmug@e.mcc> writes: Is there a term in database theory for the principle of breaking the data down into its smallest constituent parts rather than putting data that might need to be processed separately in the same field? I believe it's called functional decomposition and it's not specific to databases <URL:http://en.wikipedia.org/wiki/Functional_decomposition>. |
#7
| |||
| |||
|
|
On 2010-06-22, Ben Finney <bignose+hates-spam (AT) benfinney (DOT) id.au> wrote: A better example is street addresses (though, of course, there are some locations that make this not as simple as it might first appear). Country, state or province, postal code, city or town, street, property number, unit number, addressee's full name. That's much less ambiguous and more reliably queried and re-composed. Not really. There are national variations in addressing too, |
#8
| |||
| |||
|
|
On Tue, 22 Jun 2010 14:18:47 +1000, Ben Finney bignose+hates-spam (AT) benfinney (DOT) id.au> wrote: I believe it's called “functional decomposition” and it's not specific to databases URL:http://en.wikipedia.org/wiki/Functional_decomposition>. Hmmm... I hadn't heard that term before. It certainly describes the principle. I just thought I had heard a different term, but it was very long ago in school. The link in that article to "database normalization" does not contain that phrase. |
#9
| |||
| |||
|
|
On Tue, 22 Jun 2010 14:18:47 +1000, Ben Finney bignose+hates-spam (AT) benfinney (DOT) id.au> wrote: Prof Wonmug <wonmug@e.mcc> writes: Is there a term in database theory for the principle of breaking the data down into its smallest constituent parts rather than putting data that might need to be processed separately in the same field? I believe it's called ?functional decomposition? and it's not specific to databases <URL:http://en.wikipedia.org/wiki/Functional_decomposition>. Hmmm... I hadn't heard that term before. It certainly describes the principle. I just thought I had heard a different term, but it was very long ago in school. The link in that article to "database normalization" does not contain that phrase. |
| Thanks |
#10
| |||
| |||
|
|
Jasen Betts <jasen (AT) xnet (DOT) co.nz> writes: On 2010-06-22, Ben Finney <bignose+hates-spam (AT) benfinney (DOT) id.au> wrote: A better example is street addresses (though, of course, there are some locations that make this not as simple as it might first appear). Country, state or province, postal code, city or town, street, property number, unit number, addressee's full name. That's much less ambiguous and more reliably queried and re-composed. Not really. There are national variations in addressing too, Yes, and if you read my message again you'll see that I allowed that. I maintain that, compared to people's names, addresses are much less ambiguous in their components and much more easily re-composed from components by simple mechanical process, and thus a better candidate for functional decomposition. |
![]() |
| Thread Tools | |
| Display Modes | |
| |