seaching a list...

[Gabriel Genellina]

At Thursday 10/8/2006 21:54, bruce wrote:

>the issue i'm having is that i'm going to have to compare multiple rows of
>information to the information in the db. so essentially i'd have to do a
>hit to the db, for each row of information i want to compare if i did it
>your way... (which was what i had thought about)
>
>the issue of doing the string/list compare/search is that i can get
>everything from the db with one call... i can then iterate through memory
>for each of my row information that i'm searching to see if it exists in the
>db...
>
>memory searches should be faster than the network overhead, and the
>associated multiple db calls...

should... are you sure?
How many rows on the database? how many rows to compare? network overhead?
Do some timing/performance tests to evaluate that. Things aren't 
always as you expect.



Gabriel Genellina
Softlab SRL 


	
	
		
__________________________________________________
Preguntá. Respondé. Descubrí.
Todo lo que querías saber, y lo que ni imaginabas,
está en Yahoo! Respuestas (Beta).
¡Probalo ya! 
http://www.yahoo.com.ar/respuestas