First-Order Incremental Evaluation of Datalog Queries.

@inproceedings{DBLP:conf/dbpl/DongS93,
  author    = {Guozhu Dong and
               Jianwen Su},
  editor    = {Catriel Beeri and
               Atsushi Ohori and
               Dennis Shasha},
  title     = {First-Order Incremental Evaluation of Datalog Queries},
  booktitle = {Database Programming Languages (DBPL-4), Proceedings of the Fourth
               International Workshop on Database Programming Languages - Object
               Models and Languages, Manhattan, New York City, USA, 30 August
               - 1 September 1993},
  publisher = {Springer},
  series    = {Workshops in Computing},
  year      = {1993},
  isbn      = {3-540-19853-9},
  pages     = {295-308},
  ee        = {db/conf/dbpl/DongS93.html},
  crossref  = {DBLP:conf/dbpl/93},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-5 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

References

[1]

Foto N. Afrati, Stavros S. Cosmadakis: Expressiveness of Restricted Recursive Queries (Extended Abstract). STOC 1989: 113-126 BibTeX

[2]

Krzysztof R. Apt, Howard A. Blair, Adrian Walker: Towards a Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming. 1988: 89-148 BibTeX

[3]

Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
Contents BibTeX

[4]

Krzysztof R. Apt, Jean-Marc Pugin: Maintenance of Stratified Databases Viewed as a Belief Revision System. PODS 1987: 136-145 BibTeX

[5]

Alfred V. Aho, Jeffrey D. Ullman: The Universality of Data Retrieval Languages. POPL 1979: 110-120 BibTeX

[6]

François Bancilhon: Naive Evaluation of Recursively Defined Relations. On Knowledge Base Management Systems (Islamorada) 1985: 165-178 BibTeX

[7]

Val Tannen, Peter Buneman, Limsoon Wong: Naturally Embedded Query Languages. ICDT 1992: 140-154 BibTeX

[8]

François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman: Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986: 1-15 BibTeX

[9]

François Bry, Hendrik Decker, Rainer Manthey: A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases. EDBT 1988: 488-505 BibTeX

[10]

Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter: A Data Structure for Arc Insertion and Regular Path Finding. SODA 1990: 22-31 BibTeX

[11]

Ashok K. Chandra, Philip M. Merlin: Optimal Implementation of Conjunctive Queries in Relational Data Bases. STOC 1977: 77-90 BibTeX

[12]

Guozhu Dong: On Datalog Linearization of Chain Queries. Theoretical Studies in Computer Science 1992: 181-206 BibTeX

[13]

Guozhu Dong: Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations. PODS 1992: 81-90 BibTeX

[14]

...

[15]

Guozhu Dong, Rodney W. Topor: Incremental Evaluation of Datalog Queries. ICDT 1992: 282-296 BibTeX

[16]

Ashish Gupta, Dinesh Katiyar, Inderpal Singh Mumick: Counting solutions to the View Maintenance Problem. Workshop on Deductive Databases, JICSLP 1992: 185-194 BibTeX

[17]

Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi: Tools for Datalog Boundedness. PODS 1991: 1-12 BibTeX

[18]

Toshihide Ibaraki, Naoki Katoh: On-Line Computation of Transitive Closures of Graphs. Inf. Process. Lett. 16(2): 95-97(1983) BibTeX

[19]

Giuseppe F. Italiano: Amortized Efficiency of a Path Retrieval Data Structure. Theor. Comput. Sci. 48(3): 273-281(1986) BibTeX

[20]

Yannis E. Ioannidis: A Time Bound on the Materialization of some Recursively Defined Views. VLDB 1985: 219-226 BibTeX

[21]

Dean Jacobs, Richard Hull: Database Programming with Delayed Updates. DBPL 1991: 416-428 BibTeX

[22]

Håkan Jakobsson: On Materializing Views and On-Line Queries. ICDT 1992: 407-420 BibTeX

[23]

Volker Küchenhoff: On the Efficient Computation of the Difference Between Concecutive Database States. DOOD 1991: 478-502 BibTeX

[24]

John W. Lloyd, John C. Shepherdson: Partial Evaluation in Logic Programming. J. Log. Program. 11(3&4): 217-242(1991) BibTeX

[25]

John W. Lloyd, Liz Sonenberg, Rodney W. Topor: Integrity Constraint Checking in Stratified Databases. J. Log. Program. 4(4): 331-343(1987) BibTeX

[26]

Jean-Marie Nicolas: Logic for Improving Integrity Checking in Relational Data Bases. Acta Inf. 18: 227-253(1982) BibTeX

[27]

Xiaolei Qian: On the Expressive Power of the Bounded Iteration Construct. DBPL 1989: 411-421 BibTeX

[28]

Maarten H. van Emden, Robert A. Kowalski: The Semantics of Predicate Logic as a Programming Language. J. ACM 23(4): 733-742(1976) BibTeX

[29-1]

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press 1988, ISBN 0-7167-8158-1
Contents BibTeX

[29-2]

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
Contents BibTeX

[30]

Moshe Y. Vardi: Decidability and Undecidability Results for Boundedness of Linear Recursive Queries. PODS 1988: 341-351 BibTeX

Referenced by

1. Kousha Etessami: Dynamic Tree Isomorphism via First-Order Updates. PODS 1998: 235-243
2. Martin Sköld, Tore Risch: Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions. ICDE 1996: 392-401
3. Guozhu Dong, Jianwen Su: Space-Bounded FOIES. PODS 1995: 139-150
4. Ti-Pin Chang, Richard Hull: Using Witness Generators to Support Bi-directional Update Between Object-Based Databases. PODS 1995: 196-207
5. Guozhu Dong, Jianwen Su: Increment Boundedness and Nonrecursive Incremental Evaluation of Datalog Queries. ICDT 1995: 397-410
6. Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
   Contents