Can we come up with a list of functions like this that people would
like to see?
Right now I have:
- feature (difficulty)
- size of btree (moderate)
- size of sub-range? (harder)
- go to N values from btree starting at the Kth key in btree
Ian
On Oct 3, 2007, at 11:07 PM, [EMAIL PROTECTED] wr
Thanks Ian for your long answer :) :
2007/10/3, Ian S Eslick <[EMAIL PROTECTED]>:
>
> When you say indexes are not sequential, do you mean UIDs are not
> sequentially allocated? I think there is a BDB sequence issue that I've
> never worried about that jumps to the nearest 100 when you reconnect
When you get that 2 second result, have you declared an index on the
fields you are sorting on or is this a full sort + count + offset query?
At least from what I can tell of the PostgreSQL implementation of
SQL, the optimizer doesn't keep accurate counts for the underlying
table so always
I have to say that Mariano is hitting some of the issues we will be
facing soon as our quest to learn Lisp and Elephant continues and we
continue working on migrating some of our SQL-based applications
over. This particular need of his is also a real need we have since
it's something we off
When you say indexes are not sequential, do you mean UIDs are not sequentially
allocated? I think there is a BDB sequence issue that I've never worried about
that jumps to the nearest 100 when you reconnect. However, if you create
anything other than a user object, you will also have gaps in t
When you say indexes are not sequential, do you mean UIDs are not sequentially
allocated? I think there is a BDB sequence issue that I've never worried about
that jumps to the nearest 100 when you reconnect. However, if you create
anything other than a user object, you will also have gaps in t
