Abstract
In recent years, the management of uncertain data has received much attention in a centralized database. However, to our knowledge, no work has been done on this topic in the context of Peer-to-Peer (P2P) systems, and the existing techniques of P2P range queries cannot be suitable for uncertain data. In this paper, we study the problem of answering probabilistic threshold range queries on multi-dimensional uncertain data for P2P systems. Our novel solution of the problem, PeerUN, is based on a tree structure overlay which has the optimal diameter and can support efficient routing in highly dynamic scenarios. The issues (also faced with multi-dimensional uncertain data) of existing techniques for multi-dimensional indexing over a structure P2P network are (1) they process queries efficiently at the cost of huge maintenance overhead; (2) they have low maintenance costs, but they suffer poor routing efficiency or introduce huge network overhead. PeerUN can process range queries on multi-dimensional uncertain data efficiently with low maintenance costs. PeerUN achieves this by introducing a series of novel queries processing algorithms and a cost-based optimal data replication strategy. Experimental results validate the effectiveness of the proposed approach.
This is a preview of subscription content, log in via an institution to check access.
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
Faradjian, A., Gehrke, J., Bonnet, P.: Gadt: a probability space ADT for representing and querying the physical world. In: Proc. of ICDE (2002)
Böhm, C., Pryakhin, A., Schubert, M.: The gauss-tree: efficient object Identification in databases of probabilistic feature vectors. In: Proc. of ICDE (2006)
Cheng, R., Kalashnikov, D., Prabhakar, S.: Querying imprecise data in moving object environments. TKDE 16(9), 1112–1127 (2004)
Ljosa, V., Singh, A.K.: APLA: indexing arbitrary probability distributions. In: Proc. of ICDE (2007)
Tao, Y., Cheng, R.: Indexing multi-dimensional uncertain data with arbitrary probability density functions. In: Proc. of VLDB (2005)
Tanin, E., Harwood, A., Samet, H.: Using a distributed quadtree index in peer-to-peer networks. VLDB Journal 16(2), 165C–178C (2007)
Jagadish, H.V., Ooi, B.C.: VBI-tree: a peer-to-peer framework for supporting multi-dimensional indexing schemes. In: Proc. of ICDE (2006)
Lee, W., Li, M., Sivasubramaniam, A.: Dptree: a balanced tree based indexing framework for peer-to-peer systems. In: Proc. of ICNP (2006)
Cai, M., Frank, M.R., Szekely, P.A.: Maan: A multiattribute addressable network for grid information services. In: Proc. of GRID (2003)
Novak, D., Zezula, P.: M-Chord: a scalable distributed similarity search structure. In: Proc. of InfoScale (2006)
Falchi, F., Gennaro, C., Zezula, P.: A content–addressable network for similarity search in metric spaces. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, J.-H., Ouksel, A.M. (eds.) DBISP2P 2005 and DBISP2P 2006. LNCS, vol. 4125, pp. 98–110. Springer, Heidelberg (2007)
Soliman, M.A., Ilyas, I.F., Chang, K.C.: Top-k query processing in uncertain databases. In: Proc. of ICDE (2007)
Re, C., Dalvi, N., Suciu, D.: Efficient top-k query evaluation on probabilistic data. In: Proc. of ICDE (2007)
Kriegel, H.P., Kunath, P., Renz, M.: Probabilistic nearest-neighbor query on uncertain objects. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 337–348. Springer, Heidelberg (2007)
Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic skylines on uncertain data. In: Proc. of VLDB (2007)
Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM 18(9), 509–517 (1975)
Yuan, Y., Guo, D., Wang, G., Liu, Y.: Beyond the lower bound: a unified and optimal P2P construction method. HKUST Technical Report (2008), http://www.cse.ust.hk/~liu/guodeke/index.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yuan, Y., Wang, G., Sun, Y., Wang, B., Yang, X., Yu, G. (2009). An Efficient P2P Range Query Processing Approach for Multi-dimensional Uncertain Data. In: Chen, L., Liu, C., Liu, Q., Deng, K. (eds) Database Systems for Advanced Applications. DASFAA 2009. Lecture Notes in Computer Science, vol 5667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04205-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-04205-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04204-1
Online ISBN: 978-3-642-04205-8
eBook Packages: Computer ScienceComputer Science (R0)