Sciweavers

306 search results - page 1 / 62
» Probabilistic ranking for relational databases based on corr...
Sort
View
CIKM
2010
Springer
13 years 2 months ago
Probabilistic ranking for relational databases based on correlations
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
Jaehui Park, Sang-goo Lee
EDBT
2010
ACM
135views Database» more  EDBT 2010»
13 years 8 months ago
Probabilistic ranking over relations
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin
DEXA
2010
Springer
172views Database» more  DEXA 2010»
13 years 5 months ago
Ranking Objects Based on Attribute Value Correlation
There has been a great deal of interest in recent years on ranking query results in relational databases. This paper presents a novel method to rank objects (e.g., tuples) by explo...
Jaehui Park, Sang-goo Lee
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 6 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
VLDB
2004
ACM
129views Database» more  VLDB 2004»
13 years 10 months ago
Probabilistic Ranking of Database Query Results
We investigate the problem of ranking answers to a database query when many tuples are returned. We adapt and apply principles of probabilistic models from Information Retrieval f...
Surajit Chaudhuri, Gautam Das, Vagelis Hristidis, ...