This repository contains the source code, scripts, and input data to reproduce the results published in the following paper (soon to be published in the Proceedings of WSDM'22):

Using Conjunctions for Faster Disjunctive Top-k Queries
Michal Siedlaczek, Antonio Mallia, and Torsten Suel.
Proceedings of the 15th ACM International Conference on Web Search and Data Mining. 2022.

This repository contains a Docker image that should pull its own dependencies. However, for an interested reader, these are the projects used in this work:

• PISA (conjunctions-for-disjunctions branch)
• CIFF
• intersect (intersection selection code)