comp.lang.idl-pvwave archive: archive

Home » Public Forums » archive » Optimization help

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Optimization help [message #48160]

Thu, 30 March 2006 17:23

Jonathan Greenberg
Messages: 91
Registered: November 2002

Member

I was wondering if there are any tricks to speeding up the following
database merging problem:

Say I have a 3 x 10000 array, and I want to find out the row # of the 10,000
rows matches (if any) an arbitrary 3 x 1 array. I can do this by cycling
through each column one at a time and doing an intersection (e.g. Where(
array[0] eq database[0,*]) intersected with where(array[1] eq database[1,*]
intersected with where(array[2] eq database[2,*])

This seems like a pretty slow approach to doing this, so are there any
tricks to making this run a lot faster? I'm talking about doing this for an
image, so the overhead is going to be pretty significant if I can't do any
matrix tricks and have to look up at pixel one at a time using the above
method...

--j

Report message to a moderator

Previous Topic:	Re: What is the algorithms of sort function and where function?
Next Topic:	Re: iTools Layout - Some help for once :-)

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Wed Oct 08 16:52:36 PDT 2025

Total time taken to generate the page: 0.00437 seconds