Advertisement

Increment boundedness and nonrecursive incremental evaluation of datalog queries

  • Guozhu Dong
  • Jianwen Su
Contributed Papers Datalog Analysis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 893)

Abstract

Given a recursive (datalog) query, the nonrecursive incremental evaluation approach uses nonrecursive (datalog) programs to compute the difference of the answers to the query against successive databases between updates. The mechanism used in this approach is called a “First-Order Incremental Evaluation System” (FOIES). We show that for two large classes of datalog queries, called “generalized (weakly) regular queries”, FOIES always exist. We also define “increment boundedness” and its variations, which generalize boundedness. Increment bounded queries are shown to have FOIES of certain forms. We also relate increment boundedness to structural recursion, which was proposed for bulk data types. We characterize increment boundedness using the “insertion idempotency”, “insertion commutativity”, and “determinism” properties of structural recursion. Finally, we show that the increment boundedness notions are undecidable and a decidable sufficient condition is given.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abiteboul. Boundness is undecidable for datalog programs with a single recursive rule. Inf. Process. Lett., 32(6), October 1989.Google Scholar
  2. 2.
    A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1974.Google Scholar
  3. 3.
    V. Breazu-Tannen, P. Buneman, and S. Naqvi. Structural recursion as a query language. In Proceedings of the Third International Workshop on Database Programming Languages: Bulk Types and Persistent Data, pages 9–19, 1991.Google Scholar
  4. 4.
    S. Chaudhuri and M. Vardi. On the equivalence of recursive and nonrecursive datalog programs. In Proc. ACM Symp. on Principles of Database Systems, 1992.Google Scholar
  5. 5.
    G. Dong and J. Su. First-order incremental evaluation of datalog queries (extended abstract). In Proc. 4th Int. Workshop on Database Programming Languages, 1993.Google Scholar
  6. 6.
    G. Dong and J. Su. First-order on-line computation of transitive closure queries. In Proc. of 16th Australian Computer Science Conference, pages 721–729, 1993.Google Scholar
  7. 7.
    G. Dong, J. Su, and R. Topor. First-order incremental evaluation of datalog queries. Technical report, Dept. of Comp. Sci., Univ. of Melbourne, 1993. (Submitted to AMAI).Google Scholar
  8. 8.
    G. Dong and R. Topor. Incremental evaluation of datalog queries. In Proc. Int'l Conference on Database Theory, pages 282–296, Berlin, Germany, Oct. 1992.Google Scholar
  9. 9.
    H. Gaifman, H. Mairson, Y. Sagiv, and M. Y. Vardi. Undecidable optimization problems for database logic programs. Journal of the Association for Computing Machinery, 40(3):683–713, 1993.Google Scholar
  10. 10.
    A. Gupta, I. S. Mumick, and V. S. Subrahmanian. Maintaining views incrementally. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 157–166, 1993.Google Scholar
  11. 11.
    G. Hillebrand, P. Kanellakis, H. Mairson, and M. Vardi. Undecidable boundedness problems for datalog programs. Technical Report RJ 8739, IBM Almaden Research Center, San Jose, CA, Apr. 1992.Google Scholar
  12. 12.
    G. Hillerbrand, P. Kanellakis, H. Mairson, and M. Vardi. Tools for Datalog boundedness. In Proc. ACM Symp. on Principles of Database Systems, 1991.Google Scholar
  13. 13.
    Y. Ioannidis. A time bound on the materialization of some recursively defined views. In Proc. of Int. Conf. on Very Large Data Bases, 1985.Google Scholar
  14. 14.
    J. Naughton and Y. Sagiv. A decidable class of bounded recursion. In Proc. ACM Symp. on Principles of Database Systems, pages 227–236, 1987.Google Scholar
  15. 15.
    S. Patnaik and N. Immerman. Dyn-FO: A parallel dynamic complexity class. In Proc. ACM Symp. on Principles of Database Systems, pages 210–221, 1994.Google Scholar
  16. 16.
    J. D. Ullman. Database and Knowledge-Base Systems, volume 1. Computer Science Press, 1988.Google Scholar
  17. 17.
    J. D. Ullman. Database and Knowledge-Base Systems, volume 2. Computer Science Press, 1989.Google Scholar
  18. 18.
    R. van der Meyden. Predicate boundedness of linear monadic datalog is in PSPACE. Technical Report SCS&E Report 9205, Univ. of New South Wales, 1992.Google Scholar
  19. 19.
    M. Vardi. Decidability and undecidability results for boundedness of linear recursive programs. In Proc. ACM Symp. on Principles of Database Systems, pages 341–351, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Guozhu Dong
    • 1
  • Jianwen Su
    • 2
  1. 1.Department of Computer ScienceUniversity of MelbourneParkvilleAustralia
  2. 2.Department of Computer ScienceUniversity of CaliforniaSanta BarbaraUSA

Personalised recommendations