N-ary queries by tree automata

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

Volumn 3774 LNCS, Issue , 2005, Pages 217-231

  Niehren, Joachim ^a   Planque, Laurent ^a   Talbot, Jean Marc ^a   Tison, Sophie ^a  

^a INRIA   (France)

Author keywords

Automata; Databases; Information extraction; Logic; Pattern; Types; XML

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; FORMAL LOGIC; INFORMATION ANALYSIS; PROBLEM SOLVING; XML;

AUTOMATA; INFORMATION EXTRACTION; PATTERN; TYPES;

QUERY LANGUAGES;

EID: 33745411181     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11601524_14     Document Type: Conference Paper

References (21)

1. R. Baumgartner, S. Flesca, and G. Gottlob. Visual web information extraction with lixto. In 28th International Conference on Very Large Data Bases, pages 119-128, 2001.
2. A. Berlea and H. Seidl. Binary queries for document trees. Nordic Journal of Computing, 11(1):41-71, 2004.
3. R. Bloem and J. Engelfriet. A comparison of tree transductions defined by monadic second order logic and by attribute grammars. Journal of Comput. and Syst. Sci., 61(1):1-50, 2000.
4. A. Bruggemann-Klein, D. Wood, and M. Murata. Regular tree and regular hedge languages over unranked alphabets: Version 1, Apr. 07 2001.
5. J. Carme, A. Lemay, and J. Niehren. Learning node selecting tree transducer from completely annotated examples. In 7th International Colloquium on Grammatical Inference, volume 3264 of Lecture Notes in Artificial Intelligence, pages 91-102. Springer Verlag, 2004.
6. J. Carme, J. Niehren, and M. Tommasi. Querying unranked trees with stepwise tree automata. In 19th International Conference on Rewriting Techniques and Applications, volume 3091 of Lecture Notes in Computer Science, pages 105-118. Springer Verlag, 2004.
7. G. Castagna, Patterns and types for querying XML. In 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science. Springer Verlag, Aug. 2005.
8. J. Chomicki, D. Q. Goldin, and G. M. Kuper. Variable independence and aggregation closure. In ACM Conference on Principle of Databases, pages 40-48, 1996.
9. H. Comon, M. Dauchet, R. Gilleron, P. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univlille3.fr/tata, 1997.
10. M. Prick, M. Grohe, and C. Koch. Query evaluation on compressed trees. In 18th IEEE Symposium on Logic in Computer Science, pages 188-197, 2003.
11. th LICS, Lecture Notes in Computer Science, pages 189-202, Copenhagen, 2002.
12. G. Gottlob, C. Koch, R. Baumgartner, M. Herzog, and S. Plesca. The Lixto data extraction project - back and forth between theory and practice. In ACM Symposium on Principles of Database Systems. ACM-Press, 2004.
13. H. Hosoya and B. Pierce. Regular expression pattern matching for xml. Journal of Functional Programming, 6(13):961-1004, 2003.
14. L. Libkin. Variable independence for first-order definable constraints. ACM Transactions on Computational Logics, 4(4):431-451, 2003.
15. S. Maneth, A. Berlea, T. Perst, and H. Seidl, Xml type checking with macro tree transducers. In 24th ACM Symposium on Principles of Database Systems, pages 283-294, New York, NY, USA, 2005. ACM-Press.
16. W. Martens and J. Niehren. Minimizing tree automata for unranked trees. In 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science. Springer Verlag, Aug. 2005.
17. M.Marx. Conditional XPath, the first order complete XPath dialect. In Proceedings of the symposium on Principles of database systems, pages 13-22, 2004.
18. P. Neven and J. V. D. Bussche. Expressiveness of structured document query languages based on attribute grammars. Journal of the ACM, 49(1):56-100, 2002.
19. P. Neven and T. Schwentick. Query automata over finite trees. Theoretical Computer Science, 275(1-2):633-674, 2002.
20. H. Seidl. On the finite degree of ambiguity of finite tree automata. Acta Informatica, 26(6):527-542, 1989.
21. J. W. Thatcher and J. B. Wright. Generalized finite automata with an application to a decision problem of second-order logic. Mathematical System Theory, 2:57-82, 1968.