This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Crochemore M, Hancart C, Lecroq T. Algorithms on strings. Cambridge: Cambridge University Press; 2007.
de la Briandais R. File searching using variable length keys. In: Proceedings of the Western Joint Computer Conference; 1959. p. 295–8.
Fredkin E. Trie memory. Commun ACM. 1960;3(9):490–9.
Gonnet GH, Baeza-Yates R. Handbook of algorithms and data structures – in Pascal and C. 2nd ed. Addison-Wesley, Reading, 1991.
Gusfield D. Algorithms on strings, trees and sequences. Cambridge: Cambridge University Press; 1997.
Knuth DE. The art of computer programming. Volume 3: sorting and searching. 3rd ed. Addison-Wesley, Reading; 1997. Section 6.3: digital searching, p. 492–512.
Morrison DR. PATRICIA – practical algorithm to retrieve information coded in alphanumeric. J ACM. 1968;15(4):514–34.
Sedgewick R, Flajolet P. An introduction to the analysis of algorithms. Reading: Addison-Wesley; 1996.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Crochemore, M., Lecroq, T. (2018). Trie. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1143
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1143
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering