You are viewing a plain text version of this content. The canonical link for it is here.
Posted to user@ignite.apache.org by John Wilson <sa...@gmail.com> on 2017/09/22 23:19:54 UTC

A quick question on Ignite's B+ tree implementation

Hi,

The internal nodes of a B+ tree, by definition, store only keys while the
leaf nodes store (or hold pointer to) the actual data.

The documentation here,
https://apacheignite.readme.io/docs/memory-architecture, states that each
index node (including internal nodes) store information to access the data
page and offset for the key in question (not just the leaf nodes)

Why call it a B+ tree.

Thanks,

Re: A quick question on Ignite's B+ tree implementation

Posted by Denis Magda <dm...@apache.org>.
+ dev list

Hi John,

As the one who worked on this documentation, I confirm that it’s correct.

In my opinion, the only missing thing is that an index page (node) can comprise key/value if the latter is of primitive type (int, float, char, String of specific length). *Vladimir*, *Sam*, could you confirm this point and share more details with John?
 
—
Denis

> On Sep 22, 2017, at 4:19 PM, John Wilson <sa...@gmail.com> wrote:
> 
> Hi,
> 
> The internal nodes of a B+ tree, by definition, store only keys while the leaf nodes store (or hold pointer to) the actual data.
> 
> The documentation here, https://apacheignite.readme.io/docs/memory-architecture <https://apacheignite.readme.io/docs/memory-architecture>, states that each index node (including internal nodes) store information to access the data page and offset for the key in question (not just the leaf nodes) 
> 
> Why call it a B+ tree.
> 
> Thanks,

Re: A quick question on Ignite's B+ tree implementation

Posted by Denis Magda <dm...@apache.org>.
+ dev list

Hi John,

As the one who worked on this documentation, I confirm that it’s correct.

In my opinion, the only missing thing is that an index page (node) can comprise key/value if the latter is of primitive type (int, float, char, String of specific length). *Vladimir*, *Sam*, could you confirm this point and share more details with John?
 
—
Denis

> On Sep 22, 2017, at 4:19 PM, John Wilson <sa...@gmail.com> wrote:
> 
> Hi,
> 
> The internal nodes of a B+ tree, by definition, store only keys while the leaf nodes store (or hold pointer to) the actual data.
> 
> The documentation here, https://apacheignite.readme.io/docs/memory-architecture <https://apacheignite.readme.io/docs/memory-architecture>, states that each index node (including internal nodes) store information to access the data page and offset for the key in question (not just the leaf nodes) 
> 
> Why call it a B+ tree.
> 
> Thanks,