GRINAGraphBasedRDFIndex-Associationforthe.PDFVIP

GRIN: A Graph Based RDF Index Octavian Udrea Andrea Pugliese V.S. Subrahmanian University of Maryland University of Calabria – DEIS department University of Maryland College Park, MD 20742 Via P. Bucci, Rende, Italy College Park, MD 20742 Abstract graph (think of these as vertices that occupy strategic po- sitions in the graph) and by proposing a notion of radius RDF (“Resource Description Framework”) is now a widely from those center vertices. All vertices within the stated used World Wide Web Consortium standard. However, radius of a center vertex are associated with that vertex methods to index large volumes of RDF data are still in (each graph vertex must be associated with one or more their infancy. In this paper, we focus on providing a very lightweight indexing mechanism for certain kinds of RDF center vertices). We propose methods of finding center and radius vertices. queries, namely graph-based queries where there is a need to traverse edges in the graph determined by an RDF database. 2. We then define GRIN - an efficient tree data structure to Our approach uses the idea of drawing circles around selected store the regions defined by these center vertices (together “center” vertices in the graph where the circle would encom- with their associated radii). pass tho