Open Access Open Access  Restricted Access Subscription or Fee Access

Hierarchy Query Result Based Navigation

Dr.G. Jagajothi, M. Uma Maheswari, D. Indhu, D. Sathiya, P. Sundari


Search queries on biomedical databases, such as PubMed, often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization, which can also be combined, have been proposed to alleviate this information overload problem. Results categorization for biomedical databases is the focus of this work. A natural way to organize biomedical citations is according to their MeSH annotations. MeSH is a comprehensive concept hierarchy used by PubMed. In this paper, we present the BioNav system, a novel search interface that enables the user to navigate large number of query results by organizing them using the MeSH concept hierarchy. First, the query results are organized into a navigation tree. At each node expansion step, BioNav reveals only a small subset of the concept nodes, selected such that the expected user navigation cost is minimized.


Interactive Data Exploration and Discovery, Search Process, Graphical User Interfaces, Interaction Styles.

Full Text:



J.S. Agrawal, S. Chaudhuri, G. Das, and A. Gionis, “Automated Ranking of Database Query Results,” Proc. First Biennial Conf. Innovative Data Systems Research, 2003.

K. Chakrabarti, S. Chaudhuri, and S.W. Hwang, “Automatic Categorization of Query Results,” Proc. ACM SIGMOD, pp. 755- 766, 2004.

Z. Chen and T. Li, “Addressing Diverse User Preferences in SQL- Query-Result Navigation,” Proc. ACM SIGMOD, pp. 641-652, 2007.

L. Comtet, Advanced Combinatorics: The Art of Finite and Infinite Expansions, pp. 176-177, Reidel, 1974.

R. Delfs, A. Doms, A. Kozlenkov, and M. Schroeder, “GoPubMed: Ontology-Based Literature Search Applied to Gene Ontology and PubMed,” Proc. German Conf. Bioinformatics, pp. 169-178, 2004.

D. Demner-Fushman and J. Lin, “Answer Extraction, Semantic Clustering, and Extractive Summarization for Clinical Question Answering,” Proc. Int’l Conf. Computational Linguistics and Ann. Meeting of the Assoc. for Computational Linguistics, pp. 841-848, 2006.

Entrez Programming Utilities, entrez/query/static/eutils_help.html, 2008.

U. Feige, D. Peleg, and G. Kortsarz, “The Dense k-Subgraph Problem,” Algorithmica, vol. 29, pp. 410-421, 2001.

V. Hristidis and Y. Papakonstantinou, “DISCOVER: Keyword Search in Relational Databases,” Proc. Int’l Conf. Very Large Data Bases (VLDB), 2002.

R. Hoffman and A. Valencia, “A Gene Network for Navigating the Literature,” Nature Genetics, vol. 36, no. 7, p. 664, 2004.

iHOP—Information Hyperlinked over Protein,, 2008.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.