Local properties of query languages

Theoretical Computer Science

Volumn 239, Issue 2, 2000, Pages 277-308

  Dong, Guozhu ^a   Libkin, Leonid ^b   Wong, Limsoon ^c  

^a WRIGHT STATE UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

Databases; Expressive power; Locality; Query languages

Indexed keywords

EID: 0001375694     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00223-6     Document Type: Article

References (44)

1. S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases, Addison-Wesley, Reading, MA, 1995.
2. S. Abiteboul, P. Kanellakis, Query languages for complex object databases, SIGACT News 21(3) (1990) 9-18.
3. J. Albert, Algebraic properties of bag data types, in: Proc. 17th Internat. Conf. on Very Large Data Bases, 1991, pp. 211-219.
4. J. Barwise, S. Feferman (Eds.), Model-Theoretic Logics, Springer, Berlin, 1985.
5. P. Buneman, S. Naqvi, V. Tannen, L. Wong, Principles of programming with complex objects and collection types, Theoret. Comput. Sci. 149(1) (1995) 3-48.
6. S. Chaudhuri, M.Y. Vardi, Optimization of real conjunctive queries, in: Proc. 12th ACM Symp. on Principles of Database Systems, Washington, D.C., May 1993.
7. M.P. Consens, A.O. Mendelzon, Low complexity aggregation in GraphLog and Datalog, Theoret. Comput. Sci. 116(1) (1993) 95-116.
8. G. Dong, L. Libkin, L. Wong, On impossibility of decremental recomputation of recursive queries in relational calculus and SQL, in: Proc. 5th Internat. Workshop on Database Programming Languages, Gubbio, Italy, September 1995. Springer Electronic Workshops in Computing. Available from Springer EWiC server: http://www.springer.co.uk/eWiC/Workshops/DBPL5.html.
9. G. Dong, L. Libkin, L. Wong, Local properties of query languages, in: Proc. Internat. Conf. on Database Theory (ICDT'97), Lecture Notes in Computer Science, vol. 1186, Springer, Berlin, pp. 141-154.
10. G. Dong, J. Su, Incremental and decremental evaluation of transitive closure by first-order queries, Inform. Comput. 120(1) (1995) 101-106.
11. G. Dong, J. Su, Space-bounded FOIES, in: Proc. 14th ACM Symp. on Principles of Database Systems, San Jose CA, May 1995, pp. 139-150.
12. H.-D. Ebbinghaus, J. Flum, Finite Model Theory, Springer, Berlin, 1995.
13. A. Ehrenfeucht, An application of games to the completeness problem of formalized theories, Fund. Math. 49 (1961) 129-141.
14. K. Etessami, Counting quantifiers, successor relations, and logarithmic space, J. Comput. System Sci. 54(3) (1997) 400-411.
15. R. Fagin, Probabilities on finite models, J. of Symbolic Logic 41 (1976) 50-58.
16. R. Fagin, L. Stockmeyer, M. Vardi, On monadic NP vs monadic co-NP, Inform. Comput. 120 (1994) 78-92.
17. R. Fraïssé, Sur quelques classifications des systèmes de relations, Université d'Alger, Publications Scientifiques, Sér. A 1 (1954) 35-182.
18. H. Gaifman, On local and non-local properties, in: Proc. Herbrand Symp. Logic Colloquium '81, North-Holland, Amsterdam, 1982.
19. C.A. Gunter, Semantics of Programming Languages: Structures and Techniques, MIT Press, Cambridge, MA, 1992.
20. T. Griffin, L. Libkin, Incremental maintenance of views with duplicates, in: Proc. ACM-SIGMOD Internat. Conf. on Management of Data, San Jose, CA, May 1995.
21. S. Grumbach, L. Libkin, T. Milo, L. Wong, Query languages for bags: expressive power and complexity, SIGACT News 27(2) (1996) 30-37.
22. S. Grumbach, T. Milo, Towards tractable algebras for bags, J. Comput. System Sci. 55(3) (1996) 570-588.
23. S. Grumbach, C. Tollu, On the expressive power of counting, Theoret. Comput. Sci. 149(1) (1995) 67-99.
24. W. Hanf, Model-theoretic methods in the study of elementary logic, in: J.W. Addison et al. (Eds.), The Theory of Models, North-Holland, Amsterdam, 1965, pp. 132-145.
25. L. Hella, Logical hierarchies in PTIME, Inform. Comput. 129 (1996) 1-19.
26. L. Hella, L. Libkin, J. Nurmonen, Notions of locality and their logical characterizations over finite models, J. Symbolic Logic, to appear.
27. N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (1987) 760-778.
28. N. Immerman, E. Lander, Describing graphs: a first order approach to graph canonization, in: Complexity Theory Retrospective, Springer, Berlin, 1990.
29. A. Klug, Equivalence of relational algebra and relational calculus query languages having aggregate functions, J. ACM 29(3) (1982) 699-717.
30. L. Libkin, On the forms of locality over finite models, in: Proc. 12th IEEE Symp. on Logic in Computer Science, Warsaw, Poland, 1997, pp. 204-215
31. L. Libkin, On counting logics and local properties, in: Proc4 13th IEEE Symp. on Logic in Computer Science, Indianapolis, Indiana, 1998, pp. 501-512.
32. L. Libkin, L. Wong, Some properties of query languages for bags, in: Proc. 4th Internat. Workshop on Database Programming Languages, Manhattan, New York, August 1993.
33. L. Libkin, L. Wong, Aggregate functions, conservative extension, and linear orders, in: Proc. 4th Internat. Workshop on Database Programming Languages, Manhattan, New York, August 1993.
34. L. Libkin, L. Wong, Conservativity of nested relational calculi with internal generic functions, Inform. Process. Lett. 49 (1994) 273-280.
35. L. Libkin, L. Wong, On representation and querying incomplete information in databases with bags, Inform. Process. Lett. 56 (1995) 209-214.
36. L. Libkin, L. Wong, Query languages for bags and aggregate functions, J. Comput. System Sci. 55(2) (1997) 241-272.
37. L. Libkin, L. Wong, On the power of aggregation in relational query languages, in: Proc. 6th Internat. Workshop on Database Programming Languages, Lecture Notes in Computer Science, vol. 1369, Springer, Berlin, 1998, pp. 260-280.
38. J. Nurmonen, On winning strategies with unary quantifiers, J. Logic Comput. 6 (1996) 779-798.
39. J. Nurmonen, Unary quantifiers and finite structures, Ph.D. Thesis, University of Helsinki, 1996.
40. G. Ozsoyoglu, Z.M. Ozsoyoglu, V. Matos, Extending relational algebra and relational calculus with set-valued attributes and aggregate functions, ACM Trans. Database Systems 12(4) (1987) 566-592.
41. J. Paredaens, D. Van Gucht, Converting nested relational algebra expressions into flat algebra expressions, ACM Trans. Database Systems 17(1) (1992) 65-93.
42. S. Patnaik, N. Immerman, Dyn-FO: a parallel dynamic complexity class, J. Comput. System Sci. 55(2) (1997) 199-209.
43. J. Väänänen, Generalized quantifiers, Bull. EATCS 62 (1997) 115-136.
44. L. Wong, Normal forms and conservative properties for query languages over collection types, J. Comput. System Sci. 52(3) (1996) 495-505.