Vertical Partitioning for Database Design: A Graphical Algorithm

ACM SIGMOD Record

Volumn 18, Issue 2, 1989, Pages 440-450

  Navathe, Shamkant B ^a   Ra, Mingyoung ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976839448     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/66926.66966     Document Type: Article

References (8)

1. Brassard, G., and Bratley, P., Algorithmics: Theory & Practice, Prentice Hall, 1988.
2. Ceri, S., and Pelagatti, G., Distributed Databases: Principles and Systems, McGraw Hill, 1984.
3. Ceri, S., Pernici, B., and Wiederhold, G., "Optimization Problems and Solution Methods in the Design of Data Distribution," Working Paper, Stanford University, 1988.
4. Cornell, D., and Yu, P. S., "A Vertical Partitioning Algorithm for Relational Databases," Proc. Third International Conference on Data Engineering, Feb. 1987.
5. Hoffer, J. A., and Severance, D. G., "The Use of Cluster Analysis in Physical Database Design," Proc First International Conference on Very Large Data Bases, 1975.
6. McCormick, W. T., Schweitzer, P. J., and White, T. W., "Problem Decomposition and Data Reorganization by a Clustering Technique," Operations Research, 20, Sep. 1972.
7. Navathe, S. B., Ceri, S., Wiederhold, G., and Dou, J., "Vertical Partitioning Algorithms for Database Design," ACM Trans. on Database Systems, Vol. 9, No. 4, Dec. 1984.
8. Navathe, S. B., and Ceri, S., "A Comprehensive Approach to Fragmentation and Allocation of Data in Distributed Databases," IEEE Tutorial on Distributed Database Management, (Larson J-A., and Rahimi,S., eds), 1985.