Efficient Query Result Navigation Using Top Down Navigation Model

Search queries on databases, and often it return a large number of results, only a small subset of result are relevant to the user. Ranking and categorization, which can also be combined, have been proposed to alleviate this information overload problem. Results categorization for databases is the focus of this work. In this paper, we present the system is a novel search interface that enables the user to navigate large number of query results by organizing them using the concept hierarchy. First, the query results are organized navigation tree. Inside the navigation tree edge cut operation is performed. The query results returns the two set of results that is relevant to the user and ignore results. At each node expansion step, this system of results reveals only a small subset of the concept nodes, selected such that the expected user navigation cost is minimized. In contrast, previous works expand the hierarchy in a predefined static manner, without navigation cost modelling. We show that the problem of selecting the best concepts to reveal at each node expansion and propose an efficient heuristic as well as a feasible optimal algorithm for relatively small trees.