Guozhu Dong, Jianwen Su, Rodney Topor  Home/Search
Context Related
| munkora.cs.mu.oz.au/pu...mu_93_03.ps.gz cs.mu.oz.au/publicatio...mu_93_03.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: munkora.cs.mu.oz.au/publicat...TR (more) From: cs.mu.oz.au/publications/tr_...TR (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 first-order queries to compute the differences, and call this process "first-order incremental query evaluation." After... (Update)
Context of citations to this paper: More
...is in Dyn FO. The static versions of all these problems are not first order. Related work on dynamic complexity appears in [MSV94] In [DST93] first order incremental evaluation system (FOIES) are defined. A problem has an FOIES iff it is in Dyn FO. In [TY79] Tarjan and Yao...
...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...
Cited by: More
Dynamic Tree Isomorphism via First-order Updates to a Relational .. - Etessami (Correct)
Dyn-FO: A Parallel, Dynamic Complexity Class - Patnaik, Immerman (1994) (Correct)
Maintaining Transitive Closure of Graphs in SQL - Dong, Libkin, Su, Wong (1999) (Correct)
Similar documents (at the sentence level):
64.0%: Nonrecursive Incremental Evaluation of Datalog Queries - Dong, Su, Topor (1995) (Correct)
Active bibliography (related documents): More All
0.5: Grammars And Automata To Optimize Chain Logic Queries - Greco, Sacca (1999) (Correct)
0.5: The PushDown Method to Optimize Chain Logic Programs (Extended.. - Greco, al. (Correct)
0.4: Optimizing Incremental View Maintenance Expressions in Relational.. - Vista (1996) (Correct)
Similar documents based on text: More All
0.3: Mining the Smallest Association Rule Set for Predictions - Jiuyong Li Hong (2001) (Correct)
0.2: A model for inheritance and overriding in deductive.. - Dobbie, Topor (1993) (Correct)
0.2: A Parallel Sort-Balance Mutual Range-Join Algorithm on.. - Wong, Topor, Shen (1998) (Correct)
Related documents from co-citation: More All
7: Ullman J. D.: Principles of Database and Knowledge-Base Systems, Volumes 1 and 2. Computer Science Press, 1988. This article was processed using the L scaled 913a T E X macro package with LLNCS style
7: Maintaining views incrementally (context) - Gupta, Mumick et al. - 1993
6: Incremental evaluation of datalog queries (context) - Dong, Topor - 1992
BibTeX entry: (Update)
G. Dong and J. Su, First-order incremental evaluation of datalog queries, Proc. of Intl. Workshop on Database Programming Languages, 1993. http://citeseer.ist.psu.edu/127735.html More
@inproceedings{ dong93firstorder,
author = "G. Dong and J. Su",
title = "First-Order Incremental Evaluation of Datalog Queries",
booktitle = "Proc.\ of 4th International Workshop on Database Programming Languages, C. Beeri, A. Ohori and D. Shasha (Eds)",
publisher = "Workshop in Computing Series, Springer-Verlag",
pages = "295--308",
year = "1993",
url = "citeseer.ist.psu.edu/127735.html" }
Citations (may not include all citations):981 Principles of Database and Knowledge-base Systems (context) - Ullman - 1989
775 Foundations of Databases (context) - Abiteboul, Hull et al. - 1992
435 Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1988
248 The semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976
232 Optimal implementation of conjunctive queries in relational .. (context) - Chandra, Merlin - 1977
224 Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
204 Magic sets and other strange ways to implement logic program.. (context) - Bancilhon, Maier et al. - 1986
163 Universality of data retrieval languages (context) - Aho, Ullman - 1979
106 Naturally embedded query languages (context) - Breazu-Tannen, Buneman et al. - 1992
95 Logic for improving integrity checking in relational data ba.. (context) - Nicolas - 1982
63 A uniform approach to constraint satisfaction and constraint.. (context) - Bry, Decker et al. - 1988
45 the efficient computation of the difference between consecut.. (context) - Kuchenhoff - 1991
42 Naive evaluation of recursively defined relations (context) - Bancilhon - 1985
32 Integrity constraint checking in stratified databases (context) - Lloyd, Sonenberg et al. - 1987
30 Incremental evaluation of Datalog queries (context) - Dong, Topor - 1992
27 line computation of transitive closure of graphs (context) - Ibaraki, Katoh - 1983
27 Amortized efficiency of a path retrieval data structure (context) - Italiano - 1986
26 Maintenance of transitive closures and transitive reductions.. - Poutre, van Leeuwen - 1987
19 Expressiveness of restricted recursive queries (context) - Afrati, Cosmadakis - 1989
17 Decidability and undecidability results for boundedness of l.. (context) - Vardi - 1988
15 Counting solutions to the view maintenance problem - Gupta, Katiyar et al. - 1992
15 A data structure for arc insertion and regular path finding (context) - Buchsbaum, Kanellakis et al. - 1990
12 Database programming with delayed updates - Jacobs, Hull - 1991
11 Undecidable boundedness problems for Datalog programs - Hillebrand, Kanellakis et al. - 1992
10 A time bound on the materialization of some recursively defi.. (context) - Ioannidis - 1985
10 the expressive power of the bounded iteration construct - Qian - 1989
7 Maintenance of stratified databases viewed as a belief revis.. (context) - Apt, Pugin - 1987
5 On materializing views and on-line queries (context) - Jakobsson - 1992
4 On Datalog linearization of chain queries (context) - Dong - 1991
4 Datalog expressiveness of chain queries: Grammar tools and c.. (context) - Dong - 1992
3 First-order on-line computation of transitive closure querie.. (context) - Dong, Su - 1993
2 Tools for Datalog boundedness (context) - Hillerbrand, Kanellakis et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://munkora.cs.mu.oz.au/publications/tr_db/TR.html): More
Effective Clustering of Records for Fast Query Processing - Ramamohanarao, Harris (1996) (Correct)
Optimal Clustering of Relations in a Database System - Harris, Ramamohanarao (1994) (Correct)
Multiple Paths Join for Nested Relational Databases - Liu, Ramamohanarao (1993) (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