An algorithm for automatic layout of entity-relationship diagrams
Proc. of the third international conference on Entity-relationship approach to software engineering
ER model clustering as an aid for user communication and documentation in database design
Communications of the ACM
Graph drawing by force-directed placement
Software—Practice & Experience
Randomized algorithms
Conceptual schemas with abstractions making flat conceptual schemas more comprehensible
Data & Knowledge Engineering
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Entity-relationship and object-oriented model automatic clustering
Data & Knowledge Engineering
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Entity Tree Clustering - A Method for Simplifying ER Designs
ER '92 Proceedings of the 11th International Conference on the Entity-Relationship Approach: Entity-Relationship Approach
Levelled Entity Relationship Model
ER '94 Proceedings of the13th International Conference on the Entity-Relationship Approach
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
GD '95 Proceedings of the Symposium on Graph Drawing
A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
User-oriented visual layout at multiple granularities
AVI '96 Proceedings of the workshop on Advanced visual interfaces
Improving graphical information system model use with elision and connecting lines
ACM Transactions on Computer-Human Interaction (TOCHI)
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Combating web spam with trustrank
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
On the visualization of large-sized ontologies
Proceedings of the working conference on Advanced visual interfaces
On Computing the Importance of Entity Types in Large Conceptual Schemas
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
A method for filtering large conceptual schemas
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Information exploration in search computing
Search computing
StarLion: auto-configurable layouts for exploring ontologies
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
Ontology-Driven conceptual design of ETL processes using graph transformations
Journal on Data Semantics XIII
On computing the importance of associations in large conceptual schemas
Conceptual Modelling and Its Theoretical Foundations
Journal of Visual Languages and Computing
Understanding constraint expressions in large conceptual schemas by automatic filtering
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Exploratory search framework for Web data sources
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occurs very frequently in reverse engineering and in information integration. In this paper we describe a novel method that can aid the understanding and the visualization of very large ER diagrams that is inspired by the link analysis techniques that are used in Web Searching. Specifically, this method takes as input an ER diagram and returns a smaller (top-k) diagram that consists of the major entity and relationship types of the initial diagram. Concerning the drawing of the resulting top-k graphs in the 2D space, we propose a force-directed placement algorithm especially adapted for ER diagrams. Specifically, we describe and analyze experimentally two different force models and various configurations. The experimental evaluation on large diagrams of real world applications proved the effectiveness of this technique.