The problem of incomplete information in relational databases
In practice it is often the case that the available information is incomplete with respect to the information that is supposed to be recorded in a database. The book of the series ``Lecture Notes in Computer Science considers the problems raised by information incompleteness in the context of the relational model. The book consists of five chapters. Chapter 2 reviews the relational model and the operations in a uniform manner. A lattice structure on the set of all relations is imposed. Then several concepts, such as dependency satisfaction and updates can be defined in terms of operations on the lattice. Chapter 3 is a generalization of chapter 2 to the incomplete case, i.e. to sets of sets of relations. The author shows that there are two lattice structures on sets of sets of relations. The operations introduced in Chapter 2 are generalized elementwise to sets of relations, according to the basic intuitiv assumption. Chapter 4 treats the implementation of sets of relations as so called tables. A table is a relation with null values and restrictions on the null values as entries. In Chapter 5 the computational complexity of the introduced algorithms is analyzed, in the pursuit of finding a table class and a set of operations that can be efficiently implemented. In Chapter 6 the author briefly compares the results to other works, and summarizes the significant implications of the previous chapters.
- Set-theoretic problems of null completion in relational databases
- Valuations in incomplete information databases
- Unique complements and decompositions of database schemata
- On representation and querying incomplete information in databases with bags
- Querying disjunctive databases through nonmonotonic logics
- The complexity of query evaluation in indefinite temporal constraint databases
- Models of approximation in databases
- Sound and efficient closed-world reasoning for planning
- Querying temporal and spatial constraint networks in PTIME
- Type data bases with incomplete information
- Certain answers over incomplete XML documents: extending tractability boundary
- Querying incomplete information in RDF with SPARQL
- Incomplete data and data dependencies in relational databases
- m-tables: representing missing data
- Relational Attribute Systems II: Reasoning with Relations in Information Structures
- Incomplete information costs and database design
- An Approach to Handling Incomplete Information in Databases
- scientific article; zbMATH DE number 67826 (Why is no real title available?)
- scientific article; zbMATH DE number 718139 (Why is no real title available?)
- FLEXIBLE ADJUSTMENT OF DATA: AN EXERCISE IN RELATIONAL ALGEBRA
- A practical measure of the information in a logical theory
- Rough sets in incomplete information systems with order relations under Lipski's approach
- Data exchange and schema mappings in open and closed worlds
- scientific article; zbMATH DE number 2222696 (Why is no real title available?)
- Lossless outer joins with incomplete information
- \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models
- Query evaluation in probabilistic relational databases
- A domain calculus based on Heyting-valued logic
- Towards an algebraic theory of information integration
- World-set decompositions: Expressiveness and efficient algorithms
- Complexity tailored design: a new design methodology for databases with incomplete information.
This page was built for publication: The problem of incomplete information in relational databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1202165)
