Frame memory: a storage architecture to support rapid design and implementation of efficient databases

ABSTRACT

Frame memory is a virtual view of secondary storage that can be implemented with reasonable overhead to support database record storage and accessing requirements. Frame memory is designed so that its operating characteristics can be easily manipulated by either designers or design algorithms, while performance effects of such changes can be accurately predicted. Automated design procedures exist to generate and evaluate alternative database designs built upon frame memory, and the existence of these procedures establishes frames as an attractive memory management architecture for future database management systems.

REFERENCES

• 1: BAYER, R. Symmetric binary B-trees--Data structures and maintenance algorithms. Acta Inf. 1, 4 (Dec. 1972), 290-306.
• 2: James R. Bell, The quadratic quotient method: a hash code eliminating secondary clustering, Communications of the ACM, v.13 n.2, p.107-109, Feb 1970 [doi>10.1145/362007.362040]
• 3: BENNER, F.H. On designing generalized file records for management information systems. Proc, AFIPS 1967 Fall Joint Computer Conf., AFIPS Press, Arlington, Va., pp. 291-303.
• 4: CARDENAS, F.A., AND SAGAMANG, J.P. Doubly-chained tree data base organization--Analysis and design strategies. Comput. J. 20, 1 (1977), 15-26.
• 5: CORPORATE Codasyl Systems Committee, Introduction to “feature analysis of generalized data base management systems”, Communications of the ACM, v.14 n.5, p.308-318, May 1971 [doi>10.1145/362588.362590]
• 6: DUHNE, R.A. Optimal design of a generalized file organization. Ph.D. Dissertation, Cornell Univ., Ithaca, N.Y., 1977, 167 pages.
• 7: Rob Gerritsen, A preliminary system for the design of DBTG data structures, Communications of the ACM, v.18 n.10, p.551-557, Oct. 1975 [doi>10.1145/361020.361022]
• 8: Bruce Hahn, A new technique for compression and storage of data, Communications of the ACM, v.17 n.8, p.434-436, Aug. 1974 [doi>10.1145/361082.361086]
• 9: HEAPS, H.S. Storage analysis of a compression coding for document data bases. INFOR 10, 1 (Feb. 1972), 47-6I.
• 10: HULTEN, C., AND SODERLUND, L. A simulation model for performance analysis of large shared data bases. Proc. Third Int. Conf. Very Large Data Bases, New York, 1977, pp. 524-533.
• 11: IBM CORPORATION. Introduction to IBM Direct Access Storage Devices and Organizations. Rep. DG 20-1649, White Plains, N.Y., 1974, 123 pages.
• 12: KEEI-IN, D.G., AND LACY, J.O. VSAM data set design parameters. IBM Syst. J. 13, 3 (Sept. 1974), 185-212.
• 13: Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
• 14: Salvatore Tony March, Jr., Models of storage structures and the design of database records based upon a user characterization., 1978
• 15: Salvatore T. March , Dennis G. Serverance, The determination of efficient record segmentations and blocking factors for shared data files, ACM Transactions on Database Systems (TODS), v.2 n.3, p.279-296, Sept. 1977 [doi>10.1145/320557.320574]
• 16: Salvatore T. March , Dennis G. Severance, A mathematical modeling approach to the automatic selection of database designs, Proceedings of the 1978 ACM SIGMOD international conference on management of data, May 31-June 02, 1978, Austin, Texas [doi>10.1145/509252.509272]
• 17: MARCH, S.T., AND SEVERANCE, D.G. A computerized database design system version 3: System documentation. Management Information Systems Research Center Rep. MISRC-TR-78-24, Univ. Minnesota, Minneapolis, Aug. 1978.
• 18: MARCh, S.T., AND SEVERANCE, D.G. A computerized database design system version 3: User's manual. Management Information Systems Research Center Rep. MISRC-TR-78-23, Univ. Minnesota, Minneapolis, Aug. 1978.
• 19: MAXWELL, W.L., AND SEVERANCE, D.G. Comparison of alternatives in an information system. Proc. Wharton Conf. Research on Computers in Organizations, Univ. Pennsylvania, Philadelphia, Oct. 1973.
• 20: MRI SYSTEMS CORPORATION. System 2000 Language Guide. Austin, Tex., 1976.
• 21: OLLE, T.VY'. Data structures and storage structures for general file processing. Proc. FILE 68 Int. Seminar File Organizations, Copenhagen, 1968, pp. 285-294.
• 22: SENKO, M.E., AND ALTMAN, E.B. DIAM II and levels of abstraction, the physical device level: A general model for access methods. Unpublished working paper.
• 23: SEVERANCE, D.G. A parametric model of alternative file structures, inf. Syst. I, 2 (1975), 51-55.
• 24: Dennis Severance , Ricardo Duhne, A practitioner's guide to addressing algorithms, Communications of the ACM, v.19 n.6, p.314-326, June 1976 [doi>10.1145/360238.360242]
• 25: D. G. Severance , J. V. Carlis, A Practical Approach to Selecting Record Access Paths, ACM Computing Surveys (CSUR), v.9 n.4, p.259-272, Dec. 1977 [doi>10.1145/356707.356709]
• 26: SPERRY UNIVAC. Univac 1000 Series Data Management Reference Manual. Blue Bell, Pa., 1973.
• 27: VAN DEE POOL, J.A. Optimum storage allocation for a fffle with open addressing. IBM J. Res. Dev. 17, 2 (Mar. 1973), 106-116.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL

Additional Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.2 Storage Management
          Subjects: Secondary storage

General Terms:
Algorithms, Design

Keywords:
analytic modeling, database design system, virtual secondary storge