From XQuery to relational logics

ACM Transactions on Database Systems

Volumn 34, Issue 4, 2009, Pages

  Benedikt, Michael ^a   Koch, Christoph ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY BOUNDS; DATA VALUES; EXTENSIONS OF FIRST-ORDER LOGIC; FIRST ORDER LOGIC; FIRST-ORDER; LOGICAL LANGUAGE; PREDICATE LOGIC; RELATIONAL CALCULUS; RELATIONAL DATA; RELATIONAL LOGIC; RELATIONAL QUERY LANGUAGES; TOP-DOWN APPROACH; TOP-DOWN TREES; TREE-STRUCTURED DATA; VARIABLE BINDING; VARIABLE FRAGMENT;

FORMAL LOGIC; LINGUISTICS; TRANSLATION (LANGUAGES);

QUERY LANGUAGES;

EID: 76149137272     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1620585.1620592     Document Type: Conference Paper

References (35)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley.
2. AVIGAD, J. 2003. Eliminating definitions and skolem functions in first-order logic. ACM Trans. Comput. Logic 4, 3, 402-415.
3. BARRINGTON, D. A. M., IMMERMAN, N., AND STRAUBING, H. 1990. On Uniformity within NC1. J. Comput. Syst. Sci. 41, 3, 274-306.
4. BENEDIKT, M. 2008. Back From Relational Logics to XQuery. To appear.
5. BENEDIKT, M. AND KOCH, C. 2006. Interpreting Tree-to-Tree Queries. In Proceedings of the International Colloquium on Automata Languages and Programmings (ICALP). 552-564.
6. BENEDIKT, M. AND KOCH, C. 2009. XPath Leashed. ACM Comput. Surv. 41.
7. CHAMBERLIN, D., ROBIE, J., AND FLORESCU, D. 2000. Quilt: An XML query language for heterogeneous data sources. In Proceedings of the InternationalWorkshop onWeb and Databases (WebDB). 53-62.
8. DEHAAN, D., TOMAN, D., CONSENS, M., AND öZSU, M. T. 2003. A Comprehensive XQuery to SQL translation using Dynamic Interval Encoding. In Proceedings of the ACM International Conference on the Management of Data (SIGMOD). 623-634.
9. EBBINGHAUS, H. -D. AND FLUM, J. 1999. Finite Model Theory. Springer. 2nd edition.
10. ETESSAMI, K., VARDI, M., AND WILKE, T. 2002. First order logic with two variables and unary temporal logic. Inform. Comput. 179, 2, 279-295
11. FAN, W., YU, J. X., LU, H., LU, J., AND RASTOGI, R. 2005. Query translation from XPath to SQL in the presence of recursive DTDs. In Proceedings of the International Conference on Very Large Databases (VLDB). 337-348.
12. FERŃANDEZ, M., KADIYSKA, Y., MORISHIMA, A., SUCIU, D., AND TAN, W. -C. 2002. SilkRoute: A framework for publishing relational data in XML. ACM Trans. Datab. Syst. 27, 4, 438-493.
13. GOTTLOB, G., KOCH, C., AND PICHLER, R. 2005. Efficient algorithms for processing XPath queries. ACM Trans. Datab. Syst. 30, 2, 444-491.
14. GOTTLOB, G., KOCH, C., AND SCHULZ, K. U. 2004. Conjunctive queries over trees. In Proceedings of the Symposium on Principles of Database Systems (PODS). 189-200.
15. GUREVICH, Y. AND SHELAH, S. 1989. On the satrength of the interpretation method. J. Symbol. Logic 54, 2, 305-323.
16. GYSSENS, M., SUCIU, D., AND GUCHT, D. V. 2001. The restricted and bounded fixpoint closures of the nested relational algebra are equivalent. Inform. Comput. 164, 1, 85-117.
17. HIDDERS, J., MARRARA, S., PAREDAENS, J., AND VERKAMMEN, R. 2005a. On the expressive power of XQuery fragments. In Proceedings of the International Workshop on Database Programming Languages (DBPL). 154-168.
18. HIDDERS, J., PAREDAENS, J., VERKAMMEN, R., AND DEMEYER, S. 2004. A light but formal introduction to XQuery. In Proceedings of the XML Database Symposium (XSYM). 5-20.
19. HIDDERS, J., PAREDAENS, J., VERKAMMEN, R., MICHIELS, P., AND PAGE, W. L. 2005b. On the expressive power of node construction in XQuery. In Proceedings of the International Workshop on Web and Database (WebDB). 85-90.
20. IMMERMAN, N. 1999. Descriptive Complexity. Springer.
21. JOHNSON, D. S. 1990. A catalog of complexity classes. In Handbook of Theoretical Computer Science. Vol.1. Elsevier Science Publishers B. V., Chapter 2, 67-161.
22. KOCH, C. 2006. On the complexity of non-recursive XQuery and functional query languages on complex values. ACM Trans. Datab. Syst. 31, 4, 1215-1256.
23. KRISHNAMURTHY, R., CHAKARAVARTHY, V., KAUSHIK, R., AND NAUGHTON, J. 2004a. Recursive XML schemas, recursive XML queries, and relational storage: XML-to-SQL query translation. In Proceedings of the International Conference on Data Engineering (ICDE). 42-53.
24. KRISHNAMURTHY, R., KAUSHIK, R., AND NAUGHTON, J. 2003. XML-to-SQL query translation literature: State of the art and open problems. In Proceedings of the XML Database Symposium (XSYM). 1-18.
25. KRISHNAMURTHY, R., KAUSHIK, R., AND NAUGHTON, J. 2004b. Efficient XML-to-SQL query translation: Where to add the intelligence. In Proceedings of the International Conference on Very Large Databases (VLDB). 144-155.
26. LIBKIN, L. 2004. Elements of Finite Model Theory. Springer.
27. MARX, M. 2004. XPath with conditional axis relations. In Proceedings of the International Conference on Extending Databse Technology (EDBT). 477-494.
28. MARX, M. 2005. First order paths in ordered trees. In Proceedings of the International Conference on Database Theory (ICDT). 114-128.
29. PAREDAENS, J. AND VAN GUCHT, D. 1988. Possibilities and limitations of using flat operators in nested algebra expressions. In Proceedings of the Symposium on Principles of Database Systems (PODS). 29-38.
30. SCHWEIKARDT, N. 2005. Arithmetic, first-order logic, and counting quantifiers. ACM Trans. Computat. Logic 6, 3, 634-671.
31. SUCIU, D. 1997. Bounded fixpoints for complex objects. Theor. Comput. Sci. 176, 4, 283-328.
32. VAN DEN BUSSCHE, J. 1992. Complex object manipulation through identifiers: An algebraic perspective. Tech. rep. 92-141, Department of Mathematics and Computer Science, University of Antwerp.
33. VAN DEN BUSSCHE, J. 2001. Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions. Theor. Comput. Sci. 254, 1-2, 363-377.
34. WONG, L. 1996. Normal forms and conservative extension properties for query languages over collection types. J. Comput. Syst. Sci. 52, 3, 495-505.
35. WORLDWIDEWEB CONSORTIUM. 2002. XQuery 1. 0 and XPath 2. 0 Formal Semantics. W3CWorking Draft. http://www. w3. org/TR/query-algebra/.