Abstract
Motivated by constraint complex values which allow us to represent nested finitely representable sets, we study the expressive power of various query languages over constraint complex value databases. The tools we use come in the form of collapse results which are well established results in the context of first-order logic. We show that active-generic collapse carries over to second-order logic for structures with o-minimality and any relational signature in the complex value model. We also consider the problem of safety in the context of embedded finite complex value models and constraint complex value databases.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kanellakis, P., Kuper, G., Revesz, P.: Constraint query languages. Journal of Computer and System Sciences 51(1), 26–52 (1995)
Libkin, L.: Embedded finite models and constraint databases. In: Book:Finite Model Theory and its Applications. Springer, Heidelberg (2007)
Libkin, L.: Query languages with arithmetic and constraint databases. SIGACT News, Database Theory Column, 41–50 (1999)
Benedikt, M., Dong, G., Libkin, L., Wong, L.: Relational expressive power of constraint query languages. Journal of the ACM 45, 1–34 (1998)
Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)
Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)
Otto, M., den Bussche, J.V.: First-order queries on databases embedded in an infinite structure. Information Processing Letters 60, 37–41 (1996)
Benedikt, M., Libkin, L.: Relational queries over interpreted structures. Journal of the ACM 47, 644–680 (2000)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Benedikt, M., Libkin, L.: Safe constraint queries. SIAM Journal on Computing 29, 1652–1682 (2000)
Revesz, P.: Safe query languages for constraint databases. Transactions on Database Systems 23, 58–99 (1998)
Stolboushkin, A., Taitslin, M.: Safe stratified datalog with integer order does not have syntax. ACM Transactions on Database Systems 23(1), 100–109 (1998)
Abiteboul, S., Beeri, C.: The power of languages for the manipulation of complex values. The Very Large Data Bases Journal 4, 727–794 (1995)
Avron, A.: Constructibility and decidability versus domain independence and absoluteness. Theoretical Computer Science 394, 144–158 (2008)
Suciu, D.: Domain-independent queries on databases with external functions. Theoretical Computer Science 190(2), 279–315 (1998)
Liu, H.C., Yu, J.: Safe database queries with external functions. In: Proceedings of International Database Engineering and Applications Symposium, Montreal, Canada, pp. 260–269 (1999)
Liu, H.C., Yu, J., Liang, W.: Safety, domain independence and translation of complex value database queries. Information Sciences 178, 2507–2533 (2008)
Grumbach, S., Su, J.: Dense-order constraint databases. In: Proceedings of ACM Symposium on Principles of Database Systems, pp. 66–77 (1995)
Libkin, L.: A collapse result for constraint queries over structures of small degree. Information Processing Letter 86, 277–281 (2003)
Benedikt, M., Grohe, M., Libkin, L., Segoufin, L.: Reachability and connectivity queries in constraint databases. Journal of Computer and System Sciences 66, 169–206 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, HC. (2011). Expressive Power of Query Languages for Constraint Complex Value Databases. In: Yu, J.X., Kim, M.H., Unland, R. (eds) Database Systems for Advanced Applications. DASFAA 2011. Lecture Notes in Computer Science, vol 6588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20152-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-20152-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20151-6
Online ISBN: 978-3-642-20152-3
eBook Packages: Computer ScienceComputer Science (R0)