Sciweavers

370 search results - page 7 / 74
» Automated Ranking of Database Query Results
Sort
View
DOCENG
2004
ACM
14 years 1 months ago
Presenting the results of relevance-oriented search over XML documents
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 resu...
Alda Lopes Gançarski, Pedro Rangel Henrique...
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 1 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
FQAS
2009
Springer
142views Database» more  FQAS 2009»
14 years 10 days ago
On the Selection of the Best Retrieval Result Per Query - An Alternative Approach to Data Fusion
Some recent works have shown that the “perfect” selection of the best IR system per query could lead to a significant improvement on the retrieval performance. Motivated by thi...
Antonio Juárez-González, Manuel Mont...
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
14 years 7 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
14 years 7 months ago
Supporting ad-hoc ranking aggregates
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas