Physical Database Design: Techniques for Improved Database Performance

In recent years, the information processing requirements of business organizations have expanded tremendously. With this expansion, the design of databases to efficiently manage this information has become critical. This paper addresses two areas of physical database design: record structuring (the grouping of data items into records that are physically stored and accessed together) and access path design (the design of algorithms and system structures used to determine the physical location of records and to support content dependent retrieval). The performance of a database system is largely dependent on the design choices made in these two areas. Techniques to support a database designer in making these choices are discussed.

[1]  Dennis G. Severance,et al.  A mathematical modeling approach to the automatic selection of database designs , 1978, SIGMOD '78.

[2]  Dennis G. Severance,et al.  A Practical Approach to Selecting Record Access Paths , 1977, CSUR.

[3]  Alfonso F. Cardenas,et al.  Doubly-Chained Tree Data Base Organisation-Analysis and Design Strategies , 1977, Comput. J..

[4]  R. Gerritsen.  A preliminary system for the design of DBTG data structures , 1975, CACM.

[5]  Paul J. Schweitzer,et al.  Problem Decomposition and Data Reorganization by a Clustering Technique , 1972, Oper. Res..

[6]  P. Bruce Berra,et al.  Minimum cost selection of secondary indexes for formatted files , 1977, TODS.

[7]  Jeffrey A. Hoffer.  Database design practices for inverted files , 1980, Inf. Manag..

[8]  Mario Schkolnick,et al.  A clustering algorithm for hierarchical structures , 1977, TODS.

[9]  Rob Gerritsen,et al.  A Data Base Design Decision Support System , 1977, VLDB.

[10]  Gio Wiederhold,et al.  Database Design , 1977 .

[11]  Christer Hulten,et al.  A Simulation Model for Performance Analysis of Large Shared Data Bases , 1977, VLDB.

[12]  John V. Carlis,et al.  Physical database design: A DSS approach , 1981, Inf. Manag..

[13]  William Kent,et al.  Data and Reality , 1978 .

[14]  Douglas Comer,et al.  Heuristics for trie index minimization , 1979, ACM Trans. Database Syst..

[15]  William C. McGee.  The Information Management System IMS/VS Part II: Data Base Facilities , 1977, IBM Syst. J..

[16]  Salvatore T. March,et al.  Techniques for Structuring Database Records , 1983, CSUR.

[17]  Toby J. Teorey,et al.  Design of Database Structures , 1982 .

[18]  Alfonso F. Cardenas.  Analysis and performance of inverted data base structures , 1975, CACM.

[19]  Peter P. Chen.  The entity-relationship model: toward a unified view of data , 1975, VLDB '75.

[20]  Dennis G. Severance,et al.  The determination of efficient record segmentations and blocking factors for shared data files , 1977, TODS.

[21]  Calvin C. Gotlieb,et al.  A unifying model of physical databases , 1982, TODS.

[22]  Franz Edelman,et al.  The Management of Information Resources - A Challenge for American Business , 1981, MIS Q..

[23]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[24]  Dennis G. Severance,et al.  Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases , 1976, JACM.

[25]  Salvatore T. March,et al.  COMPUTER-AIDED PHYSICAL DATABASE DESIGN METHODOLOGY. , 1983 .

[26]  S. Bing Yao.  An attribute based model for database access cost analysis , 1977, TODS.

[27]  James Martin,et al.  Principles of Data-Base Management , 1976 .

[28]  Wan-Ping Chiang,et al.  A method for database record clustering , 1982 .

[29]  Dennis G. Severance,et al.  The use of cluster analysis in physical data base design , 1975, VLDB '75.

[30]  Irving L. Traiger,et al.  A history and evaluation of System R , 1981, CACM.

[31]  Shamkant B. Navathe,et al.  View representation in logical database design , 1978, SIGMOD Conference.

[32]  Arthur M. Geoffrion,et al.  Solving Bicriterion Mathematical Programs , 1967, Oper. Res..

[33]  Michael Hammer,et al.  A heuristic approach to attribute partitioning , 1979, SIGMOD '79.