Efficient search for the top-k probable nearest neighbors in uncertain databases

Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor data management, deal with different kinds of uncertainty. Finding the nearest neighbor objects to a given query point is an important query type in these applications. In this paper, we study the problem of finding objects with the highest marginal probability of being the nearest neighbors to a query object. We adopt a general uncertainty model allowing for data and query uncertainty. Under this model, we define new query semantics, and provide several efficient evaluation algorithms. We analyze the cost factors involved in query evaluation, and present novel techniques to address the trade-offs among these factors. We give multiple extensions to our techniques including handling dependencies among data objects, and answering threshold queries. We conduct an extensive experimental study to evaluate our tec...

• Type: Journal
• Year: 2008
• Where: PVLDB
• Authors: George Beskales, Mohamed A. Soliman, Ihab F. Ilyas
• Keywords: Important Query Type, Nearest Neighbors, PVLDB 2008, Query Uncertainty