This program implements several methods for solving the AllPairs Similarity Search problem for cosine similarity and Tanimoto coefficient, including AllPairs, MMJoin, MK-Join, IdxJoin, L2AP and TAPNN.

Please cite the following paper(s) if you make use of this program or any of its components in your research.

For Cosine APSS (L2AP), please cite:

David C. Anastasiu and George Karypis. L2AP: Fast Cosine Similarity Search With Prefix L-2 Norm Bounds. Proceedings of the 30th IEEE International Conference on Data Engineering (ICDE 2014).

For Tanimoto APSS (TAPNN), please cite:

David C. Anastasiu and George Karypis. Efficient Identification of Tanimoto Nearest Neighbors. Proceedings of the 3rd IEEE International Conference on Data Science and Advanced Analytics (DSAA 2016).