On materializing views and on-line queries

Jakobsson, Håkan

doi:10.1007/3-540-56039-4_56

Cited by 4 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Graph algorithms [21,20,26,24]. Graph algorithms for on-line evaluation of transitive closure of graphs are given in [21,20], and a method to optimize transitive queries by using subtrees in graphs constructed in previous evaluations is presented in [24].…”

Section: Incremental Evaluation Of Datalogmentioning

confidence: 99%

“…Graph algorithms for on-line evaluation of transitive closure of graphs are given in [21,20], and a method to optimize transitive queries by using subtrees in graphs constructed in previous evaluations is presented in [24]. The main difference is that they use more elaborate data structures and recursive algorithms, whereas we only use relations and nonrecursive Datalog programs.…”

Section: Incremental Evaluation Of Datalogmentioning

confidence: 99%

“…However, it also raises the complexity of query evaluation. The problem of efficiently computing Datalog queries has attracted a great deal of attention in the database and logic programming communities e.g., [6,8,12,14,17,18,24,25,27].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Nonrecursive incremental evaluation of Datalog queries

Dong

Topor

1995

Ann Math Artif Intell

View full text Add to dashboard Cite

We consider the problem of repeatedly evaluating the same (computationally expensive) query to a database that is being updated between successive query requests. In this situation, it should be possible to use the difference between successive database states and the answer to the query in one state to reduce the cost of evaluating the query in the next state. We use nonrecursive Datalog (which are unions of conjunctive queries) to compute the differences, and call this process "incremental query evaluation using conjunctive queries."After formalizing the notion of incremental query evaluation using conjunctive queries, we give an algorithm that constructs, for each regular chain query (including transitive closure as a special case), a nonrecursive Datalog program to compute the difference between the answer after an update and the answer before the update. We then extend this result to weakly regular queries, which are regular chain programs augmented with conjunctive queries having the so-called cartesian-closed increment property, and to the case of unbounded-set insertions where the sets are binary cartesian products. Finally, we show that the class of conjunctive queries with the cartesian-closed increment property is decidable.

show abstract

Section: Incremental Evaluation Of Datalogmentioning

confidence: 99%

Section: Incremental Evaluation Of Datalogmentioning

confidence: 99%

See 1 more Smart Citation

Nonrecursive incremental evaluation of Datalog queries

Dong

Topor

1995

Ann Math Artif Intell

View full text Add to dashboard Cite

show abstract

“…Other work on dynamic complexity for databases includes the theory of maintaining materialized views upon updates [J92,GMS93;Io85] This paper is organized as follows. In Section 2, we begin with some background on descriptive complexity.…”

Section: Introductionmentioning

confidence: 99%

Dyn-FO: A Parallel, Dynamic Complexity Class

Patnaik

Immerman

1997

Journal of Computer and System Sciences

163

View full text Add to dashboard Cite

Traditionally, computational complexity has considered only static problems. Classical complexity classes such as NC, P, and NP are defined in terms of the complexity of checking upon presentation of an entire input whether the input satisfies a certain property. For many applications of computers it is more appropriate to model the process as a dynamic one. There is a fairly large object being worked on over a period of time. The object is repeatedly modified by users and computations are performed. We develop a theory of dynamic complexity. We study the new complexity class, dynamic first-order logic (Dyn-FO). This is the set of properties that can be maintained and queried in firstorder logic, i.e., relational calculus, on a relational database. We show that many interesting properties are in Dyn-FO, including multiplication, graph connectivity, bipartiteness, and the computation of minimum spanning trees. Note that none of these problems is in static FO, and this fact has been used to justify increasing the power of query languages beyond first-order. It is thus striking that these problems are indeed dynamic first-order and, thus, were computable in first-order database languages all along. We also define``bounded-expansion reductions'' which honor dynamic complexity classes. We prove that certain standard complete problems for static complexity classes, such as REACH a for P, remain complete via these new reductions. On the other hand, we prove that other such problems, including REACH for NL and REACH d for L, are no longer complete via bounded-expansion reductions. Furthermore, we show that a version of REACH a , called REACH a + , is not in Dyn-FO unless all of P is contained in parallel linear time. ] 1997 Academic Press

show abstract

Incremental maintenance of materialized object-oriented views in MultiView: strategies and performance evaluation

Kuno

Rundensteiner

1998

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

On materializing views and on-line queries

Cited by 4 publications

References 8 publications

Nonrecursive incremental evaluation of Datalog queries

Nonrecursive incremental evaluation of Datalog queries

Dyn-FO: A Parallel, Dynamic Complexity Class

Incremental maintenance of materialized object-oriented views in MultiView: strategies and performance evaluation

Contact Info

Product

Resources

About