Fault Tolerant Suffix Trees
作者机构：Department of Computer Science and Information TechnologyUniversity of Engineering and TechnologyPeshawar25120Pakistan Department of Computer ScienceShaheed Benazir Bhutto Women UniversityPeshawar25000Pakistan Department of Information TechnologyFCITKing Abdulaziz UniversityJeddahSaudi Arabia Department of Electrical EngineeringUniversity of Engineering and TechnologyPeshawar25120Pakistan
出 版 物：《Computers, Materials & Continua》 (计算机、材料和连续体（英文）)
年 卷 期：2021年第66卷第1期
页 面：157-164页
核心收录：
学科分类：0831[工学-生物医学工程（可授工学、理学、医学学位）] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0805[工学-材料科学与工程（可授工学、理学学位）] 0701[理学-数学] 0801[工学-力学（可授工学、理学学位）] 0812[工学-计算机科学与技术（可授工学、理学学位）]
主 题：Resilient data structures fault tolerant data structures suffix tree
摘 要：Classical algorithms and data structures assume that the underlying memory is reliable,and the data remain safe during or after ***,the assumption is perilous as several studies have shown that large and inexpensive memories are vulnerable to bit ***,the correctness of output of a classical algorithm can be threatened by a few memory *** tolerant data structures and resilient algorithms are developed to tolerate a limited number of faults and provide a correct output based on the uncorrupted part of the *** tree is one of the important data structures that has widespread applications including substring search,super string problem and data *** fault tolerant version of the suffix tree presented in the literature uses complex techniques of encodable and decodable error-correcting codes,blocked data structures and fault-resistant *** this work,we use the natural approach of data replication to develop a fault tolerant suffix tree based on the faulty memory random access machine *** proposed data structure stores copies of the indices to sustain memory faults injected by an *** develop a resilient version of the Ukkonen’s algorithm for constructing the fault tolerant suffix tree and derive an upper bound on the number of corrupt suffixes.
维普期刊数据库