(Enter summary)
Abstract: We study the problem of maintaining recursively-dened 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 known to hold for relational calculus and various extensions, including those with grouping and... (Update)
Cited by: More
Fully Dynamic Undirected Graph Reachability in Constant Time on a.. - Hesse
(Correct)
Similar documents (at the sentence level):
51.8%: Incremental Recomputation in Local Languages - Dong, Libkin, Wong (2003)
(Correct)
13.7%: Properties of Languages That Make Recursive Views.. - Dong, Libkin, Wong
(Correct)
Active bibliography (related documents): More All
0.4: Expressive Power of SQL - Libkin (2001)
(Correct)
0.3: Maintaining Transitive Closure of Graphs in SQL - Dong, Libkin, Su, Wong (1999)
(Correct)
0.3: Logics Capturing Local Properties - Libkin (2001)
(Correct)
Similar documents based on text: More All
0.4: Incremental Recomputation of Recursive Queries with Nested.. - Libkin, Wong (1997)
(Correct)
0.4: Relational Expressive Power of Constraint Query Languages - Benedikt, Dong, Libkin, Wong (1995)
(Correct)
0.4: Logics with Aggregate Operators - Hella, Libkin, Nurmonen, Wong (1999)
(Correct)
BibTeX entry: (Update)
Dong, Libkin, and Wong. Incremental recomputation in local languages. INFCTRL: Information and Computation (formerly Information and Control), 181, 2003. http://citeseer.ist.psu.edu/article/libkin01incremental.html More
@misc{ libkin03incremental,
author = "D. Libkin",
title = "Incremental recomputation in local languages",
text = "Dong, Libkin, and Wong. Incremental recomputation in local languages. INFCTRL:
Information and Computation (formerly Information and Control), 181, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/libkin01incremental.html" }
Citations (may not include all citations):
775
Foundations of Databases (context) - Abiteboul, Hull et al. - 1995
294
Finite Model Theory (context) - Ebbinghaus, Flum - 1995
222
Maintaining views incrementally (context) - Gupta, Mumick et al. - 1993
211
Languages that capture complexity classes
- Immerman - 1987
116
On local and non-local properties (context) - Gaifman - 1982
110
Descriptive Complexity (context) - Immerman - 1999
93
Principles of programming with complex objects and collectio..
- Buneman, Naqvi et al. - 1995
88
Incremental recomputation of active relational expressions
- Qian, Wiederhold - 1991
49
On monadic NP vs monadic co-NP (context) - Fagin, Stockmeyer et al. - 1994
49
Query languages for bags and aggregate functions
- Libkin, Wong - 1997
43
Incremental and decremental evaluation of transitive closure.. (context) - Dong, Su - 1995
37
Complexity models for incremental computation
- Miltersen, Subramanian et al. - 1994
36
Maintenance expressions for views with aggregation
- Quass
34
Special Issue on Materialized Views and Data Warehousing (context) - Gupta, Mumick et al. - 1995
31
Notions of locality and their logical characterizations over..
- Hella, Libkin et al. - 1999
30
Incremental evaluation of datalog queries (context) - Dong, Topor - 1992
28
Fully dynamic biconnectivity and transitive closure (context) - Henzinger, King - 1995
27
Dyn-FO: A parallel dynamic complexity class
- Patnaik, Immerman - 1997
24
Logics with aggregate operators
- Hella, Libkin et al.
19
Incremental maintenance of views with duplicates
- Grin, Libkin - 1995
17
the power of aggregation in relational query languages
- Libkin, Wong - 1997
12
Eciently updating materialized views (context) - Blakeley, Larson et al. - 1986
11
Incremental recomputation of recursive queries with nested s..
- Libkin, Wong - 1997
8
An improved algorithm for incremental recomputation of activ..
- Grin, Libkin et al. - 1997
8
Deterministic FOIES are strictly weaker (context) - Dong, Su - 1997
5
Locality of order-invariant rst-order formulas (context) - Grohe, Schwentick - 2000
1
Arity bounds in rst-order incremental evaluation and denitio.. (context) - Dong, Su - 1998
1
Dynamic tree isomorphism via rst-order updates (context) - Etessami
Documents on the same site (http://www.cs.toronto.edu/~libkin/publ.html): More
Expressive Power of SQL - Libkin (2001)
(Correct)
Logics Capturing Local Properties - Libkin (2001)
(Correct)
Lower Bounds for Invariant Queries in Logics with Counting - Libkin, Wong (2002)
(Correct)
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