The implicit dictionary problem revisited
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].
KeywordsEncode Scheme Binary Search Full Paper Operation Change Operation Insert
Unable to display preview. Download preview PDF.
- H. Alt, K. Mehlhorn, and J.I. Munro, Partial Match Retrieval in Implicit Data Structures, Information Processing Letters, 19, 1984, 61–65.Google Scholar
- 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
- 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
- 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
- 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
- J.I. Munro, A Multikey Search Problem, Proceedings of the Allerton Conference on Communication, Control, and Computing, 1979, 241–244.Google Scholar