[MUD-Dev] TECH: programming languages (was: Re: TECH: STL / Heaps, etc.)

Ola Fosheim Grøstad <olag@ifi.uio.no> Ola Fosheim Grøstad <olag@ifi.uio.no>
Tue Sep 4 15:43:25 New Zealand Standard Time 2001

Hans-Henrik Staerfeldt wrote:
> On Thu, 23 Aug 2001, Ola Fosheim Grøstad wrote:

>> Potentially maybe.  Unfortunately, I can't even see how this
>> could be generally achieved even in the most theoretical sense.
> An example is database searches; here your SQL query is analyzed,
> and the database search engine makes a number of strategies for
> evaluationg your query. It will the try to select the fastest
> strategy. Sure this does nothing for very trivial searches, like
> getting all players named "John", but for more complex searches,
> like getting the the top 10 items based on weight that is named
> "Cup", it makes sense first to select the items named cup and then
> sort them, rather than sorting all items and then select for
> cup. I don't know about the 'designing an algorithm' part, as i
> don't see anything alike 'agorithm design' here, but in some
> limited way it is already being done.

Hmmm... Well, I don't agree in the general sense. Relational
databases are slow by nature compared to the optimized alternative
for a particular task. (You surely don't want to throw out your
filesystem?)  However, I could agree with you to some extent if the
application involves user-generated queries and they tend to be
unpredictable, but then we are not really talking about

Ola  -  http://www.notam.uio.no/~olagr/

MUD-Dev mailing list
MUD-Dev at kanga.nu

More information about the MUD-Dev mailing list