The Problem of Incomplete Information in Relational Databases

In a relational database the information is recorded as rows in tables. However, in many practical situations the available information is incomplete and the values for some columns are missing. Yet few existing database management systems allow the user to enter null values in the database. This mo...

Full description

Main Author: Grahne, Gösta
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1991, 1991
Edition:1st ed. 1991
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 02363nmm a2200361 u 4500
001 EB000657189
003 EBX01000000000000000510271
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540465072 
100 1 |a Grahne, Gösta 
245 0 0 |a The Problem of Incomplete Information in Relational Databases  |h Elektronische Ressource  |c by Gösta Grahne 
250 |a 1st ed. 1991 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1991, 1991 
300 |a VIII, 164 p  |b online resource 
505 0 |a Relational databases -- Semantic aspects of incomplete information -- Syntactic and algorithmic aspects of incomplete information -- Computational complexity aspects of incomplete information -- Some conclusive aspects 
653 |a Artificial Intelligence 
653 |a Algorithms 
653 |a Artificial intelligence 
653 |a Database Management 
653 |a Data structures (Computer science) 
653 |a Data Structures and Information Theory 
653 |a Database management 
653 |a Algorithm Analysis and Problem Complexity 
710 2 |a SpringerLink (Online service) 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
856 |u https://doi.org/10.1007/3-540-54919-6?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 005.73 
520 |a In a relational database the information is recorded as rows in tables. However, in many practical situations the available information is incomplete and the values for some columns are missing. Yet few existing database management systems allow the user to enter null values in the database. This monograph analyses the problems raised by allowing null values in relational databases. The analysis covers semantical, syntactical, and computational aspects. Algorithms for query evaluation, dependency enforcement and updates in the presence of null values are also given. The analysis of the computational complexity of the algorithms suggests that from a practical point of view the database should be stored as Horn tables, which are generalizations of ordinary relations, allowing null values and Horn clause-like restrictions on these null values. Horn tables efficiently support a large class of queries, dependencies and updates