The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (2010 vol.22)
pp: 1234-1246
Thomas Bernecker , Ludwig-Maximilians-Universität München, Germany
Hans-Peter Kriegel , Ludwig-Maximilians-Universität München, Germany
Nikos Mamoulis , University of Hong Kong, Hong Kong
Matthias Renz , Ludwig-Maximilians-Universität München, Germany
Andreas Zuefle , Ludwig-Maximilians-Universität München, Germany
ABSTRACT
This paper introduces a scalable approach for probabilistic top-k similarity ranking on uncertain vector data. Each uncertain object is represented by a set of vector instances that is assumed to be mutually exclusive. The objective is to rank the uncertain data according to their distance to a reference object. We propose a framework that incrementally computes for each object instance and ranking position, the probability of the object falling at that ranking position. The resulting rank probability distribution can serve as input for several state-of-the-art probabilistic ranking models. Existing approaches compute this probability distribution by applying the Poisson binomial recurrence technique of quadratic complexity. In this paper, we theoretically as well as experimentally show that our framework reduces this to a linear-time complexity while having the same memory requirements, facilitated by incremental accessing of the uncertain vector instances in increasing order of their distance to the reference object. Furthermore, we show how the output of our method can be used to apply probabilistic top-k ranking for the objects, according to different state-of-the-art definitions. We conduct an experimental evaluation on synthetic and real data, which demonstrates the efficiency of our approach.
INDEX TERMS
Uncertain databases, probabilistic ranking, similarity search.
CITATION
Thomas Bernecker, Hans-Peter Kriegel, Nikos Mamoulis, Matthias Renz, Andreas Zuefle, "Scalable Probabilistic Similarity Ranking in Uncertain Databases", IEEE Transactions on Knowledge & Data Engineering, vol.22, no. 9, pp. 1234-1246, September 2010, doi:10.1109/TKDE.2010.78
REFERENCES
[1] P. Agrawal, O. Benjelloun, A. Das Sarma, C. Hayworth, S. Nabar, T. Sugihara, and J. Widom, "Trio: A System for Data, Uncertainty, and Lineage," Proc. Int'l Conf. Very Large Databases (VLDB '06), 2006.
[2] L. Antova, T. Jansen, C. Koch, and D. Olteanu, "Fast and Simple Relational Processing of Uncertain Data," Proc. 24th Int'l Conf. Data Eng. (ICDE '08), 2008.
[3] O. Benjelloun, A.D. Sarma, A. Halevy, and J. Widom, "ULDBs: Databases with Uncertainty and Lineage," Proc. Int'l Conf. Very Large Databases (VLDB '06), pp. 1249-1264, 2006.
[4] J.L. Bentley and M. Douglas McIlroy, "Engineering a Sort Function," Software—Practice & Experience, vol. 23, pp. 1249-1265, 1993.
[5] T. Bernecker, H.-P. Kriegel, and M. Renz, "Proud: Probabilistic Ranking in Uncertain Databases," Proc. 20th Int'l Conf. Scientific and Statistical Database Management, July 2008.
[6] C. Böhm, A. Pryakhin, and M. Schubert, "Probabilistic Ranking Queries on Gaussians," Proc. Int'l Conf. Scientific and Statistical Database Management, pp. 169-178, 2006.
[7] R. Cheng, D. Kalashnikov, and S. Prabhakar, "Evaluating Probabilistic Queries over Imprecise Data," Proc. ACM SIGMOD, pp. 551-562, 2003.
[8] R. Cheng, S. Singh, and S. Prabhakar, "U-DBMS: A Database System for Managing Constantly-Evolving Data," Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), 2005.
[9] R. Cheng, Y. Xia, S. Prabhakar, R. Shah, and J. Vitter, "Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data," Proc. 30th Int'l Conf. Very Large Databases (VLDB '04), pp. 876-887, 2004.
[10] G. Cormode, F. Li, and K. Yi, "Semantics of Ranking Queries for Probabilistic Data and Expected Results," Proc. 25th Int'l Conf. Data Eng. (ICDE '09), pp. 305-316, Mar./Apr. 2009.
[11] N. Dalvi and D. Suciu, "Efficient Query Evaluation on Probabilistic Databases," The VLDB J., vol. 16, no. 4, pp. 523-544, 2007.
[12] G.R. Hjaltason and H. Samet, "Ranking in Spatial Databases," Proc. Fourth Int'l Symp. Advances in Spatial Databases, M.J. Egenhofer and J.R. Herring, eds., pp. 83-95, 1995.
[13] M. Hua, J. Pei, W. Zhang, and X. Lin, "Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach," Proc. ACM SIGMOD, pp. 673-686, June 2008.
[14] H.-P. Kriegel, P. Kunath, M. Pfeifle, and M. Renz, "Probabilistic Similarity Join on Uncertain Data," Proc. 11th Int'l Conf. Database Systems for Advanced Applications, pp. 295-309, 2006.
[15] H.-P. Kriegel, P. Kunath, and M. Renz, "Probabilistic Nearest-Neighbor Query on Uncertain Objects," Proc. 12th Int'l Conf. Database Systems for Advanced Applications, 2007.
[16] H.-P. Kriegel, M. Renz, M. Schubert, and A. Züfle, "Statistical Density Prediction in Traffic Networks," Proc. Eighth SIAM Conf. Data Mining (SDM '08), 2008.
[17] H.-P. Kriegel, B. Seeger, R. Schneider, and N. Beckmann, "The ${\rm r}^{\ast}$ -Tree: An Efficient Access Method for Geographic Information System," Proc. Int'l Conf. Geographic Information Systems, 1990.
[18] K. Lange, Numerical Analysis for Statisticians. Springer, 1999.
[19] X. Lian and L. Chen, "Probabilistic Ranked Queries in Uncertain Databases," Proc. 11th Int'l Conf. Extending Database Technology (EDBT '08), pp. 511-522, Mar. 2008.
[20] C. Re, N. Dalvi, and D. Suciu, "Efficient Top-K Query Evaluation on Probabilistic Databases," Proc. 23rd Int'l Conf. Data Eng. (ICDE '07), 2007.
[21] P. Sen and A. Deshpande, "Representing and Querying Correlated Tuples in Probabilistic Databases," Proc. 23rd Int'l Conf. Data Eng. (ICDE '07), 2007.
[22] M. Soliman and I. Ilyas, "Ranking with Uncertain Scores," Proc. 25th Int'l Conf. Data Eng. (ICDE '09), pp. 317-328, Mar./Apr. 2009.
[23] M. Soliman, I. Ilyas, and K. Chen-Chuan Chang, "Top-k Query Processing in Uncertain Databases," Proc. 23rd Int'l Conf. Data Eng. (ICDE '07), pp. 896-905, Apr. 2007.
[24] Y. Tao, R. Cheng, X. Xiao, W. Ngai, B. Kao, and S. Prabhakar, "Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions," Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 922-933, 2005.
[25] O. Wolfson, P. Sistla, S. Chamberlain, and Y. Yesha, "Updating and Querying Databases That Track Mobile Units," Distributed and Parallel Databases, vol. 7, no. 3, pp. 257-387, 1999.
[26] K. Yi, F. Li, G. Kollios, and D. Srivastava, "Efficient Processing of Top-K Queries in Uncertain Databases," Proc. 24th Int'l Conf. Data Eng. (ICDE '08), pp. 1406-1408, Apr. 2008.
[27] K. Yi, F. Li, G. Kollios, and D. Srivastava, "Efficient Processing of Top-K Queries in Uncertain Databases with X-Relations," IEEE Trans. Knowledge and Data Eng., vol. 20, no. 12, pp. 1669-1682, Dec. 2008.
[28] M.L. Yiu, N. Mamoulis, X. Dai, Y. Tao, and M. Vaitis, "Efficient Evaluation of Probabilistic Advanced Spatial Queries on Existentially Uncertain Data," IEEE Trans. Knowledge and Data Eng., vol. 21, no. 1, pp. 108-122, Jan. 2009.
[29] X. Zhang and J. Chomicki, "On the Semantics and Evaluation of Top-K Queries in Probabilistic Databases," Proc. 24th Int'l Conf. Data Eng. Workshops (ICDE '08), pp. 556-563, Apr. 2008.
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool