Abstract
Cloud storage system such as Amazon’s Dynamo and Google’s GFS poses new challenges to the community to support efficient query processing for various applications. In this paper we propose RT-HCN, a distributed indexing scheme for multi-dimensional query processing in data centers, the infrastructure to build cloud systems. RT-HCN is a two-layer indexing scheme, which integrates HCN-based routing protocol and the R-Tree based indexing technology, and is portionably distributed on every server. Based on the characteristics of HCN, we design a special index publishing rule and query processing algorithms to guarantee efficient data management for the whole network. We prove theoretically that RT-HCN is both query-efficient and space-efficient, by which each server will only maintain a tolerable number of indices while a large number of users can concurrently process queries with low routing cost. We compare our design with RT-CAN, a similar design in traditional P2P network. Experiments validate the efficiency of our proposed scheme and depict its potential implementation in data centers.
This work has been supported in part by the National Natural Science Foundation of China (Grant number 61202024, 61202025, 61133006), China 973 project (2014CB340303, 2012CB316200), Shanghai Educational Development Foundation (Chenguang Grant No.12CG09), Shanghai Pujiang Program 13PJ1403900, and the Natural Science Foundation of Shanghai (Grant No.12ZR1445000).
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
Ghemawat, S., Gobioff, H., Leung, S.-T.: The Google file system. ACM SIGOPS 37(5), 29–43 (2003)
DeCandia, G., Hastorun, D., Jampani, M., et al.: Dynamo: amazon’s highly available key-value store. ACM SIGOPS 41(6), 205–220 (2007)
Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. ACM SIGOPS 44(2), 35–40 (2010)
Beaver, D., Kumar, S., Li, H.C., et al.: Finding a Needle in Haystack: Facebook’s Photo Storage. In: USENIX OSDI, pp. 47–60 (2010)
Baker, J., Bond, C., Corbett, J.C., et al.: Megastore: Providing Scalable, Highly Available Storage for Interactive Services. ACM CIDR 11, 223–234 (2011)
Corbett, J.C., Dean, J., Epstein, M., et al.: Spanner: Google’s globally-distributed database. ACM TOCS 31(3), 8 (2013)
Wang, J., Wu, S., Gao, H., et al.: Indexing multi-dimensional data in a cloud system. In: ACM SIGMOD, pp. 591–602 (2010)
Wu, S., Wu, K.-L.: An Indexing Framework for Efficient Retrieval on the Cloud. Bulletin of TCDE of the IEEE Computer Society 32(1), 75–82 (2009)
Wu, S., Jiang, D., Ooi, B.C., Wu, K.-L.: Efficient b-tree based indexing for cloud data processing. ACM VLDB 3(1-2), 1207–1218 (2010)
Chen, G., Vo, H.T., Wu, S., et al.: A Framework for Supporting DBMS-like Indexes in the Cloud. ACM VLDB 4(11), 702–713 (2011)
Jagadish, H.V., Ooi, B.C., Vu, Q.H.: Baton: A balanced tree structure for peer-to-peer networks. In: ACM VLDB, pp. 661–672 (2005)
Ratnasamy, S., Francis, P., Handley, M., et al.: A scalable content-addressable network. ACM SIGCOMM 31(4), 161–172 (2001)
Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. ACM SIGCOMM 38(4), 63–74 (2008)
Greenberg, A., Hamilton, J.R., Jain, N., et al.: VL2: a scalable and flexible data center network. ACM SIGCOMM 39(4), 51–62 (2009)
Guo, C., Wu, H., Tan, K., et al.: Dcell: a scalable and fault-tolerant network structure for data centers. ACM SIGCOMM 38(4), 75–86 (2008)
Guo, C., Lu, G., Li, D., et al.: BCube: a high performance, server-centric network architecture for modular data centers. ACM SIGCOMM 39(4), 63–74 (2009)
Li, D., Guo, C., Wu, H., et al.: FiConn: Using backup port for server interconnection in data centers. In: IEEE INFOCOM, pp. 2276–2285 (2009)
Li, D., Guo, C., Wu, H., et al.: Scalable and cost-effective interconnection of data-center servers using dual server ports. IEEE/ACM TON 19(1), 102–114 (2011)
Wu, H., Lu, G., Li, D., et al.: MDCube: a high performance network structure for modular data center interconnection. In: ACM CoNEXT, pp. 25–36 (2009)
Li, D., Xu, M., Zhao, H., Fu, X.: Building mega data center from heterogeneous containers. In: IEEE ICNP, pp. 256–265 (2011)
Guo, D., Chen, T., Li, D., et al.: BCN: expansible network structures for data centers using hierarchical compound graphs. In: IEEE INFOCOM, pp. 61–65 (2011)
Guo, D., Chen, T., Li, D., et al.: Expandable and cost-effective network structures for data centers using dual-port servers. IEEE Trans. Comp. 62(7), 1303–1317 (2013)
Antonin, G.: R-trees: A dynamic index structure for spatial searching. ACM SIGMOD 14(2), 47–57 (1984)
Chang, F., Dean, J., Ghemawat, S., et al.: Bigtable: A distributed storage system for structured data. ACM TOCS 26(2), 4:1–4:26 (2008)
Weil, S.A., Brandt, S.A., Miller, E.L., et al.: Ceph: A scalable, high-performance distributed file system. In: USENIX OSDI, pp. 307–320 (2006)
Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: ACM STOC, pp. 380–388 (2002)
Sagan, H.: Space-filling curves. Springer, New York (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Li, F., Liang, W., Gao, X., Yao, B., Chen, G. (2014). Efficient R-Tree Based Indexing for Cloud Storage System with Dual-Port Servers. In: Decker, H., Lhotská, L., Link, S., Spies, M., Wagner, R.R. (eds) Database and Expert Systems Applications. DEXA 2014. Lecture Notes in Computer Science, vol 8645. Springer, Cham. https://doi.org/10.1007/978-3-319-10085-2_35
Download citation
DOI: https://doi.org/10.1007/978-3-319-10085-2_35
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10084-5
Online ISBN: 978-3-319-10085-2
eBook Packages: Computer ScienceComputer Science (R0)