Sciweavers

386 search results - page 12 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
VLDB
2007
ACM
118views Database» more  VLDB 2007»
14 years 9 months ago
Materialized Views in Probabilistic Databases for Information Exchange and Query Optimization
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...
Christopher Re, Dan Suciu
DOCENG
2004
ACM
14 years 2 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...
WWW
2011
ACM
13 years 3 months ago
Search result diversity for informational queries
Ambiguous queries constitute a significant fraction of search instances and pose real challenges to web search engines. With current approaches the top results for these queries ...
Michael J. Welch, Junghoo Cho, Christopher Olston
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 3 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 1 months 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...