Skip to main content
SpringerLink
Log in

The implicit dictionary problem revisited

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1992)

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

Included in the following conference series:

  • 126 Accesses

Abstract

In this paper we give an implicit data structure for storing a set of 2-key records; it can support the operations insert, delete, and search under either key in O((lg3 n(lg Ig n)2) time, where n is number of records currently in the data structure. The data structure can be generalized to handle k-key records for any k > 2 and the time complexity of each operation becomes O(lgk+1 n(lg lg n)2). Prior to our work, finding an implicit data structure to support such operations in polylogarithmic time was an open problem [8, 4].

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. H. Alt, K. Mehlhorn, and J.I. Munro, Partial Match Retrieval in Implicit Data Structures, Information Processing Letters, 19, 1984, 61–65.

    Google Scholar 

  2. A. Borodin, F.E. Fich, F. Meyer Auf Der Heidej, E. Upfal, and A. Wigderson, Tradeoff Between Search and Update Time for the Implicit Dictionary Problem, Theoretical Computer Science, 58, 1988, 57–68.

    Article  Google Scholar 

  3. S. Carlsson, J.I. Munro, and P.V. Poblete, An Implicit Binomial Queue with Constant Insertion time, Proceedings of the Scandinavian Workshop on Algorithm Theory, 1988, 1–13.

    Google Scholar 

  4. A. Fiat, M. Naor, A.A. SchÄffer, J.P. Schmidt, and A. Siegel, Storing and Searching a Multikey Table, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 1988, 344–353.

    Google Scholar 

  5. G.N. Frederickson, Implicit Data Structures for Dictionary Problem, Journal of the ACM, 30, 1983, 80–94.

    Article  Google Scholar 

  6. G. Gambosi, E. Nardelli, and M. Talamo, A Pointer-free Data Structure for Merging Heaps and Min-max Heaps, Theoretical Computer Science, 84, 1991, 107–126.

    Article  Google Scholar 

  7. J.I. Munro, An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log2 n) Time, Journal of Computer and System Sciences, 33, 1986, 66–74.

    Google Scholar 

  8. J.I. Munro, Searching a Two Key Table Under a Single Key, Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 1987, 383–387.

    Google Scholar 

  9. J.I. Munro, A Multikey Search Problem, Proceedings of the Allerton Conference on Communication, Control, and Computing, 1979, 241–244.

    Google Scholar 

  10. J.I. Munro and H. Suwanda, Implicit Data Structures for Fast Search and Update, Journal of Computer and System Sciences, 21, 1980, 236–250.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong

    Tak Wah Lam & Ka Hing Lee

Authors
  1. Tak Wah Lam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ka Hing Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Toshihide Ibaraki Yasuyoshi Inagaki Kazuo Iwama Takao Nishizeki Masafumi Yamashita

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lam, T.W., Lee, K.H. (1992). The implicit dictionary problem revisited. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds) Algorithms and Computation. ISAAC 1992. Lecture Notes in Computer Science, vol 650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56279-6_100

Download citation

  • DOI: https://doi.org/10.1007/3-540-56279-6_100

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47501-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation