Structural characterizations of the semantics of XPath as navigation tool on a document

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

Volumn , Issue , 2006, Pages 318-327

  Gyssens, Marc ^a   Paredaens, Jan ^b   Van Gucht, Dirk ^c   Fletcher, George H L ^c  

^a HASSELT UNIVERSITY   (Belgium)

^b UNIVERSITY OF ANTWERP   (Belgium)

^c INDIANA UNIVERSITY   (United States)

Author keywords

Definability; Expressibility; XPath

Indexed keywords

DEFINABILITY; EXPRESSIBILITY; XPATH;

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; NAVIGATION; XML;

SEMANTICS;

EID: 34250677319     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142397     Document Type: Conference Paper

References (24)

1. F. Bancilhon. On the Completeness of Query Languages for Relational Data Bases. In MFCS, pages 112-123, Zakopane, Poland, 1978. Springer LNCS 64.
2. M. Benedikt, W. Fan, and F. Geerts. XPath Satisfiability in the Presence of DTDs. In ACM PODS, pages 25-36, Baltimore, MD, USA, 2005.
3. M. Benedikt, W. Fan, and G. M. Kuper. Structural Properties of XPath Fragments. In ICDT, pages 79-95, Siena, Italy, 2003. Springer LNCS 2572.
4. A. Berglund, S. Boag, D. Chamberlin, M. F. Fernández, M. Kay, J. Robie, and J. Simeon. XML Path Language (XPath) Version 2.0. Technical report, W3C, 2005.
5. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, Cambridge, UK, 2001.
6. P. Buneman, M. Grohe, and C. Koch. Path Queries on Compressed XML. In VLDB, pages 141-152, Berlin, Germany, 2003.
7. A. K. Chandra and D. Harel. Computable Queries for Relational Data Bases. J. Comp. Sys. Sci., 21(2):156-178, 1980.
8. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer Verlag, Berlin, 1995.
9. I. Fundulaki and M. Marx. Specifying Access Control Policies for XML Documents with XPath. In ACM SACMAT, pages 61-69, New York, NY, USA, 2004.
10. R. Goldman and J. Widom. DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases. In VLDB, pages 436-445, Athens, Greece, 1997.
11. G. Gottlob and C. Koch. Monadic Queries over Tree-Structured Data. In IEEE LICS, pages 189-202, Copenhagen, Denmark, 2002.
12. G. Gottlob, C. Koch, and R. Pichler. Efficient Algorithms for Processing XPath Queries. ACM Trans. Database Syst., 30(2):444-491, 2005.
13. M. Grohe. Equivalence in Finite-Variable Logics is Complete for Polynomial Time. Combinatorica, 19(4):507-532, 1999.
14. R. Kaushik, P. Shenoy, P. Bohannon, and E. Gudes. Exploiting Local Similarity for Indexing Paths in Graph-Structured Data. In IEEE ICDE, pages 129-140, San Jose, CA, USA, 2002.
15. L. Krzeszczakowski. Pebble Games on Trees. In EACSL CSL, pages 359-371, Vienna, Austria, 2003. Springer LNCS 2803.
16. L. Libkin. Logics for Unranked Trees: An Overview. In EATCS ICALP, pages 35-50, Lisbon, Portugal, 2005. Springer LNCS 3580.
17. M. Marx. Conditional XPath, the First Order Complete XPath Dialect. In ACM PODS, pages 13-22, Paris, France, 2004.
18. M. Marx and M. de Rijke. Semantic Characterizations of Navigational XPath. SIGMOD Record, 34(2):41-46, 2005.
19. G. Miklau and D. Suciu. Containment and Equivalence for a Fragment of XPath. J. ACM, 51(1):2-45, 2004.
20. T. Milo and D. Suciu. Index Structures for Path Expressions. In ICDT, pages 277-295, Jerusalem, Israel, 1999.
21. J. Paredaens. On the Expressive Power of the Relational Algebra. Inf. Process. Lett., 7(2): 107-111, 1978.
22. P. Ramanan. Covering Indexes for XML Queries: Bisimulation - Simulation = Negation. In VLDB, pages 165-176, Berlin, Germany, 2003.
23. A. Tarski. On the Calculus of Relations. J. Symb. Log., 6(3):73-89, 1941.
24. A. Tarski and S. Givant. A Formalization of Set Theory Without Variables. American Mathematical Society, Providence, RI, USA, 1987.