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 language | English (US) |
---|---|
Pages | 103-112 |
Number of pages | 10 |
DOIs | |
State | Published - 1997 |
Externally published | Yes |
Event | Proceedings of the 1997 2nd ACM International Conference on Digital Libraries - Philadelphia, PA, USA Duration: Jul 23 1997 → Jul 26 1997 |
Other
Other | Proceedings of the 1997 2nd ACM International Conference on Digital Libraries |
---|---|
City | Philadelphia, PA, USA |
Period | 7/23/97 → 7/26/97 |
ASJC Scopus subject areas
- Software
- Information Systems
- Computer Science Applications
- Library and Information Sciences