Skip to main content
SpringerLink
Log in

A Framework for Supporting Tree-Like Indexes on the Chord Overlay

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

An Erratum to this article was published on 27 March 2020

This article has been updated

Abstract

With the explosive growth of data, to support efficient data management including queries and updates, the database system is expected to provide tree-like indexes, such as R-tree, M-tree, B+-tree, according to different types of data. In the distributed environment, the indexes have to be scattered across the compute nodes to improve reliability and scalability. Indexes can speed up queries, but they incur maintenance cost when updates occur. In the distributed environment, each compute node maintains a subset of an index tree, so keeping the communication cost small is more crucial, or else it occupies lots of network bandwidth and the scalability and availability of the database system are affected. Further, to achieve the reliability and scalability for queries, several replicas of the index are needed, but keeping the replicas consistent is not straightforward. In this paper, we propose a framework supporting tree-like indexes, based on Chord overlay, which is a popular P2P structure. The framework dynamically tunes the number of replicas of index to balance the query cost and the update cost. Several techniques are designed to improve the efficiency of updates without the cost of performance of the queries. We implement M-tree and R-tree in our framework, and extensive experiments on real- life and synthetic datasets verify the efficiency and scalability of our framework.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Change history

  • 27 March 2020

    Erratum: Ming-Dong Zhu, De-Rong Shen, Yue Kou, Tie-Zheng Nie, Ge Yu. A Framework for Supporting Tree-Like Indexes on the Chord Overlay. Journal of Computer Science and Technology 2013, 28(6): 962-972. DOI: 10.1007/s11390-013-1391-8.

References

  1. 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. the 7th OSDI, November 2006, pp.205-218.

  2. Cooper B F, Ramakrishnan R, Srivastava U, Silberstein A, Bohannon P, Jacobsen H, Puz N, Weaver D, Yerneni R. Pnuts: Yahoo!’s hosted data serving platform. In Proc. the 34th VLDB, August 2008, pp.1277-1288.

  3. DeCandia G, Hastorun D, Jampani M, Kakulapati G, Lakshman A, Pilchin A, Sivasubramanian S, Vosshall P, Vogels W. Dynamo: Amazons highly available key-value store. In Proc. the 21st SOSP, October 2007, pp.205-220.

  4. Dean J, Ghemawat S. MapReduce: Simplified data processing on large clusters. In Proc. the 6th OSDI, December 2004, pp.137-150.

  5. Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. SIGCOMM, August 2001, pp.149-160.

  6. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable contentaddressable network. In Proc. SIGCOMM, Aug. 2001, pp.161-172.

  7. Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. IFIP/ACM International Conference on Distributed Systems Platforms, November 2001, pp.329-350.

  8. Tanin E, Harwood A, Samet H. Using a distributed quadtree index in peer-to-peer networks. VLDB Journal, 2007, 16(2): 165–178.

    Article  Google Scholar 

  9. Wang J, Wu S, Gao H, Li J, Ooi B C. Indexing multidimensional data in a cloud system. In Proc. SIGMOD, June 2010, pp.591-602.

  10. Wu S, Jiang D, Ooi B C, Wu K L. Efficient B-tree based indexing for cloud data processing. In Proc. the 36th VLDB, September 2010, pp.1207-1218.

  11. Chen G, Vo H, Wu S, Ooi B C, Özsu M T. A framework for supporting DBMS-like indexes in the cloud. In Proc. the 37th VLDB, August 2011, pp.702-713.

  12. Crainiceanu A, Linga P, Machanavajjhala A et al. P-Ring: An efficient and robust P2P range index structure. In Proc. SIGMOD, June 2007, pp.223-234.

  13. Zhu M, Shen D, Kou Y, Nie T, Yu G. An adaptive distributed index for similarity queries in metric spaces. In Proc. the 13th WAIM, August 2012, pp.222-227.

  14. Aberer K, Cudré-Mauroux P, Datta A et al. P-Grid: A self-organizing structured P2P system. ACM SIGMOD Record, 32(3): 29–33.

  15. Karger D, Lehman E, Leighton F, Panigrahy R, Levine M, Lewin D. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proc. the 29th STOC, 1997, pp.654-663.

  16. Sexton A, Swinbank R. Bulk loading the M-tree to enhance query performance. In Proc. the 21st BNCOD, July 2004, pp.190-202.

  17. Jagadish H V, Ooi B C, Tan K, Yu C, Zhang R. iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst., 2005, 30(2): 364–397.

    Article  Google Scholar 

  18. Novak D, Zezula P. M-Chord: A scalable distributed similarity search structure. In Proc. the 1st INFOSCALE, May 30-June 1, 2006, Article No. 19.

  19. Novak D, Batko M, Zezula P. Metric index: An efficient and scalable solution for precise and approximate similarity search. Inf. Syst., 2011, 36(4): 721–733.

    Article  Google Scholar 

  20. Batko M. Distributed and scalable similarity searching in metric spaces. In Proc. the 9th EDBT, March 2004, pp.44-153.

  21. Nene S, Nayar S. A simple algorithm for nearest neighbor search in high dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1997, 19(9): 989–1003.

    Article  Google Scholar 

  22. Kolahdouzan M, Shahabi C. Voronoi-based k nearest neighbor search for spatial network database. In Proc. the 30th VLDB, August 31-Sept. 3, 2004, pp.840-851.

  23. Mondal A, Lifu Y, Kitsuregawa M. P2PR-Tree: An R-tree-based spatial index for peer-to-peer environments. In Proc. the 9th EDBT, March 2004, pp.516-525.

Download references

Author information

Authors and Affiliations

  1. College of Information Science and Engineering, Northeastern University, Shenyang, 110004, China

    Ming-Dong Zhu, De-Rong Shen, Kou Yue, Tie-Zheng Nie & Ge Yu

Authors
  1. Ming-Dong Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. De-Rong Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kou Yue
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tie-Zheng Nie
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ge Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ming-Dong Zhu.

Additional information

This research was supported by the National Basic Research 973 Program of China under Grant No. 2012CB316201, the National Natural Science Foundation of China under Grant Nos. 60973021, 61033007, 61003060, and the Fundamental Research Funds for the Central Universities of China under Grant No. N100704001.

Electronic supplementary material

Below is the link to the electronic supplementary material.

(DOC 28 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhu, MD., Shen, DR., Yue, K. et al. A Framework for Supporting Tree-Like Indexes on the Chord Overlay. J. Comput. Sci. Technol. 28, 962–972 (2013). https://doi.org/10.1007/s11390-013-1391-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-013-1391-8

Keywords

Search

Navigation