B*-tree
Sign in to saveAlso known as B* tree
B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes
Also known as B* tree
B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).