Shuo Han's paper (Keyword Search on RDF Graphs — A Query Graph Assembly Approach) is accepted by CIKM 2017.

Keyword search provides ordinary users an easy-to-use interface for querying RDF data. In this paper, we study how to assemble a query graph that is to represent user’s query intention accurately and efficiently. Based on the input keywords, we first obtain the elementary query graph building blocks, such as entity/class vertices and predicate edges. Then, we formally define the query graph assembly (QGA) problem. Although we prove theoretically that QGA is a NP-complete problem,we design some heuristic lower bounds and propose a bipartite graph matching-based best-first search algorithm. The algorithm’s time complexity does not depend on the RDF graph size, which guarantees the good scalability of our system in large RDF graphs.