...
首页> 外文期刊>Fuzzy sets and systems >An initial approach to the evaluation of possibilistic queries addressed to possibilistic databases
【24h】

An initial approach to the evaluation of possibilistic queries addressed to possibilistic databases

机译:评估针对可能性数据库的可能性查询的初始方法

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

摘要

It is now recognized that querying databases containing imprecise information raises several problems, including that of the computational complexity of evaluating the query. In this paper, we consider a new kind of query, called possibilistic query, of the form "to what extent is it possible that a given tuple t belongs to the answer of Q", where Q is a regular relational query. The aim is to show that a reasonable complexity can be expected for a specified subset of possibilistic queries.
机译:现在已经认识到,查询包含不精确信息的数据库会引起一些问题,包括评估查询的计算复杂性。在本文中,我们考虑一种新的查询,称为可能性查询,其形式为“给定元组t在多大程度上属于Q的答案”,其中Q是常规关系查询。目的是表明可以为指定的可能性查询子集提供合理的复杂性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号