2000 character limit reached
Towards Scalable Visual Exploration of Very Large RDF Graphs (1506.04333v2)
Published 13 Jun 2015 in cs.HC and cs.DB
Abstract: In this paper, we outline our work on developing a disk-based infrastructure for efficient visualization and graph exploration operations over very large graphs. The proposed platform, called graphVizdb, is based on a novel technique for indexing and storing the graph. Particularly, the graph layout is indexed with a spatial data structure, i.e., an R-tree, and stored in a database. In runtime, user operations are translated into efficient spatial operations (i.e., window queries) in the backend.