Skip to main content

Abstract

We add dynamic capabilities to PATRICIA, the only known sublinear searching algorithm for text databases on secondary storage. This we do by giving constant-time insertion and deletion algorithms for the PATRICIA index and by storing the text on conventional database structures, namely B-trees. We discuss the application of dynamic PATRICIA to an editor for large texts on secondary storage.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • A. V. Aho & M. J. Corasick, 1975. Efficient string matching, CACM 18, 333–40.

    MathSciNet  MATH  Google Scholar 

  • J. C. Bays, 1974. The compleat PATRICIA, Ph.D. dissertation, U. of Oklahoma.

    Google Scholar 

  • R. S. Boyer & J. S. Moore, 1977. A fast string searching algorithm, CACM 20, 10, 762–72.

    Google Scholar 

  • R. Dhillon, 1984. Private communication.

    Google Scholar 

  • D. E. Knuth, 1973. The Art of Computer Programming, vol. III, Sorting and Searching, Addison-Wesley, Reading, Mass.

    Google Scholar 

  • D. E. Knuth, J. H. Morris & V. A. Pratt, 1970. Fast pattern searching in strings, SIAM J. Comput. 6, 2, 323–50.

    MathSciNet  Google Scholar 

  • T. H. Merrett, 1984. Relational Information Systems, Reston Publishing Co. Inc., Reston, Virginia.

    MATH  Google Scholar 

  • T. H. Merrett, 1984a. First steps to algebraic processing of text in G. Gardarin&E. Gelenbe eds., New Applicationf of Databases, Acad. Press, 109–128.

    Google Scholar 

  • D. R. Morrison, 1968. PATRICIA: practical algorithm to retrieve information coded in alphanumeric, JACM 15, 514–34.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Plenum Press, New York

About this chapter

Cite this chapter

Merrett, T.H., Fayerman, B. (1987). Dynamic Patricia. In: Ghosh, S.P., Kambayashi, Y., Tanaka, K. (eds) Foundations of Data Organization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1881-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1881-1_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-9048-3

  • Online ISBN: 978-1-4613-1881-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics