{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:23Z","timestamp":1750220543149,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,20]],"date-time":"2021-06-20T00:00:00Z","timestamp":1624147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,20]]},"DOI":"10.1145\/3468081.3471125","type":"proceedings-article","created":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T16:14:12Z","timestamp":1634919252000},"page":"69-73","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Redundancy of Routing Information on the Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph with the Load Balancing Method"],"prefix":"10.1145","author":[{"given":"Ken","family":"Higuchi","sequence":"first","affiliation":[{"name":"University of Fukui, Japan"}]},{"given":"Kenya","family":"Hasegawa","sequence":"additional","affiliation":[{"name":"University of Fukui, Japan"}]},{"given":"Tatsuo","family":"Tsuji","sequence":"additional","affiliation":[{"name":"University of Fukui, Japan"}]}],"member":"320","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290674"},{"key":"e_1_3_2_1_2_1","first-page":"274","article-title":"Interpolation-Based Index Maintenance","volume":"23","author":"Burkhard A.","year":"1983","unstructured":"Walter\u00a0 A. Burkhard . 1983 . Interpolation-Based Index Maintenance . BIT Comput. Sci. Sect. 23 , 3 (1983), 274 \u2013 294 . https:\/\/doi.org\/10.1007\/BF01934457 10.1007\/BF01934457 Walter\u00a0A. Burkhard. 1983. Interpolation-Based Index Maintenance. BIT Comput. Sci. Sect. 23, 3 (1983), 274\u2013294. https:\/\/doi.org\/10.1007\/BF01934457","journal-title":"BIT Comput. Sci. Sect."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIS.2016.7550841"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SNPD.2019.8935873"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2010.5641860"},{"key":"e_1_3_2_1_7_1","first-page":"127","article-title":"A Routing Algorithm for Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph. In Roger Lee (Eds.), Applied Computing & Information Technology","volume":"619","author":"Higuchi Ken","year":"2015","unstructured":"Ken Higuchi , Makoto Yoshida , Naoyuki, and Tatsuo Tsuji . 2015 . A Routing Algorithm for Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph. In Roger Lee (Eds.), Applied Computing & Information Technology , Studies in Computational Intelligence 619 (2015), 127 \u2013 140 . Ken Higuchi, Makoto Yoshida, Naoyuki, and Tatsuo Tsuji. 2015. A Routing Algorithm for Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph. In Roger Lee (Eds.), Applied Computing & Information Technology, Studies in Computational Intelligence 619 (2015), 127\u2013140.","journal-title":"Studies in Computational Intelligence"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SNPD.2017.8022762"},{"key":"e_1_3_2_1_9_1","first-page":"1850","article-title":"An Implementation of Large Scale Distributed Key-value Store with Range Search Feature Based on Range-key Skip Graph","volume":"53","author":"Ishi Yoshimasa","year":"2012","unstructured":"Yoshimasa Ishi , Yuuichi Teranishi , Mikio Yoshida , and Susumu Takeuchi . 2012 . An Implementation of Large Scale Distributed Key-value Store with Range Search Feature Based on Range-key Skip Graph . Journal of IPSJ 53 , 7 (2012), 1850 \u2013 1862 . Yoshimasa Ishi, Yuuichi Teranishi, Mikio Yoshida, and Susumu Takeuchi. 2012. An Implementation of Large Scale Distributed Key-value Store with Range Search Feature Based on Range-key Skip Graph. Journal of IPSJ 53, 7 (2012), 1850\u20131862.","journal-title":"Journal of IPSJ"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5683641"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"e_1_3_2_1_12_1","first-page":"3223","article-title":"An Extension of Skip Graph to Store Multiple Keys on Single Node","volume":"49","author":"Konishi Yuji","year":"2008","unstructured":"Yuji Konishi , Mikio Yoshida , Susumu Takeuchi , Yuichi Tananishi , Kaname Harumoto , and Shinji Shimojo . 2008 . An Extension of Skip Graph to Store Multiple Keys on Single Node . Jornal of IPSJ 49 , 9 (2008), 3223 \u2013 3233 . Yuji Konishi, Mikio Yoshida, Susumu Takeuchi, Yuichi Tananishi, Kaname Harumoto, and Shinji Shimojo. 2008. An Extension of Skip Graph to Store Multiple Keys on Single Node. Jornal of IPSJ 49, 9 (2008), 3223\u20133233.","journal-title":"Jornal of IPSJ"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_1_14_1","volume-title":"Linear Hashing: A New Tool for File and Table Addressing. In Sixth International Conference on Very Large Data Bases","author":"Litwin Witold","year":"1980","unstructured":"Witold Litwin . 1980 . Linear Hashing: A New Tool for File and Table Addressing. In Sixth International Conference on Very Large Data Bases , October 1-3, 1980, Montreal, Quebec, Canada, Proceedings. IEEE Computer Society, 212\u2013223. Witold Litwin. 1980. Linear Hashing: A New Tool for File and Table Addressing. In Sixth International Conference on Very Large Data Bases, October 1-3, 1980, Montreal, Quebec, Canada, Proceedings. IEEE Computer Society, 212\u2013223."},{"key":"e_1_3_2_1_15_1","volume-title":"First International Workshop, IPTPS 2002","author":"Maymounkov Petar","year":"2002","unstructured":"Petar Maymounkov and David Mazi\u00e8res . 2002 . Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In Peer-to-Peer Systems , First International Workshop, IPTPS 2002 , Cambridge, MA, USA , March 7-8, 2002, Revised Papers(Lecture Notes in Computer Science, Vol.\u00a02429), Peter Druschel, M.\u00a0Frans Kaashoek, and Antony I.\u00a0T. Rowstron (Eds.). Springer, 53\u201365. https:\/\/doi.org\/10.1007\/3-540-45748-8_5 10.1007\/3-540-45748-8_5 Petar Maymounkov and David Mazi\u00e8res. 2002. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In Peer-to-Peer Systems, First International Workshop, IPTPS 2002, Cambridge, MA, USA, March 7-8, 2002, Revised Papers(Lecture Notes in Computer Science, Vol.\u00a02429), Peter Druschel, M.\u00a0Frans Kaashoek, and Antony I.\u00a0T. Rowstron (Eds.). Springer, 53\u201365. https:\/\/doi.org\/10.1007\/3-540-45748-8_5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/6012.6014"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_18_1","volume-title":"An Implementation and Evaluation of Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph. Jornal of IEICE J89-D, 5","author":"Yoshida Makoto","year":"2015","unstructured":"Makoto Yoshida , Ken Higuchi , and Tatsuo Tsuji . 2015. An Implementation and Evaluation of Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph. Jornal of IEICE J89-D, 5 ( 2015 ), 742\u2013750. Makoto Yoshida, Ken Higuchi, and Tatsuo Tsuji. 2015. An Implementation and Evaluation of Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph. Jornal of IEICE J89-D, 5 (2015), 742\u2013750."}],"event":{"name":"ACIT 2021: The 8th International Virtual Conference on Applied Computing & Information Technology","acronym":"ACIT 2021","location":"Kanazawa Japan"},"container-title":["Proceedings of the the 8th International Virtual Conference on Applied Computing & Information Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3468081.3471125","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3468081.3471125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:07Z","timestamp":1750195687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3468081.3471125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,20]]},"references-count":18,"alternative-id":["10.1145\/3468081.3471125","10.1145\/3468081"],"URL":"https:\/\/doi.org\/10.1145\/3468081.3471125","relation":{},"subject":[],"published":{"date-parts":[[2021,6,20]]},"assertion":[{"value":"2021-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}