We describe the theory and implementation of a general theorem-proving technique for checking integrity of deductive databases recently proposed by Sadri and Kowalski. The method uses an extension of the SLDNF proof procedure and achieves the effect of the simplification algorithms of Nicolas, Lloyd, Topor et al, and Decker by reasoning forwards from the update and thus focusing on the relevant...

The advantages brought by the proper management of information in terms of quality, integrity, and robustness in data manipulation is widely known. This is particularly true for statisticians that must grapple with multidimensionality in data, complex semantics in queries, and large quantities of data needing to be elaborated. In this context, an appropriate approach to temporal information is ...

We consider deductive databases with updates and integrity constraints and introduce a new notion that of bounded disturbance of an active medium. In these terms we define several types of notions of steady behavior of such deductive databases, which may open up new classes of applications of logically controlled databases. In this work we explore computational complexity of the concepts introd...

We address the problem of null values and other forms of semi-structured data in object-oriented databases. Various aspects and issues concerning semi-structured data that are currently presented in the literature are discussed in the paper. We propose a new universal approach to semi-structured data based on the idea of absent objects. The idea covers null values and union types and can be smo...

In this paper, we describe how image data may be organized so to facilitate uncertainty management. We develop a fuzzy model for image data and provide an algebra for dealing with such data. New algebraic operators are defined in order to capture the fuzziness related to the semantic descriptors of an image.

The concept of “reasonable” queries on relational data bases is investigated. We provide an abstract characterization of the class of queries which are computable, and define the completeness of a query language as the property of being precisely powerful enough to express the queries in this class. This definition is then compared with other proposals for measuring the power of query languages...

For the past year, we have been assembling requirements from a collection of scientific data base users from astronomy, particle physics, fusion, remote sensing, oceanography, and biology. The intent has been to specify a common set of requirements for a new science data base system, which we call SciDB. In addition, we have discovered that very complex business analytics share most of the same...

The concept of knowledge discovery as defined through “establishing previously unknown and unsuspected relations of features in a data base” is, cum grano salis, relatively easy to implement for data bases containing numerical data. Increasingly we find at our disposal data bases containing scientific literature. Computer assisted detection of unknown relations of features in such data bases wo...