The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2006 vol.18)
pp: 1659-1666
ABSTRACT
We study the complexity of query satisfiability and entailment for the Boolean Information Retrieval models {\cal WP} and {\cal AWP} using techniques from propositional logic and computational complexity. {\cal WP} and {\cal AWP} can be used to represent and query textual information under the Boolean model using the concept of attribute with values of type text, the concept of word, and word proximity constraints. Variations of {\cal WP} and {\cal AWP} are in use in most deployed digital libraries using the Boolean model, text extenders for relational database systems (e.g., Oracle 10g), search engines, and P2P systems for information retrieval and filtering.
INDEX TERMS
Boolean information retrieval, computational complexity, data models, query languages, satisfiability, entailment, proximity.
CITATION
Manolis Koubarakis, Spiros Skiadopoulos, Christos Tryfonopoulos, "Logic and Computational Complexity for Boolean Information Retrieval", IEEE Transactions on Knowledge & Data Engineering, vol.18, no. 12, pp. 1659-1666, December 2006, doi:10.1109/TKDE.2006.193
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool