gStore Answering SPARQL Queries via Subgraph gstore回答SPARQL查询通过子图.pptVIP

VS-tree Solution 0000 1000 1000 0000 10000 001 X 002 VS-tree Solution-limitations 0000 1000 1000 0000 10000 If this level is dense, many summary matches = More search space Process each level step by step Possible Optimization Methods “magically” know which level to begin with to minimize the number of summary matches Use DFS(Depth First Search) to find the valid child nodes While inserting vertices, consider not only the hamming distance but also the number of super edges introduced Optimization example Experimental results-Exact queries Queries Yago network (20 million triples size