Combining N-gram retrieval with weights propagation on massive RDF graphs
Hu He, Xiaoyong Du · 2012
N-gram approach takes the position information into account additionally and thus can offer higher accuracy in query answering than keyword based approaches and is widely used in IR and NLP. However, in large-scale RDF graphs, URIs instead of documents are the ranking and querying units; URIs are usually much shorter than documents, and different URIs are interlinked into a massive network. One shot n-gram querying is usually not good for the RDF data in many cases. In this paper, we present a hybrid framework which combines the n-gram retrieval with link analysis based weight propagation. The idea is to exploit the link structures in the RDF data graphs and propagate the one shot n-gram score weights along with these links. Large scale experiments using MapReduce on Billion Triples Challenge dataset show the hybrid framework achieves an 80.3% improvement in relevance scores over mere n-gram retrieval.