Efficient algorithms for document retrieval problems
Published in Symposium on Discrete Algorithms • Jan 6, 2002
Authors:
S. Muthukrishnan
Abstract
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 cl...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!