In this paper, we discuss how to present the result of searching elements of any type from XML documents relevant to some information need (relevance-oriented search). As the resulting elements can contain each other, we show an intuitive way of organizing the resulting list of elements in several ranked lists at different levels, such that each element is presented only one time. Depending on the size of such ranked lists, its presentation is given by a structure tree, for small lists, or by a sequence of pointers, for large lists. In both cases, the textual content of the implied elements is given. We also analyse the size of ranked lists in a real collection of XML documents. Categories and Subject Descriptor
Abstract. When querying XML collections, users cannot always ex-press their need in a precise way. S...
In this paper, we study the use of XML tagged keywords (or simply key-tags) to search an XML fragmen...
Extensible Markup Language (XML) is a simple text format which was designed to describe data using c...
Abstract. XML query languages proposed so far are limited to Boolean retrieval in the sense that que...
Abstract. Conventional ranking methods for document search have considered content of documents to r...
Query languages for XML such as XPath or XQuery support Boolean retrieval: a query result is a (poss...
XML query languages proposed so far are limited to Boolean retrieval in the sense that query results...
The evolution of computing technology suggests that it has become more feasible to offer access to W...
Keyword search is widely recognized as a convenient way to retrieve information from XML data. In or...
We propose and evaluate a method for obtaining more accu-rate search results in an extensible markup...
International audienceInformation retrieval encounters a migration from the traditional paradigm (re...
Query languages for XML such as XPath or XQuery support Boolean retrieval: a query result is a (pos...
The evolution of computing technology suggests that it has become more feasible to offer access to W...
Keyword search is a user-friendly way to query XML databases. Most previous efforts in this area foc...
In this paper, we demonstrate an effective ranked XML keyword search with meaningful result display....
Abstract. When querying XML collections, users cannot always ex-press their need in a precise way. S...
In this paper, we study the use of XML tagged keywords (or simply key-tags) to search an XML fragmen...
Extensible Markup Language (XML) is a simple text format which was designed to describe data using c...
Abstract. XML query languages proposed so far are limited to Boolean retrieval in the sense that que...
Abstract. Conventional ranking methods for document search have considered content of documents to r...
Query languages for XML such as XPath or XQuery support Boolean retrieval: a query result is a (poss...
XML query languages proposed so far are limited to Boolean retrieval in the sense that query results...
The evolution of computing technology suggests that it has become more feasible to offer access to W...
Keyword search is widely recognized as a convenient way to retrieve information from XML data. In or...
We propose and evaluate a method for obtaining more accu-rate search results in an extensible markup...
International audienceInformation retrieval encounters a migration from the traditional paradigm (re...
Query languages for XML such as XPath or XQuery support Boolean retrieval: a query result is a (pos...
The evolution of computing technology suggests that it has become more feasible to offer access to W...
Keyword search is a user-friendly way to query XML databases. Most previous efforts in this area foc...
In this paper, we demonstrate an effective ranked XML keyword search with meaningful result display....
Abstract. When querying XML collections, users cannot always ex-press their need in a precise way. S...
In this paper, we study the use of XML tagged keywords (or simply key-tags) to search an XML fragmen...
Extensible Markup Language (XML) is a simple text format which was designed to describe data using c...