In the morning, I have a meeting with Dr.Candan. The main topic is about my research. 

First, I showed him with the simple implementation I made for the potential demo for icde2007. He gave me some good suggestions:

1. Introducing RDF as the form of file to store important information in the application, such as the assertions, the graph etc. 

2. It's better to display all vertices in the graph with the layout of hierarchical structure, like a tree. For the moment, the package of JUNG does not provide the relevant support. However, there are some solutions. 

For example, we could use MST (Minimal Spanning Tree) algorithm to construct a virtual tree from the original graph, and use this virtual tree as the input of the algorithm to visualize tree structure provided by JUNG. The positions of all vertices could be obtained at last, to modify the original graph to be tree-like.

When MST is concerned, we need be careful to select the root of the virtual tree. (Maybe the number of fan-in or fan-out can be clue!)

On the other hand, we also talk about how to display over one sub-trees in the graph. 

3. Dr.Candan assigned two papers to me, which are in the reference in the cleandb paper. 

4. He also asked me to give the slides for his presentation in CleanDB for our paper.