Local properties of query languages

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

Volumn 1186, Issue , 1997, Pages 140-154

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

^a UNIVERSITY OF MELBOURNE   (Australia)

^b LUCENT TECHNOLOGIES   (United States)

^c BioInformatics Center and Institute of Systems Science   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; FORMAL LOGIC; QUERY PROCESSING;

AUXILIARY DATA; BOUNDED DEGREE; DATABASE QUERY LANGUAGE; EXPRESSIVE POWER; FINITE MODEL THEORY; FIRST ORDER LOGIC; RELATIONAL CALCULUS; TRANSITIVE CLOSURE;

QUERY LANGUAGES;

EID: 84948978740     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62222-5_42     Document Type: Conference Paper

References (28)

1. S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases, Addison Wesley, 1995.
2. S. Abiteboul, P. Kanellakis. Query languages for complex object databases. SIGACT News, 21(3):9-18, 1990.
3. M. Ajtai and R. Fagin. Reachability is harder for directed than for undirected graphs. Journal of Symbolic Logic, 55(1):113-150, March 1990.
4. J. Albert. Algebraic properties of bag data types. In VLDB'91, pages 211-219.
5. J. Barwise et al eds., Model-Theoretic Logics. Springer-Verlag, 1985.
6. P. Buneman, S. Naqvi, V. Tannen, L. Wong. Principles of programming with complex objects and collection types. Theoretical Computer Science, 149 (1995), 3-48.
7. S. Chaudhuri, M. Y. Vardi, Optimization of real conjunctive queries, In PODS'98.
8. M.P. Consens, A.O. Mendelzon, Low complexity aggregation in GraphLog and Datalog, Theoretical Computer Science 116 (1993), 95-116.
9. G. Dong, L. Libkin, L. Wong. On impossibility of decremental recomputation of recursive queries in relational calculus and SQL. In Database Progr. Lang.'95, Springer Electronic Workshops in Computing, 1996.
10. G. Dong, L. Libkin, L. Wong. Local properties of query languages, Tech. Memo, Bell Labs, 1995.
11. G. Dong and J. Su. Incremental and Decremental Evaluation of Transitive Closure by First-Order Queries. Information and Computation, 120(1):101-106, 1995.
12. G. Dong and J. Su. Space-bounded FOIES. In PODS'95, pages 139-150.
13. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer Verlag, 1995.
14. K. Etessami, Counting quantifiers, successor relations, and logarithmic space, in Conf. on Structure in Complexity Theory, 1995.
15. R. Fagin, L. Stockmeyer, M. Vardi, On monadic NP vs monadic co-NP, Information and Computation, 120 (1994), 78-92.
16. Q. Gaifman, On local and non-local properties, in Logic Colloquium '81, North Holland, 1982.
17. T. Griffin, L. Libkin, Incremental maintenance of views with duplicates, In SIG-MOD'95, pages 319-330.
18. S. Grumbach, T. Milo, Towards tractable algebras for bags, Journal of Computer and System Sciences, 52 (1996), 570-588.
19. S. Grumbach, L. Libkin, T. Milo and L. Wong. Query languages for bags: expressive power and complexity. SIGACT News, 27 (1996), 30-37.
20. S. Grumbach and C. Tollu. On the expressive power of counting. Theoretical Computer Science 149(1): 67-99, 1995.
21. A. Klug, Equivalence of relational algebra and relational calculus query languages having aggregate functions, Journal of the ACM 29, No. 3 (1982), 699-717.
22. L. Libkin, L. Wong, Some properties of query languages for bags, In DBPL'93, Springer, 1994.
23. L. Libkin, L. Wong, Query languages for bags and aggregate functions. JCSS, to appear. Extended abstract in PODS'94, pages 155-166
24. L. Libkin, L. Wong, On representation and querying incomplete information in databases with bags, Information Processing Letters 56 (1995), 209-214.
25. G. Ozsoyoglu, Z. M. Ozsoyoglu, V. Matos, Extending relational algebra and relational calculus with set-valued attributes and aggregate functions, ACM Transactions on Database Systems 12, No. 4 (1987), 566-592.
26. J. Paredæns and D. Van Gucht. Converting nested relational algebra expressions into flat algebra expressions. ACM TODS, 17(l):65-93, March 1992.
27. S. Patnaik and N. Immerman. Dyn-FO: A parallel dynamic complexity class. In PODS'94, pages 210-221.
28. L. Wong, Normal forms and conservative properties for query languages over collection types, JCSS 52 (1996), 495-505.