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,
