Fixed Binary[16] Index

[Stefan Von Torklus]

sounds good. But I can't find much information on that topic. (the wiki page is empty and google didn't find much within this list)
I saw the example application. But I need to know, what methods are available and possible how to make such an index...
I'd be glad, if someone give me some direction, where to find answers ;-)

-------- Original-Nachricht --------
> Datum: Tue, 29 Jul 2008 15:33:49 +0300
> Von: Ruslan Zasukhin <sunshine at public.kherson.ua>
> An: "valentina at lists.macserve.net" <valentina at lists.macserve.net>
> Betreff: Re: Fixed Binary[16] Index

> On 7/28/08 5:40 PM, "Stefan Von Torklus" <stefanvt at gmx.de> wrote:
> 
> Hi Stefan
> 
> > Thanks for the answer. I already noticed, that it works, if you have no
> index.
> > It's right, that it is really uncommon to use a ByteArray for searching.
> > But if you need an identifier, which is globally unique, it would be
> hard to
> > do this 
> > with a long or longlong.
> > 
> > I'll give it a try to split this value into 2 ULLong Fields. If the
> speed
> > doesn't fit the need of the application,
> > I would add a feature request or need to work with another solution.
> > (unfortunately... 'cause I used valentina within my last 3 projects and
> it
> > always works fine!)
> 
> If you split to two fields, you can build SINGLE index on both fields
> using
> Table Methods. This should give fast speed.
> 
> 
> -- 
> 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]
> 
> 
> _______________________________________________
> Valentina mailing list
> Valentina at lists.macserve.net
> http://lists.macserve.net/mailman/listinfo/valentina