IE> As for Sean's request about doing an efficient intersection, as
Alex
IE> was explaining there are only two ways to do this efficiently:
no, these are two ways to do it inefficiently, there is only one way
to do
it efficiently -- via combined index :)
True, but his request was efficienc
On 4/4/08, Ian Eslick <[EMAIL PROTECTED]> wrote:
> However, premature optimization often causes more trouble than it's worth.
> The easiest thing to do to get going is to index both slots and say:
>
> (intersection (get-instances-by-range 'event 'date )
> (get-instances-by-value 'e
Hi there,
The string tuple-sorting hack makes me cringe. I know that I could
make BDB and the lisp side sort lists based on their constituents
pretty easily if you felt we could make the same hack work in
postmodern.
(cons "Fred" 23) < (cons "Fred" 25) < (cons "Sally" 10)
Maybe we could
> I'm really just curious about using
> 2 btree indices together without requiring the creation of a 3rd.
Of course I could be working against elephant while trying to do all of this.
So here is what I am trying to achieve, any pointers would be great.
Given the following code.
>>
(defpackage
On 4/4/08, Alex Mizrahi <[EMAIL PROTECTED]> wrote:
> (defclass test-event ()
> ((date :accessor date-of :initform (now) :index t) ...
> and it will create indices for you automatically.
Yes, although this is just an example of what I'm trying to achieve
and isn't exactly what i'm doing. I'm re
