基于内容的嵌入式神经联想记忆信息检索

M. Schmidt, U. Rückert
{"title":"基于内容的嵌入式神经联想记忆信息检索","authors":"M. Schmidt, U. Rückert","doi":"10.1109/EMPDP.2001.905073","DOIUrl":null,"url":null,"abstract":"In this paper a novel approach for the storage and access of an index used in Internet search engines (Information Retrieval) is presented. The index provides a mapping from search terms to documents. The Binary Neural Associative Memory (BiNAM) stores an index by associating document signatures and document locations in a distributed and content addressable way. The system presented here has a high memory efficiency of more than 90%. The trade-off between memory consumption and precision of the query-results is examined. A scalable system architecture is presented. The architecture exploits the parallel structure of the BiNAM. The association time is estimated to be orders of magnitude faster than a software solution. The system is realized as a modular PCI architecture. The maximum capacity of the first version is 768 MByte memory which allows to implement a BiNAM of 80 K neurons with 80 K inputs each. In such a system approximately 64 million associations can be scored and accessed within 330 ns per association.","PeriodicalId":262971,"journal":{"name":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Content-based information retrieval using an embedded neural associative memory\",\"authors\":\"M. Schmidt, U. Rückert\",\"doi\":\"10.1109/EMPDP.2001.905073\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a novel approach for the storage and access of an index used in Internet search engines (Information Retrieval) is presented. The index provides a mapping from search terms to documents. The Binary Neural Associative Memory (BiNAM) stores an index by associating document signatures and document locations in a distributed and content addressable way. The system presented here has a high memory efficiency of more than 90%. The trade-off between memory consumption and precision of the query-results is examined. A scalable system architecture is presented. The architecture exploits the parallel structure of the BiNAM. The association time is estimated to be orders of magnitude faster than a software solution. The system is realized as a modular PCI architecture. The maximum capacity of the first version is 768 MByte memory which allows to implement a BiNAM of 80 K neurons with 80 K inputs each. In such a system approximately 64 million associations can be scored and accessed within 330 ns per association.\",\"PeriodicalId\":262971,\"journal\":{\"name\":\"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EMPDP.2001.905073\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMPDP.2001.905073","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

本文提出了一种存储和访问Internet搜索引擎(信息检索)索引的新方法。索引提供了从搜索词到文档的映射。二进制神经关联记忆(BiNAM)通过以分布式和内容可寻址的方式关联文档签名和文档位置来存储索引。该系统的存储效率高达90%以上。检查了内存消耗和查询结果精度之间的权衡。提出了一种可扩展的系统架构。该架构利用了BiNAM的并行结构。关联时间估计比软件解决方案快几个数量级。该系统采用模块化的PCI架构实现。第一个版本的最大容量是768mbyte内存,允许实现80k神经元的BiNAM,每个神经元有80k输入。在这样一个系统中,大约6400万个关联可以在330 ns内被评分和访问。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Content-based information retrieval using an embedded neural associative memory
In this paper a novel approach for the storage and access of an index used in Internet search engines (Information Retrieval) is presented. The index provides a mapping from search terms to documents. The Binary Neural Associative Memory (BiNAM) stores an index by associating document signatures and document locations in a distributed and content addressable way. The system presented here has a high memory efficiency of more than 90%. The trade-off between memory consumption and precision of the query-results is examined. A scalable system architecture is presented. The architecture exploits the parallel structure of the BiNAM. The association time is estimated to be orders of magnitude faster than a software solution. The system is realized as a modular PCI architecture. The maximum capacity of the first version is 768 MByte memory which allows to implement a BiNAM of 80 K neurons with 80 K inputs each. In such a system approximately 64 million associations can be scored and accessed within 330 ns per association.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Adding flexibility and real-time performance by adapting a single processor industrial application to a multiprocessor platform Heterogeneous matrix-matrix multiplication or partitioning a square into rectangles: NP-completeness and approximation algorithms Parallel simulated annealing for the delivery problem Implementing on-line techniques to allocate file resources in large distributed systems Visual data-parallel programming for signal processing applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1