Algorithm for answer graph construction for keyword queries on RDF data
Kanniyappan Parthasarathy, Sreenivasa Kumar P., Dominic Damien · 2011
RDF and RDFS have recently become very popular as frameworks for representing data and meta-data in form of a domain description, respectively. RDF data can also be thought of as graph data. In this paper, we focus on keywordbased querying of RDF data represented as a graph. Existing approaches for answering such keyword queries, identies connected trees with minimal cost in the labeled graph as answers. In this paper we present an elegant algorithm for keyword query processing on RDF data that not only identies trees but also more meaningful graph structures including cycles. The approach adopts a pruned exploration mechanism where closely related nodes are identied, sub-graphs are pruned and joined using suitable hook nodes. The system also exploits Type/SubClassOf relationship during the construction of the answer graph. The working of the algorithm is illustrated using a fragment of AIFB institute data represented as an RDF graph.