A pruned TRIE to index a sorted file and its evaluation

https://doi.org/10.1016/0306-4379(84)90024-3Get rights and content

Abstract

One of the main performance criteria in a data base management system is data access speed. This speed depends on many factors such as technology, memory organization, access paths… Among those problems, we are interested in indexing a sorted file. An important improvement of the system performance is expected if the index is resident in main memory. We present a TRIE structure [Knuth], the main feature of which is compactness. An analysis of this structure average size is proposed, under different assumptions. Placing this work in the framework of the data base machine VERSO [VERSO], we show that we can maintain the index resident in main memory.

References (20)

  • W.A. Burkhard

    Associative retrieval trie hash coding

    J. Comput. Systems Sci.

    (1977)
  • F. Bancilhon

    A relational backend data base machine

  • J.L. Bentley

    Multidimensional binary search trees for associative searching

    Comm. ACM

    (1975)
  • W.A. Burkhard

    Hashing and trie algorithm for partial match retrieval

    ACM Trans. on Data Base Systems

    (June 1976)
  • Erdeleyi et al.: Higher transcendental...
  • R. Fagin

    Extendible hashing. A fast access method for dynamic files

    TODS

    (1979)
  • P. Flajolet et al.

    A recursive partitioning process on computer science

  • D.G. Keehn et al.

    VSAM data set design parameters

    IBM Systems J.

    (1974)
  • D. E. Knuth: The Art of Computer Programming, Vol....
  • P. Larson

    Dynamic hashing

    BIT

    (1978)
There are more references available in the full text version of this article.

Cited by (1)

View full text