Skip to main content
SpringerLink
Log in

On the Power of Incremental Evaluation in SQL-like Languages

  • Conference paper
  • First Online:
Research Issues in Structured and Semistructured Database Programming (DBPL 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1949))

Included in the following conference series:

Abstract

We consider IES(SQL), the incremental evaluation system over an SQL-like language with grouping, arithmetics, and aggregation. We show that every second order query is in IES(SQL) and that there are PSPACE-complete queries in IES(SQL). We further show that every PSPACE query is in IES(SQL) augmented with a deterministic transitive closure operator. Lastly, we consider ordered databases and provide a complete analysis of a hierarchy on IES(SQL) defined with respect to arity-bounded auxiliary relations.

Part of this work was done while visiting INRIA and Kent Ridge Digital Labs.

Part of this work was done while visiting Bell Labs.

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

Access this chapter

Log in via an institution
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. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

    Google Scholar 

  2. S. Abiteboul, V. Vianu. Computing with first-order logic. JCSS 50 (1995), 309–335.

    MATH  MathSciNet  Google Scholar 

  3. P. Buneman, S. Naqvi, V. Tannen, and L. Wong. Principles of programming with complex objects and collection types. Theoretical Computer Science, 149(1):3–48, September 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. G. Dong, L. Libkin, and L. Wong. On impossibility of decremental recomputation of recursive queries in relational calculus and SQL. In DBPL’95, page 8.

    Google Scholar 

  5. G. Dong, L. Libkin, and L. Wong. Local properties of query languages. In Theoretical Computer Science, to appear. Extended abstract in ICDT’97.

    Google Scholar 

  6. G. Dong, L. Libkin, J. Su and L. Wong. Maintaining the transitive closure of graphs in SQL. In Int. J. Information Technology, 5 (1999), 46–78.

    Google Scholar 

  7. G. Dong and J. Su. Arity bounds in first-order incremental evaluation and definition of polynomial time database queries. Journal of Computer and System Sciences 57 (1998), 289–308.

    Article  MATH  MathSciNet  Google Scholar 

  8. G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence, 14:187–223, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  9. K. Etessami. Dynamic tree isomorphism via first-order updates to a relational database. In PODS’98, pages 235–243.

    Google Scholar 

  10. R. Fagin, L. Stockmeyer, M. Vardi, On monadic NP vs monadic co-NP, Information and Computation, 120 (1994), 78–92.

    Article  MathSciNet  Google Scholar 

  11. H. Gaifman, On local and non-local properties, in “Proceedings of the Herbrand Symposium, Logic Colloquium’ 81,” North Holland, 1982.

    Google Scholar 

  12. A. Gupta, I. S. Mumick and V. S. Subrahmanian. Maintaining views incrementally. In SIGMOD’93, pages 157–166.

    Google Scholar 

  13. A. Gupta and I.S. Mumick. Maintenance of materialized views: problems, techniques, and applications. Data Engineering Bulletin 18 (1995), 3–18.

    Google Scholar 

  14. L. Hella, L. Libkin and J. Nurmonen. Notions of locality and their logical characterizations over finite models. J. Symb. Logic, 64 (1999), 1751–1773.

    Article  MATH  MathSciNet  Google Scholar 

  15. L. Hella, L. Libkin, J. Nurmonen and L. Wong. Logics with aggregate operators. In LICS’99, pages 35–44.

    Google Scholar 

  16. N. Immerman. Languages that capture complexity classes. SIAM Journal of Computing, 16:760–778, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  17. L. Libkin. On counting logics and local properties. In LICS’98, pages 501–512.

    Google Scholar 

  18. L. Libkin and L. Wong. Query languages for bags and aggregate functions. Journal of Computer and System Sciences 55 (1997), 241–272.

    Article  MATH  MathSciNet  Google Scholar 

  19. L. Libkin and L. Wong. Incremental recomputation of recursive queries with nested sets and aggregate functions. In DBPL’97, pages 222–238.

    Google Scholar 

  20. C. Papadimitriou. Computational Complexity. Addison Wesley, 1994.

    Google Scholar 

  21. S. Patnaik and N. Immerman. Dyn-FO: A parallel dynamic complexity class. Journal of Computer and System Sciences 55 (1997), 199–209.

    Article  MathSciNet  Google Scholar 

  22. T.A. Schultz. ADEPT-The advanced database environment for planning and tracking. Bell Labs Technical Journal, 3(3):3–9, 1998.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bell Laboratories, 600 Mountain Avenue, 07974, Murray Hill, NJ, USA

    Leonid Libkin

  2. Kent Ridge Digital Labs, 21 Heng Mui Keng Terrace, 119613, Singapore

    Limsoon Wong

Authors
  1. Leonid Libkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Limsoon Wong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Strathclyde, G1 1XH, Glasgow, Scotland, UK

    Richard Connor

  2. Department of Computer Science, University of Toronto, 6 King’s College Road, M5S 3H5, Ontario, Toronto, Canada

    Alberto Mendelzon

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Libkin, L., Wong, L. (2000). On the Power of Incremental Evaluation in SQL-like Languages. In: Connor, R., Mendelzon, A. (eds) Research Issues in Structured and Semistructured Database Programming. DBPL 1999. Lecture Notes in Computer Science, vol 1949. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44543-9_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-44543-9_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41481-0

  • Online ISBN: 978-3-540-44543-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation