关键词: 属性路径, 正则表达式, SPARQL, RDF, gStore

Abstract:

The authors propose a divide-and-conquer based solution over gStore, an existing RDF search engine, to process property path query on large scale graph data. In proposed solution, regular expression is partitioned within the path query and then preprocess strings of fixed length. The authors handle the search over those subqueries of wildcards. The proposed method is able to filter lots of unpromising search and efficient on solving the regular path match problem over large scale graph data. The corresponding experiments on DBpedia and LUBM confirm that proposed method can response for queries in seconds on average.

Key words: property path, regular expression, SPARQL, RDF, gStore