On Coherent Indented Tree Visualization of RDF Graphs

摘要

Indented tree has been widely used to organize information and visualize graph-structured data like RDF graphs. Given a starting resource in a cyclic RDF graph as root, there are different ways of transforming the graph into a tree representation to be visualized as an indented tree. In this paper, we aim to smooth user's reading experience by visualizing an optimally coherent indented tree in the sense of featuring the fewest reversed edges, which often cause confusion and interrupt the user's cognitive process due to lack of effective way of presentation. To achieve this, we propose a two-step approach to generate such an optimal tree representation for a given RDP graph. We empirically show the difference in coherence between tree representations of real-world RDF graphs generated by different approaches. These differences lead to a significance difference in user experience in our user study, which reports a notable degree of dependence between coherence and user experience.