Boolean similarity measures for resource discovery
Shih-Hao Li, Peter B. Danzig · IEEE Transactions on Knowledge and Data Engineering · 1997
As the number of Internet servers increases rapidly, it becomes difficult to determine the relevant servers when searching for information. The authors develop a new method to rank Internet servers for Boolean queries. Their method reduces time and space complexity from exponential to polynomial in the number of Boolean terms. They contrast it with other known methods and describe its implementation.