{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:59:32Z","timestamp":1648933172035},"reference-count":14,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":6786,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Syst. Comp. Jpn."],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1002\/(sici)1520-684x(199702)28:2<86::aid-scj9>3.0.co;2-n","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T19:32:29Z","timestamp":1030303949000},"page":"86-95","source":"Crossref","is-referenced-by-count":0,"title":["Improvement of binary digital search trees using hierarchical structures"],"prefix":"10.1002","volume":"28","author":[{"given":"Masami","family":"Shishibori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Kiyohara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-ichi","family":"Aoe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB1","volume-title":"Computer Algorithms\u00e2\u0080\u0094Key Search Strategies","author":"Aoe","year":"1991"},{"key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB2","first-page":"25","volume-title":"Handbook of Algorithms and Data Structures","author":"Gonnet","year":"1984"},{"issue":"11","key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB3","first-page":"1359","article-title":"A static hashing method and its application","volume":"33","author":"Aoe","year":"1992","journal-title":"Inf. Process."},{"issue":"4","key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB4","first-page":"391","article-title":"A hashing method","volume":"24","author":"Ide","year":"1983","journal-title":"Inf. Process."},{"issue":"9","key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB5","first-page":"980","article-title":"Hashing technique and applications","volume":"21","author":"Nishihara","year":"1980","journal-title":"Inf. Process."},{"issue":"12","key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB6","first-page":"1465","article-title":"A dynamic hashing method and its applications","volume":"33","author":"Aoe","year":"1992","journal-title":"Inf. Process."},{"key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB7","first-page":"85","volume-title":"Dynamic hashing schemes","author":"Enbody","year":"1990"},{"issue":"3","key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","article-title":"Extendible hashing \u00e2\u0080\u0094 A fast access method for dynamic files","volume":"4","author":"Fagin","year":"1979","journal-title":"ACM Trans. Database Syst."},{"issue":"6","key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB9","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/TSE.1982.236022","article-title":"Analysis of extendible hashing","volume":"SE-8","author":"Mendelson","year":"1982","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"4","key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB10","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF01932839","article-title":"Order preserving extendible hashing and bucket trees","volume":"21","author":"Tamminen","year":"1981","journal-title":"BIT"},{"key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB11","first-page":"121","volume-title":"Comput Surveys","volume":"11","author":"Comer","year":"1979"},{"key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB12","first-page":"422","volume-title":"The Art of Computer Programming","author":"Knuth","year":"1973"},{"issue":"7","key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB13","first-page":"769","article-title":"Data management by B-trees","volume":"21","author":"Mizoguchi","year":"1980","journal-title":"Inf. Process."},{"issue":"7","key":"10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N-BIB14","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1987.233491","article-title":"Two access methods using compact binary trees","volume":"SE-13","author":"Jonge","year":"1987","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1520-684X(199702)28:2%3C86::AID-SCJ9%3E3.0.CO;2-N","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1520-684X(199702)28:2%3C86::AID-SCJ9%3E3.0.CO;2-N","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T08:25:05Z","timestamp":1625127905000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1520-684X(199702)28:2<86::AID-SCJ9>3.0.CO;2-N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,2]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1520-684x(199702)28:2<86::aid-scj9>3.0.co;2-n","relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}