code for effective navigation of query results
#1

Good evening to all,I need to know about Technologies and Frameworks used for developing Effective Navigation of Query results based on concept Hierarchies.
Could u please send me those Technologies .

Thanking u.

Reply
#2

code for effective navigation of query results

Abstract:
This project presents 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. This project implements dynamic results categorization and ranking. This shows experimentally that BioNav outperforms state-of-the-art categorization systems with respect to the user navigation cost. 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. In contrast, previous works expand the hierarchy in a predefined static manner, without navigation cost modeling. We show that the problem of selecting the best concepts to reveal at each node expansion is NP-complete and propose an efficient heuristic as well as a feasible optimal algorithm for relatively small trees. We show experimentally that BioNav outperforms state-of-the-art categorization systems with respect to the user navigation cost.

Aim & Objective
• To propose 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.
• To propose an efficient heuristic as well as a feasible optimal algorithm for relatively small trees.
• To implement the BioNav system for the medicine database.

Problem Statement
A comprehensive framework is used for navigating large query results using extensive concept hierarchies. A complexity result proving that expanding the tree in a way that minimizes the user’s navigation cost is an NP-complete problem.

Contribution
The proposals dynamically categorize SQL query results by inferring a hierarchy based on the characteristics of the result tuples. Their domain is the tuple attributes and their problem is how to organize them hierarchically in order to minimize the navigation cost. They also decide the value ranges for each attribute, for both categorical and numerical ones, and how to rank them. BioNav is distinct since it offers dynamic navigation on a predefined hierarchy, as is the MeSH concept hierarchy. Hence, BioNav is complementary to these systems, since it can be used to optimize the navigation, after these systems construct the navigation tree.

EXISTING SYSTEM:

Existing search operation Information overload is a major problem when searching
Biomedical databases such as PubMed, where typically a large number of citations are returned, of which only a small subset is relevant to the user.

PROPOSED SYSTEM:

The proposals dynamically categorize SQL query results by inferring a hierarchy based on the characteristics of the result tuples. Their domain is the tuple attributes and their problem is how to organize them hierarchically in order to minimize the navigation cost. They also decide the value ranges for each attribute, for both categorical and numerical ones, and how to rank them. One of the systems takes into consideration the user’s preferences during the inference for a more personalized experience. Once the hierarchy is inferred, they follow a static navigation method. BioNav is distinct since it offers dynamic navigation on a predefined hierarchy, as is the MeSH concept hierarchy. Hence, BioNav is complementary to these systems, since it can be used to optimize the navigation, after these systems construct the navigation tree.

HARDWARE REQUIREMENTS:

v Processor - Pentium –IV 2GHz
v RAM - 512 MB (min)

v Hard Disk - 20 GB

v Floppy Drive - 1.44 MB

v Key Board - Standard Windows Keyboard

v Mouse - Two or Three Button Mouse

v Monitor - VGA


SOFTWARE REQUIREMENTS:


v Operating System : Windows XP

v Application Server : Tomcat5.0/6.X

v Front End : J2EE-(HTML, Java, Jsp, Servlet )

v Scripts : JavaScript.

v Development tool : Net beans 6.0.1

v Build tool : Ant

v Server side Script : Java Server Pages.

v Database : MsAccess

v Database Connectivity : JDBC.


MODULES:


BIOMEDICAL SEARCH SYSTEMS:

PubMed– using a keyword search interface. Currently, in an exploratory scenario where the user tries to find citations relevant to her line of research and hence not known a priori, she submits an initially broad keyword- based query that typically returns a large number of results. Subsequently, the user iteratively refines the query, if she has an idea of how to, by adding more keywords, and re-submits it, until a relatively small number of results are returned. This refinement process is problematic because after a number of iterations the user is not aware if she has over-specified the query, in which case relevant citations might be excluded from the final query result.
Query on PubMed is using the MeSH static concept hierarchy, thus utilizing the initiative of the US National Library of Medicine (NLM) to build and maintain such a comprehensive structure. Each citation in MEDLINE is associated with several MeSH concepts in two ways: (i) by being explicitly annotated with them, and (ii) by mentioning those in their text. Since these associations are provided by PubMed, a relatively straightforward interface to navigate the query result would first attach the citations to the corresponding MeSH concept nodes and then let the user navigate the navigation tree

DYNAMIC NAVIGATION TREE:

Navigation tree Fig displays a snapshot of such an interface where shown next to each node label is the count of distinct citations in the sub tree rooted at that node. A typical navigation starts by revealing the children of the root ranked by their citation count, and is continued by the user expanding on or more of them, revealing their ranked children and so on, until she clicks on a concept and inspects the citations attached to it. A similar interface and navigation method is used by e-commerce sites, such as Amazon and eBay. For this example, we assume that the user will navigate to the three indicated concepts corresponding to three independent lines of research related to prothymosin.






BioNav introduces a dynamic navigation method that depends on the particular query result at hand and is demonstrated in Fig The query results are attached to the corresponding MeSH concept nodes as in Fig. but then the navigation proceeds differently. The key action on the interface is the expansion of a node that selectively reveals a ranked list of descendant (not necessarily children) concepts, instead of simply showing all its children.



HIERARCHY NAVIGATION WEB (INTERFACE) SEARCH:





BioNav belongs primarily to the categorization class, which is ideal for this domain given the rich concept hierarchies (e.g., MeSH ) available for biomedical data. We augment our categorization techniques with simple ranking techniques. BioNav organizes the query results into a dynamic hierarchy, the navigation tree. Each concept (node) of the hierarchy has a descriptive label. The user then navigates this tree structure, in a top-down fashion, exploring the concepts of interest while ignoring the rest.



QUERY WORKLOAD ONLINE OPERATION:

On-Line Operation Upon receiving a keyword query from the user, BioNav executes the same query against the MEDLINE database and retrieves only the IDs (Pub Med Identifiers) of the citations in the query result. This is done using the ESearch utility of the Entrez Programming Utilities (eUtils) . eUtils are a collection of web interfaces to PubMed for issuing a query and downloading the results with various levels of detail and in a variety of formats. Next, the navigation tree is constructed by retrieving the MeSH concepts associated with each citation in the query result from the BioNav database. This is possible since MeSH concepts have tree identifiers encoding their location in the MeSH hierarchy, which are also retrieved from the BioNav database. This process is done once for each user query.

To get full information or details of code for effective navigation of query results please have a look on the pages

http://ijarcssedocs/papers/Volume_3/4_April2013/V3I4-0102.pdf

if you again feel trouble on code for effective navigation of query results please reply in that page and ask specific fields in code for effective navigation of query results
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Popular Searches: categorization, effective navigation of query results based on concept hierarchies ppt, effective navigation of query results based on concept hierarchiesproject sourcecode, efficient navigation of query result based on concept hierarchs ppt, effective navigation of query results based on concept hierarchies abstract, effective navigation of query results based on concept hierarchies seminar, effective navigation of query results based on concept hierarchies,

[-]
Quick Reply
Message
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  mon sagar laxmi weekly lottery results 7 13,575 30-04-2018, 08:08 PM
Last Post: Guest
  labh laxmi lottery today 4pm results 3 8,038 24-11-2017, 10:22 AM
Last Post: jaseela123d
  nmms results 2011 12 andhra pradesh 2 6,455 28-10-2017, 03:07 PM
Last Post: Jaganmerugu10@Gmail. Com
  matlab code for adaptive differential pulse code modulation 1 1,133 04-04-2017, 11:49 AM
Last Post: jaseela123d
  maharastra gorav lottery results 4r today 1 1,050 31-03-2017, 11:03 AM
Last Post: jaseela123d
  www rguhs ygentechnology com results 2014 1 795 29-03-2017, 03:30 PM
Last Post: jaseela123d
Wink how to calculate winning lottery numbers from labh laxmi previous lottery results 1 1,463 28-03-2017, 10:21 AM
Last Post: jaseela123d
  priya biscuits maha dhamaka 2015 results 1 1,115 27-03-2017, 11:23 AM
Last Post: jaseela123d
  maharashtra state lottery results maharashtra surabhi 1 3,452 25-03-2017, 01:10 PM
Last Post: jaseela123d
  december 10 vijay karnataka deepotsava lucky draw results 1 1,219 24-03-2017, 12:52 PM
Last Post: jaseela123d

Forum Jump: