Abstract
Graph visualization is one of the popular ways to present RDF data. But all practical RDF visualizers have to somehow deal with the problem of the size of the data.
Not only can the total number of triples in RDF data be very large, but even degrees of the nodes of the graph can be very high. This article discusses some problems and solution related to visualization and exploration of such data, usually in relation to the RDF node merging technique.