0001000: 0a00 040f 9000 0f90 0fc8 0fac 0fe4
So there are 4 cells in this btree page. But that's not what I'm seeking
I want to know the level of the BTree, don't know if "level" is the exact term
to express my idea, let's see in this:
A cell in the BTree is
Thanks, but I'm more confused now.
As in the example that I provided, there are 4 cells in a single btree page. So
there must be some mechanism to determine hoe many keys that one cell can own.
I want to know exactly the very value and just how to change the value to a
larger one, for
y columns are in that particular index record (which might not match
the number of columns are in the table, as noted in the spec).
Is that what you're after? Or are you trying to figure out the depth of a
particular btree page?
-Rowan
On 11 August 2017 at 16:51, james ni <james...@live.cn> w
Let's don't focus on the "file format" documentation, just focus on the BTree
algorithm.
I want to know the depth of the BTree, and how to reduce the depth of it.
From: sqlite-users <sqlite-users-boun...@mailinglists.sqlite.org> on behalf of
Thanks Rick, it's much helpful for me.
After some experiments on the internal dbstat table, I have such conclusions,
much appreciate if you would review them:
1, My working Background:
one WITHOUT ROWID table, this table's primary key is 30 bytes;
dbstat shows there are at most 110 cells in
's the level of B+-Tree ?
On 2017/08/11 11:08 AM, Clemens Ladisch wrote:
> james ni wrote:
>> As in the example that I provided, there are 4 cells in a single btree
>> page. So there must be some mechanism to determine hoe many keys that
>> one cell can own.
> I want to know
6 matches
Mail list logo
