论文部分内容阅读
通过对分区链表中结点信息的研究 ,及前后结点中相关数据项比较之后 ,参照磁盘基数表中所记录的相应分区长度 ,给出了其中任一结点或整个分区链表丢失之后的修复算法
After studying the node information in the partitioned linked list and comparing the relevant data items in the front and back nodes, referring to the corresponding partition length recorded in the card base table, the repair after any one of the nodes or the entire partitioned linked list is lost is given algorithm