Abstract
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.
Work partially supported by: “Progetto Algoritmi per Grandi Insiemi di Dati: Scienza e Ingegneria”, MURST Programmi di Ricerca di Rilevante Interesse Nazionale.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gdtoolkit: An object-oriented library for handling and drawing graphs, 1999. Third University of Rome, http://www.dia.uniroma3.it/~gdt.
P. Atzeni, S. Ceri, S. Paraboschi, and R. Torlone. Database Systems: Concepts, Languages and Architetures. McGraw Hill, London, United Kingdom, 1999.
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.
C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data flow diagrams. IEEE Trans. Softw. Eng., SE-12(4)538–546 1986.
C. Batini, M. Talamo, and R. Tamassia. Computer aided layout of entityrelationship diagrams. Journal of Systems and Software, 4:163–173, 1984.
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.
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/.
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.
B. Chazelle. The bottom-left bin-packing heuristic: an efficient implementation. IEEE Trans. Comput., C-32:697–707 1983.
N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa. A linear algorithm for embedding planar graphs using PQ-trees. J. Comput. Syst. Sei., 30(l)54–76, 1985.
G. DiBattista, P. Eades, R. Tamassia, and I.G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
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.
F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1972.
J. Hopcroft and R.E. Tarjan. Efficient planarity testing. J. ACM, 21(4)549–568, 1974.
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.
K. Mehlhorn and S. Näher. LEDA: a platform for combinatorial and geometric Computing. Commun. ACM, 38(1)96–102, 1995.
R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAMJ. Comput., 16(3)421–444, 1987.
R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(l)61–79 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M. (2000). Drawing Relational Schemas. In: de Leeuw, W.C., van Liere, R. (eds) Data Visualization 2000. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6783-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6783-0_6
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83515-9
Online ISBN: 978-3-7091-6783-0
eBook Packages: Springer Book Archive