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.
Author supplied keywords
Cite
CITATION STYLE
Bikakis, N., Liagouris, J., Kromida, M., Papastefanatos, G., & Sellis, T. (2015). Towards scalable visual exploration of very large RDF graphs. In Lecture Notes in Computer Science (Vol. 9341, pp. 9–13). Springer Verlag. https://doi.org/10.1007/978-3-319-25639-9_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.