G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence; to appear. 13  Home/Search   Document Details and Download   Summary   Related Articles   Check

....to answering queries under other database semantics such as stable and perfect model semantics [18] and treating answer monotonicity under updates other than clause addition. Another topic is using the monotonicity results of this paper to develop incremental methods for query processing in DDDBs [4] and the development of an integrated system based on a minimal model generator for the different aspects of database processing such as integrity enforcement and updates. Acknowledgement: Part of this research was done while the author was visiting at Munich University. The author thanks Prof. ....

G. Dong, S. Jianwen, and R. Topor. Nonrecursive incremental evaluation of datalog queries. Annals of Mathematics and Artificial Intelligence, 14(1):187--223, 1995.

....in the database or in the answer or in some fixed set. In this report, this fixed set is Q , the set of rational numbers. We use the first order incremental evaluation system, IES(FO) called FOIES in [10] to illustrate the concept. IES(FO) uses first order logic to express update functions [9, 12]. The permissible updates are tuples to be inserted or deleted from the input relations. For each relation symbol R, we use R o to refer to the instance of R before an update, and R n the instance of R after the update (here o stands for old and n for new) Consider the view EVEN that is ....

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence, 14:187--223, 1995.

....in the database or in the answer or in some fixed set. In this report, this fixed set is Q , the set of rational numbers. We use the first order incremental evaluation system, IES(FO) called FOIES in [10] to illustrate the concept. IES(FO) uses first order logic to express update functions [9, 12]. The permissible updates are tuples to be inserted or deleted from the input relations. For each relation symbol R, we use R o to refer to the instance of R before an update, and R n the instance of R after the update (here o stands for old and n for new) Consider the view EVEN that is ....

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence, 14:187--223, 1995.

....input database, and O is the output database; and that the update functions must be expressible in the language L. For example, in the previous section we gave an incremental evaluation system for the parity query in relational calculus. That system did not use any auxiliary relations. Following [21, 7, 8, 19], we consider here only queries that operate on relational databases storing elements of the base type b. These queries are those whose inputs are of types of the form fb Theta : Theta bg. Queries whose incremental evaluation we study have to be generic, that is, invariant under ....

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence, 14:187--223, 1995.

....in the database or in the answer or in some fixed set. In this report, this fixed set is Q , the set of rational numbers. We use the first order incremental evaluation system, IES(FO) called FOIES in [10] to illustrate the concept. IES(FO) uses first order logic to express update functions [9, 11]. For each relation symbol R, we use R o to refer to the instance of R before an update, and R n the instance of R after the update (here o stands for old and n for new) Consider the view EVEN that is defined to be f1g if the relation R has even cardinality and fg if R has odd ....

Guozhu Dong, Jianwen Su, and Rodney Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence, 14:187--223, 1995.

No context found.

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence; to appear. 13

No context found.

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of datalog queries. Annals of Mathematics and Artificial Intelligence, 14(2-4):187--223, 1995.

.... survey on strategies for view maintenance is given in [11] The basic idea of most strategies is to update the views incrementally by using the (relatively small) change to the base relations, as well as the base relations and the old views themselves, to derive the change to the views (e.g. [1, 16, 21, 7, 10, 8, 6, 5]) More advanced strategies use auxiliary data structures to help the process. The tagging strategy reported in this paper falls into this category. Other auxiliary data structures adopted by view maintenance strategies include [1, 21, 10] using counters and [18] using pointers. These strategies ....

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence, 14(2-4):187--223, 1995.

....to the insertion and deletion of a single tuple. A further restriction is also imposed so that the constants that appear in the auxiliary database must also appear in the database or in the answer or in some fixed set. The earliest formulation of IES is [18] successive refinements were given in [11, 17, 15]. These papers considered the first order incremental evaluation system, IES(FO) which uses first order logic to express maintenance functions. It is thus equivalent to IES where pure relational calculus is used as the ambient language. A closely related formalism is dynamic first order, DynFO, ....

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence, 14:187--223, 1995.

....z to y in B that are equal in length. The same generation is a chain query; it is specified by the context free set fA n B n j n 0g. It is known that every chain query whose label patterns are specified by a regular set al..lows query recomputation after insertion using first order logic [6, 8]. It is open whether this is true for any chain query whose label patterns are specified by an arbitrary context free set. The same generation query, as a special case of a context free set, is known to be unmaintainable using first order logic under insertion of edges if auxiliary relations are ....

....whether this is true for any chain query whose label patterns are specified by an arbitrary context free set. The same generation query, as a special case of a context free set, is known to be unmaintainable using first order logic under insertion of edges if auxiliary relations are not allowed [8] and this remains true when unary auxiliary relations are allowed [7] A generalization of these two results to SQL like languages is given in Section 5. It is an open problem if incremental maintenance of the same generation query is possible when polynomial auxiliary space are allowed. The ....

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence; to appear.

....ffl ae FOIES 0 ae FOIES 1 ae FOIES 2 , but it is open whether FOIES k ae FOIES k 1 for all k 1. To illustrate the arity measure and to give more interesting examples of queries maintainable by foies, we now discuss some previous results on the transitive closure of graphs of various kinds. In [DT92, DST95] some insertion only binary foies were given for generalized transitive closure of labelled graphs. For the transitive closure of acyclic directed graphs, DS93, DS95a] gave a space free foies. For undirected graphs, there is a ternary foies [PI94] which maintains an undirected spanning forest for ....

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of datalog queries. Annals of Mathematics and Artificial Intelligence, 14(2-4):187--223, 1995.

.... database queries such as transitive closure of (un)directed graphs and parity (whether the number of tuples in a relation is even) cannot be expressed in first order logic [1] Interestingly, many materialized database views defined by such queries Q can be maintained using first order queries [9, 10, 8, 5, 6, 7]. Roughly speaking, such maintenance for the view defined by Q is carried out through a set of first order queries (fixed for Q) which is called a first order incremental evaluation system (or foies for short) 1 . One of these queries directly maintains the answer to Q, while the others ....

....queries whose input relations are unary or binary. However, the separation of FOIES k Gamma1 ae FOIES k , k 3, were achieved through queries whose input relations are 6k ary. We now briefly review some previous results on the maintenance of the transitive closure of graphs of various kinds. In [9, 8] some foies using binary auxiliary relations (for insertion only) were given for generalized transitive closure of labelled graphs. For the transitive closure of acyclic directed graphs, 4, 5] gave a foies with no auxiliary relations. For undirected graphs, there is a foies [10] using ternary ....

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of datalog queries. Annals of Mathematics and Artificial Intelligence, 14(2-4):187--223, 1995.

....over a graph G having two label symbols A and B, SG(A; B) is the chain query specified by the context free set L = fA n B n j n 0g. It is known that every chain query whose label patterns are specified by a regular set al..lows query recomputation after insertion, using first order logic [8, 11] and auxiliary relations. It is open whether this is true for any chain query whose label patterns are specified by an arbitrary context free set. The purpose of this section is to compare the complexity of incremental recomputation of transitive closure with that of context free chain queries, ....

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence; 14(2-4):187--223, 1995.

No context found.

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence, 14:187--223, 1995.

No context found.

G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence, 14:187--223, 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC