Font Size: a A A

Study And Implementation Of Visualization Techniques On Associate Relationships In Personal Dataspace

Posted on:2011-11-06Degree:MasterType:Thesis
Country:ChinaCandidate:W H YuFull Text:PDF
GTID:2248330395958480Subject:Computer system architecture
Abstract/Summary:PDF Full Text Request
In the past decades, traditional relational database management systems have played an important role in data management. However, because the amount and types of data are continuously increasing with the development of computer application technology, the need of date management has changed a lot and it leads that so many dataspace systems have been proposed. In addition, information visualization methods are widely applied in various fields. It maps data into multi-dimensional image, which is easy to discover the characteristics of data distribution and the potential semantic relations. There exist associate relationships between entities by attributes or interactions between them in Mydataspace system of the personal dataspace. Therefore, how to visualize data in dataspace in a reasonable way to help users browse and handle them has also become a research focus in recent years.In computer, information should be expressed in some structure to facilitate store, modify, add or delete by the user. A graph is an abstract structure that is frequently used to model information which is used to represent information that can be modeled as objects and connections between those objects. In general, in order to improve the readability of a drawing, it is important to take into account a variety of aesthetic criteria. As the basis for graph visualization, the performance of graph layout algorithm is essential to the display of the graph. Based on this, in this thesis, two novel methods of graph layout are put forward.First, we present a method which is called Layered drawing Algorithm based on the Attribute of node, short for LAA. Unlike the previous hierarchical layout method, it not only improves the process, but also layers the graph by the attribute characteristics of nodes efficiently. Experiment results show that the layout algorithm has well performance within a certain range of data. Due to some disadvantages of LAA a new algorithm is proposed, which is called Force Directed Layout Algorithm based on Structure and Attribute, short for FSA. Combining the characteristics of the data in the person dataspace an innovational model of force directed layout is present in FSA Extensive experiment results show that the layout algorithm has well performance and outperforms some other classical algorithms. It can not only layout the graph quickly, but also display information by the characteristics of graph sufficiently.
Keywords/Search Tags:personal dataspace, graph, information visualization, associate relationship
PDF Full Text Request
Related items