Title :
Boolean similarity measures for resource discovery
Author :
Li, Shih-Hao ; Danzig, Peter B.
Author_Institution :
Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA
Abstract :
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
Keywords :
Boolean algebra; Internet; computational complexity; network servers; query processing; Boolean queries; Boolean similarity measures; Boolean terms; Internet server ranking; information searching; resource discovery; space complexity; time complexity; Computer Society; Database languages; File servers; Information retrieval; Internet; Natural languages; Network servers; Polynomials; Search engines; Web server;
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
