A universal relation database system implemented via the network model

Sharon Mc Cure Kuck; Yehoshua Sagiv

doi:10.1145/588111.588135

A universal relation database system implemented via the network model

Sharon Mc Cure Kuck, Yehoshua Sagiv

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

21 Scopus citations

Abstract

We describe a network schema design algorithm that uses a well-designed relational schema as input. The resulting network database handles incomplete information, since we use only the modified foreign-key constraint and not the universal instance assumption. We believe that the representative instance is a correct representation of information stored in the database. We show how to map the representative instance to the network database. We give two algorithms for translating a relational query to a network application program. The first algorithm is confined to relational queries that express selections and projections over the universal relation scheme. The second algorithm includes all relational queries over select, project and (natural) join. Optimization techniques are discussed for both types of translation.

Original language	English
Title of host publication	Proceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982
Publisher	Association for Computing Machinery
Pages	147-157
Number of pages	11
ISBN (Print)	0897910702
DOIs	https://doi.org/10.1145/588111.588135
State	Published - 29 Mar 1982
Externally published	Yes
Event	1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982 - Los Angeles, United States Duration: 29 Mar 1982 → 31 Mar 1982

Publication series

Name	Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Conference

Conference	1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982
Country/Territory	United States
City	Los Angeles
Period	29/03/82 → 31/03/82

Bibliographical note

Publisher Copyright:
© 1982 ACM.

Access to Document

10.1145/588111.588135

Cite this

Kuck, S. M. C., & Sagiv, Y. (1982). A universal relation database system implemented via the network model. In Proceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982 (pp. 147-157). (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems). Association for Computing Machinery. https://doi.org/10.1145/588111.588135

@inproceedings{9dee3af7f28d4ede811e469812eff007,

title = "A universal relation database system implemented via the network model",

abstract = "We describe a network schema design algorithm that uses a well-designed relational schema as input. The resulting network database handles incomplete information, since we use only the modified foreign-key constraint and not the universal instance assumption. We believe that the representative instance is a correct representation of information stored in the database. We show how to map the representative instance to the network database. We give two algorithms for translating a relational query to a network application program. The first algorithm is confined to relational queries that express selections and projections over the universal relation scheme. The second algorithm includes all relational queries over select, project and (natural) join. Optimization techniques are discussed for both types of translation.",

author = "Kuck, {Sharon Mc Cure} and Yehoshua Sagiv",

note = "Publisher Copyright: {\textcopyright} 1982 ACM.; 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982 ; Conference date: 29-03-1982 Through 31-03-1982",

year = "1982",

month = mar,

day = "29",

doi = "10.1145/588111.588135",

language = "אנגלית",

isbn = "0897910702",

series = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",

publisher = "Association for Computing Machinery",

pages = "147--157",

booktitle = "Proceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982",

}

Kuck, SMC & Sagiv, Y 1982, A universal relation database system implemented via the network model. in Proceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Association for Computing Machinery, pp. 147-157, 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982, Los Angeles, United States, 29/03/82. https://doi.org/10.1145/588111.588135

A universal relation database system implemented via the network model. / Kuck, Sharon Mc Cure; Sagiv, Yehoshua.
Proceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982. Association for Computing Machinery, 1982. p. 147-157 (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A universal relation database system implemented via the network model

AU - Kuck, Sharon Mc Cure

AU - Sagiv, Yehoshua

PY - 1982/3/29

Y1 - 1982/3/29

N2 - We describe a network schema design algorithm that uses a well-designed relational schema as input. The resulting network database handles incomplete information, since we use only the modified foreign-key constraint and not the universal instance assumption. We believe that the representative instance is a correct representation of information stored in the database. We show how to map the representative instance to the network database. We give two algorithms for translating a relational query to a network application program. The first algorithm is confined to relational queries that express selections and projections over the universal relation scheme. The second algorithm includes all relational queries over select, project and (natural) join. Optimization techniques are discussed for both types of translation.

AB - We describe a network schema design algorithm that uses a well-designed relational schema as input. The resulting network database handles incomplete information, since we use only the modified foreign-key constraint and not the universal instance assumption. We believe that the representative instance is a correct representation of information stored in the database. We show how to map the representative instance to the network database. We give two algorithms for translating a relational query to a network application program. The first algorithm is confined to relational queries that express selections and projections over the universal relation scheme. The second algorithm includes all relational queries over select, project and (natural) join. Optimization techniques are discussed for both types of translation.

UR - http://www.scopus.com/inward/record.url?scp=84976798114&partnerID=8YFLogxK

U2 - 10.1145/588111.588135

DO - 10.1145/588111.588135

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84976798114

SN - 0897910702

T3 - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

SP - 147

EP - 157

BT - Proceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982

PB - Association for Computing Machinery

T2 - 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1982

Y2 - 29 March 1982 through 31 March 1982

ER -

A universal relation database system implemented via the network model

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this