{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:24:05Z","timestamp":1649157845084},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,3,1]],"date-time":"1981-03-01T00:00:00Z","timestamp":352252800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1981,3]]},"DOI":"10.1007\/bf02243419","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T21:03:18Z","timestamp":1132002198000},"page":"9-18","source":"Crossref","is-referenced-by-count":0,"title":["Full table scatter storage parallel searching"],"prefix":"10.1007","volume":"26","author":[{"given":"J. R.","family":"M\u00fchlbacher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02243419_CR1","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/360860.360907","volume":"17","author":"A. F. Ackermann","year":"1974","unstructured":"[AC 74] Ackermann, A. F.: Quadratic search for Hash tables of sizep n . Comm. ACM17, 164 (1974).","journal-title":"Comm. ACM"},{"key":"BF02243419_CR2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/362007.362040","volume":"13","author":"J. R. Bell","year":"1970","unstructured":"[BE 70] Bell, J. R.: The quadratic quotient method: a Hashcode eliminating secondary clustering. Comm. ACM13, 107\u2013109 (1970).","journal-title":"Comm. ACM"},{"key":"BF02243419_CR3","unstructured":"[BH 73] Brinch Hansen, P.: Operating system principles. Prentice-Hall 1973."},{"key":"BF02243419_CR4","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/362790.362797","volume":"13","author":"J. R. Bell","year":"1970","unstructured":"[BK 70] Bell, J. R., Kaman, C. H.: The linear quotient Hash code. Comm. ACM13, 675\u2013677 (1970).","journal-title":"Comm. ACM"},{"key":"BF02243419_CR5","doi-asserted-by":"crossref","unstructured":"[BU 63] Buchholz, W.: File organization and addressing. IBM Syst. Journal1963, 80\u2013111.","DOI":"10.1147\/sj.22.0086"},{"key":"BF02243419_CR6","unstructured":"[BU 73] Burkhard, W. A.: Full table quadratic quotient scatter table searching. Proc. 6th Hawaii Int. Conf. on System Sc., 81\u201382 (1973)."},{"key":"BF02243419_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0303-1268(79)90124-X","volume":"5","author":"G. Chroust","year":"1979","unstructured":"[CM 79] Chroust, G., M\u00fchlbacher, J. R.: Rivalling multiprocessor organization: An approach to performance increases. Euromicro-Journal5, 65\u201372 (1979).","journal-title":"Euromicro-Journal"},{"key":"BF02243419_CR8","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/362705.362709","volume":"13","author":"A. C. Day","year":"1970","unstructured":"[DA 70] Day, A. C.: Full table quadratic searching for scatter storage. Comm. ACM13, 481\u2013482 (1970).","journal-title":"Comm. ACM"},{"key":"BF02243419_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-88678-2","volume-title":"Vorlesungen \u00fcber Zahlentheorie","author":"H. Hasse","year":"1964","unstructured":"[HA 64] Hasse, H.: Vorlesungen \u00fcber Zahlentheorie. Berlin-G\u00f6ttingen-Heidelberg-New York: Springer 1964."},{"key":"BF02243419_CR10","doi-asserted-by":"crossref","unstructured":"[HE 63] Heising, W. P.: Note on random addressing techniques. IBM Syst. Journal1963, 112\u2013116.","DOI":"10.1147\/sj.22.0112"},{"key":"BF02243419_CR11","unstructured":"[KN 73] Knuth, D. E.: The art of computer programming, Vol. 3, Searching and Sorting. 1973."},{"key":"BF02243419_CR12","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1145\/362736.362765","volume":"13","author":"L. Lamport","year":"1970","unstructured":"[LA 70] Lamport, L.: Comment on Bell's quadratic quotient method for Hash code searching. Comm. ACM13, 573\u2013574 (1970).","journal-title":"Comm. ACM"},{"key":"BF02243419_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L. Lamport","year":"1977","unstructured":"[LA 77] Lamport, L.: Proving the correctness of multiprocess programs. IEEE Trans. o. Softw. Eng.SE-3, 125\u2013143 (1977).","journal-title":"IEEE Trans. o. Softw. Eng."},{"key":"BF02243419_CR14","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1145\/361598.361617","volume":"15","author":"F. Luccio","year":"1972","unstructured":"[LU 72] Luccio, F.: Weighted increment linear search for scatter tables. Comm. ACM15, 1045\u20131047 (1972).","journal-title":"Comm. ACM"},{"key":"BF02243419_CR15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/362851.362880","volume":"11","author":"W. D. Maurer","year":"1968","unstructured":"[MA 68] Maurer, W. D.: An improved Hash code for scatter storage. Comm. ACM11, 35\u201338 (1968).","journal-title":"Comm. ACM"},{"key":"BF02243419_CR16","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/362851.362882","volume":"11","author":"R. Morris","year":"1968","unstructured":"[MO 68] Morris, R.: Scatter storage techniques. Comm. ACM11, 38\u201343 (1968).","journal-title":"Comm. ACM"},{"key":"BF02243419_CR17","volume-title":"Datenstrukturen","author":"J. R. M\u00fchlbacher","year":"1975","unstructured":"[MU 75] M\u00fchlbacher, J. R.: Datenstrukturen. M\u00fcnchen: Carl Hanser Verlag 1975."},{"key":"BF02243419_CR18","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1147\/rd.12.0130","volume":"1","author":"W. W. Peterson","year":"1957","unstructured":"[PE 57] Peterson, W. W.: Adressing for random acces storage. IBM J. Res. Dev.1, 130\u2013146 (1957).","journal-title":"IBM J. Res. Dev."},{"key":"BF02243419_CR19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/362007.362036","volume":"13","author":"C. E. Radke","year":"1970","unstructured":"[RA 70] Radke, C. E.: The use of quadratic residue research. Comm. ACM13, 103\u2013107 (1970).","journal-title":"Comm. ACM"},{"key":"BF02243419_CR20","doi-asserted-by":"crossref","first-page":"1975","DOI":"10.1145\/356631.356633","volume":"6","author":"D. G. Severance","year":"1974","unstructured":"[SE 74] Severance, D. G.: Identifier search mechanisms: a survey and generalized method. Comp. Surveys6, 1975\u20131994 (1974).","journal-title":"Comp. Surveys"},{"key":"BF02243419_CR21","doi-asserted-by":"crossref","first-page":"1972","DOI":"10.1145\/362566.362570","volume":"14","author":"J. G. Williams","year":"1971","unstructured":"[WI 71] Williams, J. G.: Storage utilization in a memory hierarchy, when storage assignment is performed by a Hashing algorithm. Comm. ACM14, 1972\u20131975 (1971).","journal-title":"Comm. ACM"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243419.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02243419\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T23:27:40Z","timestamp":1557876460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02243419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,3]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,3]]}},"alternative-id":["BF02243419"],"URL":"https:\/\/doi.org\/10.1007\/bf02243419","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,3]]}}}