The Use of Cluster Analysis in Physical Data Base Design.

Jeffrey A. Hoffer, Dennis G. Severance: The Use of Cluster Analysis in Physical Data Base Design. VLDB 1975: 69-86

@inproceedings{DBLP:conf/vldb/HofferS75,
  author    = {Jeffrey A. Hoffer and
               Dennis G. Severance},
  editor    = {Douglas S. Kerr},
  title     = {The Use of Cluster Analysis in Physical Data Base Design},
  booktitle = {Proceedings of the International Conference on Very Large Data
               Bases, September 22-24, 1975, Framingham, Massachusetts, USA},
  publisher = {ACM},
  year      = {1975},
  pages     = {69-86},
  ee        = {db/conf/vldb/HofferS75.html},
  crossref  = {DBLP:conf/vldb/75},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Abstract

The physical structure and relative placement of information elements within a data base is critical for the efficient design of a computerized information system which is shared by a community of users. Traditionally the selection among alternative structural designs has been handled largely via heuristics. Recent research has shown that a number of significant design problems can be stated mathematically as nonlinear, integer, zero-one programming problems. In concept, therefore, mathematical programming algorithms can be used to determine "optimal" data base designs. In practice, one finds that realistic problems of even modest size are computationally infeasible. This paper presents a means for overcoming this difficulty in the design of data base records. A metric with which to measure the similarity of usage among data items is developed and used by a clustering algorithm to reduce the space of alternative designs to a point where solution is economically feasible.

Copyright © 1975 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/vldb7588 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

BibTeX

Printed Edition

Douglas S. Kerr (Ed.): Proceedings of the International Conference on Very Large Data Bases, September 22-24, 1975, Framingham, Massachusetts, USA. ACM 1975
Contents BibTeX

References

[1]: ...
[2]: ...
[3]: ...
[4]: ...
[5]: ...
[6]: ...
[7]: ...
[8]: ...

Referenced by

Surajit Chaudhuri, Vivek R. Narasayya: Index Merging. ICDE 1999: 296-303
Elzbieta Malinowski, Sharma Chakravarthy: Fragmentation Techniques for Distributing Object-Oriented Databases. ER 1997: 347-360
John Shepherd, Banchong Harangsri, Hwee Ling Chen, Anne H. H. Ngu: A Two-Phase Approach to Data Allocation in Distributed Databases. DASFAA 1995: 380-387
Gultekin Özsoyoglu, Aladdin Hafez: Near-Optimum Storage Models for Nested Relations Based on Workload Information. IEEE Trans. Knowl. Data Eng. 5(6): 1018-1038(1993)
Shamkant B. Navathe, Minyoung Ra: Vertical Partitioning for Database Design: A Graphical Algorithm. SIGMOD Conference 1989: 440-450
Aladdin Hafez, Gultekin Özsoyoglu: The Partial Normalized Storage Model of Nested Relations. VLDB 1988: 100-111
Patrick Valduriez, Setrag Khoshafian, George P. Copeland: Implementation Techniques of Complex Objects. VLDB 1986: 101-110
Domenico Saccà, Gio Wiederhold: Database Partitioning in a Cluster of Processors. ACM Trans. Database Syst. 10(1): 29-56(1985)
Shamkant B. Navathe, Stefano Ceri, Gio Wiederhold, Jinglie Dou: Vertical Partitioning Algorithms for Database Design. ACM Trans. Database Syst. 9(4): 680-710(1984)
Salvatore T. March, Gary D. Scudder: On the Selection of Efficient Record Segmentations and Backup Strategies for Large Shared Databases. ACM Trans. Database Syst. 9(3): 409-438(1984)
Salvatore T. March: Techniques for Structuring Database Records. ACM Comput. Surv. 15(1): 45-79(1983)
Clement T. Yu, M. K. Siu, K. Lam, C. H. Chen: File Allocation in Distributed Databases with Interaction between Files. VLDB 1983: 248-259
Stefano Ceri, Mauro Negri, Giuseppe Pelagatti: Horizontal Data Partitioning in Database Design. SIGMOD Conference 1982: 128-136
Kenneth C. Sevcik: Data Base System Performance Prediction Using an Analytical Model (Invited Paper). VLDB 1981: 182-198
Don S. Batory: On Searching Transposed Files. ACM Trans. Database Syst. 4(4): 531-544(1979)
M. J. Turner, R. Hammond, P. Cotton: A DBMS for Large Statistical Databases. VLDB 1979: 319-327
Michael Hammer, Bahram Niamir: A Heuristic Approach to Attribute Partitioning. SIGMOD Conference 1979: 93-101
Mario Schkolnick: A Survey of Physical Database Design Methodology and Techniques. VLDB 1978: 474-487
Mario Schkolnick: A Clustering Algorithm for Hierarchical Structures. ACM Trans. Database Syst. 2(1): 27-44(1977)
Beverly K. Kahn: A Method for Describing Information Required by the Database Design Process. SIGMOD Conference 1976: 53-64

BibTeX

ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]