# Space-Efficient Framework for Top-k String Retrieval Problems

@article{Hon2009SpaceEfficientFF,
title={Space-Efficient Framework for Top-k String Retrieval Problems},
author={Wing-Kai Hon and Rahul Shah and Jeffrey Scott Vitter},
journal={2009 50th Annual IEEE Symposium on Foundations of Computer Science},
year={2009},
pages={713-722}
}
Given a set ${\cal D}=\{d_1, d_2,..., d_D\}$ of $D$strings of total length $n$, our task is to report the "most relevant"strings for a given query pattern $P$. This involves somewhat more advanced query functionality than the usual pattern matching, as some notion of "most relevant" is involved. In information retrieval literature, this task is best achieved by using inverted indexes. However, inverted indexes work only for some predefined set of patterns. In the pattern matching community, the… CONTINUE READING

#### Citations

##### Publications citing this paper.
SHOWING 1-10 OF 78 CITATIONS, ESTIMATED 53% COVERAGE
Highly Influenced
5 Excerpts
Highly Influenced
4 Excerpts
Highly Influenced
14 Excerpts
Highly Influenced
10 Excerpts

#### 146 Citations

Citations per Year
Semantic Scholar estimates that this publication has 146 citations based on the available data.

See our FAQ for additional information.

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 36 REFERENCES
Highly Influential
4 Excerpts
Highly Influential
18 Excerpts
Highly Influential
3 Excerpts
Highly Influential
3 Excerpts