Boolean Text Query Optimization
Dr. Byung S. Lee
Department of Computer Science
Date:
Time:
Location: 367 Votey
Abstract
A conjunctive Boolean text query is a used to search for text documents containing all the keywords. The query often specifies a long list of keywords for better precision. In this case, the order of keyword processing has a significant impact on the query speed. Currently known approaches to this ordering are based on heuristics, and cannot guarantee an optimal ordering. We observe that a text query can be processed as a relational join query and, thus, can benefit from a relational query optimization technique. In this talk, we present a technique that finds a globally optimal join sequence in O(nlogn) time.
(This
is a joint work with