Conditional XPath

ACM Transactions on Database Systems

Volumn 30, Issue 4, 2005, Pages 929-959

  Marx, Maarten ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Semistructured data; XML; XPath

Indexed keywords

LOGIC DESIGN; MATRIX ALGEBRA; TREES (MATHEMATICS); XML;

CONDITIONAL XPATH; FIRST-ORDER DEFINABLE PATH; SEMISTRUCTURED DATA; XPATH;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33745196199     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/1114244.1114247     Document Type: Conference Paper

References (49)

1. ALECHINA, N., DEMRI, S., AND DE RIJKE, M. 2003. A modal perspective on path constraints. J. Logic Comput. 13, 1-18.
2. ALECHINA, N. AND IMMERMAN, N. 2000. Reachability logic: An efficient fragment of transitive closure logic. Logic J. IGPL 8, 3, 325-337.
3. BARCELO, P. AND LIBKIN, L. 2005. Temporal logics over unranked trees. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'05). IEEE Computer Society Press, Los Alamitos, CA.
4. BENEDIKT, M., FAN, W., AND KUPER, G. 2003. Structural properties of XPath fragments. In Proceedings of the 10th International Conference on Database Theory (ICDT2003). Springer-Verlag, New York.
5. BLACKBURN, P., DE RIJKE, M., AND VENEMA, Y. 2001. Modal Logic. Cambridge University Press.
6. BLACKBURN, P., MEYER-VIOL, W., AND DE RIJKE, M. 1996. A proof system for finite trees. In Computer Science Logic, H. K. Büning, Ed. Lecture Notes in Computer Science, vol. 1092. Springer-Verlag, New York, 86-105.
7. CALVANESE, D., GIACOMO, G. D., AND LENZEHINI, M. 1999. Representing and reasoning on XML documents: A description logic approach. J. Logic Comput. 9, 3, 295-318.
8. CHANDRA, A. AND MERLIN, P. 1977. Optimal implementation of conjunctive queries in relational databases. In Proceedings of 9th ACM Symposium on Theory of Computing. ACM, New York, 77-90.
9. CODD, E. 1972. Relational completeness of data base sublanguages. In Database Systems, R. Rustin, Ed. Prentice-Hall, Englewood Cliffs, NJ, 33-64.
10. EBBINGHAUS, H.-D. AND FLUM, J. 1995. Finite model theory. Perspectives in Mathematical Logic. Springer-Verlag, New York.
11. ETESSAMI, K., VARDI, M., AND WILKE, TH. 1997. First-order logic with two variables and unary temporal logic. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97). IEEE Computer Society Press, Los Alamitos, CA, 228-235.
12. FRICK, M. AND GROHE, M. 2002. The complexity of first-order and monadic second-order logic revisited. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02). (Copenhagen, Denmark). IEEE Computer Society Press, Los Alamitos, CA, 215-224.
13. GABBAY, D., HODKINSON, I., AND REYNOLDS, M. 1994. Temporal Logic. Volume 1: Mathematical Foundations and Computational Aspects. Oxford Science Publications.
14. GABBAY, D., PNUELI, A., SHELAH, S., AND STAVI, J. 1980. On the temporal analysis of fairness. In Proceedings of the 7th ACM Symposium on Principles of Programming Languages. ACM, New York, 163-173.
15. GOTTLOB, G. AND KOCH, C. 2002. Monadic queries over tree-structured data. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02). (Copenhagen, Denmark), IEEE Computer Society Press, Los Alamitos, CA.
16. GOTTLOB, G. AND KOCH, C. 2004. Monadic datalog and the expressive power of languages for web information extraction. J. ACM 51, 1, 74-113.
17. GOTTLOB, G., KOCH, C., AND PICHLER, R. 2002. Efficient algorithms for processing XPath queries. In Proceedings of the International Conference on Very Large Databases.
18. GOTTLOB, G., KOCH, C., AND PICHLER, R. 2003. The complexity of XPath query evaluation. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, New York, 179-190.
19. GOTTLOB, G., KOCH, C., AND SCHULZ, K. 2004. Conjunctive queries over trees. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, New York, 189-200.
20. HAREL, D., KOZEN, D., AND TIURYN, J. 2000. Dynamic Logic. MIT Press, Cambridge, MA.
21. IMMERMAN, N. 1982. Upper and lower bounds for first-order expressibility. J. Comput. Syst. Sci. 25, 76-98.
22. IMMERMAN, N. AND KOZEN, D. 1987. Definability with bounded number of bound variables. In Proceedings of the Symposium of Logic in Computer Science. Computer Society Press, Washington, 236-244.
23. KAMP, J. 1968. Tense logic and the theory of linear order. Ph.D. dissertation, University of California, Los Angeles, Los Angeles, CA.
24. KOZEN, D. 1997. Kleene algebra with tests. ACM Trans. Prog. Lang. Syst. 19, 3, 427-443.
25. KRACHT, M. 1997. Inessential features. In Logical Aspects of Computational Linguistics, C. Retore, Ed. Lecture Notes in Artificial Intelligence, vol. 1328. Springer-Verlag, New York, 43-62.
26. KRACHT, M. 1999. Tools and Techniques in Modal Logic. Number 142 in Studies in Logic. Elsevier, Amsterdam, The Netherlands.
27. MARX, M. 2004a. Conditional XPath, the first-order complete XPath dialect. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium an Principles of Database Systems. ACM, New York, 13-22.
28. MARX, M. 2004b. XPath with conditional axis relations. In Proceedings of the International Conference on Extending Database Technology. Lecture Notes in Computer Science, vol. 2992. Springer-Verlag, New York, 477-494.
29. MARX, M. 2005. First order paths in ordered trees. In Proceedings of the International Conference on Database Theory (ICDT2005). Lecture Notes in Computer Science, vol. 3363. Springer-Verlag, New York, 114-128.
30. MARX, M. AND DE RIJKE, M. 2005. Semantic characterizations of navigational XPath. ACM SIGMOD Record 34, 2, 41-46.
31. MIKLAU, G. AND Suciu, D. 2002. Containment and equivalence for an XPath fragment. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, New York, 65-76.
32. NEVEN, F. 1999. Design and analysis of query languages for structured documents. Ph.D. thesis, Limburgs Universitair Centrum, Belgium.
33. NEVEN, F. AND SCHWENTICK, T. 2000. Expressive and efficient pattern languages for tree-structured data. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, New York, 145-156.
34. OLTEANU, D., MEUSS, H., FURCHE, T., AND BRY, F. 2002. Xpath: Looking forward. In EDBT Workshops. Lecture Notes in Computer Science, vol. 2490. Springer-Verlag, New York, 109-127.
35. PALM, A. 1997. Transforming tree constraints into formal grammars. Ph.D. dissertation. Universität Passau.
36. PALM, A. 1999. Propositional tense logic for trees. In Sixth Meeting on Mathematics of Language. University of Central Florida, Orlando, FL.
37. RABINOVICH, A. 2002. Expressive power of temporal logics. In CONCUR 2002, Proceedings. Lecture Notes in Artificial Intelligence, vol. 2421. Springer-Verlag, New York, 57-75.
38. REINHARDT, K. 2002. The complexity of translating logic to finite automata. In Automata, Logics, and Infinite Games, Lecture Notes in Computer Science, vol. 2500. Springer-Verlag, New York, 231-238.
39. ROGERS, J. 1998. A Descriptive Approach to Language Theoretic Complexity. CSLI Press.
40. SCHLINGLOFF, B.-H. 1992. Expressive completeness of temporal logic of trees. J. Appl. Non-Class. Logics 2, 2, 157-180.
41. SCHWENTICK, T. 2000. On diving in trees. In Proceedings of the 25th Symposium on Mathematical Foundations of Computer Science. 660-669.
42. TARSKI, A. AND GIVANT, S. 1987. A Formalization of Set Theory without Variables. Vol. 41. AMS Colloquium publications, Providence, R.I.
43. THOMAS, W. 1997. Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht. Springer-Verlag, New York, 118-143.
44. VARDI, M. 1995. On the complexity of bounded-variable queries. In Proceedings of the ACM 14th Symposium on Principles of Database Systems. ACM, New York, 266-276.
45. VARDI, M. 1997. Why is modal logic so robustly decidable? In DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31. American Math. Society, 149-184.
46. W3C XPATH 1.0. XML path language (XPath): Version 1.0. http://www.w3.org/TR/xpath.html.
47. W3C XQUERY. XQuery 1.0: A query language for XML. http://www.w3.org/TR// xquery/.
48. W3C XSLT. XSL transformations language (XSLT): Version 2.0. http://www.w3.org/TR/xslt20/.
49. WADLER, P. 2000. Two semantics for XPath. Tech. rep., Bell Labs.