Issue No. 06 - November-December (1997 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.649313
<p><b>Abstract</b>—As the number of Internet servers increases rapidly, it becomes difficult to determine the relevant servers when searching for information. We develop a new method to rank Internet servers for Boolean queries. Our method reduces time and space complexity from exponential to polynomial in the number of Boolean terms. We contrast it with other known methods and describe its implementation.</p>
Boolean query, information retrieval, ranking, resource discovery, similarity measure.
Peter B. Danzig, Shih-Hao Li, "Boolean Similarity Measures for Resource Discovery", IEEE Transactions on Knowledge & Data Engineering, vol. 9, no. , pp. 863-876, November-December 1997, doi:10.1109/69.649313