Pail: Efficient 𝑘 NN Search on Set-Valued Attributes
Pail is proposed, a 𝑘 NN search algo-rithm for sets that supports a wide range of similarity functions and implements the positional filter directly into a novel index structure to effectively prune candidates.