Increment boundedness and nonrecursive incremental evaluation of datalog queries

  • Guozhu Dong
  • Jianwen Su
Contributed Papers Datalog Analysis

DOI: 10.1007/3-540-58907-4_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 893)
Cite this paper as:
Dong G., Su J. (1995) Increment boundedness and nonrecursive incremental evaluation of datalog queries. In: Gottlob G., Vardi M.Y. (eds) Database Theory — ICDT '95. ICDT 1995. Lecture Notes in Computer Science, vol 893. Springer, Berlin, Heidelberg

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.

Copyright information

© Springer-Verlag 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