Drawing Relational Schemas
A wide number of practical applications would benefit from automatically generated graphical representations of relational schemas, in which tables are represented by boxes, and table attributes correspond to distinct stripes inside each table. Links, connecting two attributes of two different tables, represent relational constraits or join paths, and may attach arbitrarily to the left or to the right side of the stripes representing the attributes. To our knowledge no drawing technique is available to automatically produce diagrams in such strongly constrained drawing Convention. In this paper we provide a polynomial time algorithm solving this problem and test its efficiency and effectiveness against a large test suite.
KeywordsTest Suite Polynomial Time Algorithm Relational Schema Graph Drawing Drawing Technique
Unable to display preview. Download preview PDF.
- 1.Gdtoolkit: An object-oriented library for handling and drawing graphs, 1999. Third University of Rome, http://www.dia.uniroma3.it/~gdt.Google Scholar
- 2.P. Atzeni, S. Ceri, S. Paraboschi, and R. Torlone. Database Systems: Concepts, Languages and Architetures. McGraw Hill, London, United Kingdom, 1999.Google Scholar
- 3.C. Batini, E. Nardelli, M. Talamo, and R. Tamassia. GINCOD: a graphical tool for conceptual design of data base applications. In A. Albano, V.D. Antonellis, and A.D. Leva, editors, Computer Aided Data Base Design, pages 33–51. North- Holland, New York, NY, 1985.Google Scholar
- 4.C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data flow diagrams. IEEE Trans. Softw. Eng., SE-12(4)538–546 1986.Google Scholar
- 6.G.D. Battista, W. Didimo, M. Patrignani, and M. Pizzonia. Orthogonal and quasiupward drawings with vertices of arbitrary size. In J. Kratochvil, editor, Graph Drawing (Proc. GD ’99), Lecture Notes Comput. Sei. Springer-Verlag, 1999. to appear.Google Scholar
- 7.G.D. Battista, S. Diglio, M. Lenti, and M. Simoncelli. Queryviewer: A java system for drawing the result of a query, 1998. Third University of Rome, http://www.dia.uniroma3.it/~lenti/QueryViewer/.Google Scholar
- 8.P. Bertolazzi, G. Di Battista, and W. Didimo. Quasi-upward planarity. In S.H. Whitesides, editor, Graph Drawing (Proc. GD ’98), volume 1547 of Lecture Notes Comput. Sei., pages 15-29. Springer-Verlag, 1998.Google Scholar
- 12.U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F.J. Brandenburg, editor, Graph Drawing (Proc. GD ’95), volume 1027 of Lecture Notes Comput. Sei., pages 254-266. Springer-Verlag, 1996.Google Scholar
- 13.F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1972.Google Scholar
- 15.K. Jansen.An approximation scheme for bin packing with conflicts. In Proc. 6th Scand. Workshop Algorithm Theory, volume 1432 of Lecture Notes Comput. Sei., pages 35-46. Springer-Verlag, 1998.Google Scholar