Skip to main content

Expressive Power of Query Languages for Constraint Complex Value Databases

  • Conference paper
Database Systems for Advanced Applications (DASFAA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6588))

Included in the following conference series:

  • 1048 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kanellakis, P., Kuper, G., Revesz, P.: Constraint query languages. Journal of Computer and System Sciences 51(1), 26–52 (1995)

    Article  MathSciNet  Google Scholar 

  2. Libkin, L.: Embedded finite models and constraint databases. In: Book:Finite Model Theory and its Applications. Springer, Heidelberg (2007)

    Google Scholar 

  3. Libkin, L.: Query languages with arithmetic and constraint databases. SIGACT News, Database Theory Column, 41–50 (1999)

    Google Scholar 

  4. Benedikt, M., Dong, G., Libkin, L., Wong, L.: Relational expressive power of constraint query languages. Journal of the ACM 45, 1–34 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  6. Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)

    Book  MATH  Google Scholar 

  7. Otto, M., den Bussche, J.V.: First-order queries on databases embedded in an infinite structure. Information Processing Letters 60, 37–41 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Benedikt, M., Libkin, L.: Relational queries over interpreted structures. Journal of the ACM 47, 644–680 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  9. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  10. Benedikt, M., Libkin, L.: Safe constraint queries. SIAM Journal on Computing 29, 1652–1682 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Revesz, P.: Safe query languages for constraint databases. Transactions on Database Systems 23, 58–99 (1998)

    Article  Google Scholar 

  12. Stolboushkin, A., Taitslin, M.: Safe stratified datalog with integer order does not have syntax. ACM Transactions on Database Systems 23(1), 100–109 (1998)

    Article  Google Scholar 

  13. Abiteboul, S., Beeri, C.: The power of languages for the manipulation of complex values. The Very Large Data Bases Journal 4, 727–794 (1995)

    Article  Google Scholar 

  14. Avron, A.: Constructibility and decidability versus domain independence and absoluteness. Theoretical Computer Science 394, 144–158 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Suciu, D.: Domain-independent queries on databases with external functions. Theoretical Computer Science 190(2), 279–315 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  16. 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)

    Google Scholar 

  17. Liu, H.C., Yu, J., Liang, W.: Safety, domain independence and translation of complex value database queries. Information Sciences 178, 2507–2533 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Grumbach, S., Su, J.: Dense-order constraint databases. In: Proceedings of ACM Symposium on Principles of Database Systems, pp. 66–77 (1995)

    Google Scholar 

  19. Libkin, L.: A collapse result for constraint queries over structures of small degree. Information Processing Letter 86, 277–281 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  20. 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)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics