-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Peter, et al --
...and then Peter Brawley said...
%
% > Assuming a table 'clients' with a client ID and a table 'cards' with a
...
% > type varchar(10) , # MC, Visa, AmEx, Disc, ... maybe a set()?
% > card int # references cards.id
% > ) ;
At 8:20 -0500 12/15/02, David T-G wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi, all --
I think that the answer I'll get is "index", but I don't know for sure...
That's right.
If I have a table with fields such as a client id number and a credit
card id number, where a given clien
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Peter, et al --
...and then Peter Brawley said...
%
% Your reference to "having the table sorted" suggests physical table sorting,
Right...
% but a basic characteristic of a relational DBMS is that data retrieval does
% not depend on physical row
David,
Your reference to "having the table sorted" suggests physical table sorting,
but a basic characteristic of a relational DBMS is that data retrieval does
not depend on physical row order. The actual order of rows in a MySql table
is entirely arbitrary, and shouldn't be your concern except pe
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi, all --
I think that the answer I'll get is "index", but I don't know for sure...
If I have a table with fields such as a client id number and a credit
card id number, where a given client might have multiple cards on file,
when I select from the
