{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:14Z","timestamp":1750308134703,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[1976,4,1]],"date-time":"1976-04-01T00:00:00Z","timestamp":197164800000},"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":["SIGIR Forum"],"published-print":{"date-parts":[[1976,4]]},"abstract":"<jats:p>The limitation of the existing class of sequential computers in the management of large data bases is well known. This has led to investigations of Associative\/Parallel devices, working alone or in conjunction with sequential devices, as possible tools for Data Base Management (DBM). Associative Memories have been shown to be an attractive tool for DBM when the data base is sufficiently small; however, their usefulness in the management of large data bases has not yet been established.The research that we are presently undertaking addresses itself to data retrieval and update in an environment of a large, general data base with substantial activity. A hierarchical directory to the data base is utilized that permits both single and multiple-attribute retrievals. A series of Associative Memories is used to pipeline the searches at various levels of the directory. The performance of this system is being compared with both sequential and other organizations utilizing Associative Memories. The criteria for comparison are retrieval and update performance, storage utilization and flexibility.<\/jats:p>","DOI":"10.1145\/1095286.1095294","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"22-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A multiple associative memory organization for pipelining a directory to a very large data base"],"prefix":"10.1145","volume":"10","author":[{"given":"P. Bruce","family":"Berra","sequence":"first","affiliation":[{"name":"Syracuse University, Syracuse, N.Y"}]},{"given":"Ashok K.","family":"Singhania","sequence":"additional","affiliation":[{"name":"Syracuse University, Syracuse, N.Y"}]}],"member":"320","published-online":{"date-parts":[[1976,4]]},"container-title":["ACM SIGIR Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095286.1095294","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1095286.1095294","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:31Z","timestamp":1750262911000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095286.1095294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,4]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1976,4]]}},"alternative-id":["10.1145\/1095286.1095294"],"URL":"https:\/\/doi.org\/10.1145\/1095286.1095294","relation":{},"ISSN":["0163-5840"],"issn-type":[{"type":"print","value":"0163-5840"}],"subject":[],"published":{"date-parts":[[1976,4]]},"assertion":[{"value":"1976-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}