Abstract
A growing number of databases especially those published on the Web are becoming available to external users. Users of these databases are provided simple form-based query interfaces that hide the underlying schematic details. Constrained by the expressiveness of the query interface users often have difficulty in articulating a precise query over the database. Supporting imprecise queries over such systems would allow users to quickly find relevant answers without iteratively refining their queries. For databases to support imprecise queries they must provide answers that closely match the query constraints. In this paper we focus on answering imprecise user queries without changing the existing database system. We propose to support imprecise queries over a database by identifying a set of related precise queries that provide answers that are relevant to the user given query. We present a domain independent approach based on information retrieval techniques to estimate the distance between queries. To demonstrate the utility and usefulness of our approach we perform usability tests and provide results.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the Interntational Workshop on Web Information and Data Management |
| Editors | R. Chiang, A.H.F. Laender, E.-P. Lim |
| Pages | 126-133 |
| Number of pages | 8 |
| State | Published - 2003 |
| Event | WIDM 2003: Proceedings of the Fifth ACM International Workshop on Web Information and Data Management - New Orleans, LA, United States Duration: Nov 7 2003 → Nov 8 2003 |
Other
| Other | WIDM 2003: Proceedings of the Fifth ACM International Workshop on Web Information and Data Management |
|---|---|
| Country/Territory | United States |
| City | New Orleans, LA |
| Period | 11/7/03 → 11/8/03 |
Keywords
- Imprecise queries
- Query similarity
- Relational database
ASJC Scopus subject areas
- Computer Networks and Communications
- Information Systems