Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
复制标题
大型共享数据库中有效记录分割的数学技术
DOI：
--
复制
发表时间：
1976
期刊：
影响因子：
--
通讯作者：
D. Severance
中科院分区：
文献类型：
--
作者：
M. Eisner;D. Severance
通过将存储在每个记录中的数据项划分为主记录段和次记录段，可以显著降低从大型共享数据库中检索信息的平均成本。一个分析模型，基于知识的数据项长度，运输成本，检索模式，开发，以协助分析师与此分配问题。该模型一般适用于数据库驻留在二级存储器中的环境，并且对于单道程序设计和多道程序设计系统都很有用。一个计算易处理的记录设计算法已被实现为Fortran程序，并应用于许多问题。现实的例子表明，降低总系统成本超过65%的潜力。
It is possible to significantly reduce the average cost of information retrieval from a large shared database by partitioning data items stored within each record into a primary and a secondary record segment. An analytic model, based upon knowledge of data item lengths, transportation costs, and retrieval patterns, is developed to assist an analyst with this assignment problem. The model is generally applicable to environments in which a database resides in secondary storage, and is useful for both uniprogramming and multiprogramming systems. A computationally tractable record design algorithm has been implemented as a Fortran program and applied to numerous problems. Realistic examples are presented which demonstrate a potential for reducing total system cost by more than 65 percent.