Includes bibliographical references (p. -149) and index.
|Series||Lecture notes in computer science ;, 554|
|LC Classifications||QA76.9.D3 G69 1991|
|The Physical Object|
|Pagination||viii, 156 p. :|
|Number of Pages||156|
|ISBN 10||3540549196, 0387549196|
|LC Control Number||91035867|
Relational databases.- Semantic aspects of incomplete information.- Syntactic and algorithmic aspects of incomplete information.- Computational complexity aspects of incomplete information.- Some conclusive aspects. Series Title: Lecture notes in computer science, Responsibility: G. Grahne. More information: French equivalent / Équivalent. The Problem of Incomplete Information in Relational Databases Series: Lecture Notes in Computer Science, Vol. In a relational database the information is recorded as rows in tables. However, in many practical situations the available information is incomplete and . On representing incomplete information in a relational data base. In Proceedings of the 7th lnternauonal Conference on Very Large Data Bases (Cannes, France, Sept. ) ACM, New York, , pp. Author: ImielińskiTomasz, LipskiWitold. Representing incomplete information in a database immediately raises the much more difficult and important problem of processing this information so that the user can obtain--perhaps partial, but correct--responses to his or her queries on the basis of the incomplete information.
Cite this chapter as: () Relational databases. In: Grahne G. (eds) The Problem of Incomplete Information in Relational Databases. Lecture Notes in Computer Science, vol In era of Big Data different applications face the problem of dealing with incomplete data. In the presence of incomplete databases, certain answers are a principled semantics of query answering. For the conventional relational model there has been considerable research in the area of incomplete information. On the other hand, research in temporal databases has concentrated on models in. orientation for literature, some branches of relational database theory as the theory of relational algorithms, theoretical foundations of query languages, op-timization and normalization are only briefly cited. This book comprises 9 sections. In section 1, the basic database terminology is presented. Section 2 describes elementary database.
Incomplete information in relational temporal databases Shashi K. Gadia, Sum1 S. Nair and Yiu- Cheong Poon Computer Science Department. Incomplete information arises in relational databases, when a fact (tuple) has to be inserted in a relation, and values for some required columns are missing. For instance, in an employee database, the phone number of one employee might be missing, as might the address of another employee. 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. of incorporating incomplete information into the relational model and the problems raised by information incompleteness in the context of the relational model, or how to meaningfully interpret and process incomplete information.