Subject | basic explanation of firebird's implementation for indexing, please? |
---|---|
Author | judlian23 |
Post date | 2008-10-28T18:00:34Z |
Hi everyone,
I'm asking out of curiosity and as a sanity check:
What is it about firebird's implementation of B tree indexing that
allows me create a database of arbitrary size and keep insert speeds
constant? On just about every other relational database that uses B
trees, I've had major scalability issues (when using a non clustered
index).
If anyone has any clue, I'd love to hear about it.
Julian
I'm asking out of curiosity and as a sanity check:
What is it about firebird's implementation of B tree indexing that
allows me create a database of arbitrary size and keep insert speeds
constant? On just about every other relational database that uses B
trees, I've had major scalability issues (when using a non clustered
index).
If anyone has any clue, I'd love to hear about it.
Julian