Skip to main content
SpringerLink
Log in

Extending STL with efficient data structures

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

Abstract

The Standard Template Library (STL) is a C++ library that provides a set of well structured generic C++ components that work together. Based on its well-structured design, STL can be extended by adding new generic algorithms or new generic containers. In this paper, the work on extending STL by adding several efficient container classes for threaded binary search trees is discussed. It is shown that the addition of threads significantly increases the efficiency of some important access operations on the binary tree containers. In general, significant gain in efficiency can be expected in situations where the data structures are relatively stable, that is, the data structures are looked up often but modified little.

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

References

  1. Stepanov A A, Lee M. The Standard Template Library. Technical Report HPL-94-34, Hewlett-Packard Lab., April 1994.

  2. Musser D R, Stepanov A A. Algorithm-oriented generic libraries.Software — Practice and Experience, 1994, 24(7): 623–642.

    Article  Google Scholar 

  3. Cormen T H, Leiserson C E, Rivest R L. Introduction to Algorithms. The MIT Press, 1991.

  4. Adel'son-Vel'skii G M, Landis E M. An algorithm for the organization of information.Soviet Mathematics Doklady, 1962, 3: 1259–1263.

    Google Scholar 

  5. Knuth D E. The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1973.

    Google Scholar 

  6. Standish T A. Data Structure Techniques. Addison-Wesley, Philippines, 1980.

    Google Scholar 

  7. Kruse R L. Data Structures & Program Design. Prentice-Hall, New Jersey, 1984.

    Google Scholar 

  8. Knuth D E. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, Mass, 1973.

    Google Scholar 

  9. Stroustrup B. The C++ Programming Language. Addison-Wesley, 1991.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Wichita State University, 67260-0083, Wichita, Kansas, USA

    Wu Hong & Nie Xumin

Authors
  1. Wu Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nie Xumin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wu Hong.

Additional information

Wu Hong received her B.S. and M.S. degrees in computer science from Nanjing University in 1990 and 1993 respectively. She received her M.S. degree in computer science in 1996 from Wichita State University in Wichita, Kansas. She is currently a software engineer at Qualcomm Inc. in San Diego, California.

Nie Xumin received his B.S. degree in computer science from Harbin Institute of Technology in 1982, M.S. degree in computer science from Temple University in Philadelphia, USA in 1985, and Ph.D degree in computer science from University of North Carolina at Chapel Hill, USA in 1989. He is currently an Assistant Professor at Wichita State University in Wichita, Kansas.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, H., Nie, X. Extending STL with efficient data structures. J. of Comput. Sci. & Technol. 13, 317–324 (1998). https://doi.org/10.1007/BF02946621

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation