【24h】

Answering Imprecise Database Queries : A Novel Approach

机译:回答不精确的数据库查询:一种新颖的方法

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:外部用户可以使用越来越多的数据库,尤其是那些在Web上发布的数据库。为这些数据库的用户提供了简单的基于表单的查询界面,这些界面隐藏了底层的原理图细节。受查询界面表达能力的限制,用户通常很难在数据库上表达精确的查询。在此类系统上支持不精确的查询将使用户能够快速找到相关的答案,而无需反复完善他们的查询。为了使数据库支持不精确的查询,它们必须提供与查询约束紧密匹配的答案。在本文中,我们专注于在不更改现有数据库系统的情况下回答不精确的用户查询。我们建议通过标识一组相关的精确查询来支持对数据库的不精确查询,这些相关精确查询可提供与用户给定查询相关的答案。我们提出一种基于信息检索技术的领域独立方法,以估计查询之间的距离。为了证明我们方法的实用性和实用性,我们进行了可用性测试并提供了结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号