Leonid Libkin, Limsoon Wong  Home/Search
Context Related
| astar.edu.sg/limsoon/...dbpl994.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: astar.edu.sg/lim...limsoonpapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper. The main questions addressed in this setting deal with conditions under which it is possible to evaluate queries incrementally (Update)
Context of citations to this paper: More
.... exponentially many new elements, letting it decide problems that it couldn t when the database size remains polynomially bounded, cf. [LW99]. Using our new formulation of dynamic computation, we present the first complete problems for dynamic complexity classes including Dyn FO...
Cited by: More
Efficient Incremental Validation of XML Documents after.. - Barbosa, Leighton, Smith (2006) (Correct)
Incremental Recomputation in Local Languages - Dong, Libkin, Wong (2003) (Correct)
Complete Problems for Dynamic Complexity Classes - Hesse, Immerman (2002) (Correct)
Active bibliography (related documents): More All
1.5: On the Power of Incremental Evaluation in SQL-like Languages - Libkin, Wong (1999) (Correct)
0.7: Maintaining Transitive Closure of Graphs in SQL - Dong, Libkin, Su, Wong (1999) (Correct)
0.4: A Data Warehouse for Cross-Species Anatomy - Wagner (2002) (Correct)
Similar documents based on text: More All
0.5: 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: SQL Can Maintain Polynomial-Hierarchy Queries - Libkin, Wong (1997) (Correct)
Related documents from co-citation: More All
3: Incremental and decremental evaluation of transitive closure by first-order quer.. (context) - Dong, Su - 1995
3: Dyn-FO: A parallel dynamic complexity class - Patnaik, Immerman - 1994
3: Complexity models for incremental computation - Miltersen, Subramanian et al. - 1994
BibTeX entry: (Update)
L. Libkin and L. Wong, "On the Power of Incremental Evaluation in SQL-Like Languages." DBPL (1999). http://citeseer.ist.psu.edu/libkin99power.html More
@article{ libkin00power,
author = "Leonid Libkin and Limsoon Wong",
title = "On the Power of Incremental Evaluation in {SQL}-Like Languages",
journal = "Lecture Notes in Computer Science",
volume = "1949",
pages = "17--??",
year = "2000",
url = "citeseer.ist.psu.edu/libkin99power.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
775 Foundations of Databases (context) - Abiteboul, Hull et al. - 1995
222 Maintaining views incrementally (context) - Gupta, Mumick et al.
211 Languages that capture complexity classes - Immerman - 1987
116 On local and non-local properties (context) - Gaifman - 1982
111 Maintenance of materialized views: problems (context) - Gupta, Mumick - 1995
93 Principles of programming with complex objects and collectio.. - Buneman, Naqvi et al. - 1995
49 Local properties of query languages - Dong, Libkin et al.
49 Query languages for bags and aggregate functions - Libkin, Wong - 1997
49 On monadic NP vs monadic co-NP (context) - Fagin, Stockmeyer et al. - 1994
43 Computing with first-order logic - Abiteboul, Vianu - 1995
31 Notions of locality and their logical characterizations over.. - Hella, Libkin et al.
27 Dyn-FO: A parallel dynamic complexity class - Patnaik, Immerman - 1997
24 Logics with aggregate operators - Hella, Libkin et al.
17 On counting logics and local properties - Libkin
15 Nonrecursive incremental evaluation of Datalog queries - Dong, Su et al. - 1995
12 On impossibility of decremental recomputation of recursive q.. - Dong, Libkin et al.
11 Incremental recomputation of recursive queries with nested s.. - Libkin, Wong
6 Arity bounds in first-order incremental evaluation and defin.. (context) - Dong, Su - 1998
5 Dynamic tree isomorphism via first-order updates to a relati.. - Etessami
3 ADEPT -- The advanced database environment for planning and .. (context) - Schultz - 1998
3 Maintaining the transitive closure of graphs in SQL - Dong, Libkin et al. - 1999
Documents on the same site (http://sdmc.i2r.a-star.edu.sg/limsoon/limsoonpapers.html): More
Semantic Representations and Query Languages for Or-Sets - Libkin, Wong (1993) (Correct)
BioKleisli: A Digital Library for Biomedical Researchers - Davidson, Overton, Tannen.. (1996) (Correct)
S-Hash: An Indexing Scheme for Approximate Subsequence.. - Pang, Ooi, Wong (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