Advertisement

The implicit dictionary problem revisited

  • Tak Wah Lam
  • Ka Hing Lee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)

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((lg3n(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+1n(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].

Keywords

Encode Scheme Binary Search Full Paper Operation Change Operation Insert 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [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.CrossRefGoogle Scholar
  3. [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. [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. [5]
    G.N. Frederickson, Implicit Data Structures for Dictionary Problem, Journal of the ACM, 30, 1983, 80–94.CrossRefGoogle Scholar
  6. [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.CrossRefGoogle Scholar
  7. [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. [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. [9]
    J.I. Munro, A Multikey Search Problem, Proceedings of the Allerton Conference on Communication, Control, and Computing, 1979, 241–244.Google Scholar
  10. [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.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Tak Wah Lam
    • 1
  • Ka Hing Lee
    • 1
  1. 1.Department of Computer ScienceThe University of Hong KongPokfulamHong Kong

Personalised recommendations