Design and Implementation of a Real Time Information Storage and Retrieval System

ACM '71 Pub Date : 1900-01-01 DOI:10.1145/800184.810471
Steven J. Karpen
{"title":"Design and Implementation of a Real Time Information Storage and Retrieval System","authors":"Steven J. Karpen","doi":"10.1145/800184.810471","DOIUrl":null,"url":null,"abstract":"Presented here is a paper on the “Design and Implementation of a Real Time (On Line) Information Storage and Retrieval System”. Guidance is given into the design and testing of a hashing function for a volatile set of alphanumeric keys. The interrelationship between the hashing function and the Information Storage and Retrieval (IS&R) System is examined with respect to design criteria. Finally the design of the IS&R System itself is presented in terms of an attempt to optimize the Input/Output (I/O) time versus disk and memory storage for a volatile set of records. Built into the IS&R System design is the flexibility to optimize the systems performance under both the ideal and worst case hashing function design or performance. Emphasis, in the design, is placed on the I/O time required in updating, or inquiring, the file for a matched record retrieval. The following techniques were combined to form the original IS&R System: data structures, directory (dictionary) concept, bit directories, link listing (chaining), hashing function, and minimization of disk head movement.\n The theory of the IS&R System is derived in general and is applicable to a variety of applications as long as the application possess the following requirements: a highly volatile set of records, a real time (or on line) retrieval requirement, difficulty in designing (or choosing) a hashing function due to the volatile set of keys, and heavy activity on updating, or inquiring, the file. Detailed algorithms of the system design are presented for this purpose.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"33 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '71","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800184.810471","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Presented here is a paper on the “Design and Implementation of a Real Time (On Line) Information Storage and Retrieval System”. Guidance is given into the design and testing of a hashing function for a volatile set of alphanumeric keys. The interrelationship between the hashing function and the Information Storage and Retrieval (IS&R) System is examined with respect to design criteria. Finally the design of the IS&R System itself is presented in terms of an attempt to optimize the Input/Output (I/O) time versus disk and memory storage for a volatile set of records. Built into the IS&R System design is the flexibility to optimize the systems performance under both the ideal and worst case hashing function design or performance. Emphasis, in the design, is placed on the I/O time required in updating, or inquiring, the file for a matched record retrieval. The following techniques were combined to form the original IS&R System: data structures, directory (dictionary) concept, bit directories, link listing (chaining), hashing function, and minimization of disk head movement. The theory of the IS&R System is derived in general and is applicable to a variety of applications as long as the application possess the following requirements: a highly volatile set of records, a real time (or on line) retrieval requirement, difficulty in designing (or choosing) a hashing function due to the volatile set of keys, and heavy activity on updating, or inquiring, the file. Detailed algorithms of the system design are presented for this purpose.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
实时信息存储与检索系统的设计与实现
本文介绍了一种实时(在线)信息存储与检索系统的设计与实现。给出了设计和测试一个易变的字母数字键集的哈希函数的指导。从设计准则的角度考察了哈希函数与信息存储与检索系统之间的相互关系。最后,IS&R系统本身的设计是尝试优化输入/输出(I/O)时间,而不是针对易失性记录集的磁盘和内存存储。IS&R系统设计中内置了在理想和最坏情况下优化系统性能的灵活性哈希函数设计或性能。在设计中,重点放在更新或查询匹配记录检索的文件所需的I/O时间上。以下技术结合起来形成了原始的IS&R系统:数据结构、目录(字典)概念、位目录、链接列表(链)、哈希函数和最小化磁头移动。IS&R系统的理论是一般衍生出来的,适用于各种应用程序,只要应用程序具有以下要求:高度不稳定的记录集,实时(或在线)检索要求,由于键集不稳定而难以设计(或选择)哈希函数,以及更新或查询文件的繁重活动。为此,给出了系统设计的详细算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Least Common Bigram: A dictionary arrangement technique for computerized natural-language text searching Interactive graphical spline approximation to boundary value problems System for Heuristic and Rapid Processing of Component Layout and Wiring (SHARPCLAW) A version of Beale's method avoiding the free-variables Troika for architectural planning
×
引用
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