An introduction to the completeness of languages for complex objects and nested relations

S. Abiteboul; C. Beeri; M. Gyssens; D. Van Gucht

doi:10.1007/3-540-51171-7_23

An introduction to the completeness of languages for complex objects and nested relations

S. Abiteboul
, C. Beeri
, M. Gyssens
, D. Van Gucht

The Rachel and Selim Benin School of Engineering and Computer Science

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

12 Scopus citations

Abstract

Languages for models of nested relations and complex objects have been attracting considerable attention recently. Some of these languages are algebraic, others are calculus based, some are logic programming oriented. This paper describes these languages and surveys recent results about the expressive power of these languages. The emphasis is on completeness issues. The expressive power of the languages is described in terms of the three common types of completeness: calculus-completeness, BP-completeness and CH-completeness.

Original language	English
Title of host publication	Nested Relations and Complex Objects in Databases
Editors	S. Abiteboul, H.-J. Schek, P.C. Fischer
Publisher	Springer Verlag
Pages	117-138
Number of pages	22
ISBN (Print)	9783540511717
DOIs	https://doi.org/10.1007/3-540-51171-7_23
State	Published - 1989
Event	Workshop on Theory and Applications of Nested Relations and Complex Objects, 1987 - Darmstadt, Germany Duration: 6 Apr 1987 → 8 Apr 1987

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	361 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Workshop on Theory and Applications of Nested Relations and Complex Objects, 1987
Country/Territory	Germany
City	Darmstadt
Period	6/04/87 → 8/04/87

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1989.

Access to Document

10.1007/3-540-51171-7_23

Cite this

Abiteboul, S., Beeri, C., Gyssens, M., & Van Gucht, D. (1989). An introduction to the completeness of languages for complex objects and nested relations. In S. Abiteboul, H.-J. Schek, & P. C. Fischer (Eds.), Nested Relations and Complex Objects in Databases (pp. 117-138). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 361 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-51171-7_23

Abiteboul, S. ; Beeri, C. ; Gyssens, M. et al. / An introduction to the completeness of languages for complex objects and nested relations. Nested Relations and Complex Objects in Databases. editor / S. Abiteboul ; H.-J. Schek ; P.C. Fischer. Springer Verlag, 1989. pp. 117-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{50bcce09ad85479fb94da651556852be,

title = "An introduction to the completeness of languages for complex objects and nested relations",

abstract = "Languages for models of nested relations and complex objects have been attracting considerable attention recently. Some of these languages are algebraic, others are calculus based, some are logic programming oriented. This paper describes these languages and surveys recent results about the expressive power of these languages. The emphasis is on completeness issues. The expressive power of the languages is described in terms of the three common types of completeness: calculus-completeness, BP-completeness and CH-completeness.",

author = "S. Abiteboul and C. Beeri and M. Gyssens and \{Van Gucht\}, D.",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1989.; Workshop on Theory and Applications of Nested Relations and Complex Objects, 1987 ; Conference date: 06-04-1987 Through 08-04-1987",

year = "1989",

doi = "10.1007/3-540-51171-7\_23",

language = "אנגלית",

isbn = "9783540511717",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "117--138",

editor = "S. Abiteboul and H.-J. Schek and P.C. Fischer",

booktitle = "Nested Relations and Complex Objects in Databases",

address = "גרמניה",

}

Abiteboul, S, Beeri, C, Gyssens, M & Van Gucht, D 1989, An introduction to the completeness of languages for complex objects and nested relations. in S Abiteboul, H-J Schek & PC Fischer (eds), Nested Relations and Complex Objects in Databases. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 361 LNCS, Springer Verlag, pp. 117-138, Workshop on Theory and Applications of Nested Relations and Complex Objects, 1987, Darmstadt, Germany, 6/04/87. https://doi.org/10.1007/3-540-51171-7_23

An introduction to the completeness of languages for complex objects and nested relations. / Abiteboul, S.; Beeri, C.; Gyssens, M. et al.
Nested Relations and Complex Objects in Databases. ed. / S. Abiteboul; H.-J. Schek; P.C. Fischer. Springer Verlag, 1989. p. 117-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 361 LNCS).

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

TY - GEN

T1 - An introduction to the completeness of languages for complex objects and nested relations

AU - Abiteboul, S.

AU - Beeri, C.

AU - Gyssens, M.

AU - Van Gucht, D.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1989.

PY - 1989

Y1 - 1989

N2 - Languages for models of nested relations and complex objects have been attracting considerable attention recently. Some of these languages are algebraic, others are calculus based, some are logic programming oriented. This paper describes these languages and surveys recent results about the expressive power of these languages. The emphasis is on completeness issues. The expressive power of the languages is described in terms of the three common types of completeness: calculus-completeness, BP-completeness and CH-completeness.

AB - Languages for models of nested relations and complex objects have been attracting considerable attention recently. Some of these languages are algebraic, others are calculus based, some are logic programming oriented. This paper describes these languages and surveys recent results about the expressive power of these languages. The emphasis is on completeness issues. The expressive power of the languages is described in terms of the three common types of completeness: calculus-completeness, BP-completeness and CH-completeness.

UR - https://www.scopus.com/pages/publications/84905095972

U2 - 10.1007/3-540-51171-7_23

DO - 10.1007/3-540-51171-7_23

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

AN - SCOPUS:84905095972

SN - 9783540511717

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 117

EP - 138

BT - Nested Relations and Complex Objects in Databases

A2 - Abiteboul, S.

A2 - Schek, H.-J.

A2 - Fischer, P.C.

PB - Springer Verlag

T2 - Workshop on Theory and Applications of Nested Relations and Complex Objects, 1987

Y2 - 6 April 1987 through 8 April 1987

ER -

Abiteboul S, Beeri C, Gyssens M, Van Gucht D. An introduction to the completeness of languages for complex objects and nested relations. In Abiteboul S, Schek HJ, Fischer PC, editors, Nested Relations and Complex Objects in Databases. Springer Verlag. 1989. p. 117-138. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-51171-7_23

An introduction to the completeness of languages for complex objects and nested relations

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this