Automata theory for XML researchers

SIGMOD Record

Volumn 31, Issue 3, 2002, Pages 39-46

  Neven, Frank ^a  

^a HASSELT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

DATALOG PROGRAMS; RANKED TREE AUTOMATA; REGULAR STRING LANGUAGES;

DATABASE SYSTEMS; FORMAL LANGUAGES; FUNCTIONS; QUERY LANGUAGES; SET THEORY; TREES (MATHEMATICS); XML;

AUTOMATA THEORY;

EID: 0038180542     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/601858.601869     Document Type: Article

References (38)

1. A. V. Aho and J. D. Ullman. Translations on a context-free grammar. Inform, and Control, 19:439-475, 1971.
2. G. J. Bex, S. Maneth, and F. Neven. A formal model for an expressive fragment of XSLT. Information Systems, 27(1):21-39, 2002.
3. A. Brüggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets: Version 1, april 3, 2001. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001.
4. A. Brüggemann-Klein and D. Wood. Caterpillars: A context specification technique. Markup Languages, 2(1):81-106, 2000.
5. M. Consens and T. Milo. Algebras for querying text regions: Expressive power and optimization. Journal of Computer and System Sciences, 3:272-288, 1998.
6. P. Deransart, M. Jourdan, and B. Lorho. Attribute Grammars: Definition, Systems and Bibliography, volume 323 of Lecture Notes in Computer Science. Springer, 1988.
7. J. Engelfriet and H. J. Hoogeboom. Tree-walking pebble automata. In J. Karhumki, H. Maurer, G. Paun, and G.Rozenberg, editors, Jewels are forever, contributions to Theoretical Computer Science in honor of Arto Salomaa, pages 72-83. Springer-Verlag, 1999.
8. J. Engelfriet, H.J. Hoogeboom, and J.-P. van Best. Trips on trees. Acta Cybernetica, 14:51-64, 1999.
9. G. Gottlob and C. Koch. Monadic datalog and the expresive power of languages for web information extraction. In Proc. 21th Symposium on Principles of Database Systems (PODS 2002), pages 17-28. ACM Press, 2002.
10. H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In Proceedings of 28th Symposium on Principles of Programming Languages (POPL 2001), pages 67-80. ACM Press, 2001.
11. M. Kaminski and N. Francez. Finite-memory automata. Theoretical Computer Science, 134(2):329-363, 1994.
12. N. Klarlund, A. Moller, and M. I. Schwartzbach. The DSD schema language. In Proceedings of the 3th ACM SIGSOFT Workshop on Formal Methods in Software Practice (FMSP 2000), 2000.
13. D. Lee, M. Mani, and M. Murata. Reasoning about XML schema languages using formal language theor. Technical report, IBM Almaden Research Center, 2000. Log# 95071.
14. S. Maneth and F. Neven. Structured document transformations based on XSL. In R. Connor and A. Mendelzon, editors, Research Issues in Structured and Semistructured Database Programming (DBPL'99), volume 1949 of Lecture Notes in Computer Science, pages 79-96. Springer, 2000.
15. W. Martens and F. Neven. Typechecking of top-down uniform unranked tree transducers. Manuscript.
16. G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In Proc. 21th Symposium on Principles of Database Systems (PODS 2002), pages 65-76, 2002.
17. T. Milo, D. Suciu, and V. Vianu. Type checking for XML transformers. In Proceedings of the Nineteenth ACM Symposium on Principles of Database Systems, pages 11-22. ACM Press, 2000.
18. M. Murata. Relax, http://www.xml.gr.jp/relax/.
19. M. Murata. Data model for document transformation and assembly. In E. V. Munson, K. Nicholas, and D. Wood, editors, Proceedings of the workshop on Principles of Digital Document Processing, volume 1481 of Lecture Notes in Computer Science, pages 140-152, 1998.
20. M. Murata. Extended path expressions for xml. In Proc. 20th Symposium on Principles of Database Systems (PODS 2001), pages 126-137. ACM Press, 2001.
21. A. Neumann and H. Seidl. Locating matches of tree patterns in forests. In V. Arvind and R. Ramanujam, editors, Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, pages 134-145. Springer, 1998.
22. F. Neven. Extensions of attribute grammars for structured document queries. In R. Connor and A. Mendelzon, editors, Research Issues in Structured and Semistructured Database Programming (DBPL'99), volume 1949 of Lecture Notes in Computer Science, pages 97-114. Springer, 2000.
23. F. Neven. On the power of walking for querying tree-structured data. In Proc. 21th Symposium on Principles of Database Systems (PODS 2002), pages 77-84. ACM Press, 2002.
24. F. Neven and T. Schwentick. Expressive and efficient pattern languages for tree-structured data. In Proc. 19th Symposium on Principles of Database Systems (PODS 2000), pages 145-156, 2000.
25. F. Neven and T. Schwentick. On the power of tree-walking automata. In U. Montanari, J. D. P. Rolim, and E. Welzl, editors, International Colloquium on Automata, Languages and Programming (ICALP 2000), volume 1853 of Lecture Notes in Computer Science, pages 547-560. Springer, 2000.
26. F. Neven and T. Schwentick. Automata- and logic-based pattern languages for tree-structured data. Unpublished, 2001.
27. F. Neven and T. Schwentick. Query automata on finite trees. Theoretical Computer Science, 275:633-674, 2002.
28. F. Neven, T. Schwentick, and V. Vianu. Towards regular languages over infinite alphabets. In J. Sgall, A. Pultr, and P. Kolman, editors, Mathematical Foundations of Computer Science (MFCS 2001), volume 2136 of Lecture Notes in Computer Science, pages 560-572. Springer, 2001.
29. F. Neven and J. Van den Bussche. Expressiveness of structured document query languages based on attribute grammars. Journal of the ACM, 49(1), 2002.
30. C. Pair and A. Quere. Définition et etude des bilangages réguliers. Information and Control, 13(6):565-593, 1968.
31. Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In Proc. 20th Symposium on Principles of Database Systems (PODS 2001), pages 35-46. ACM Press, 2001.
32. T. Schwentick. On diving in trees. In Proceedings of 25th Mathematical Foundations of Computer Science (MFCS 2000), pages 660-669, 2000.
33. L. Segoufin and V. Vianu. Validating streaming XML documents. In Proc. 21th Symposium on Principles of Database Systems (PODS 2002), pages 53-64. ACM Press, 2002.
34. D. Suciu. Typechecking for semistructured data. In Proceedings of the 8th Workshop on Data Bases and Programming Languages (DBPL 2001), 2001.
35. D. Suciu. The XML typechecking problem. SIGMOD Record, 31(l):89-96, 2002.
36. M. Takahashi. Generalizations of regular sets and their application to a study of context-free languages. Information and Control, 27(l):1-36, 1975.
37. M. Y. Vardi. Automata theory for database theoreticians. In Proceedings of the Eighth ACM Symposium on Principles of Database Systems, pages 83-92. ACM Press, 1989.
38. V. Vianu. A web odyssey: From Codd to XML. In Proc. 20th Symposium on Principles of Database Systems (PODS 2001), pages 1-15, 2001.