Affiliation:
1. Institut de Recherche en Informatique et Systèmes Aléatoires, Ecole Nationale Supérieure des Sciences Appliquées et de Technologie (IRISA-ENSSAT), University of Rennes 1, BP 80518, 22300 Lannion, France
Abstract
In this paper, we give an overview of the most representative approaches aimed at querying databases containing ill-known data, starting from the pioneering works by Codd and Lipski and up to very recent proposals. This study focuses on approaches with a clear and sound semantics, based on the notion of possible worlds. Three types of queries are considered: (i) those about attribute values (in an algebraic or SQL-like framework), (ii) those about the properties satisfied by a given set of worlds (i.e., a set of instances of an imprecise database), and (iii) those about the representation of uncertain data. For the first two types, it is emphasized that a trade-off has to be found between expressivity (of the model) and tractability (of the queries in the context of a given model).
Publisher
World Scientific Pub Co Pte Lt
Subject
Artificial Intelligence,Information Systems,Control and Systems Engineering,Software
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献