Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions
نویسندگان
چکیده
We examine the power of incremental evaluation systems that use an SQL-like language formaintaining recursively-de ned views. We show that recursive queries such as transitive closure,and \alternating paths" can be incrementally maintained in a nested relational language, whensome auxiliary relations are allowed. In the presence of aggregate functions, even more queries canbe maintained, for example, the \same generation" query. In contrast, it is still an open problemwhether such queries are maintainable in relational calculus. We then restrict the language so thatno nested relations are involved (but we keep the aggregate functions). Such a language capturesthe capability of most practical relational database systems. We prove that this restriction doesnot reduce the incremental computational power; that is, any query that can be maintained in anested language with aggregates, is still maintainable using only at relations. We also show thatone does not need auxiliary relations of arity more than 2. In particular, this implies that therecursive queries maintainable in the nested language with aggregates, can be also maintained ina practical relational database systems using auxiliary tables of arity at most 2. This is again insharp contrast to maintenance in relational calculus, which admits a strict arity-based hierarchy.
منابع مشابه
Properties of Languages That Make Recursive Views Unmaintainable
We study the problem of maintaining recursively-deened 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 show that in most cases such incremental maintenance is impossible if either no auxiliary relations are used or they are limited to be deterministic. Instead of concentrating on provi...
متن کاملIncremental recomputation in local languages
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. The property we use is locality of queries, which is know...
متن کاملEfficient Incremental Evaluation of Queries with Aggregation
We present a technique for eeciently evaluating queries on programs with mono-tonic aggregation, a class of programs deened by Ross and Sagiv. Our technique consists of the following components: incremental computation of aggregate functions , incremental xpoint evaluation of monotonic programs and Magic Sets transformation of monotonic programs. We also present a formalization of the notion of...
متن کاملEecient Incremental Evaluation of Queries with Aggregation
We present a technique for eeciently evaluating queries on programs with mono-tonic aggregation, a class of programs deened by Ross and Sagiv. Our technique consists of the following components: incremental computation of aggregate functions , incremental xpoint evaluation of monotonic programs and Magic Sets transformation of monotonic programs. We also present a formalization of the notion of...
متن کاملQuery Languages for Bags and Aggregate Functions
Theoretical foundations for querying databases based on bags are studied in this paper. We fully determine the strength of many polynomial-time bag operators relative to an ambient query language. Then we obtain BQL, a query language for bags, by picking the strongest combination of these operators. The relationship between the nested relational algebra and various fragments of BQL is investiga...
متن کامل