Skip to main content

\(R^2\)-Tree: An Efficient Indexing Scheme for Server-Centric Data Center Networks

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11029))

Included in the following conference series:

  • 1128 Accesses

Abstract

Index plays a very important role in cloud storage systems, which can support efficient querying tasks for data-intensive applications. However, most of existing indexing schemes for data centers focus on one specific topology and cannot be migrated directly to the other networks. In this paper, based on the observation that server-centric data center networks (DCNs) are recursively defined, we propose pattern vector, which can formulate the server-centric topologies more generally and design \(R^2\)-Tree, a scalable two-layer indexing scheme with a local R-Tree and a global R-Tree to support multi-dimensional query. To show the efficiency of \(R^2\)-Tree, we start from a case study for two-dimensional data. We use a layered global index to reduce the query scale by hierarchy and design a method called Mutex Particle Function (MPF) to determine the potential indexing range. MPF helps to balance the workload and reduce routing cost greatly. Then, we extend \(R^2\)-Tree indexing scheme to handle high-dimensional data query efficiently based on the topology feature. Finally, we demonstrate the superior performance of \(R^2\)-Tree in three typical server-centric DCNs on Amazon’s EC2 platform and validate its efficiency.

This work was partly supported by the Program of International S&T Cooperation (2016YFE0100300), the China 973 project (2014CB340303), the National Natural Science Foundation of China (Grant number 61472252, 61672353, 61729202 and U1636210), the Shanghai Science and Technology Fund (Grant number 17510740200), CCF-Tencent Open Research Fund (RAGR20170114), and Guangdong Province Key Laboratory of Popular High Performance Computers of Shenzhen University (SZU-GDPHPCL2017).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://chorochronos.datastories.org/?q=node/21.

References

  1. Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. In: ACM SIGCOMM Computer Communication Review, pp. 63–74 (2008)

    Google Scholar 

  2. Beaver, D., Kumar, S., Li, H.C., Sobel, J., Vajgel, P.: Finding a needle in Haystack: Facebook’s photo storage. In: OSDI, pp. 47–60 (2010)

    Google Scholar 

  3. Chen, G., Vo, H.T., Wu, S., Ooi, B.C., Özsu, M.T.: A framework for supporting DBMS-like indexes in the cloud. Proc. VLDB Endow. 4(11), 702–713 (2011)

    Google Scholar 

  4. Decandia, G., et al.: Dynamo: Amazon’s highly available key-value store. In: SOGOPS, pp. 205–220 (2007)

    Google Scholar 

  5. Gao, L., Zhang, Y., Gao, X., Chen, G.: Indexing multi-dimensional data in modular data centers. In: Chen, Q., Hameurlain, A., Toumani, F., Wagner, R., Decker, H. (eds.) DEXA 2015. LNCS, vol. 9262, pp. 304–319. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22852-5_26

    Chapter  Google Scholar 

  6. Gao, X., Li, B., Chen, Z., Yin, M.: FT-INDEX: a distributed indexing scheme for switch-centric cloud storage system. In: ICC, pp. 301–306 (2015)

    Google Scholar 

  7. Ghemawat, S., Gobioff, H., Leung, S.T.: The Google file system. In: SOSP, pp. 29–43 (2003)

    Google Scholar 

  8. Greenberg, A., et al.: VL2: a scalable and flexible data center network. In: ACM SIGCOMM Computer Communication Review, pp. 51–62 (2009)

    Google Scholar 

  9. Guo, C., et al.: BCube: a high performance, server-centric network architecture for modular data centers. ACM SIGCOMM Comput. Commun. Rev. 39(4), 63–74 (2009)

    Article  Google Scholar 

  10. Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., Lu, S.: DCell: a scalable and fault-tolerant network structure for data centers. ACM SIGCOMM Comput. Commun. Rev. 38(4), 75–86 (2008)

    Article  Google Scholar 

  11. Guo, D., Chen, T., Li, D., Li, M., Liu, Y., Chen, G.: Expandable and cost-effective network structures for data centers using dual-port servers. IEEE Trans. Comput. 62(7), 1303–1317 (2013)

    Article  MathSciNet  Google Scholar 

  12. Hong, Y., Tang, Q., Gao, X., Yao, B., Chen, G., Tang, S.: Efficient R-tree based indexing scheme for server-centric cloud storage system. IEEE Trans. Knowl. Data Eng. 28(6), 1503–1517 (2016)

    Article  Google Scholar 

  13. Li, D., Guo, C., Wu, H., Tan, K.: FiConn: using backup port for server interconnection in data centers. In: INFOCOM, pp. 2276–2285 (2009)

    Google Scholar 

  14. Liao, Y., Yin, D., Gao, L.: DPillar: scalable dual-port server interconnection for data center networks. In: ICCCN, pp. 1–6 (2014)

    Google Scholar 

  15. Liu, Y., Gao, X., Chen, G.: A universal distributed indexing scheme for data centers with tree-like topologies. In: Chen, Q., Hameurlain, A., Toumani, F., Wagner, R., Decker, H. (eds.) DEXA 2015. LNCS, vol. 9261, pp. 481–496. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22849-5_33

    Chapter  Google Scholar 

  16. Walraed-Sullivan, M., Vahdat, A., Marzullo, K.: Aspen trees: balancing data center fault tolerance, scalability and cost. In: CoNEXT, pp. 85–96 (2013)

    Google Scholar 

  17. Wang, J., Wu, S., Gao, H., Li, J., Ooi, B.C.: Indexing multi-dimensional data in a cloud system. In: SIGMOD, pp. 591–602 (2010)

    Google Scholar 

  18. Wu, S., Wu, K.L.: An indexing framework for efficient retrieval on the cloud. IEEE Comput. Soc. Data Eng. Bull. 32(1), 75–82 (2009)

    MathSciNet  Google Scholar 

  19. Zhang, R., Qi, J., Stradling, M., Huang, J.: Towards a painless index for spatial objects. ACM Trans. Database Syst. 39(3), 19 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaofeng Gao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lin, Y., Chen, X., Gao, X., Yao, B., Chen, G. (2018). \(R^2\)-Tree: An Efficient Indexing Scheme for Server-Centric Data Center Networks. In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2018. Lecture Notes in Computer Science(), vol 11029. Springer, Cham. https://doi.org/10.1007/978-3-319-98809-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98809-2_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98808-5

  • Online ISBN: 978-3-319-98809-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics