Distributed data location strategies and Implement on weights of jump table
Genqing Bian · 2012
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).