Patricia tries again revisited

@article{Szpankowski1990PatriciaTA,
  title={Patricia tries again revisited},
  author={Wojciech Szpankowski},
  journal={J. ACM},
  year={1990},
  volume={37},
  pages={691-711}
}
  • Wojciech Szpankowski
  • Published in JACM 1990
  • Mathematics, Computer Science
  • J. ACM
  • The Patricia trie is a simple modification of a regular trie. By eliminating unary branching nodes, the Patricia achieves better performance than regular tries. However, the question is: how much on the average is the Patricia better? This paper offers a thorough answer to this question by considering some statistics of the number of nodes examined in a <italic>successful search</italic> and an <italic>unsuccessful search</italic> in the Patricia tries. It is shown that for the Patricia… CONTINUE READING

    Tables and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 52 CITATIONS

    Renewal theory in the analysis of tries and strings

    • Svante Janson
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 2009
    VIEW 9 EXCERPTS
    CITES RESULTS
    HIGHLY INFLUENCED

    Burst tries: a fast, efficient data structure for string keys

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors

    VIEW 4 EXCERPTS
    CITES BACKGROUND

    Limiting Distribution for the Depth in Patricia Tries

    VIEW 4 EXCERPTS

    Asymmetric Rényi Problem

    VIEW 1 EXCERPT

    LSHiForest: A Generic Framework for Fast Tree Isolation Based Ensemble Anomaly Analysis

    FILTER CITATIONS BY YEAR

    1988
    2019

    CITATION STATISTICS

    • 2 Highly Influenced Citations

    References

    Publications referenced by this paper.
    SHOWING 1-4 OF 4 REFERENCES

    Analysis of a recurrence equation arising in stack-type algorithms for collision-dctecting channels

    • W Szpankowski
    • Proc. Intern. Seminar on Computer Networking and PerformanceEvaluation
    • 1985
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Some further results on digital trees

    • P Kirschenhofer, R Prodinger
    • Some further results on digital trees
    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Handbook ofmathematical functions

    • Abramowitz, I.M.• Stegun
    • 1964
    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    Combinatorial identities

    • J Riordan
    • Combinatorial identities
    • 1968
    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL