Efficient algorithms for document retrieval problems

@inproceedings{Muthukrishnan2002EfficientAF,
  title={Efficient algorithms for document retrieval problems},
  author={S. Muthukrishnan},
  booktitle={SODA},
  year={2002}
}
We are given a collection D of text documents d1,…,dk, with ∑i = n, which may be preprocessed. In the document listing problem, we are given an online query comprising of a pattern string p of length m and our goal is to return the set of all documents that contain one or more copies of p. In the closely related occurrence listing problem, we output the set of all positions within the documents where pattern p occurs. In 1973, Weiner [24] presented an algorithm with O(n) time and space… CONTINUE READING
Highly Influential
This paper has highly influenced 40 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 305 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
157 Extracted Citations
2 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

306 Citations

02040'04'07'10'13'16
Citations per Year
Semantic Scholar estimates that this publication has 306 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…