This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Arithmetic Interpolation Search for Alphabet Tables
April 1992 (vol. 41 no. 4)
pp. 493-499

The inefficiency of interpolation search for an alphabetic table has been demonstrated by F.W. Burton and G.N. Lewis (1980). This inefficiency is expected since such tables are usually far from uniform in distribution. However, for nonuniformly distributed tables for which the cumulative distribution function F is known, applying F to the keys yields uniform distribution for which interpolation search is very fast. In arithmetic coding a string of characters is mapped into the (0, 1) interval according to the probabilities of its characters. It is found that this transformation, designed for data compression, is actually the cumulative distribution function F for alphabetic tables. Experiments confirm that interpolation search on alphabetic tables, applying arithmetic coding to the character strings in a sophisticated way, shows a performance very close to lg lg n accesses. Hence, a new fast search technique for alphabetic tables is designed.

[1] F. W. Burton and G. N. Lewis, "A robust variation of interpolation search,"Inform. Processing Lett., vol. 10, pp. 198-201, 1980.
[2] W. Feller,An Introduction to Probability Theory and its Applications, Vol. 1third ed. New York: Wiley, 1968.
[3] K. E. Foster, "A statistically based interpolation binary search," T. R., Winthrop College, SC.
[4] G. Frederickson, "Implicit data structures for the dictionary problem,"J. ACM, vol. 30, pp. 80-94, 1983.
[5] G. H. Gonnet, L. D. Rogers, and J. A. George, "An algorithmic and complexity analysis of interpolation search,"Acta Informatica, vol. 13, pp. 39-52, 1980.
[6] A. Itai, A. G. Konheim, and M. Rodeh, "A sparse table implementation of priority queues," inProc. Eighth ICALP Conf. Automata Languages and Programming, 1981, pp. 417-431.
[7] G. G. Langdon, "An introduction to arithmetic coding,"IBM J. Res. Develop., vol. 28, no. 2, pp. 135-149, 1984.
[8] K. Melhorn and A. Tsakalidis, "Dynamic interpolation search," inProc. Twelfth ICALP Conf. Automata Languages and Programming, 1985, pp. 424-439.
[9] Y. Perl, "Optimum split trees,"J. Algorithms, vol. 5, pp. 364-374, 1984.
[10] W. W. Peterson, "Addressing for random access storage,"IBM J. Res. Develop., pp. 131-132, 1957.
[11] Y. Perl, A. Itai, and H. Avni, "Interpolation search--A Lg Lg N search,"Commun. ACM, vol. 21, pp. 550-553, 1978.
[12] Y. Perl and E. M. Reingold, "Understanding the complexity of interpolation search,"Inform. Processing Lett., vol. 6, pp. 219-222, 1977.
[13] B. A. Shell, "Median split trees: A fast lookup technique for frequently occurring keys,"Commun. ACM, vol. 21, pp. 947-958, 1978.
[14] N. Santoro and J. B. Sidney, "Interpolation binary search,"Inform. Processing Lett., vol. 20, pp. 179-181, 1985.
[15] D. E. Willard, "Surprisingly efficient search algorithms for nonuniformly generated fields," inProc. Twelfth Allerton Conf. Commun., Contr. Comput., 1983, pp. 656-662.
[16] D. E. Willard, "Searching unindexed and nonuniformly generated files in lg lg N time,"SIAM J. Comput., vol. 14, pp. 1013-1029, 1985.
[17] A. C. Yao and F. F. Yao, "The complexity of searching on ordered random table," inProc. Seventeenth Annu. Symp. Foundations Comput. Sci., 1976, pp. 173-177.
[18] I. H. Witten, R. M. Neal, and J. G. Cleary, "Arithmetic coding for data compression,"Commun. ACM, vol. 30, pp. 520-540, 1987.

Index Terms:
alphabet tables; interpolation search; database theory; search problems.
Citation:
Y. Perl, L. Gabriel, "Arithmetic Interpolation Search for Alphabet Tables," IEEE Transactions on Computers, vol. 41, no. 4, pp. 493-499, April 1992, doi:10.1109/12.135562
Usage of this product signifies your acceptance of the Terms of Use.