Supporting Various Top-k Queries over Uncertain Datasets

There have been many researches and semantics in answering top-k queries on uncertain data in various applications. However, most of these semantics must consume much of their time in computing position probability. Our approach to support various top-k queries is based on position probability distr...

Full description

Saved in:
Bibliographic Details
Published in:Wuhan University journal of natural sciences 2014-02, Vol.19 (1), p.84-92
Main Authors: Li, Wenfeng, Fu, Zufa, Wang, Liwei, Li, Deyi, Peng, Zhiyong
Format: Article
Language:English
Subjects:
Approximation
Biomedical and Life Sciences
Computer Science
Computing time
Consumption
Life Sciences
Materials Science
Mathematical analysis
Probability distribution
Queries
Semantics
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:There have been many researches and semantics in answering top-k queries on uncertain data in various applications. However, most of these semantics must consume much of their time in computing position probability. Our approach to support various top-k queries is based on position probability distribution （PPD） sharing. In this paper, a PPD-tree structure and several basic operations on it are proposed to support various top-k queries. In addition, we proposed an approximation method to improve the efficiency of PPD generation. We also verify the effectiveness and efficiency of our approach by both theoretical analysis and experiments.
ISSN:1007-1202
1993-4998
DOI:10.1007/s11859-014-0983-7