{"title":"The Method of Distribute Data Storage and Location on Weights of Jump Table","authors":"Bi-lin Shao , Gen-qing Bian , Wei-qi Zhang","doi":"10.1016/j.aasri.2013.10.067","DOIUrl":null,"url":null,"abstract":"<div><p>Focusing on the existing location technology limited the performance of the algorithm, distributed data location strategies DLPSL based on weights of jump table is presented to solve the efficiency problem. 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 storage and 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. Its time complexity is <em>0(log n)</em>, and space complexity is <em>0(n)</em>.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 120-125"},"PeriodicalIF":0.0000,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.067","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AASRI Procedia","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2212671613000681","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Focusing on the existing location technology limited the performance of the algorithm, distributed data location strategies DLPSL based on weights of jump table is presented to solve the efficiency problem. 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 storage and 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. Its time complexity is 0(log n), and space complexity is 0(n).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
