The B-tree would store the key value, followed by a list of pointers to each of the physical rows.
B-树将存储键值,以及一个指向每个物理行的指针列表。
We are currently investigating whether using a customized B-Tree algorithm can make it possible to search with the help of wild CARDS and to store index documents more compactly.
我们目前正在研究使用定制的B -Tree算法进行带有通配符的搜索并且更加紧凑地存储索引文档是否可行。
应用推荐