A first approach to possibilistic queries addressed to possibilistic databases

被引：0

作者：

Bosc, P ^{[1
]}

Duval, L ^{[1
]}

Pivert, O ^{[1
]}

机构：

[1] ENSSAT, IRISA, Lannion, France

来源：

JOINT 9TH IFSA WORLD CONGRESS AND 20TH NAFIPS INTERNATIONAL CONFERENCE, PROCEEDINGS, VOLS. 1-5 | 2001年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

It is now recognized that querying databases containing imprecise information raises several problems, including that of complexity. In this paper, we consider a new kind of queries, called possibilistic queries, of the form "to what extent is it possible that a given tuple t belongs to the answer of Q (a regular relational query)". This paper is a first attempt to show that a reasonable complexity can be expected for a specified subset of possibilistic queries.

引用

页码：2452 / 2457

页数：6