Inremental recomputation of recursive queries with nested sets and aggregate functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1369 LNCS, Issue , 1998, Pages 222-238

  Libkin, Leonid ^a   Wong, Limsoon ^b  

^a NOKIA RESEARCH CENTER   (United States)

^b Institute of Systems Science   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; RECURSIVE FUNCTIONS; RELATIONAL DATABASE SYSTEMS;

AGGREGATE FUNCTION; ALTERNATING PATH; COMPUTATIONAL POWER; INCREMENTAL EVALUATION; RELATIONAL CALCULUS; RELATIONAL LANGUAGES; SHARP CONTRAST; TRANSITIVE CLOSURE;

AGGREGATES;

EID: 22044451571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64823-2_13     Document Type: Conference Paper

References (23)

1. S. Abiteboul, R. Hull and V. Vianu. Foundations of Databases. Addison Wesley, 1995.
2. S. Abiteboul and P. Kanellakis. Query languages for complex object databases. SIGACT News, 21(3):9-18, 1990.
3. A. Aho and J. Ullman. Universality of data retrieval languages. In Proceedings 6th Symposium on Principles of Programming Languages, Texas, January 1979, pages 110-120, 1979.
4. P. Buneman, L. Libldn, D. Suciu, V. Tannen, and L. Wong. Comprehension syntax. SIGMOD Record, 23(1):87-96, March 1994.
5. P. Buneman, S. Naqvi, V. Tannen, and L. Wong. Principles of programming with complex objects and collection types. Theoretical Computer Science, 149(1):3-48, September 1995.
6. J.-Y. Cai. Lower bound for constant-depth circuits in the presence of help bits. Information Processing Letters, 36:79-83, 1990.
7. G. Dong, L. Libkin, and L. Wong. On impossibility of decrementai recomputation of recursive queries in relational calculus and SQL. In Proceedings of Sth International Workshop on Database Programming Languages, Gubbio, Italy, September 1995, Springer Electronic Workshops in Computing, 1996. Available at http://www.springer.co.uk/eWiC/Workshops/DBPL5.html.
8. G. Dong, L. Libkin, and L. Wong. Local properties of query languages. In Proceedings of 6th International Conference on Database Theory, pages 140-154, Delphi, Greece, January 1997.
9. G. Dong and J. Su. Incremental and decrementai evaluation of transitive closure by first-order queries. Information and Computation, 120(1):101-106, July 1995.
10. G. Dong and J. Su. Space-bounded FOIES. In Proceedings of 14th ACM Symposium on Principles of Database Systems, San Jose, California, pages 139-150, May 1995.
11. G. Dong and J. Su. Deterministic FOIES are strictly weaker. Annals of Mathematics and Artificial Intelligence 19(1):127-146, 1997.
12. G. Dong, J. Su, and R. Topor. Nonrecursive incremental evaluation of Datalog queries. Annals of Mathematics and Artificial Intelligence, 14:187-223, 1995.
13. 1 arity hierarchies. Bulletin of EATCS, 61:72-79, 1997.
14. N. Immerman. Languages that capture complexity classes. SIAM Journal of Computing, 16:760-778, 1987.
15. L. Libkin and L. Wong. Aggregate functions, conservative extension, and linear orders. In C. Beeri, A. Ohori, and D. Shasha, editors, Proceedings of 4th International Workshop on Database Programming Languages, New York, August 1993, pages 282-294. Springer-Verlag, January 1994.
16. L. Libkin and L. Wong. Conservativity of nested relational calculi with internal generic functions. Information Processing Letters, 49(6):273-280, March 1994.
17. L. Libkin and L. Wong. Query languages for bags and aggregate functions. Journal of Computer and System Sciences, 55 (1997), 241-272.
18. L. Libkin and L. Wong. Incremental recomputation of recursive queries with nested sets and aggregate functions. Technical Report 97-224-0, Institute of Systems Science, Heng Mui Keng Terrace, Singapore 119597, April 1997.
19. J. Paredaens and D. Van Gucht. Converting nested relational algebra expressions into flat algebra expressions. ACM Transaction on Database Systems, 17(1):65-93, March 1992.
20. S. Patnaik and N. Immerman. Dyn-FO: A parallel dynamic complexity class. In Proceedings of 13th ACM Symposium on Principles of Database Systems, pages 210-221, Minneapolis, Minnesota, May 1994.
21. P. Wadler. Comprehending monads. Mathematical Structures in Computer Science, 2:461-493, 1992.
22. L. Wong. Querying Nested Collections. PhD thesis, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104, August 1994. Available as University of Pennsylvania IRCS Report 94-09.
23. L. Wong. Normal forms and conservative extension properties for query languages over collection types. Journal of Computer and System Sciences, 52(3):495-505, June 1996.