Numerical Document Queries

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn 22, Issue , 2003, Pages 155-166

  Seidl, Helmut ^a   Schwentick, Thomas ^b   Muscholl, Anca ^c  

^a UNIVERSITY OF TRIER   (Germany)

^b PHILIPPS UNIVERSITY MARBURG   (Germany)

^c UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Automata; Monadic second order logic; Presburger arithmetic; Querying XML documents

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; CONSTRAINT THEORY; DATABASE SYSTEMS; ONLINE SEARCHING; XML;

DATA VALUES; QUERYING ALGORITHMS;

QUERY LANGUAGES;

EID: 1142305375     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773153.773169     Document Type: Conference Paper

References (28)

1. A. Berlea and H. Seidl. Binary Queries. In Extreme Markup Languages 2002 Conference, Montreal, August 2002.
2. L. Berman. The Complexity of Logical Theories. Theoretical Computer Science (TCS), 11:71-77, 1980.
3. J.R. Büchi. Weak Second-order Arithmetic and Finite Automata. Math. Logik. Grund. Math., 6:66-92, 1960.
4. L. Cardelli and G. Ghelli. A Query Language Based on the Ambient Logic. In 10th European Symposium on Programming (ESOP), pages 1-22. LNCS 2028, Springer Verlag, 2001.
5. L. Cardelli and A. Gordon. Anytime, Anywhere: Modal Logics for Mobile Ambients. In 27th ACM Conf. on Principles of Programming Languages (POPL), pages 365-377, 2000.
6. G. Conforti, O. Ferrara, and G. Ghelli. TQL Algebra and its Implementation (Extended Abstract). In IFIP Int. Conf. on Theoretical Computer Science (IFIP TCS), pages 422-434, 2002.
7. G. Conforti, G. Ghelli, A. Albano, D. Colazzo, P. Manghi, and C. Sartiani. The Query Language TQL. In 5th Int. Workshop on the Web and Databases (WebDB), 2002.
8. J. Ferrante and C.W. Rackoff. The Computational Complexity of Logical Theories, volume 718 of Lecture Notes in Mathematics. Springer Verlag, 1979.
9. M.J. Fischer and M.O. Rabin. Superexponential Complexity of Presburger Arithmetic. In AMS Symp. on the Complexity of Computational Computational Processes. Vol. 7, pages 27-41, 1974.
10. S. Ginsburg and E.H. Spanier. Bounded ALGOL-like Languages. Trans. Amer. Math. Soc., 113:333-368, 1964.
11. S. Ginsburg and E.H. Spanier. Semigroups, Presburger Formulas and Languages. Pacific Journal of Mathematics, 16(2):285-296, 1966.
12. G. Gottlob and C. Koch. Monadic Datalog and the Expressive Power of Languages for Web Information Extraction. In PODS 2001, pages 17-28, 2002.
13. F. Klaedtke and H. Ruess. Parikh automata and monadic second-order logics with linear cardinality constraints. Technical Report 177, Institute of Computer Science at Freiburg University, 2002.
14. O. Kupferman, U. Sattler, and M.Y. Vardi. The Complexity of the Graded μ-Calculus. In 18th Int. Conf. on Automated Deduction (CADE), pages 423-437. LNCS 2392, Springer Verlag, 2002.
15. D. Lugiez. A Good Class of Automata and Application to Inductive Theorem Proving. In 25th Int. Coll. on Automata, Languages and Programming (ICALP), pages 409-420. LNCS 1443, Springer Verlag, 1998.
16. D. Lugiez and S. Dal Zilio. Multitrees Automata, Presburger's Constraints and Tree Logics. Technical Report 08-2002, Laboratoire d'Informatique Fondamentale de Marseille, 2002.
17. D. Lugiez and S. Dal Zilio. XML Schema, Tree Logic and Sheaves Automata. Technical Report RR-4631, INRIA, 2002.
18. T. Milo, D. Suciu, and V. Vianu. Typechecking for XML Transformers. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 11-22, Dallas, TX, 2000.
19. M. Minsky. Recursive Unsolvability of Post's Problem of Tag and Other Topics in the Theory of Turing Machines. Ann. of Math., 74:437-455, 1961.
20. 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 (FSTTCS), LNCS, pages 134-145. Springer Verlag, 1998.
21. F. Neven and T. Schwentick. Query Automata over Finite Trees. Theoretical Computer Science (TCS), 275 (1-2):633-674, 2002.
22. F. Neven, T. Schwentick, and V. Vianu. Towards Regular Languages over Infinite Alphabets. In MFCS 2001, pages 560-572, 2001.
23. F. Neven and J. Van den Bussche. Expressiveness of Structured Document Query Languages Based on Attribute Grammars. Journal of the ACM, 49(1):56-100, 2002.
24. J. Niehren and A. Podelski. Feature Automata and Recognizable Sets of Feature Trees. In 4th Int. Conf. on Theory and Practice of Software Development (TAPSOFT), pages 356-375. LNCS 668, Springer Verlag, 1993.
25. H. Ohsaki. Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories. In 15th Computer Science Logic (CSL), pages 539-553. LNCS 2142, Springer Verlag, 2001.
26. H. Ohsaki and T. Takai. Decidability and Closure Properties of Equational Tree Languages. In 13th Int. Conf. on Rewriting Techniques and Applications (RTA), pages 114-128. LNCS 2378, Springer Verlag, 2002.
27. R. Parikh. On Context-Free Languages. Journal of the ACM (JACM), 13(4):570-581, 1966.
28. P. Wolper and B. Boigelot. On the Construction of Automata from Linear Arithmetic Constraints. In Tools and Algorithms for Construction and Analysis of Systems, 6th Ann. Conf. (TACAS), pages 1-19. LNCS 1785, Springer Verlag, 2000.