{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:48:05Z","timestamp":1648720085365},"reference-count":3,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2007,6]]},"abstract":"<jats:p> In this paper, we propose three techniques to improve the cost\/performance of the skip graph that was recently proposed by Aspnes and Shah. The skip graph, which is a distributed data structure that could efficiently support find, insert, and delete operations of a key drawn from a totally ordered set, consists of N nodes each of which is connected with exactly log <jats:sub>2<\/jats:sub> N nodes determined by a set of random binary vectors called membership vectors. In the following, we will extend the construction of the skip graph in the following two directions: 1) proposal of a subgraph of the skip graph which realizes a graceful degradation of the routing performance when the number of neighbors reduces from log <jats:sub>2<\/jats:sub> N, and 2) proposal of a supergraph of the skip graph which realizes a significant performance improvement when the number of neighbors increases from log <jats:sub>2<\/jats:sub> N. The performance of those extended graphs will be evaluated analytically. <\/jats:p>","DOI":"10.1142\/s021926590700193x","type":"journal-article","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T10:38:51Z","timestamp":1185964731000},"page":"119-132","source":"Crossref","is-referenced-by-count":0,"title":["EXTENDED SKIP GRAPHS FOR EFFICIENT KEY SEARCH IN PEER-TO-PEER ENVIRONMENT"],"prefix":"10.1142","volume":"08","author":[{"given":"SATOSHI","family":"FUJITA","sequence":"first","affiliation":[{"name":"Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Japan"}]},{"given":"AKIRA","family":"OHTSUBO","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Japan"}]},{"given":"MASAYA","family":"MITO","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Japan"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf2","series-title":"NIPS","author":"Kleinberg J.","year":"2001"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1038\/35022643"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021926590700193X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:32:58Z","timestamp":1565148778000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021926590700193X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":3,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2007,6]]}},"alternative-id":["10.1142\/S021926590700193X"],"URL":"https:\/\/doi.org\/10.1142\/s021926590700193x","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}