• Computer Science
  • Published in SODA 1997

Fast Algorithms for Sorting and Searching Strings

@inproceedings{Bentley1997FastAF,
  title={Fast Algorithms for Sorting and Searching Strings},
  author={Jon Louis Bentley and Robert Sedgewick},
  booktitle={SODA},
  year={1997}
}
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. The sorting algorithm blends Quicksort and radix sort; it is competitive with the best known C sort codes. The searching algorithm blends tries and binary search trees; it is faster than hashing and other commonly used search methods. The basic ideas behind the algorithms date back at least to the 1960s, but their… CONTINUE READING

Figures, Tables, and Topics from this paper.

Citations

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

Compression techniques for fast external sorting

  • The VLDB Journal
  • 2006
VIEW 20 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

An experimental study of an opportunistic index

VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Adaptive Algorithms for Cache-Efficient Trie Search

VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Performance Improvement for Multi-Key Quick Sort using Kepler GPUs

Bharath Shamasundar, Amoolya Shetty, A. Suryachandra Rao, Supreetha Shetty, Neelima Bayyapu
  • 2015
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Structured annotations of web queries

VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

An Analysis of the Height of Tries with Random Weights on the Edges

  • Combinatorics, Probability & Computing
  • 2008
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Shedding new light on random trees

VIEW 8 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

The Height of List-tries and TST

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1997
2019

CITATION STATISTICS

  • 52 Highly Influenced Citations

References

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

Expected Time Bounds for Selection

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

The Art of Computer Programming, volume 3: Sorting and Searching

D. E. Knuth
  • 1975
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Engineering Radix Sort

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL