A generic ontology framework for indexing keyword search on massive graphs

Abstract

Due to the unstructuredness and the lack of schema information of knowledge graphs, social networks and RDF graphs, keyword search has been proposed for querying such graphs/networks. Recently, various keyword search semantics have been designed. In this paper, we propose a generic ontology-based indexing framework for keyword search, called Bisimulation of Generalized Graph Index (BiG-index), to enhance the search performance. The novelties of BiG-index reside in using an ontology graph G(Ont) to summarize and index a data graph G iteratively, to form a hierarchical index structure G. BiG-index is generic since it only requires keyword search algorithms to generate query answers from summary graphs having two simple properties. Regarding query evaluation, we transform a keyword search q into Q according to G(Ont) in runtime. The transformed query is searched on the summary graphs in G. The efficiency is due to the small sizes of the summary graphs and the early pruning of semantically irrelevant subgraphs. To illustrate BiG-index's applicability, we show popular indexing techniques for keyword search (e.g., Blinks and r-clique) can be easily implemented on top of BiG-index. Our extensive experiments show that BiG-index reduced the runtimes of popular keyword search work Blinks by 50.5 percent and r-clique by 29.5 percent.