if you're going to process the bits in
>your client. But if you want to display the bits in MySQL in the same
>order as your SET declaration, you can use
>Reverse(Binary(Bin(Bit_Or(column_name
>which
d then parse the results
for for each member of the set .. which is a worse method.
I was hoping that since each member of the SET really
represents a number, that there would be some bitwise
operation that would painlessly produce all the members
of the SET that appear at least once.
If n
nd up against a mad deadline).
Thanks again,
chas
>Bob wrote:
>Sir, the basic problem is that you've violated first normal form,
>which states columns should only contain atomic (indivisible) data.
>Since you plan to divide up the data in your columns, it's obviously
>n
,G,I
D,F
G,H,L,M,O
etc
But it then requires processing to work out which
values have been used at least once. It's not very
scalable.
Is there a method to retrieve a list of all the values
that have been used at least once ?
Thank you very much,
chas
ps. using an old version at the mom
