The Community for Technology Leaders
RSS Icon
Issue No.12 - December (2011 vol.22)
pp: 2046-2054
Yue Wang , Sch. of Comput. Sci., Fudan Univ., Shanghai, China
Wang-Chien Lee , Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA
Dingxiong Deng , Sch. of Comput. Sci., Fudan Univ., Shanghai, China
Shuigeng Zhou , Shanghai Key Lab. of Intell. Infromation Process., Fudan Univ., Shanghai, China
Jianliang Xu , Dept. of Comput. Sci., Hong Kong Baptist Univ., Kowloon Tong, China
Yuzhe Tang , Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA
In this paper, we study the problem of indexing multidimensional data in P2P networks based on distributed hash tables (DHTs). We advocate the indexing approach that superimposes a multidimensional index tree on top of a DHT - a paradigm that keeps the underlying DHT intact while being able to adapt to any DHT substrate. In this context, we identify several index design issues and propose a novel indexing scheme called multidimensional Lightweight Hash Tree (m-LIGHT). First, to preserve data locality, m-LIGHT employs a clever naming mechanism that gracefully maps a tree-based index into the DHT and contributes to high efficiency in both index maintenance and query processing. Second, to tackle the load balancing issue, m-LIGHT leverages a new data-aware splitting strategy that achieves optimal load balance under a fixed index size. We present detailed algorithms for processing complex queries over the m-LIGHT index. We also conduct an extensive performance evaluation of m-LIGHT in comparison with several state-of-the-art indexing schemes. The experimental results show that m-LIGHT substantially reduces index maintenance overhead and improves query performance in terms of both bandwidth consumption and response latency.
tree data structures, file organisation, indexing, peer-to-peer computing, query processing, resource allocation, bandwidth consumption, DHT, multidimensional data indexing approach, P2P networks, distributed hash tables, multidimensional lightweight hash tree, data locality, query processing, load balancing issue, data-aware splitting strategy, index maintenance, Peer to peer computing, Maintenance engineering, Query processing, Indexing, Distributed databases, k-NN queries., P2P systems, distributed hash tables, multi-dimensional indexing, range queries
Yue Wang, Wang-Chien Lee, Dingxiong Deng, Shuigeng Zhou, Jianliang Xu, Yuzhe Tang, "A Lightweight Multidimensional Index for Complex Queries over DHTs", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 12, pp. 2046-2054, December 2011, doi:10.1109/TPDS.2011.91
[1] A. Andrzejak and Z. Xu, "Scalable, Efficient Range Queries for Grid Information Services," Proc. Peer-to-Peer Computing, pp. 33-40, 2002.
[2] J. Aspnes and G. Shah, "Skip Graphs," Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '03), pp. 384-393, 2003.
[3] A.R. Bharambe, M. Agrawal, and S. Seshan, "Mercury: Supporting Scalable Multi-Attribute Range Queries," Proc. ACM SIGCOMM, pp. 353-366, 2004.
[4] M. Cai, M.R. Frank, J. Chen, and P.A. Szekely, "MAAN: A Multi-Attribute Addressable Network for Grid Information Services," Proc. Fourth Int'l Workshop Gird Computing (GIRD '03), pp. 184-191, 2003.
[5] Y. Chawathe, S. Ramabhadran, S. Ratnasamy, A. LaMarca, S. Shenker, and J.M. Hellerstein, "A Case Study in Building Layered DHT Applications," Proc. ACM SIGCOMM, pp. 97-108, 2005.
[6] P. Ganesan, B. Yang, and H. Garcia-Molina, "One Torus to Rule Them All: Multidimensional Queries in P2P Systems," Proc. Seventh Int'l Workshop the Web and Databases (WebDB '04), pp. 19-24, 2004.
[7] J. Gao and P. Steenkiste, "An Adaptive Protocol for Efficient Support of Range Queries in DHT-Based Systems," Proc. 12th IEEE Int'l Conf. Network Protocols (ICNP '04), pp. 239-250, 2004.
[8] H.V. Jagadish, B.C. Ooi, and Q.H. Vu, "BATON: A Balanced Tree Structure for Peer-to-Peer Networks," Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 661-672, 2005.
[9] H.V. Jagadish, B.C. Ooi, Q.H. Vu, R. Zhang, and A. Zhou, "Vbi-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes," Proc. 22nd Int'l Conf. Data Eng. (ICDE '06), 2006.
[10] D.R. Karger, E. Lehman, F.T. Leighton, R. Panigrahy, M.S. Levine, and D. Lewin, "Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web," Proc. ACM Symp. Theory of Computing (STOC '97), pp. 654-663, 1997.
[11] M. Li, W.-C. Lee, and A. Sivasubramaniam, "DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems," Proc. IEEE Int'l Conf. Network Protocols (ICNP '06), pp. 12-21, 2006.
[12] S. Ramabhadran, S. Ratnasamy, J.M. Hellerstein, and S. Shenker, "Brief Announcement: Prefix Hash Tree," Proc. 23rd Ann. ACM Symp. Principles of Distributed Computing (PODC '04), 2004.
[13] S. Ratnasamy, P. Francis, M. Handley, R.M. Karp, and S. Shenker, "A Scalable Content-Addressable Network," Proc. ACM SIGCOMM, 2001.
[14] S.C. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling Churn in a DHT," Proc. USENIX Ann. Technical Conf., pp. 127-140, 2004.
[15] S.C. Rhea, B. Godfrey, B. Karp, J. Kubiatowicz, S. Ratnasamy, S. Shenker, I. Stoica, and H. Yu, "Opendht: A Public DHT Service and Its Uses," Proc. ACM SIGCOMM, pp. 73-84, 2005.
[16] N. Roussopoulos, S. Kelley, and F. Vincent, "Nearest Neighbor Queries," Proc. ACM SIGMOD, pp. 71-79, 1995.
[17] A.I.T. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems," Proc. 18th IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware '01), pp. 329-350, 2001.
[18] C. Schmidt and M. Parashar, "Flexible Information Discovery in Decentralized Distributed Systems," Proc. 12th IEEE Int'l Symp. High Performance Distributed Computing (HPDC '03), pp. 226-235, 2003.
[19] G. Shen, C. Zheng, W. Pu, and S. Li, "Distributed Segment Tree: A Unified Architecture to Support Range Query and Cover Query," technical report, Microsoft Research Asia, 2007.
[20] I. Stoica, R. Morris, D.R. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," Proc. ACM SIGCOMM, pp. 149-160, 2001.
[21] Y. Tang and S. Zhou, "LHT: A Low-Maintenance Indexing Scheme over DHTs," Proc. 28th Int'l Conf. Distributed Computing Systems (ICDCS '08), pp. 141-151, 2008.
[22] Y. Tang, S. Zhou, and J. Xu, "Light: A Query-Efficient Yet Low-Maintenance Indexing Scheme over Dhts," IEEE Trans. Knowledge Data Eng., vol. 22, no. 1, pp. 59-75, Jan. 2010.
[23] P. Yalagandu and J. Browne, "Solving Range Queries in a Distributed System," Technical Report TR-04-18, UT CS, 2003.
[24] C. Zhang, A. Krishnamurthy, and R.Y. Wang, "Brushwood: Distributed Trees in Peer-to-Peer Systems," Proc. Fourth Int'l Workshop Peer-to-Peer Systems (IPTPS '05), pp. 47-57, 2005.
[25] C. Zheng, G. Shen, S. Li, and S. Shenker, "Distributed Segment Tree: Support of Range Query and Cover Query over DHT," Proc. Fifth Int'l Workshop Peer-to-Peer Systems (IPTPS '06), Feb. 2006.
38 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool