# Re: scalability of table lookup

Ed Krol (e-krol@uiuc.edu)
Mon, 7 Jun 1993 14:31:37 -0500

- Messages sorted by: [ date ][ thread ][ subject ][ author ]
- Next message: Keith Moore: "dereferencing URNs"
- Previous message: Tim Berners-Lee: "Re: scalability of table lookup"
- Maybe in reply to: Stu Weibel: "scalability of table lookup"
- Next in thread: Stu Weibel: "Re: scalability of table lookup"

    Date: Mon, 7 Jun 1993 14:31:37 -0500

    Message-Id: <199306071931.AA08927@ux1.cso.uiuc.edu>

    To: weibel@oclc.org (Stu Weibel)

    From: e-krol@uiuc.edu (Ed Krol)

    Subject: Re: scalability of table lookup

>How fast is fast? Is there a consensus here as to what constitutes
>acceptable performance? 100 or 200 transactions a second is a very
>reasonable target for servers of this kind (we routinely achieve 200
>transactions per second on our cataloging system). The apparent speed
>to the user/application would, of course, be dependent on load.

I guess I think that is way low. My rough answer would be too big
for any one server to handle, to big to trust to any one part of the
Internet.... If you consider over the entire Internet the sum number
of requests of all the ftp sessions, gopher sessions and web sessions....

I also think that this is only a small part of the finding nirvana.
If, given a URN, you can turn it into a string of URL's in .5 second that
request is still probably less than half way timewise to getting something
good for the user.

- Next message: Keith Moore: "dereferencing URNs"
- Previous message: Tim Berners-Lee: "Re: scalability of table lookup"
- Maybe in reply to: Stu Weibel: "scalability of table lookup"
- Next in thread: Stu Weibel: "Re: scalability of table lookup"