Abstract
After studying, in the previous chapter, the expressive power of constraint queries over finite databases, we now turn to results concerning the complexity and expressive power of constraint query languages over possibly infinite, finitely representable, databases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliographic Notes
A. Schönhage and V. Strassen. Schnelle Multiplikation grosser Zahlen. Computing, 7: 281–292, 1971.
M. L. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory (MST), 17 (1): 13–27, 1984.
N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16 (4): 760–778, 1987.
P. C. Kanellakis and D. Q. Goldin. Constraint programming and database query languages. In Proceedings 2nd Conference on Theoretical Aspects of Computer Software (TACS’94), volume 789 of Lecture Notes in Computer Science, pages 96–120. Springer-Verlag, 1994.
S. Grumbach, J. Su, and C. Tollu. Linear constraint query languages: Expressive power and complexity. In D. Leivant, editor, International Workshop on Logic and Computational Complexity (LCC’94), volume 960 of Lecture Notes in Computer Science, pages 426–446. Springer-Verlag, 1995.
P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51 (1): 26–52, 1995.
S. Grumbach and G. M. Kuper. Tractable recursion over geometric data. In Proceedings of the and International Conference on Principles and Practice of Constraint Programming (CP’97), volume 1330 of Lecture Notes in Computer Science, pages 450–462. Springer-Verlag, 1997.
S. Grumbach and J. Su. Finitely representable databases. Journal of Computer and System Sciences (JCSS), 55 (2): 273–298, 1997.
S. Grumbach and J. Su. Queries with arithmetical constraints. The- oretical Computer Science (TCS), 173 (1): 151–181, 1997.
M. Benedikt, G. Dong, L. Libkin, and L. Wong. Relational expressive power of constraint query languages. Journal of the ACM, 45 (1): 134, 1998.
E. Grädel and S. Kreutzer. Descriptive complexity theory for constraint databases. In Proceedings of the Annual Conference for the European Association for Computer Science Logic (CSL’99), Lecture Notes in Computer Science. Springer-Verlag, 1999.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Grumbach, S., Kuper, G., Su, J. (2000). Expressive Power: The Infinite Case. In: Kuper, G., Libkin, L., Paredaens, J. (eds) Constraint Databases. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04031-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-04031-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08542-0
Online ISBN: 978-3-662-04031-7
eBook Packages: Springer Book Archive