On query-answering in relational data bases

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In recent years the relational model has been widely adopted for data base description. According to this model a data base, DB, describes certain objects of the world having certain attributes, and the relationships among them. Thus, DB is characterized by a set of attributes, D , a set of domains associated with the attributes, and a set of dependencies, F , corresponding to the relationships among the attributes (all the terms and concepts not defined here are those of References 1-3 ). A data base is a collection of relations, R ={ R i }. Each relation R i is characterized by a set of attributes S i ={ D j | D j D } called its scheme , and consists of a set of tuples. Each tuple is a map from the attributes of the relation scheme to their domains that satisfies all the dependencies of F (we shall consider functional dependencies).

Original languageEnglish
Title of host publication1979 International Workshop on Managing Requirements Knowledge, MARK 1979
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages717-720
Number of pages4
ISBN (Electronic)9781509031818
DOIs
StatePublished - Jun 1979
Event1979 International Workshop on Managing Requirements Knowledge, MARK 1979 - New York, United States
Duration: 4 Jun 19797 Jun 1979

Publication series

Name1979 International Workshop on Managing Requirements Knowledge, MARK 1979

Conference

Conference1979 International Workshop on Managing Requirements Knowledge, MARK 1979
Country/TerritoryUnited States
CityNew York
Period4/06/797/06/79

Bibliographical note

Publisher Copyright:
© 1979 IEEE.

Fingerprint

Dive into the research topics of 'On query-answering in relational data bases'. Together they form a unique fingerprint.

Cite this