Fast Prefix Matching of Bounded Strings

@article{Buchsbaum2003FastPM,
  title={Fast Prefix Matching of Bounded Strings},
  author={Adam L. Buchsbaum and Glenn S. Fowler and Balachander Krishnamurthy and Kiem-Phong Vo and Jia Wang},
  journal={ACM Journal of Experimental Algorithmics},
  year={2003},
  volume={8}
}
Longest Prefix Matching (LPM) is the problem of finding which string from a given set is the longest prefix of another, given string. LPM is a core problem in many applications, including IP routing, network data clustering, and telephone network management. These applications typically require very fast matching of bounded strings, i.e., strings that are short and based on small alphabets. We note a simple correspondence between bounded strings and natural numbers that maps prefixes to nested… CONTINUE READING

From This Paper

Topics from this paper.
11 Citations
6 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Similar Papers

Loading similar papers…