Incremental Recomputation in Local Languages

Document Type

Article

Publication Date

2003

Abstract

We study the problem of maintaining recursively defined views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanisms. The main results of this paper are negative ones: we show that a certain property of query languages implies impossibility of such incremental maintenance. 2003 Elsevier Science (USA). All rights reserved.

DOI

10.1016/S0890-5401(03)00017-8

Find in your library

Off-Campus WSU Users


Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 19
  • Usage
    • Abstract Views: 3
  • Captures
    • Readers: 8
see details

Share

COinS