VServer temp join table

[Ruslan Zasukhin]

On 9/21/10 1:51 PM, "Justin Drury" <justin at crunch-recording.com> wrote:

>>> What would be awesome is if I could just somehow pass a bitset!  That
>>> way I
>>> could say...ok server, take this bitset match it up on the main database
>>> and
>>> give me the results sorted by...x and grouped by n.  But nothing in the
>>> C++
>>> SDK jumps out.
>> 
>> What about this method and similar:
>> 
>> virtual BitSet_Ptr            FindValue(
>>         Const_I_Value_Ptr   inValue = NULL,
>>          Const_BitSet_Ptr    inSelection = NULL,
>>          ESearch               inSearchPref = kPreferIndexed  ) const =
>> 0;
>> 
>> 
>> InSelection a a bitset in the scope of which will be done next search.
>> 
> 
> Hi Ruslan,

> That works if I just want to search within, although at that point i've found
> maintaining my own list and doing a search and then doing an intersection of
> the results is faster.  If this interface allowed me to execute a specific SQL
> query while providing the bitset, that'd be great.  (For those times where I
> need to sort a result set of recid's, or group them).  I know its
> unconventional and probably not that many other people would find a use for
> it, but if you think its doable i'll add it to mantis!

Hi Justin,

I am not yet sure what you want, but it seems you tend to think many in API
way.  And now you try switch to VSERVER, which better work with SQL way ...


I do not see many sense in mix of API and SQL way tools.
Will be a mess.

In REALbasic plugin, we did try make something as
    CursorToArraySet()  and reverse ...

But this will not help you build intersections.

May be you need switch to pure SQL way ?
At least for some tasks where you see problems.


-- 
Best regards,

Ruslan Zasukhin
VP Engineering and New Technology
Paradigma Software, Inc

Valentina - Joining Worlds of Information
http://www.paradigmasoft.com

[I feel the need: the need for speed]