CAJ | 학술논문

为了克服现有的定位技术对快速查找存储数据算法性能的限制,提出一种基于权值跳表的分布式数据定位（Distribute Data Location Priority Skip List,DLPSL）策略,以解决数据定位效率问题。在跳表节点中加入权值,使定位率高的存储节点优先被找到,缩短查找路径,提高定位效率。系统性能分析表明,DLPSL中节点的插入、删除和定位比单链表存储结构和跳跃图效率都高,其时间复杂度为O（logn）,空间复杂度为O（n）。
위료극복현유적정위기술대쾌속사조존저수거산법성능적한제,제출일충기우권치도표적분포식수거정위（Distribute Data Location Priority Skip List,DLPSL）책략,이해결수거정위효솔문제。재도표절점중가입권치,사정위솔고적존저절점우선피조도,축단사조로경,제고정위효솔。계통성능분석표명,DLPSL중절점적삽입、산제화정위비단련표존저결구화도약도효솔도고,기시간복잡도위O（logn）,공간복잡도위O（n）。
Focusing on existing location technology limited the performance of the algorithm,distributed data location strategies DLPSL based on weights of jump table to solve the efficiency problem is presented.Weights are added to nodes of jump table,so that the high rate of location of the storage node priority is found to short the search path,and improve the location efficiency.System analysis shows that,the node＇s insertion,deleting,and location on DLPSL are more efficient than single-linked list storage structure and skip graphic.It＇s time complexity is O（logn）,space complexity is O（n）.