Re: Fastest memory based search technique (was: Adding 1 to an array)

2007-06-25 Thread Dick Kriesel
On 6/24/07 10:51 AM, David Bovill [EMAIL PROTECTED] wrote: So whats wrong with the idea of creating arrays and then making unions of these arrays to get a fast in memory result equivalent to SQL join? You'd need to update your arrays when you recompile anything, when you rename almost any

Fastest memory based search technique (was: Adding 1 to an array)

2007-06-24 Thread David Bovill
Thanks Ken. On 24/06/07, Ken Ray [EMAIL PROTECTED] wrote: on mouseUp put 1 into tA[1] put 2 into tA[2] put 3 into tA[3] put tA + 1 into tA put tA[1],tA[2],tA[3] end mouseUp On 24/06/07, Jim Ault [EMAIL PROTECTED] wrote: Does the list of tags change or is it static? Its a

Re: Fastest memory based search technique (was: Adding 1 to an array)

2007-06-24 Thread Jim Ault
I would recommend that you try to institute a controlled word dictionary, rather than let the user create key words since this will defeat the description of 'instant'. Even with very fast databases, the SQL join operation (which sounds like your method) can get slower and slower. You might want

Re: Fastest memory based search technique (was: Adding 1 to an array)

2007-06-24 Thread David Bovill
On 24/06/07, Jim Ault [EMAIL PROTECTED] wrote: I would recommend that you try to institute a controlled word dictionary, rather than let the user create key words since this will defeat the description of 'instant'. Even with very fast databases, the SQL join operation (which sounds like your

Re: Fastest memory based search technique (was: Adding 1 to an array)

2007-06-24 Thread Jim Ault
On 6/24/07 10:51 AM, David Bovill [EMAIL PROTECTED] wrote: I do use the (filter command) + (arrays, lists, custom properties) a lot to extract data using patterns I create... but only small stuff, and only for me/my lingo. Designing for others who will think differently and multi-lingual and