Skip to main content
SpringerLink
Log in

Incremental Computation of Queries

  • Reference work entry
Encyclopedia of Database Systems

  • 155 Accesses

Synonyms

Incremental view maintenance

Definition

A view on a database is defined by a query over the database. When the database is updated, the value of the view (namely the answer to the query) will likely change. The computation of the new answer to the query using the old answer is called incremental query computation or incremental view maintenance. Incremental computation is typically performed by identifying the part in the old answer that need to be removed, and the part in the new answer that need to be added. Incremental computation is desirable when it is much more efficient than a re-computation of the query. Efficiency can be measured by computation time, storage space, or query language desirability/availability, etc. Incremental computation algorithms could use auxiliary relations (in addition to the query answer), which also need to be incrementally computed.

Two query languages can be involved for the incremental query computation problem. One is used for defining the...

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Dong G., Libkin L., Su J., and Wong L. Maintaining transitive closure of graphs in SQL. Int. J. Inf. Technol., 5(1):46–78, 1999.

    Google Scholar 

  2. Dong G. and Pang C. Maintaining transitive closure in first-order after node-set and edge-set deletions. Inf. Process. Lett., 62(3):193–199, 1997.

    Article  MathSciNet  Google Scholar 

  3. Dong G. and Su J. Incremental and decremental evaluation of transitive closure by first-order queries. Inf. Comput., 120(1):101–106, July 1995.

    Article  MathSciNet  MATH  Google Scholar 

  4. Dong G. and Su. J. Arity bounds in first-order incremental evaluation and definition of polynomial time database queries. J. Comput. Syst. Sci., 57(3):289–308, December 1998. Preliminary version in the Proceedings of the ACM Symposium on Principles of Database Systems, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  5. Dong G. and Su J. Incremental maintenance of recursive views using relational calculus/SQL. ACM SIGMOD Rec., 29(1):44–51, 2000.

    Article  Google Scholar 

  6. Dong G., Su J., and Topor R. Nonrecursive incremental evaluation of datalog queries. Annals Math. Artif. Intell., 14:187–223, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  7. Dong G. and Topor. R. Incremental evaluation of datalog queries. In Proc. 4th Int. Conf. on Database Theory,pp. 282–296. 1992,

    Google Scholar 

  8. Griffin T., Libkin L., and Trickey H. An improved algorithm for the incremental recomputation of active relational expressions. IEEE Trans. Knowl. Data Eng., 9(3):508–511, 1997.

    Article  Google Scholar 

  9. A. and Gupta I.S. (eds.). Mumick Materialized views: techniques, implementations, and applications. MIT, MA, USA, 1999.

    Google Scholar 

  10. Immerman N. Descriptive Complexity. Springer, New York, NY, USA, December 1998.

    Google Scholar 

  11. Libkin L. and Wong L. On the power of incremental evaluation in SQL-like languages. In Proc. 7th Int. Workshop on Database Programming Languages, See also: SQL can maintain polynomial-hierarchy queries. Technical report, Institute of Systems Science Singapore, 1997.pp. 17–30. 1999,

    Google Scholar 

  12. Pang C., Dong G., and Kotagiri R. Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL. ACM Trans. Database Syst., 30(3):698–721, 2005.

    Article  Google Scholar 

  13. Patnaik S. and Immerman N. Dyn-FO: a parallel dynamic complexity class. J. Comput. Syst. Sci., 55(2):199–209, Oct 1997. Preliminary version in the Proceedings of the ACM Symposium on Principles of Database Systems, 1994.

    Article  MathSciNet  Google Scholar 

  14. Qian X. and Wiederhold G. Incremental recomputation of active relational expressions IEEE Trans. Knowl. Data Eng., 3(3):337–341, 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wright State University, Dayton, OH, USA

    Guozhu Dong

  2. University of California-Santa Barbara, Santa Barbara, CA, USA

    Jianwen Su

Authors
  1. Guozhu Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianwen Su
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computing, Georgia Institute of Technology, 266 Ferst Drive, 30332-0765, Atlanta, GA, USA

    LING LIU (Professor) (Professor)

  2. Database Research Group David R. Cheriton School of Computer Science, University of Waterloo, 200 University Avenue West, N2L 3G1, Waterloo, ON, Canada

    M. TAMER ÖZSU (Professor and Director, University Research Chair) (Professor and Director, University Research Chair)

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this entry

Cite this entry

Dong, G., Su, J. (2009). Incremental Computation of Queries. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_1351

Download citation

Publish with us

Policies and ethics

Search

Navigation