An integrated model of record segmentation and access path selection for databases

Abstract An analytic model is developed to integrate two closely related subproblems of physical database design: record segmentation and access path selection. Several restrictive assumptions of the past research on record segmentation, e.g. a single access method and the dominance of one subfile over the other, are relaxed in this model. A generic design process for this integrated performance model is suggested and applied to a relational database. A heuristic procedure and an optimal algorithm are developed for solving the model. Extensive computational results are reported to show the effectiveness of these solution techniques.

[1]  Alfonso F. Cardenas,et al.  Evaluation and selection of file organization—a model and system , 1973, Commun. ACM.

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

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

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

[5]  G. Nemhauser,et al.  Integer Programming , 2020 .

[6]  Ronald L. Rardin,et al.  An Overview of Complexity Theory in Discrete Optimization: Part II. Results and Implications , 1982 .

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

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

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

[10]  Irving L. Traiger,et al.  System R: relational approach to database management , 1976, TODS.

[11]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[12]  June Sung Park,et al.  Essays on some critical issues in physical database design , 1988 .

[13]  James R. Evans.  Structural analysis of local search heuristics in combinatorial optimization , 1987, Comput. Oper. Res..

[14]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

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

[16]  Dorit S. Hochbaum,et al.  Database Location in Computer Networks , 1980, JACM.

[17]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[18]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

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

[20]  Arie Segev,et al.  Optimization of join operations in horizontally partitioned database systems , 1986, TODS.

[21]  Gary D. Scudder,et al.  On the selection of efficient record segmentations and backup strategies for large shared databases , 1984, TODS.

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Gio Wiederhold,et al.  Estimating block accesses in database organizations: a closed noniterative formula , 1983, CACM.

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

[25]  Hasan Pirkul,et al.  Computer and Database Location in Distributed Computer Systems , 1986, IEEE Transactions on Computers.

[26]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[27]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[28]  Jr. Salvatore Tony March.  Models of storage structures and the design of database records based upon a user characterization. , 1978 .

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

[30]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[31]  Robert M. Nauss,et al.  An Efficient Algorithm for the 0-1 Knapsack Problem , 1976 .

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

[33]  S. B. Yao,et al.  Approximating block accesses in database organizations , 1977, CACM.