Abstract
Recently, as a new computing infrastructure, cloud computing is getting more and more attention. How to improve the data management of cloud computing is becoming a research hot. Current cloud computing systems only support key-value insert and lookup operations. However, they can not effectively support complex queries and the management of multi-dimensional data due to lack of efficient index structures. Therefore, a scalable and reliable index structure is generally needed. In this paper, a novel quad-tree based multi-dimensional index structure is proposed for efficient data management and query processing in cloud computing systems. A local quad-tree index is built on each compute node to manage the data residing on the node. Then, the compute nodes are organized in a Chord-based overlay network. A portion of local indexes is selected from each compute node as a global index and published based on the overlay routing protocol. The global index with low maintenance cost can dramatically enhance the performance of query processing in cloud computing systems. Experiments show that the proposed index structure is scalable, efficient and reliable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dean, J., Ghemawat, S.: MapReduce: Simplified Data Processing on Large Clusters. In: Proc. of OSDI, pp. 137–150 (2004)
DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: Amazon’s Highly Available Key-value Store. In: Proc. of SOSP, pp. 205–220 (2007)
Stoica, I., Morris, R., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. of SIGCOMM, pp. 149–160 (2001)
Kedem, G.: The Quad-CIF Tree: A Data Struture for Hierarchical On-Line Algorithms. In: Proc. of the 19th Design Automation Conference, pp. 352–357 (1982)
Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A scalable content-addressable network. In: Proc. of SIGCOMM, pp. 161–172 (2001)
Ghemawat, S., Gobioff, H., Leung, S.-T.: The Google file System. In: Proc. of SOSP, pp. 29–43 (2003)
Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: A Distributed Storage System for Structured Data. In: Proc. of OSDI, pp. 205–218 (2006)
Wu, S., Wu, K.-L.: An Indexing Framework for Efficient Retrieval on the Cloud. IEEE Data Eng. Bull. (DEBU) 32(1), 75–82 (2009)
Zhang, X., Ai, J., Wang, Z., Lu, J., Meng, X.: An Efficient Multi-Dimensional Index for Cloud Data Management. In: Proc. of CloudDb, pp. 17–24 (2009)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching In: Proc. of the ACM SIGMOD, pp. 47–57 (1984)
Bentley, J.L.: Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9), 509–517 (1975)
Wang, J., Wu, S., Gao, H., Li, J., Ooi, B.C.: Indexing Multi-dimensional Data in a Cloud System. In: Proc. of SIGMOD, pp. 591–602 (2010)
Tang, Y., Zhou, S., Xu, J.: LigHT: A Query-Efficient yet Low-Maintenance Indexing Scheme over DHTs. IEEE Trans. Knowl. Data Eng. (TKDE) 22(1), 59–75 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, L., Qiao, B., Wang, G., Chen, C. (2011). An Efficient Quad-Tree Based Index Structure for Cloud Data Management. In: Wang, H., Li, S., Oyama, S., Hu, X., Qian, T. (eds) Web-Age Information Management. WAIM 2011. Lecture Notes in Computer Science, vol 6897. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23535-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-23535-1_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23534-4
Online ISBN: 978-3-642-23535-1
eBook Packages: Computer ScienceComputer Science (R0)