386 search results - page 9 / 78 » Probabilistic Ranking of Database Query Results |
ICDE
2010
IEEE
14 years 1 months ago
2010
IEEE
Mashups are situational applications that build data flows to link the contents of multiple Web sources. Often times, ranking the results of a mashup is handled in a materializethe...
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
PVLDB
2010
13 years 7 months ago
2010
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
SSD
2005
Springer
14 years 2 months ago
2005
Springer
We study the problem of answering spatial queries in databases where objects exist with some uncertainty and they are associated with an existential probability. The goal of a thre...
ICDE
2009
IEEE
14 years 3 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...