Boolean query mapping across heterogeneous information sources

Kevin Chen Chuan Chang, Hector Garcia-Molina, Andreas Paepcke

Research output: Contribution to journalArticle

Abstract

Searching over heterogeneous information sources is difficult because of the nonuniform query languages. 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 result. In this paper we introduce the architecture and associated algorithms for generating the supported subsuming queries and filters. We show that generated subsuming queries return a minimal number of documents; we also discuss how minimal cost filters can be obtained. We have implemented prototype versions of these algorithms and demonstrated them on heterogeneous Boolean systems.

Original languageEnglish (US)
Pages (from-to)515-521
Number of pages7
JournalIEEE Transactions on Knowledge and Data Engineering
Volume8
Issue number4
DOIs
StatePublished - Dec 1 1996
Externally publishedYes

Keywords

  • Boolean queries
  • Digital libraries
  • Filtering
  • Heterogeneity
  • Information retrieval
  • Query subsumption
  • Query translation

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Boolean query mapping across heterogeneous information sources'. Together they form a unique fingerprint.

  • Cite this