首页>
外国专利>
Memory space saving method of storing data which must be found quickly
Memory space saving method of storing data which must be found quickly
展开▼
机译:节省必须快速找到的数据的存储空间节省方法
展开▼
页面导航
摘要
著录项
相似文献
摘要
A memory space saving method of storing data blocks which must be found quickly, and to each of which linearly pre-sorted keys are assigned, is given. The keys are arranged in the lowest node level of a t-ary B*-tree. If the maximum number of keys in a node is exceeded, it is not divided as is otherwise usual, but the greatest key is transferred to the adjacent node which contains the next greatest key. If no adjacent node exists, a new node is created. By using the method, creation of only partly occupied nodes is avoided. The B*-tree is densely stored. IMAGE
展开▼
机译:给出了一种节省存储空间的方法,该方法用于存储必须快速找到的数据块,并且为每个数据块分配了线性预排序的键。密钥排列在三进制B *树的最低节点级别中。如果超过了节点中的最大密钥数,则不会像平常一样将其划分,而是将最大密钥传输到包含次大密钥的相邻节点。如果不存在相邻节点,则创建一个新节点。通过使用该方法,避免了仅创建部分被占用的节点。 B *树密集存储。 <图像>
展开▼