Boolean similarity measures for resource discovery

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...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on knowledge and data engineering Vol. 9; no. 6; pp. 863 - 876
Main Authors Shih-Hao Li, Danzig, P.B.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.11.1997
IEEE Computer Society
Subjects
Applied sciences
Computer science; control theory; systems
Computer Society
Computer systems and distributed systems. User interface
Database languages
Exact sciences and technology
File servers
Information retrieval
Information systems. Data bases
Internet
Memory organisation. Data processing
Natural languages
Network servers
Office automation, teleprocessing
Polynomials
Search engines
Software
Web server
Query language
Similarity
Boolean function
Information retrieval
Computational complexity
Implementation
Polynomial time
Remote data processing
Space complexity
Binary tree
Database
Natural language
Internet
Time complexity
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1041-4347
1558-2191
DOI:10.1109/69.649313