Suppose you want to find documents that contain at least k of a given set of n

Question:

Suppose you want to find documents that contain at least k of a given set of n keywords. Suppose also you have a keyword index that gives you a (sorted) list of identifiers of documents that contain a specified keyword. Give an efficient algorithm to find the desired set of documents.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Database System Concepts

ISBN: 978-0072554816

4th Edition

Authors: Henry F. Korth, S. Sudarshan

Question Posted: