\input zb-basic
\input zb-ioport
\iteman{io-port 05774354}
\itemau{Xu, Chuanfei; Wang, Yanqiu; Lin, Shukuan; Gu, Yu; Qiao, Jianzhong}
\itemti{Efficient fuzzy top-$k$ query processing over uncertain objects.}
\itemso{Bringas, Pablo Garc{\'\i}a (ed.) et al., Database and expert systems applications. 21st international conference, DEXA 2010, Bilbao, Spain, August 30 -- September 3, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15363-1/pbk). Lecture Notes in Computer Science 6261, 167-182 (2010).}
\itemab
Summary: Recently, many application domains, such as sensor network monitoring and Location-Based Service, raise the issue of uncertain data management. Uncertain objects, a kind of uncertain data, have some uncertain attributes whose values are ranges instead of points. In this paper, we study a new kind of top-$k$ queries, Probabilistic Fuzzy Top-k queries (PF-Topk queries) which can return $k$ results from uncertain objects for fuzzy query conditions. We formally define the problem of PF-Topk query and present a framework for answering this kind of queries. We propose an exact algorithm, Envelope Planes of Membership Function (EPMF) algorithm based on the upper and lower bounding functions, which answers fuzzy top-$k$ queries over uncertain objects in high-dimensional query space efficiently. We also propose an approximate algorithm which improves efficiency while ensuring high precision by setting a proper value of parameter. To reduce the search space, a pruning method is proposed to safely prune some objects before querying. The effectiveness and efficiency of our algorithms is demonstrated by the theoretical analysis and experiments with synthetic and real datasets.
\itemrv{~}
\itemcc{}
\itemut{}
\itemli{doi:10.1007/978-3-642-15364-8\_12}
\end