Probabilistic nearest neighbor query processing on distributed uncertain data |
| |
Authors: | Daichi Amagata Yuya Sasaki Takahiro Hara Shojiro Nishio |
| |
Affiliation: | 1.Department of Multimedia Engineering Graduate School of Information Science and Technology Osaka University,Suita,Japan;2.Department of Systems and Social Informatics,Graduate School of Information Science Nagoya University,Nagoya,Japan |
| |
Abstract: | A nearest neighbor (NN) query, which returns the most similar object to a user-specified query object, plays an important role in a wide range of applications and hence has received considerable attention. In many such applications, e.g., sensor data collection and location-based services, objects are inherently uncertain. Furthermore, due to the ever increasing generation of massive datasets, the importance of distributed databases, which deal with such data objects, has been growing. One emerging challenge is to efficiently process probabilistic NN queries over distributed uncertain databases. The straightforward approach, that each local site forwards its own database to the central server, is communication-expensive, so we have to minimize communication cost for the NN object retrieval. In this paper, we focus on two important queries, namely top-k probable NN queries and probabilistic star queries, and propose efficient algorithms to process them over distributed uncertain databases. Extensive experiments on both real and synthetic data have demonstrated that our algorithms significantly reduce communication cost. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|