Re^4: redundancy Checker

Well I haven't code anything yet for the redundancy checker part. I am still planning on how best to do it. Array?

I've don the data input part, but that just a simple SQL insert, and all the data are place in the database

i.e.

big small large medium good

extra size bad small nice

Comment on Re^4: redundancy Checker

Replies are listed 'Best First'.
Re^5: redundancy Checker by GrandFather (Saint) on Jul 27, 2005 at 03:23 UTC
Ok, so give us a sample of the data, an indication of how much data there is, and the sort of redundancy checks you anticipate making. By the time you have done that you should have almost answered your own question unless you enter the realms of normalising nasty data (see Ovid's comment) or you end us with a huge amount of data. A hash would be the natural data type to store data in that is supposed to have unique keys Perl is Huffman encoded by design.	[reply]

Replies are listed 'Best First'.

Re^5: redundancy Checker
by GrandFather (Saint) on Jul 27, 2005 at 03:23 UTC

Ok, so give us a sample of the data, an indication of how much data there is, and the sort of redundancy checks you anticipate making.

By the time you have done that you should have almost answered your own question unless you enter the realms of normalising nasty data (see Ovid's comment) or you end us with a huge amount of data.

A hash would be the natural data type to store data in that is supposed to have unique keys

Perl is Huffman encoded by design.

[reply]