Database Paper Browser

Back to papers

An Efficient Index Structure for String Databases

Summary: Substrings mapped to an integer space by wavelet coefficients for scalable, on-disk substring search. MBR-based indexing with a lower-bound edit-distance proxy enables NN and range pruning, yielding 50–95% pruning and substantial I/O/CPU savings. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8759
Venue
VLDB
Year
2001
Pagerank
6.2805237e-05
Overall Rank
4,333 | 69.86%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

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
665 Fast Nearest Neighbor Search in Medical Image Databases 1996 VLDB 0.00018451109
802 Optimal Multi-Step k-Nearest Neighbor Search 1998 SIGMOD 0.00016502317
Previous Page 1 / 1 Next

Semantically Similar Papers