Answering imprecise database queries: A novel approach

Ullas Nambiar, Subbarao Kambhampati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationProceedings of the Interntational Workshop on Web Information and Data Management
EditorsR. Chiang, A.H.F. Laender, E.-P. Lim
Pages126-133
Number of pages8
StatePublished - 2003
EventWIDM 2003: Proceedings of the Fifth ACM International Workshop on Web Information and Data Management - New Orleans, LA, United States
Duration: Nov 7 2003Nov 8 2003

Other

OtherWIDM 2003: Proceedings of the Fifth ACM International Workshop on Web Information and Data Management
CountryUnited States
CityNew Orleans, LA
Period11/7/0311/8/03

Fingerprint

Schematic diagrams
Information retrieval
User interfaces
Refining

Keywords

  • Imprecise queries
  • Query similarity
  • Relational database

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Nambiar, U., & Kambhampati, S. (2003). Answering imprecise database queries: A novel approach. In R. Chiang, A. H. F. Laender, & E-P. Lim (Eds.), Proceedings of the Interntational Workshop on Web Information and Data Management (pp. 126-133)

Answering imprecise database queries : A novel approach. / Nambiar, Ullas; Kambhampati, Subbarao.

Proceedings of the Interntational Workshop on Web Information and Data Management. ed. / R. Chiang; A.H.F. Laender; E.-P. Lim. 2003. p. 126-133.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nambiar, U & Kambhampati, S 2003, Answering imprecise database queries: A novel approach. in R Chiang, AHF Laender & E-P Lim (eds), Proceedings of the Interntational Workshop on Web Information and Data Management. pp. 126-133, WIDM 2003: Proceedings of the Fifth ACM International Workshop on Web Information and Data Management, New Orleans, LA, United States, 11/7/03.
Nambiar U, Kambhampati S. Answering imprecise database queries: A novel approach. In Chiang R, Laender AHF, Lim E-P, editors, Proceedings of the Interntational Workshop on Web Information and Data Management. 2003. p. 126-133
Nambiar, Ullas ; Kambhampati, Subbarao. / Answering imprecise database queries : A novel approach. Proceedings of the Interntational Workshop on Web Information and Data Management. editor / R. Chiang ; A.H.F. Laender ; E.-P. Lim. 2003. pp. 126-133
@inproceedings{f6f16c8496fe4d838a7314788f1177c6,
title = "Answering imprecise database queries: A novel approach",
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.",
keywords = "Imprecise queries, Query similarity, Relational database",
author = "Ullas Nambiar and Subbarao Kambhampati",
year = "2003",
language = "English (US)",
pages = "126--133",
editor = "R. Chiang and A.H.F. Laender and E.-P. Lim",
booktitle = "Proceedings of the Interntational Workshop on Web Information and Data Management",

}

TY - GEN

T1 - Answering imprecise database queries

T2 - A novel approach

AU - Nambiar, Ullas

AU - Kambhampati, Subbarao

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - Imprecise queries

KW - Query similarity

KW - Relational database

UR - http://www.scopus.com/inward/record.url?scp=18744366648&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=18744366648&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:18744366648

SP - 126

EP - 133

BT - Proceedings of the Interntational Workshop on Web Information and Data Management

A2 - Chiang, R.

A2 - Laender, A.H.F.

A2 - Lim, E.-P.

ER -