Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 166

The DOI matches its OpenAlex record.

Efficient suffix trees on secondary storage

David Richard Clark, J. Ian Munro · 1996 · Symposium on Discrete Algorithms
DOI 10.5555/313852.314087

Abstract

We present a new representation for suffix trees, a data structure used in full text searching, that uses little more storage than the log n bits per index point required to store the list of index points. We also show algorithms for maintaining the structure on secondary storage in such a way that we minimize the number of disk accesses while searching and we can efficiently handle changes to the text. Using this new representation, suffix trees are competitive in terms of space with, and actually offer significantly better performance than, existing methods for full text searching. While we present new algorithms and data structures in this paper, the emphasis is on practical searching methods that have been empirically verified against real data.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

OpenAlex · 10.5555/313852.314087

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 166

Metadata

Authors
Clark, D. R., & Munro, J. I.
Venue
Symposium on Discrete Algorithms
Published
1996-01-28
Pages
383-391
DOI
10.5555/313852.314087
OpenAlex
W1978294273
Cited by
166
References
0
FWCI
4.81
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Efficient suffix trees on secondary storage. https://app.cochat.ai/papers/10.5555/313852.314087
The paper
Clark, D. R., & Munro, J. I. (1996). Efficient suffix trees on secondary storage. Symposium on Discrete Algorithms. https://doi.org/10.5555/313852.314087

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.