Abstract
In this paper, symmetry-based choice mechanisms are exploited to compute deterministic queries. We investigate a particular form of these choice mechanisms, called specified symmetry choice. This mechanism is efficient (i.e. computable in polynomial time) and can be added to Fixpoint Logic to give a language that is more powerful than the extension of Fixpoint with Counting.
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 V. Vianu. Non-determinism in logic-based languages. Annals of Math. and Artif. Int., 3:151–186, 1991.
S. Abiteboul and V. Vianu. Generic computation and its complexity. In Proc. 23rd ACM Symp. on the Theory of Computing, pages 209–219, 1991.
J. Cai, M. Furer, and N. Immerman. An optimal lower bound on the number of variables for graph identification. In Proc 30th IEEE Conf. on Foundations of Computer Science, pages 612–617, 1989.
A. Chandra and D. Harel. Computable queries for relational databases. Journal of Computer and System Sciences, 21(2):156–178, Oct. 1980.
A. Chandra and D. Harel. Structure and Complexity of relational queries. Journal of Computer and System Sciences, 25(1):99–128, Aug. 1982.
A. Dawar. Feasible Computation Through Model Theory. Ph.D Thesis. University of Pennsylvania, Philadelphia, 1993.
H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972
M. Gyssens, J. Van den Bussche, D. Van Gucht. Expressiveness of Efficient Semideterministic Choice Constructs ICALP 94, 820, 106–117.
Y. Gurevich and S. Shelah. Fixed-point extensions of first order logic. In Pro 26th IEEE Symp. on Foundations of Computer Science, 210–214, 1983.
S. Grumbach and C. Tollu. Query langugages with counters. In Proc. 4th Int. Conf. Database Theory, LNCS 646, 124–139. Springer-Verlag, 1992.
N. Immermann. Upper and lower bounds for first-order definability. JCSS, 25:76–98, 1982.
N. Immermann. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.
N. Immermann. Languages that capture complexity classes. SIAM Journal on Computing, 16:760–778, 1987.
Ph.G. Kolaitis and M.Y. Vardi. Fixpoint logic vs. infinitary logic in finite-model theory. In Proc. 7th IEEE Symp. on Logic in Computer Science, 46–57, 1992.
M. Vardi. The complexity of relational query languages. In Proc. 14th ACM Symp. on the Theory of Computing, 137–146. 1982.
J. Van den Bussche, D. Van Gucht. Semi-determinism. Proc. 11th ACM Sym. Principles of Database Systems, 191–201, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gire, F., Hoang, H.K. (1996). A more expressive deterministic query language with efficient symmetry-based choice construct. In: Pedreschi, D., Zaniolo, C. (eds) Logic in Databases. LID 1996. Lecture Notes in Computer Science, vol 1154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031757
Download citation
DOI: https://doi.org/10.1007/BFb0031757
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61814-0
Online ISBN: 978-3-540-70683-0
eBook Packages: Springer Book Archive