Re: Transport requirements for DNS-like protocols

[Michael Mealling <[e-mail]>]

On Fri, Jun 28, 2002 at 02:11:18PM +0200, Patrik Fältström wrote:
> --On 2002-06-27 23.41 -0400 Rob Austein <[e-mail]> wrote:
> > It's not a big deal for the server to perform the entire
> > query operation again.
> 
> ...given the matching operation is cheap. I.e. what you don't say
> explicitly is that we should use as much as possible of the CPU on the
> client side.
> 
> This is one of the reasons why I when I came up with IDNA want the client
> to do the normalization etc, so the server can do bitwise comparison which
> make handling of hash tables easier.
> 
> I am very nervous when people come up with protocols where the client can
> pass whatever constraints to the server, and request the server to do
> complicated things. Things which is easy when you have an MySQL database
> with 100 records, but, when you have more data in the database than what
> fits in primary memory, then you loose.

I have to agree. Our experience running .com suggests that, due to 
the scale of queries, any small percentage change in processing requirements
on the server side results in huge swings in operational requirements
that affect the entire robustness of the system. 

I think that's a valuable enough guideline to warrant putting it into at
least the SLS document I'm working on...

-MM

-- 
--------------------------------------------------------------------------------
Michael Mealling	|      Vote Libertarian!       | urn:pin:1
[e-mail]      |                              | http://www.neonym.net