Towards Scalable Visual Exploration of Very Large RDF Graphs

  • Nikos Bikakis
  • John Liagouris
  • Maria Kromida
  • George Papastefanatos
  • Timos Sellis
Conference paper

DOI: 10.1007/978-3-319-25639-9_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9341)
Cite this paper as:
Bikakis N., Liagouris J., Kromida M., Papastefanatos G., Sellis T. (2015) Towards Scalable Visual Exploration of Very Large RDF Graphs. In: Gandon F., Guéret C., Villata S., Breslin J., Faron-Zucker C., Zimmermann A. (eds) The Semantic Web: ESWC 2015 Satellite Events. ESWC 2015. Lecture Notes in Computer Science, vol 9341. Springer, Cham

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.

Keywords

graphVizdb Graph data Disk based visualization tool RDF graph visualization Spatial Visualizing linked data Partition based graph layout 

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Nikos Bikakis
    • 1
    • 2
  • John Liagouris
    • 3
  • Maria Kromida
    • 1
  • George Papastefanatos
    • 2
  • Timos Sellis
    • 4
  1. 1.NTU AthensAthensGreece
  2. 2.ATHENA Research CenterAthensGreece
  3. 3.ETH ZürichZürichSwitzerland
  4. 4.RMIT UniversityMelbourneAustralia

Personalised recommendations