Skip to main content
SpringerLink
Log in

Concurrency methods for the dictionary problem: A survey

  • Published:
Cybernetics Aims and scope

Abstract

Parallel algorithms for dictionary operations (search, insert, delete) in dynamic structures are reviewed. The algorithms considered in the paper are applicable to asynchronous processes on shared memory and to systolic structures of various architectures.

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

Literature Cited

  1. D. Knuth, The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, Mass. (1968).

    Google Scholar 

  2. D. Knuth, The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, Mass. (1973).

    Google Scholar 

  3. J. Nievergelt, “Trees as data and file structure,” Lect. Notes Comput. Sci.,112, 35–45 (1981).

    Google Scholar 

  4. A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms [Russian translation], Mir, Moscow (1979).

    Google Scholar 

  5. G. M. Adel'son-Vel'skii and E. M. Landis, “Another algorithm for the organization of information,” Dokl. Akad. Nauk SSSR,146, No. 2, 263–266 (1962).

    Google Scholar 

  6. R. Bayer and E. McCreight, “Organization and maintenance of large ordered indexes,” Acta Inform.,1, No. 3, 173–189 (1972).

    Google Scholar 

  7. D. Comer, “The ubiquitous B-tree,” ACM Comput. Surveys,11, No. 2, 121–137 (1979).

    Google Scholar 

  8. B. Samadi, “B-trees in a system with multiple users,” Inform. Process. Lett.,5, No. 4, 107–112 (1976).

    Google Scholar 

  9. U. Manber and R. E. Lander, “Concurrency control in a dynamic search structure,” ACM Trans. Database Syst.,9, No. 3, 439–455 (1984).

    Google Scholar 

  10. U. Manber, “Concurrent maintenance of binary search trees,” IEEE Trans. Software Eng.,10, No. 6, 777–784 (1984).

    Google Scholar 

  11. Y. S. Kwong and D. Wood, “Approaches to concurrency in B-trees,” Lect. Notes Comput. Sci.,88, 402–413 (1980).

    Google Scholar 

  12. R. Bayer and M. Schkolnick, “Concurrency of operations on B-trees,” Acta Inform.,9, No. 1, 1–21 (1977).

    Google Scholar 

  13. Y. S. Kwong and D. Wood, “Concurrent operations in large ordered indexes,” Lect. Notes Comput. Sci.,83, 207–222 (1980).

    Google Scholar 

  14. Y. Kwong and D. Wood, “A new method for concurrency in B-trees,” IEEE Trans. Software Eng.,8, No. 3, 211–222 (1982).

    Google Scholar 

  15. A. Birilis, “A comparative study of concurrency control methods in B-trees,” Lect. Notes Comput. Sci.,227, 306–316 (1986).

    Google Scholar 

  16. C. S. Ellis, “Concurrent search and insertion in 2-3-trees,” Acta Inform.,4, No. 1, 63–86 (1980).

    Google Scholar 

  17. C. S. Ellis, “Concurrent search and insertion in AVL-trees,” IEEE Trans. Comput.,29, No. 9, 811–817 (1980).

    Google Scholar 

  18. R. E. Miller and L. Snyder, “Multiple access to B-trees,” Proc. Conf. Inform. Sci. Syst., Baltimore (1978), pp. 173–189.

  19. P. L. Lehman and S. B. Yao, “Efficient locking for concurrent operation on B-trees,” ACM Trans. Database Syst.,6, No. 4, 650–670 (1981).

    Google Scholar 

  20. Y. Sagiv, “Concurrent operations on B*-trees with overtaking,” J. Comput. Syst. Sci.,33, No. 2, 275–296 (1986).

    Google Scholar 

  21. Y. S. Kwong and D. Wood, Concurrency in B-trees, S-trees, T-trees, Technical Report 79-CS-17, Comput. Sci., McMaster Univ. Hamilton (1979).

    Google Scholar 

  22. H. T. Kung and P. L. Lehman, “Concurrent manipulation of binary search trees,” ACM Trans. Database Syst.,5, No. 3, 354–382 (1980).

    Google Scholar 

  23. M. L. Kersten and H. Terba, “Application of the optimistic concurrent control methods,” Software — Practice and Exper.,14, No. 2, 153–168 (1984).

    Google Scholar 

  24. G. Lausen, “Integrated concurrency control in shared B-trees,” Computing,33, No. 1, 13–26 (1984).

    Google Scholar 

  25. N. P. Kriegel and Y. S. Kwong, “Insert-safeness in balanced trees,” Inform. Process. Lett.,16, No. 5, 259–264 (1983).

    Google Scholar 

  26. C. S. Guibas and R. Sedgewick, “A dichromatic framework for balanced trees,” Proc. 19th Ann. Symp. Found. Comput. Sci., San Juan (1978), pp. 8–21.

  27. Th. Ottmann, M. Schrapp, and D. Wood, “Purely top-down updating algorithms for stratified search trees,” Acta Inform.,22, No. 1, 85–100 (1985).

    Google Scholar 

  28. M. J. Carey and C. D. Thompson, “An efficient implementation of search trees on [log2 N+1] processors,” IEEE Trans. Comput.,33, No. 11, 1038–1041 (1984).

    Google Scholar 

  29. W. Paul, U. Vishkin, and H. Wagener, “Parallel dictionary on 2-3-trees,” Lect. Notes Comput. Sci.,154, 597–609 (1983).

    Google Scholar 

  30. C. Mead and L. Conway, Introduction to VLSI Systems, Addison-Wesley, Reading, Mass. (1980).

    Google Scholar 

  31. C. D. Thompson, “Area-time efficient complexity for VLSI,” Proc. 11th Ann. ACM Symp. Theory Comput. Atlanta (1979), pp. 81–88.

  32. J. Vuillemin, “A combinatorial limit to the computing power of VLSI circuits,” Proc. 21st Ann. Symp. Foundations of Comput. Sci., Syracuse (1980), pp. 924–300.

  33. J. L. Bentley and H. T. Kung, “A tree machine for search problems,” Proc. Int. Conf. Parallel Process., Bellaire (1979), pp. 257–266.

  34. Th. Ottmann, A. L. Rosenberg, and L. J. Stockneyer, “A dictionary machine (for VLSI),” IEEE Trans. Comput.,31, No. 9, 892–897 (1982).

    Google Scholar 

  35. M. J. Atallah and S. R. Kosaraju, “A generalized dictionary machine for VLSI,” IEEE Trans. Comput.,34, No. 2, 151–155 (1985).

    Google Scholar 

  36. A. K. Somani and V. K. Agarwal, “An efficient unsorted VLSI dictionary machine,” IEEE Trans. Comput.,34, No. 9, 841–851 (1985).

    Google Scholar 

  37. M. A. Bonucelli, E. Lodi, F. Luccio, et al., “A VLSI tree machine for relational data bases,” Proc. 10th Ann. Int. Symp. Computer Architecture, Stockholm (1983), pp. 67–73.

  38. S. W. Song, “A highly concurrent tree machine for database application,” Proc. Int. Conf. Parallel Processing, Columbus (1980), pp. 259–268.

  39. A. M. Schwartz and M. C. Loui, “Dictionary machines on cube-connected networks,” IEEE Trans. Comput.,36, No. 1, 100–105 (1987).

    Google Scholar 

  40. H. S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. Comput.,20, No. 2, 151–161 (1971).

    Google Scholar 

  41. H. Schmeck and H. Schroder, “Dictionary machines for different models of VLSI,” IEEE Trans. Comput.,34, No. 5, 472–475 (1985).

    Google Scholar 

Download references

Authors
  1. A. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. B. Shidlovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 35–45, 59, May–June, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anisimov, A.V., Shidlovskii, B.B. Concurrency methods for the dictionary problem: A survey. Cybern Syst Anal 25, 327–340 (1989). https://doi.org/10.1007/BF01069988

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01069988

Keywords

Search

Navigation