Implicit Data Structures for the Dictionary Problem

Several new data structures for dictionaries are presented that use just one location in addition to those required for key values. The structures are generahzations of a rotated sorted list, with the best realizing a search tune of O(log n) and insemon and deletion tunes of O(n ~ ( l o g n) 3/2) Structures adapted to allow fast average search times and structures that allow pamal match retrieval on records wRh d keys, d > 1, are also considered.

[1]  Jon Louis Bentley,et al.  Decomposable Searching Problems I: Static-to-Dynamic Transformation , 1980, J. Algorithms.

[2]  Andrew Chi-Chih Yao,et al.  The complexity of searching an ordered random table , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[3]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[4]  W. W. Peterson,et al.  Addressing for Random-Access Storage , 1957, IBM J. Res. Dev..

[5]  Alon Itai,et al.  Interpolation search—a log logN search , 1978, CACM.

[6]  Greg N. Frederickson.  Recursively Rotated Orders and Implicit Data Structures: A Lower Bound , 1984, Theor. Comput. Sci..

[7]  J. Ian Munro,et al.  Implicit Data Structures for Fast Search and Update , 1980, J. Comput. Syst. Sci..

[8]  Yehoshua Perl,et al.  Understanding the Complexity of Interpolation Search , 1977, Inf. Process. Lett..

[9]  Greg N. Frederickson,et al.  Implicit data structures with fast update , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[10]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[11]  Kurt Mehlhorn,et al.  Partial Match Retrieval in Implicit Data Structures , 1981, Inf. Process. Lett..

[12]  Ronald L. Rivest,et al.  Partial-Match Retrieval Algorithms , 1976, SIAM J. Comput..