Vertical Partitioning for Database Design: A Graphical Algorithm.

Shamkant B. Navathe, Minyoung Ra: Vertical Partitioning for Database Design: A Graphical Algorithm. SIGMOD Conference 1989: 440-450

@inproceedings{DBLP:conf/sigmod/NavatheR89,
  author    = {Shamkant B. Navathe and
               Minyoung Ra},
  editor    = {James Clifford and
               Bruce G. Lindsay and
               David Maier},
  title     = {Vertical Partitioning for Database Design: A Graphical Algorithm},
  booktitle = {Proceedings of the 1989 ACM SIGMOD International Conference on
               Management of Data, Portland, Oregon, May 31 - June 2, 1989},
  publisher = {ACM Press},
  year      = {1989},
  pages     = {440-450},
  ee        = {http://doi.acm.org/10.1145/67544.66966, db/conf/sigmod/NavatheR89.html},
  crossref  = {DBLP:conf/sigmod/89},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Vertical partitioning is the process of subdividing the attributes of a relation or a record type, creating fragments. Previous approaches have used an iterative binary partitioning method which is based on clustering algorithms and mathematical cost functions. In this paper, however, we propose a new vertical partitioning algorithm using a graphical technique. This algorithm starts from the attribute affinity matrix by considering it as a complete graph. Then, forming a linearly connected spanning tree, it generates all meaningful fragments simultaneously by considering a cycle as a fragment. We show its computational superiority. It provides a cleaner alternative without arbitrary objective functions and provides an improvement over our previous work on vertical partitioning.

Copyright © 1989 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

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" 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/smod7592 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

Printed Edition

James Clifford, Bruce G. Lindsay, David Maier (Eds.): Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, Portland, Oregon, May 31 - June 2, 1989. ACM Press 1989

, SIGMOD Record 18(2), June 1989
Contents

Online Edition: ACM Digital Library

References

[Bras 88]: ...
[Ceri 84]: Stefano Ceri, Giuseppe Pelagatti: Distributed Databases: Principles and Systems. McGraw-Hill Book Company 1984, ISBN 0-07-010829-3
[Ceri88]: Stefano Ceri, Barbara Pernici, Gio Wiederhold: Optimization problems and solution methods in the design of data distribution. Inf. Syst. 14(3): 261-272(1989)
[Corn 87]: Douglas W. Cornell, Philip S. Yu: A Vertical Partitioning Algorithm for Relational Databases. ICDE 1987: 30-35
[Hoff 75]: Jeffrey A. Hoffer, Dennis G. Severance: The Use of Cluster Analysis in Physical Data Base Design. VLDB 1975: 69-86
[McCo 72]: ...
[Nava 84]: Shamkant B. Navathe, Stefano Ceri, Gio Wiederhold, Jinglie Dou: Vertical Partitioning Algorithms for Database Design. ACM Trans. Database Syst. 9(4): 680-710(1984)
[Nava 85]: ...