Abstract
Large databases with uncertainty became more common in many applications.In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is modeled by probability distributions instead of exact feature values and that are assumed to be mutually-exclusive. A typical application of such an uncertainty model are moving objects where the exact position of each object can be determined only at discrete time intervals. The objective is to rank the uncertain data according to their distance to a reference object.In the existing system, a framework is used for efficient computation of probabilistic similarity ranking queries in uncertain vector databases, each object is ranked in object instance wise and it is clustered and again ranking to the objects is performed, which results in log-linear i.e, O(nlogn). In this paper, we propose the Radix algorithm in order to increase the performance to O(n).we theoretically as well as experimentally show that it 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bernecker, T., Kriegel, H.-P., Mamoulis, N., Renz, M., Zuefle, A.: Scalable Probabilistic Similarity Ranking in Uncertain Databases (September 2010)
Bernecker, T., Kriegel, H.-P., Renz, M.: ProUD: Probabilistic Ranking in Uncertain Databases. In: Ludäscher, B., Mamoulis, N. (eds.) SSDBM 2008. LNCS, vol. 5069, pp. 558–565. Springer, Heidelberg (2008)
Soliman, M., Ilyas, I., Chen-Chuan Chang, K.: Top-k Query Processing in Uncertain Databases. In: Proc. 23rd Int’l Conf. Data Eng. (ICDE 2007), pp. 896–905 (April 2007)
Yi, K., Li, F., Kollios, G., Srivastava, D.: Efficient Processing of Top-K Queries in Uncertain Databases. In: Proc. 24th Int’l Conf. Data Eng. (ICDE 2008), pp. 1406–1408 (April 2008)
Böhm, C., Pryakhin, A., Schubert, M.: Probabilistic Ranking Queries on Gaussians. In: Proc. Int’l Conf. Scientific and Statistical Database Management, pp. 169–178 (2006)
Cheng, R., Singh, S., Prabhakar, S.: U-DBMS: A Database System for Managing Constantly-Evolving Data. In: Proc. 31st Int’l Conf. Very Large Data Bases, VLDB 2005 (2005)
Soliman, M., Ilyas, I.: Ranking with Uncertain Scores. In: Proc. 25th Int’l Conf. Data Eng. (ICDE 2009), pp. 317–328 (March/April 2009)
Yi, K., Li, F., Kollios, G., Srivastava, D.: Efficient Processing of Top-K Queries in Uncertain Databases with X-Relations. IEEE Trans. Knowledge and Data Eng. 20(12), 1669–1682 (2008)
Cheng, R., Kalashnikov, D., Prabhakar, S.: Evaluating Probabilistic Queries over Imprecise Data. In: Proc. ACM SIGMOD, pp. 551–562 (2003)
Cheng, R., Xia, Y., Prabhakar, S., Shah, R., Vitter, J.: Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data. In: Proc. 30th Int’l Conf. Very Large Databases (VLDB 2004), pp. 876–887 (2004)
Cormode, G., Li, F., Yi, K.: Semantics of Ranking Queries for Probabilistic Data and Expected Results. In: Proc. 25th Int’l Conf. Data Eng. (ICDE 2009), pp. 305–316 (March/April 2009)
Kriegel, H.-P., Kunath, P., Pfeifle, M., Renz, M.: Probabilistic Similarity Join on Uncertain Data. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 295–309. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katukoori, D., Bhima, K., Aruna Sri, T., Hemanth Chowdary, S., Bhattacharya, S. (2012). Efficient Probabilistic Query Ranking in Uncertain Databases. In: Krishna, P.V., Babu, M.R., Ariwa, E. (eds) Global Trends in Computing and Communication Systems. ObCom 2011. Communications in Computer and Information Science, vol 269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29219-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-29219-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29218-7
Online ISBN: 978-3-642-29219-4
eBook Packages: Computer ScienceComputer Science (R0)