Advertisement

A branching process arising in dynamic hashing, trie searching and polynomial factorization

  • Philippe Flajolet
  • Jean-Marc Steyaert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)

Abstract

We obtain average value and distribution estimates for the height of a class of trees that occurs in various contexts in computer algorithms : in trie searching, as index in several dynamic schemes and as an underlying partition structure in polynomial factorization algorithms. In particular, results given here completely solve the problem of analyzing Extendible Hashing for which practical conclusions are given. The treatment relies on the saddle point method of complex analysis which is used here for extracting coefficients of a probability generating function, and on a particular technique that reveals periodic fluctuations in the behaviour of algorithms which are precisely quantified.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CZ81]
    Cantor D.G. and Zassenhaus H.: “On Algorithms for Factoring Polynomials over Finite Fields”, Math. of Comp. 36 (1981)pp 587–592Google Scholar
  2. [DB61]
    De Bruijn N.G.: Asymptotic Methods in Analysis, North-Holland P.C., Amsterdam (1961)Google Scholar
  3. [DB62]
    David F.N. and Barton D.E., Combinatorial Chance, Charles Griffin, London (1962).Google Scholar
  4. [FNPS]
    Fagin R., Nievergelt J., Pippenger N. and Strong H.R., “Extendible Hashing — A Fast Access Method for Dynamic Files”, ACM Trans. on Database System, 4 (1979) pp. 315–344.Google Scholar
  5. [FO81]
    Flajolet P. and Odlyzko A.: “The Average Height of Binary Trees and Other Simple Trees”, JCSS to appearGoogle Scholar
  6. [Go80]
    Gonnet G., “Expected Length of the Longest Probe Sequence in Hashing”, JACM 28 (1980) pp. 289–304Google Scholar
  7. [He78]
    Henrici P., Applied and Computational Complex Analysis, Vol. 2, J. Wiley, New York (1978)Google Scholar
  8. [Kn69]
    Knuth D.E.: The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading (1969)Google Scholar
  9. [Kn73]
    Knuth D.E., The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading (1973).Google Scholar
  10. [La78]
    Larson P.A., “Dynamic Hashing”, BIT 18 (1978) pp. 184–201.Google Scholar
  11. [La81]
    Lazard D, “Factorisation des PolynÔmes”, in 4‡ Journées Algorithmiques, Poitiers (1981), also sumbitted for publication.Google Scholar
  12. [Li78]
    Litwin W., “Virtual Hashing: A Dynamically Changing Hashing”, in Proc. Very Large Data Bases Conf., Berlin (1978) pp. 517–523.Google Scholar
  13. [Me80]
    Mendelson H., “Extendible Hashing: Analysis for Design”, Rochester University Report nℴ 8019 (1980).Google Scholar
  14. [Re81]
    Regnier M., “On the Average Height of Trees in Digital Searching and Dynamic Hashing”, IPL (to appear).Google Scholar
  15. [Ro79]
    Robson J.M.: “The Height of Binary Search Trees”, Austral. Comp. J. 11 (1979) pp 151–153.Google Scholar
  16. [Ya80]
    Yao A., “A Note On the Analysis of Extendible Hashing”, IPL 11 (1980) pp. 84–86.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Philippe Flajolet
    • 1
  • Jean-Marc Steyaert
    • 2
  1. 1.INRIARocquencourtFrance
  2. 2.Ecole PolytechniquePalaiseauFrance

Personalised recommendations