Show simple item record

dc.contributor.authorBattista, Giuseppe Dien_US
dc.contributor.authorDidimo, Walteren_US
dc.contributor.authorPatrignani, Maurizioen_US
dc.contributor.authorPizzonia, Maurizioen_US
dc.contributor.editorW. de Leeuw and R. van Liereen_US
dc.date.accessioned2014-01-30T06:41:33Z
dc.date.available2014-01-30T06:41:33Z
dc.date.issued2000en_US
dc.identifier.isbn3211835156en_US
dc.identifier.issn1727-5296en_US
dc.identifier.urihttp://dx.doi.org/10.2312/VisSym/VisSym00/053-062en_US
dc.description.abstractA 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.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleDrawing Relational Schemasen_US
dc.description.seriesinformationEurographics / IEEE VGTC Symposium on Visualizationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record