In many cases, users are not familiar with their exact information needs while searching complicated data sources. This lack of understanding may cause the users to feel dissatisfaction when the system retrieves insufficient results after they issue queries. However, using their original query results, we may recommend additional queries which are highly relevant to the original query. This paper presents XPloreRank to recommend top-l highly relevant keyword queries called “You May Also Like” (YMAL) queries to the users in XML keyword search. To generate such queries, we firstly analyze the original keyword query results content and construct a weighted co-occurring keyword graph. Then, we generate the YMAL queries by traversing the co-occu...
Achieving the effectiveness in relation to the relevance of query result is the most crucial part of...
Ranking and coming back probably the most relevant outcomes of a question have grown to be typically...
Users are usually not familiar with the content and structure of the data when they explore the data...
Submission note: A thesis submitted in total fulfilment of the requirements for the degree of Doctor...
Keyword search enables inexperienced users to easily search XML database with no specific knowledge ...
Keyword search enables inexperienced users to easily search XML database with no specific knowledge ...
The extreme success of web search engines makes keyword search the most popular search model for ord...
We study the spelling suggestion problem for keyword search over an XML document, which provides use...
The popularity of XML has exacerbated the need for an easy-to-use, high precision query interface fo...
Keyword search enables web users to easily access XML data without understanding the complex data sc...
Recently, keyword search has attracted a great deal of attention in XML database. It is hard to dire...
Abstract. This paper addresses an open problem of keyword search in XML trees: given relevant matche...
Keyword search in XML documents is based on the notion of lowest common ancestors in the labeled tre...
Keyword search is a user-friendly way to query XML databases. Most previous efforts in this area foc...
We present XKMis, a system for keyword search in xml documents. Unlike previous work, our method is ...
Achieving the effectiveness in relation to the relevance of query result is the most crucial part of...
Ranking and coming back probably the most relevant outcomes of a question have grown to be typically...
Users are usually not familiar with the content and structure of the data when they explore the data...
Submission note: A thesis submitted in total fulfilment of the requirements for the degree of Doctor...
Keyword search enables inexperienced users to easily search XML database with no specific knowledge ...
Keyword search enables inexperienced users to easily search XML database with no specific knowledge ...
The extreme success of web search engines makes keyword search the most popular search model for ord...
We study the spelling suggestion problem for keyword search over an XML document, which provides use...
The popularity of XML has exacerbated the need for an easy-to-use, high precision query interface fo...
Keyword search enables web users to easily access XML data without understanding the complex data sc...
Recently, keyword search has attracted a great deal of attention in XML database. It is hard to dire...
Abstract. This paper addresses an open problem of keyword search in XML trees: given relevant matche...
Keyword search in XML documents is based on the notion of lowest common ancestors in the labeled tre...
Keyword search is a user-friendly way to query XML databases. Most previous efforts in this area foc...
We present XKMis, a system for keyword search in xml documents. Unlike previous work, our method is ...
Achieving the effectiveness in relation to the relevance of query result is the most crucial part of...
Ranking and coming back probably the most relevant outcomes of a question have grown to be typically...
Users are usually not familiar with the content and structure of the data when they explore the data...