Evaluating the cost of Boolean query mapping

C. C.K. Chang, H. Garcia-Molina

Research output: Contribution to conferencePaper

Abstract

Non-uniform query languages make searching over heterogeneous information sources difficult. 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 filter query to yield the correct final results. This post-filtering approach may involve significant cost because the documents that the users will not see may have to be retrieved and filtered. There are generally two ways to implement post-filtering: batch post-filtering and incremental post-filtering. 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-filtering cost may be acceptable, while the batch post-filtering cost may sometimes be extremely large.

Original languageEnglish (US)
Pages103-112
Number of pages10
DOIs
StatePublished - Jan 1 1997
Externally publishedYes
EventProceedings of the 1997 2nd ACM International Conference on Digital Libraries - Philadelphia, PA, USA
Duration: Jul 23 1997Jul 26 1997

Other

OtherProceedings of the 1997 2nd ACM International Conference on Digital Libraries
CityPhiladelphia, PA, USA
Period7/23/977/26/97

ASJC Scopus subject areas

  • Computer Science(all)
  • Social Sciences(all)

Fingerprint Dive into the research topics of 'Evaluating the cost of Boolean query mapping'. Together they form a unique fingerprint.

  • Cite this

    Chang, C. C. K., & Garcia-Molina, H. (1997). Evaluating the cost of Boolean query mapping. 103-112. Paper presented at Proceedings of the 1997 2nd ACM International Conference on Digital Libraries, Philadelphia, PA, USA, . https://doi.org/10.1145/263690.263802