I don't think you can put a known standard term "in context" in order to change it's agreed meaning.

Although I haven't read the research paper myself, after a couple of quick discussions with others, as far as we can tell, it was actually developed to create indexes in general for searching algorithms, whether the underying data is in a RDB, a binary file, a text file, heck, maybe you are storing it in a crystal lattice 🙂

What the B Tree achieves is a balanced index, but you can't state as fact that the B is balanced, even if BOL states it.

I spose you might say in this case that an appropriate answer option to What does B stand for? might be:

E) NULL

😛

-d