NOVEL NODE IMPORTANCE MEASURES TO IMPROVE KEYWORD SEARCH OVER RDF GRAPHS
Elisa Menendez · 2019
A key contributor to the success of keyword search systems is a ranking mechanism that considers the importance of the retrieved documents.The notion of importance in graphs is typically computed using centrality measures that highly depend on the degree of the nodes, such as PageRank.However, in RDF graphs, the notion of importance is not necessarily related to the node degree.Therefore, this thesis addresses two problems: (1) how to define importance measures for RDF graphs; (2) how to use these measures to help compile and rank results of keyword queries over RDF graphs.To solve these problems, the thesis proposes a novel family of measures, called InfoRank, and a keyword search system, called QUIRA, for RDF graphs.Finally, this thesis concludes with experiments showing that the proposed solution improves the quality of the results in two keyword search benchmarks.