Abstract
An extension of Ehrenfeucht-Fraissé games for complex objects is exhibited and shown to characterize an extension of relational calculus to complex objects. The games are used to prove expressibility results about the calculus.
Work supported in part by the National Science Foundation under grants IRI-8816078 and INT-8817874, and by INRIA under an INRIA-NSF cooperation grant.
This work was performed while the author was visiting UC San Diego.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul and C. Beeri. On the Manipulation of Complex Objects. In Proc. International Workshop on Theory and Applications of Nested Relations and Complex Objects, pages 56–57, Darmstadt, 1987.
A. Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fund. Math, 49, 1961.
R. Fagin. Monadic generalized spectra. Zeitschrift fur Mathematische Logik und Grund. der Math., 21:89–96, 1975.
R. Fraissé. Sur les classifications des systèmes de relations. Publ. Sci. Univ Alger, I:1, 1954.
S.Grumbach and V.Vianu. Tractable Query Languages for Complex Objects Databases, submitted.
R. Hull and J. Su. On the expressive power of database queries with intermediate types. In 7th ACM Symposium on Principles of Database Systems, 1988.
R. Hull and J. Su. Untyped Sets, Invention and Computable Queries. In 8th ACM Symposium on Principles of Database Systems, 1989.
N. Immerman. Relational queries computable in polynomial time. Inf. and Control 68, 86–104, 1986.
P.G. Kolaitis. Finite model theory. Lecture Notes on Uniform Definability on Finite Structures, 1983.
G.M. Kuper and M.Y. Vardi. A new approach to database logic. In Proc. ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, 1984.
G.M. Kuper and M.Y. Vardi. On the complexity of queries in the logical data model. In Proc. Intern. Conf. on Database Theory, pages 267–280, Bruges, 1988.
J. Paradaens and D. van Gucht. Possibilities and limitations of using flat operators in nested algebra expressions. In Proc. 7th ACM Symp. on Principles of Database Systems, pages 29–38, 1988.
M. Vardi. Relational queries computable in polynomial time. 14th ACM Symp. on Theory of Computing, 137–146, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grumbach, S., Vianu, V. (1990). Playing games with objects. In: Abiteboul, S., Kanellakis, P.C. (eds) ICDT '90. ICDT 1990. Lecture Notes in Computer Science, vol 470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53507-1_68
Download citation
DOI: https://doi.org/10.1007/3-540-53507-1_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53507-2
Online ISBN: 978-3-540-46682-6
eBook Packages: Springer Book Archive