Superseding nearest neighbor search on uncertain spatial databases

IEEE Transactions on Knowledge and Data Engineering

Volumn 22, Issue 7, 2010, Pages 1041-1055

  Yuen, Sze Man ^a   Tao, Yufei ^a   Xiao, Xiaokui ^b   Pei, Jian ^c   Zhang, Donghui ^d  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c SIMON FRASER UNIVERSITY   (Canada)

^d Northeastern University   (United States)

Author keywords

Nearest neighbor; Spatial database; Uncertain

Indexed keywords

MULTIDIMENSIONAL INDEX; NEAREST NEIGHBOR SEARCH; NEAREST NEIGHBORS; NON-ZERO PROBABILITY; QUERY POINTS; SPATIAL DATABASE;

QUERY LANGUAGES;

PROBABILITY DENSITY FUNCTION;

EID: 77952908455     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2009.137     Document Type: Article

References (20)

1. *- Tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD, pp. 322-331, 1990.
2. G. Beskales, M. A. Soliman, and I. F. Ilyas, "Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases," Proc. Very Large Data Bases (VLDB), vol. 1, no. 1, pp. 326-339, 2008.
3. C. Bohm, A. Pryakhin, and M. Schubert, "The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors," Proc. Int'l Conf. Data Eng. (ICDE), 2006.
4. R. Cheng, J. Chen, M. F. Mokbel, and C.-Y. Chow, "Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data," Proc. Int'l Conf. Data Eng. (ICDE), pp. 973-982, 2008.
5. R. Cheng, D. V. Kalashnikov, and S. Prabhakar, "Querying Imprecise Data in Moving Object Environments," IEEE Trans. Knowledge and Data Eng., vol. 16, no. 9, pp. 1112-1127, Sept. 2004.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms. MIT Press, 2001.
7. X. Dai, M. L. Yiu, N. Mamoulis, Y. Tao, and M. Vaitis, "Probabilistic Spatial Queries on Existentially Uncertain Data," Proc. Symp. Advances in Spatial and Temporal Databases (SSTD), pp. 400-417, 2005.
8. G. R. Hjaltason and H. Samet, "Distance Browsing in Spatial Databases," ACM Trans. Database Systems, vol. 24, no. 2, pp. 265-318, 1999.
9. M. Hua, J. Pei, W. Zhang, and X. Lin, "Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach," Proc. ACM SIGMOD, pp. 673-686, 2008.
10. +-Tree Based Indexing Method for Nearest Neighbor Search," ACM Trans. Database Systems, vol. 30, no. 2, pp. 364-397, 2005.
11. F. Korn and S. Muthukrishnan, "Influence Sets Based on Reverse Nearest Neighbor Queries," Proc. ACM SIGMOD, pp. 201-212, 2000.
12. H.-P. Kriegel, P. Kunath, and M. Renz, "Probabilistic Nearest-Neighbor Query on Uncertain Objects," Proc. Database Systems for Advanced Applications (DASFAA), pp. 337-348, 2007.
13. D. Papadias, Y. Tao, K. Mouratidis, and C. K. Hui, "Aggregate Nearest Neighbor Queries in Spatial Databases," ACM Trans. Database Systems, vol. 30, no. 2, pp. 529-576, 2005. (Pubitemid 41204998)
14. J. Pei, B. Jiang, X. Lin, and Y. Yuan, "Probabilistic Skylines on Uncertain Data," Proc. Very Large Data Bases (VLDB), pp. 15-26, 2007.
15. N. Roussopoulos, S. Kelley, and F. Vincent, "Nearest Neighbor Queries," Proc. ACM SIGMOD, pp. 71-79, 1995.
16. T. Seidl and H.-P. Kriegel, "Optimal Multi-Step k-Nearest Neighbor Search," Proc. ACM SIGMOD, vol. 27, no. 2, pp. 154-165, 1998.
17. M. A. Soliman, I. F. Ilyas, and K. C.-C. Chang, "Top-k Query Processing in Uncertain Databases," Proc. Int'l Conf. Data Eng. (ICDE), pp. 896-905, 2007.
18. Y. Tao, D. Papadias, and Q. Shen, "Continuous Nearest Neighbor Search," Proc. Very Large Data Bases (VLDB), pp. 287-298, 2002.
19. R. Weber, H.-J. Schek, and S. Blott, "A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces," Proc. Very Large Data Bases (VLDB), pp. 194-205, 1998.
20. K. Yi, F. Li, G. Kollios, and D. Srivastava, "Efficient Processing of Top-k Queries in Uncertain Databases," Proc. Int'l Conf. Data Eng. (ICDE), pp. 1406-1408, 2008.