Grid file algorithms: An analysis in the biased case

  • Mireille Regnier
Session 7 Algorithms And Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 181)


Multi-key access to records in a dynamically growing file may be performed using grid file algorithms[7]. We specify two of them, that generalize mono-dimensional dynamic hashing. Then, we derive the average sizes of the associated directories and provide an asymptotic analysis for uniform and biased distributions. The growth of the indexes is non linear; for uniform distributions, sizes are: \(O(n^{1 + \tfrac{1}{b}} )\)or \(O(n^{1 + \tfrac{{s - 1}}{{sb + 1}}} )\), where s is the number of attributes being used, n the file size, and b the page capacity of the system. At last, we compare exact values and asymptotics and study the robustness of grid file algorithms with respect to the bias of the distribution.


Asymptotic Expansion Multidimensional Case Secondary Memory Disk Access Laplace Method 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Regnier, "On the Average Height of Trees in Digital Search and Dynamic Hashing," IPL 13 pp. 64–66 (1981).Google Scholar
  2. 2.
    Ph. Flajolet, "On the Performance Evaluation of Extendible Hashing and Trie Searching," Acta Informatica 20 pp. 345–369 (1983).Google Scholar
  3. 3.
    W.A. Burkhard, "Interpolation-Based Index Maintenance," BIT 23 pp. 274–294 (1983).Google Scholar
  4. 4.
    Doetsch, Handbuch der Laplace Transformation, Birkhauser (1950).Google Scholar
  5. 5.
    R. Fagin, J. Nievergelt, N. Pippenger, and H.R. Strong, "Extendible Hashing: A Fast Access Method for Dynamic Files," ACM TODS 4,3 pp. 315–344 (1979).Google Scholar
  6. 6.
    Ph. Flajolet, M. Regnier, and R. Sedgewick, "Mellin Transform Techniques for the Analysis of Algorithms," in preparation, (1984).Google Scholar
  7. 7.
    J. Nievergelt, H. Hinterberger, and K.C. Sevcik, "The Grid-file: an Adaptable Symmetric Multi-Key File Structure," ACM TODS 9, 1 (1984).Google Scholar
  8. 8.
    J.W. Lloyd and K. Ramamohanarao, "Partial-Match Retrieval for Dynamic Files," BIT 22 pp. 150–168 (1982).Google Scholar
  9. 9.
    P.A. Larson, "Dynamic Hashing," BIT 18 pp. 184–201 (1978).Google Scholar
  10. 10.
    H. Mendelson, "Analysis of Extendible Hashing," IEEE Trans. on Software Engineering, pp. 611–624 (1982).Google Scholar
  11. 11.
    T.H. Merrett and E.J. Otoo, "A Storage Scheme for Extendible Arrays," Computing, (1983), To appearGoogle Scholar
  12. 12.
    C. Puech and Ph. Flajolet, "Tree Structure for Partial Match Retrieval," INRIA Research Report 233 (1983). submitted to JACMGoogle Scholar
  13. 13.
    M. Regnier, "Evaluation des performances du hachage dynamique," These de 3-eme cycle, Universite d'Orsay, (1983).Google Scholar
  14. 14.
    M. Tamminen, "The Extendible Cell Method for Closest Point Problems," BIT 22 pp. 27–41 (1982).Google Scholar
  15. 15.
    A.C. Yao, "A Note on the Analysis of Extendible Hashing," IPL 11 pp. 84–86 (1980).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Mireille Regnier
    • 1
  1. 1.INRIA RocquencourtChesnayFrance

Personalised recommendations