Buch, Englisch, Band 554, 164 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 271 g
Buch, Englisch, Band 554, 164 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 271 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-54919-2
Verlag: Springer Berlin Heidelberg
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
Weitere Infos & Material
Relational databases.- Semantic aspects of incomplete information.- Syntactic and algorithmic aspects of incomplete information.- Computational complexity aspects of incomplete information.- Some conclusive aspects.
