Database Paper Browser

Back to papers

Practical Suffix Tree Construction

Summary: Practical suffix-tree construction for large data; yields persistent suffix-tree indexing for exact and approximate queries. O(n^2) in-memory construction beats O(n) Ukkonen; buffered disk approach scales suffix-tree construction to data far beyond prior work. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9183
Venue
VLDB
Year
2004
Pagerank
8.4894627e-05
Overall Rank
2,586 | 82.03%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
2,235 Effective Phrase Prediction 2007 VLDB 9.2208486e-05
2,251 Genome-scale Disk-based Suffix Tree Indexing 2007 SIGMOD 9.1921005e-05
6,319 ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings 2012 VLDB 5.1083749e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,115 A Database Index to Large Biological Sequences 2001 VLDB 0.00013865352
2,500 OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences 2003 VLDB 8.6388583e-05
Previous Page 1 / 1 Next

Semantically Similar Papers