.png){kind=icon}
返回
Ranking distributed database in tuple-level uncertainty
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-014-1306-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Ranking in uncertain database environments has gained a great importance recently. Many techniques were introduced to rank uncertain databases and others to rank distributed certain databases. Unfortunately, there are not that much techniques in ranking distributed uncertain databases. This paper proposes a framework that improves ranking processing in the case of uncertain and distributed database. In the proposed framework, new communication and computation-efficient algorithms are investigated for retrieving the top-k tuples from distributed sites. These algorithms are applied in tuple-level uncertainty. The main concern of the proposed algorithms is to reduce the communication rounds utilized and amount of data transmitted while achieving efficient ranking. Experimental results emphasize that both proposed algorithms have a great impact on reducing communication cost. Also, the results clarify that the first algorithm is efficient in the case of a low number of sites while the second achieves better performance in the context of a higher number of sites.
Keyword:
Uncertainty
Distributed databases
Database applications
Top-k query
Ranking
Threshold
Tuple-level
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
.png){kind=icon}
Error correction and statistical analyses for intra-host comparisons of feline immunodeficiency virus diversity from high-throughput sequencing data错误校正和统计分析，用于高通量测序数据中猫免疫缺陷病毒多样性的宿主内比较
OAAI
OAAI分享收藏
Transient Liquid Crystal Measurement of Local Heat Transfer on a Rotating Disk With Jet Impingement
PREAI
分享收藏
查看更多内容