Expressiveness of structured document query languages based on attribute grammars

Journal of the ACM

Volumn 49, Issue 1, 2002, Pages 56-100

  Neven, Frank ^a   Van Bussche, Jan Den ^a  

^a HASSELT UNIVERSITY   (Belgium)

Author keywords

Attribute grammars; Automata; Complexity; Logic; Structured documents

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; FORMAL LOGIC; MATHEMATICAL MODELS; POLYNOMIALS; SEMANTICS;

ATTRIBUTE GRAMMERS; DATABASE MANAGEMENT; STRUCTURED DOCUMENTS; TEXTUAL DATABASES;

QUERY LANGUAGES;

EID: 1142309125     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/505241.505245     Document Type: Article

References (31)

1. ABITEBOUL, S., CLUET, S., AND MILO, T. 1998. A logical view of structured files. VLDB J. 7, 2, 96-114.
2. ABITEBOUL, S., AND VIANU, V. 1995. Computing with first-order logic. J. Comput. Syst. Sci. 50, 2, 309-335.
3. BLOEM, R. AND ENGELFRIET, J. 2000. A comparison of tree transductions defined by monadic second order logic and by attribute grammars. J. Comput. Syst. Sci. 61, 1, 1-50.
4. COURCELLE, B., AND DERANSART, P. 1988. Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming. Inf. Comput. 78, 1, 1-55.
5. DERANSART, P., JOURDAN, M., AND LORHO, B. 1988. Attribute Grammars: Definition, Systems and Bibliography. In Lecture Notes in Computer Science, vol. 323. Springer-Verlag, New York.
6. DONER, J. 1970. Tree acceptors and some of their applications. J. Comput. Syst. Sci. 4, 406-451.
7. EBBINGHAUS, H.-D., AND PLUM, J. 1995. Finite Model Theory. Springer-Verlag, New York.
8. EBBINGHAUS, H.-D., FLUM, J., AND THOMAS, W. 1994. Mathematical Logic (second ed.). In Undergraduate Texts in Mathematics. Springer-Verlag, New York.
9. ENDERTON, H. 1972. A Mathematical Introduction to Logic. Academic Press, Orlando, Fla.
10. FAGIN, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. In Complexity of Computation, Volume 7 of SIAM-AMS Proceedings, R. Karp, Ed. pp. 43-73.
11. GÉCSEG, M., AND STEINBY, M. 1984. Tree Automata. Akademia Kiadó, Budapest, Hungary.
12. GÉCSEG, F., AND STEINBY, M. 1997. Tree languages. In Handbook of Formal Languages, Vol. 3, Chap. 1. G. Rozenberg and A. Salomaa, Eds. Springer-Verlag, New York.
13. GOLDFARB, C. 1995. The SGML Handbook. Clarendon Press.
14. GONNET, G., AND TOMPA, F. 1987. Mind your grammar: A new approach to modelling text. In Proceedings of the 13th Conference on Very Large Databases. pp. 339-346.
15. HOPCROFT, J., AND ULLMAN, J. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass.
16. IMMERMAN, N. 1989. Expressibility and parallel complexity. SIAM J. Comput. 18, 625-638.
17. KNUTH, D. 1968. Semantics of context-free languages. Math. Syst. Theory 2, 2, 127-145. See also Math. Syst. Theory 5, 2, 95-96, 1971.
18. KNUTH, D. 1968. Semantics of context-free languages. Math. Syst. Theory 2, 2, 127-145. See also Math. Syst. Theory 5, 2, 95-96, 1971.
19. KNUTH, D. E. 1982. The Art of Computer Programming, Vol. 1. Addison-Wesley, Reading, Mass.
20. KOLAITIS, P. 1990. Implicit definability on finite structures and unambiguous computations. In Proceedings of the 5th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 168-180.
21. KOLAITIS, P., AND VARDI, M. 1992. Infinitary logics and 0-1 laws. Inf. Comput. 98, 2, 258-294.
22. MECCA, G., ATZENI, P., MASCI, A., MERIALDO, P., AND SINDONI, G. 1998. The ARANEUS web-base management system. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, New York, pp. 544-546.
23. MORIYA, E. 1994. On two-way tree automata. Inf. Proc. Lett. 50, 117-121.
24. MOSCHOVAKIS, Y. 1974. Elementary Induction on Abstract Structures. North-Holland, Amsterdam, The Netherlands.
25. PAPADIMITRIOU, C. 1994. Computational Complexity. Addison-Wesley, Reading, Mass.
26. PAPAKONSTANTINOU, Y., GARCIA-MOLINA, H., AND WIDOM, J. 1995. Object exchange across heterogeneous information sources. In Proceedings of the 11th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, Calif., pp. 251-260.
27. THATCHER, J., AND WRIGHT, J. 1968. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Syst. Theory 2, 1, 57-81.
28. THOMAS, W. 1997. Languages, automata, and logic. In Handbook of Formal Languages, Vol. 3, Chap. 7. G. Rozenberg and A. Salomaa, Eds, Springer-Verlag, New York.
29. VALIANT, L. G. 1976. Relative complexity of checking and evaluating. Inf. Proc. Lett. 5, 1 (May), 20-23.
30. VARDI, M. Y. 1989. Automata theory for database theoreticians. In Proceedings of the 8th ACM Symposium on Principles of Database Systems. ACM, New York, pp. 83-92.
31. WOOD, D. 1995. Standard generalized markup language: Mathematical and philosophical issues. In Computer Science Today. Recent Trends and Developments, J. van Leeuwen, Ed. Lecture Notes in Computer Science, vol. 1000. Springer-Verlag, New York, pp. 344-365.