The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (2010 vol.22)
pp: 1247-1261
Ying Zhang , University of New South Wales, Sydney
Xuemin Lin , University of New South Wales, Sydney
Wenjie Zhang , University of New South Wales, Sydney
Jianmin Wang , Tsinghua University, China
Qianlu Lin , University of New South Wales, Sydney
ABSTRACT
With the rapid development of various optical, infrared, and radar sensors and GPS techniques, there are a huge amount of multidimensional uncertain data collected and accumulated everyday. Recently, considerable research efforts have been made in the field of indexing, analyzing, and mining uncertain data. As shown in a recent book [CHECK END OF SENTENCE] on uncertain data, in order to efficiently manage and mine uncertain data, effective indexing techniques are highly desirable. Based on the observation that the existing index structures for multidimensional data are sensitive to the size or shape of uncertain regions of uncertain objects and the queries, in this paper, we introduce a novel R-Tree-based inverted index structure, named UI-Tree, to efficiently support various queries including range queries, similarity joins, and their size estimation, as well as top-k range query, over multidimensional uncertain objects against continuous or discrete cases. Comprehensive experiments are conducted on both real data and synthetic data to demonstrate the efficiency of our techniques.
INDEX TERMS
Uncertain, index, range query, partition.
CITATION
Ying Zhang, Xuemin Lin, Wenjie Zhang, Jianmin Wang, Qianlu Lin, "Effectively Indexing the Uncertain Space", IEEE Transactions on Knowledge & Data Engineering, vol.22, no. 9, pp. 1247-1261, September 2010, doi:10.1109/TKDE.2010.77
REFERENCES
[1] C. Aggarwal and P. Yu, "On High Dimensional Indexing of Uncertain Data," Proc. Int'l Conf. Data Eng. (ICDE), 2008.
[2] C.C. Aggarwal, Managing and Mining Uncertain Data. Springer, 2009.
[3] C.C. Aggarwal and P.S. Yu, "A Framework for Clustering Uncertain Data Streams," Proc. Int'l Conf. Data Eng. (ICDE), 2008.
[4] J.L. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching," Comm. ACM, vol. 18, no. 9, pp. 509-517, 1975.
[5] G. Beskales, M.A. Soliman, and I.F. Ilyas, "Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases," Proc. Int'l Conf. Very Large Data Bases (VLDB), vol. 1, no. 1, 2008.
[6] C. Böhm, M. Gruber, P. Kunath, A. Pryakhin, and M. Schubert, "Prover: Probabilistic Video Retrieval Using the Gauss-Tree," Proc. Int'l Conf. Data Eng. (ICDE), 2007.
[7] C. Böhm, A. Pryakhin, and M. Schubert, "Probabilistic Ranking Queries on Gaussians," Proc. Int'l Conf. Scientific and Statistical Database Management (SSDBM), 2006.
[8] T. Brinkhoff, H.-P. Kriegel, and B. Seeger, "Efficient Processing of Spatial Joins Using R-Trees," Proc. ACM SIGMOD, 1993.
[9] J. Chen and R. Cheng, "Efficient Evaluation of Imprecise Location-Dependent Queries," Proc. Int'l Conf. Data Eng. (ICDE), 2007.
[10] R. Cheng, D.V. Kalashnikov, and S. Prabhakar, "Evaluating Probabilistic Queries Over Imprecise Data," Proc. ACM SIGMOD, 2003.
[11] 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.
[12] R. Cheng, Y. Xia, S. Prabhakar, R. Shah, and J.S. Vitter, "Effcient Indexing Methods for Probabilistic Threshold Queries Over Uncertain Data," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
[13] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. The MIT Press, 2001.
[14] X. Dai, M. Yiu, N. Mamoulis, Y. Tao, and M. Vaitis, "Probabilistic Spatial Queries on Existentially Uncertain Data," Proc. Int'l Symp. Large Spatio-Temporal Databases (SSTD), 2005.
[15] N. Dalvi and D. Suciu, "Efficient Query Evaluation on Probabilistic Databases," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
[16] Z. Ding, "Utr-Tree: An Index Structure for the Full Uncertain Trajectories of Network-Constrained Moving Objects," Proc. Int'l Conf. Mobile Data Management (MDM), 2008.
[17] R. Fagin, A. Lotem, and M. Naor, "Optimal Aggregation Algorithms for Middleware," J. Computer and System Sciences, vol. 66, no. 4, pp. 614-656, 2003.
[18] C. Faloutsos, T.K. Sellis, and N. Roussopoulos, "Analysis of Object Oriented Spatial Access Methods," Proc. ACM SIGMOD, 1987.
[19] I.D. Felipe, V. Hristidis, and N. Rishe, "Keyword Search on Spatial Databases," Proc. Int'l Conf. Data Eng. (ICDE), 2008.
[20] R.A. Finkel and J.L. Bentley, "Quad Trees: A Data Structure for Retrieval on Composite Keys," Acta Informatica, vol. 4, pp. 1-9, 1974.
[21] A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD, 1984.
[22] J. Han and M. Kamber, Data Mining: Concepts and Techniques. Diane Cerra, 2001.
[23] R. Hariharan, B. Hore, C. Li, and S. Mehrotra, "Processing Spatial-Keyword (SK) Queries in Geographic Information Retrieval (GIR) Systems," Proc. Int'l Conf. Scientific and Statistical Database Management (SSDBM), 2007.
[24] J. Hershberger and S. Suri, "Finding Tailored Partitions," Proc. Symp. Computational Geometry, 1989.
[25] M. Hua, J. Pei, W. Zhang, and X. Lin, "Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach," Proc. ACM SIGMOD, 2008.
[26] D.-O. Kim, D.-S. Hong, H.-K. Kang, and K.-J. Han, "Ur-Tree: An Efficient Index for Uncertain Data in Ubiquitous Sensor Networks," Proc. Int'l Conf. Advances in Grid and Pervasive Computing (GPC), 2007.
[27] H.-P. Kriegel, P. Kunath, M. Pfeifle, and M. Renz, "Probabilistic Similarity Join on Uncertain Data," Proc. Int'l Conf. Database Systems for Advanced Applications (DASFAA), 2006.
[28] H.-P. Kriegel, P. Kunath, and M. Renz, "Probabilistic Nearest-Neighbor Query on Uncertain Objects," Proc. Int'l Conf. Database Systems for Advanced Applications (DASFAA), 2007.
[29] R. Li, B. Bhanu, C. Ravishankar, M. Kurth, and J. Ni, "Uncertain Spatial Data Handling: Modeling, Indexing and Query," Computers & Geosciences, vol. 33, no. 1, pp. 42-61, 2007.
[30] Y. Ma, D.V. Kalashnikov, and S. Mehrotra, "Toward Managing Uncertain Spatial Information for Situational Awareness Applications," IEEE Trans. Knowledge and Data Eng., vol. 20, no. 10, pp. 1408-1423, Oct. 2008.
[31] J. Pei, B. Jiang, X. Lin, and Y. Yuan, "Probabilistic Skylines on Uncertain Data," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2007.
[32] Y. Sadahiro, "Buffer Operations on Spatial Data with Limited Accuracy," Trans. GIS, vol. 9, no. 3, pp. 323-344, 2005.
[33] A.D. Sarma, O. Benjelloun, A. Halevy, and J. Widom, "Working Models for Uncertain Data," Proc. Int'l Conf. Data Eng. (ICDE), 2005.
[34] S. Singh, C. Mayfield, S. Prabhakar, R. Shah, and S.E. Hambrusch, "Indexing Uncertain Categorical Data," Proc. Int'l Conf. Data Eng. (ICDE), 2007.
[35] Y. Tao, R. Cheng, X. Xiao, W.K. Ngai, B. Kao, and S. Prabhakar, "Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2005.
[36] Y. Tao, X. Xiao, and R. Cheng, "Range Search on Multidimensional Uncertain Data," ACM Trans. Database Systems, vol. 32, no. 3, article no. 15, 2007.
[37] Y. Theodoridis and T.K. Sellis, "A Model for the Prediction of R-Tree Performance," Proc. Symp. Principles of Database Systems (PODS), 1996.
[38] D. Zinn, J. Bosch, and M. Gertz, "Modeling and Querying Vague Spatial Objects Using Shapelets," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2007.
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool