Skip to main content
SpringerLink
Log in

Analysis of compact 0-complete trees: A new access method to large databases

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 380))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Bayer and E. McCreight, “Organization and Maintenance of Large Ordered Indexes”, Acta Informatica, 1972, 173–189.

    Google Scholar 

  2. R. Fagin and et.al., “Extendible Hashing—A Fast Access Method for Dynamic Files”, Trans. Database Systems 4, 3 (Sep. 1979), 315–344.

    Article  Google Scholar 

  3. P. Flajolet, “On the Performance Evaluation of Extendible Hashing and Trie Searching”, Acta Inf. 20 (1983), 345–369.

    Google Scholar 

  4. E. Fredkin, “Many-way Information Retrieval”, Comm. of the ACM 3, 9 (Sep. 1960), 490–499.

    Article  Google Scholar 

  5. D. Knuth, The Art of Computer Programming: Sorting and Searching, Addison Wesley, Reading, MA, 1973.

    Google Scholar 

  6. R. Orlandic and J. L. Pfaltz, “Compact 0-Complete Trees”, Proc. 14th Conf. on VLDB, Long Beach, CA, Aug. 1988, 372–381.

    Google Scholar 

  7. R. Orlandic, “Design, Analysis and Applications of Compact 0-Complete Trees”, Ph.D. Dissertation, University of Virginia, Apr. 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Prirodno-matematicki Fakultet, Univerzitet "V. Vlahovic", Titograd, Yugoslavia

    Ratko Orlandic

  2. Department of Computer Science, University of Virginia, 22903, Charlottesville, VA

    John L. Pfaltz

Authors
  1. Ratko Orlandic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John L. Pfaltz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Orlandic, R., Pfaltz, J.L. (1989). Analysis of compact 0-complete trees: A new access method to large databases. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation