comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Re: getting structure elements by tag name string
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: getting structure elements by tag name string [message #33541 is a reply to message #33491] Thu, 09 January 2003 09:20 Go to previous message
Pavel A. Romashkin is currently offline  Pavel A. Romashkin
Messages: 531
Registered: November 2000
Senior Member
Hi JD,
Reding thriugh your nice explanation, I wondered: how are SQL engines
implemented so that they look up pretty much random things but can be
incredibly fast for even multi-million record, randomly organized
arrays? They do create indices, true, but still they serch them somehow,
and that is fast. I'd say the speed is size-dependent, but it doesn't
seem to be linearly proportional.
Cheers,
Pavel

JD Smith wrote:
>
> Unfortunately, it's quite difficult to build good hash functions and
> matching hash table sizes which strike a decent balance between wasted
> memory, lookup speed, and flexibility for growing/shrinking the hash
> array. There's no reason a hash couldn't be implemented using regular
> IDL arrays and pointers, along with a suitable hash function, but I
> suspect it would be an underperformer, compared to more finely tuned
> offerings of other languages. Might be a good exercise to try though.
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Getting running routine name
Next Topic: DataMiner

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Sat Oct 11 13:57:42 PDT 2025

Total time taken to generate the page: 1.76183 seconds