gStore is a graph-based RDF data management system (or what is commonly called a “triple store”) that maintains the graph structure of the original RDF data. Its data model is a labeled, directed multiedge graph, where each vertex corresponds to a subject or an object. We also represent a given SPARQL query by a query graph Q. Query processing involves finding subgraph matches of Q over the RDF graph G. gStore incorporates an index over the RDF graph (called VS*-tree) to speed up query processing. VS*-tree is a heightbalanced tree with a number of associated pruning techniques to speed up subgraph matching.
There are three important features in gStore:
gStore mangages RDF repository from a graph datbase perspective.
gStore supports SPARQL query efficiently.
gStore can handle, in a uniform manner, dierent data types (strings and numerical data) and SPARQL queries with wildcards, aggregate, range operators
The gStore project is supported by the National Science Foundation of China (NSFC), Natural Sciences and Engineering Research Council (NSERC) of Canada, and Hong Kong RGC.