From 520ca12e5c0dc950c56f169464eb208975010ad8 Mon Sep 17 00:00:00 2001 From: Bookug Lobert Date: Fri, 6 Jan 2017 23:32:38 +0800 Subject: [PATCH] update INTRO.md from a github user better some expressions in the INTRO.md, and there is also some little modification done by me. --- docs/INTRO.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/docs/INTRO.md b/docs/INTRO.md index 466cad9..9463fcc 100644 --- a/docs/INTRO.md +++ b/docs/INTRO.md @@ -2,7 +2,7 @@ ## What Is gStore -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](http://www.w3.org/TR/rdf11-concepts/) data. +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](http://www.w3.org/TR/rdf11-concepts/) data. Its data model is a labeled, directed graph with multiple vertices and edges, where each vertex corresponds to a subject or an object. We represent a given [SPARQL](http://www.w3.org/TR/sparql11-overview/) query by a query graph Q. The query process involves finding subgraph matches of Q over the RDF graph G, instead of joining tables in relational data management system. gStore incorporates an VS-tree index over the RDF graph (called VS-tree) to speed up the query process, which is a height balanced tree with a number of associated pruning techniques to speed up subgraph matching. @@ -18,7 +18,7 @@ There are three important features in gStore: - gStore manages RDF repository from a graph database perspective. -- gStore supports both efficient query and update. +- gStore supports both queries and updates efficiently. - gStore can handle, in a uniform manner, different data types (strings and numerical data) and SPARQL queries with wild cards, aggregate, range operators(only theoretically, not achieved so far)