Chang, C. and Garcia-Molina, H. (1997) Evaluating the Cost of Boolean Query Mapping. In: Second ACM international conference on Digital libraries (DL 1997) , July 23 - 26, 1997, Philadelphia, Pennsylvania .
Non-uniform query languages make searching over heterogeneous information sources difcult. Our approach is to allow a user to compose Boolean queries in one rich front-end language. For each user query and target source, we transform the user query into a subsuming query that can be supported by the source but that may return extra documents. The results are then processed by a lter query to yield the correct nal results. This post-ltering approach may involve signicant cost because the documents that the users will not see may have to be retrieved and ltered. There are generally two ways to implement post-ltering: batch post-ltering and incremental post-ltering. In this paper we evaluate the costs of both methods for different search features such as proximity operators. The experimental results show that in many cases incremental post-ltering cost may be acceptable, while the batch post-ltering cost may sometimes be extremely large.
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||Previous number = SIDL-WP-1997-0053|
|Uncontrolled Keywords:||Boolean queries, query translation, cost evaluation, information retrieval, heterogeneity, digital libraries, query subsumption, filtering.|
|Subjects:||Computer Science > Digital Libraries|
Computer Science > Query Processing
|Related URLs:||Project Homepage||http://www-diglib.stanford.edu/diglib/pub/|
|Deposited By:||Import Account|
|Deposited On:||25 Feb 2000 16:00|
|Last Modified:||01 Jan 2009 11:45|
Repository Staff Only: item control page