ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions.

Leonid Libkin, Limsoon Wong: Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions. DBPL 1997: 222-238
@inproceedings{DBLP:conf/dbpl/LibkinW97a,
  author    = {Leonid Libkin and
               Limsoon Wong},
  editor    = {Sophie Cluet and
               Richard Hull},
  title     = {Incremental Recomputation of Recursive Queries with Nested Sets
               and Aggregate Functions},
  booktitle = {Database Programming Languages, 6th International Workshop, DBPL-6,
               Estes Park, Colorado, USA, August 18-20, 1997, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1369},
  year      = {1997},
  isbn      = {3-540-64823-2},
  pages     = {222-238},
  ee        = {db/conf/dbpl/LibkinW97a.html},
  crossref  = {DBLP:conf/dbpl/97},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 5, SSDBM, DBPL, KRDB, ADBIS, COOPIS, SIGBDP" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

References

[1]
Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
Contents BibTeX
[2]
Serge Abiteboul, Paris C. Kanellakis: Database Theory Column: Query Languages for Complex Object Databases. SIGACT News 21(3): 9-18(1990) BibTeX
[3]
Alfred V. Aho, Jeffrey D. Ullman: The Universality of Data Retrieval Languages. POPL 1979: 110-120 BibTeX
[4]
Peter Buneman, Leonid Libkin, Dan Suciu, Val Tannen, Limsoon Wong: Comprehension Syntax. SIGMOD Record 23(1): 87-96(1994) BibTeX
[5]
Peter Buneman, Shamim A. Naqvi, Val Tannen, Limsoon Wong: Principles of Programming with Complex Objects and Collection Types. Theor. Comput. Sci. 149(1): 3-48(1995) BibTeX
[6]
Jin-yi Cai: Lower Bounds for Constant-Depth Circuits in the Presence of Help Bits. Inf. Process. Lett. 36(2): 79-83(1990) BibTeX
[7]
Guozhu Dong, Leonid Libkin, Limsoon Wong: On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL. DBPL 1995: 7 BibTeX
[8]
Guozhu Dong, Leonid Libkin, Limsoon Wong: Local Properties of Query Languages. ICDT 1997: 140-154 BibTeX
[9]
Guozhu Dong, Jianwen Su: Incremental and Decremental Evaluation of Transitive Closure by First-Order Queries. Inf. Comput. 120(1): 101-106(1995) BibTeX
[10]
Guozhu Dong, Jianwen Su: Space-Bounded FOIES. PODS 1995: 139-150 BibTeX
[11]
Guozhu Dong, Jianwen Su: Deterministic FOIES are Strictly Weaker. Ann. Math. Artif. Intell. 19(1-2): 127-146(1997) BibTeX
[12]
...
[13]
...
[14]
Neil Immerman: Languages that Capture Complexity Classes. SIAM J. Comput. 16(4): 760-778(1987) BibTeX
[15]
Leonid Libkin, Limsoon Wong: Aggregate Functions, Conservative Extensions, and Linear Orders. DBPL 1993: 282-294 BibTeX
[16]
Leonid Libkin, Limsoon Wong: Conservativity of Nested Relational Calculi with Internal Generic Functions. Inf. Process. Lett. 49(6): 273-280(1994) BibTeX
[17]
Leonid Libkin, Limsoon Wong: Query Languages for Bags and Aggregate Functions. J. Comput. Syst. Sci. 55(2): 241-272(1997) BibTeX
[18]
...
[19]
Jan Paredaens, Dirk Van Gucht: Converting Nested Algebra Expressions into Flat Algebra Expressions. ACM Trans. Database Syst. 17(1): 65-93(1992) BibTeX
[20]
Sushant Patnaik, Neil Immerman: Dyn-FO: A Parallel, Dynamic Complexity Class. PODS 1994: 210-221 BibTeX
[21]
Philip Wadler: Comprehending Monads. Mathematical Structures in Computer Science 2(4): 461-493(1992) BibTeX
[22]
Limsoon Wong: Querying Nested Collections. Ph.D. thesis, Univ. Pennsylvania 1994
BibTeX
[23]
Limsoon Wong: Normal Forms and Conservative Extension Properties for Query Languages over Collection Types. J. Comput. Syst. Sci. 52(3): 495-505(1996) BibTeX

Referenced by

  1. William Hesse: The Dynamic Complexity of Transitive Closure Is In DynTC0. ICDT 2001: 234-247
  2. Guozhu Dong, Jianwen Su: Incremental Maintenance of Recursive Views Using Relational Calculus/SQL. SIGMOD Record 29(1): 44-51(2000)
  3. Kousha Etessami: Dynamic Tree Isomorphism via First-Order Updates. PODS 1998: 235-243
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
DBLP-6, 1997 Proceedings, Lecture Notes in Computer Science: Copyright © by Springer
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:06:04 2009