XPath 2.0 is an expression language that allows the processing of values conforming to the data model defined in [XQuery 1.0 and XPath 2.0 Data Model (Second Edition)]. The data model provides a tree representation of XML documents as well as atomic values such as integers, strings, and booleans, and sequences that may contain both references to nodes in an XML document and atomic values. The result of an XPath expression may be a selection of nodes from the input documents, or an atomic value, or more generally, any sequence allowed by the data model. The name of the language derives from its most distinctive feature, the path expression, which provides a means of hierarchic addressing of the nodes in an XML tree. XPath 2.0 is a superset of [XPath 1.0], with the added capability to support a richer set of data types, and to take advantage of the type information that becomes available when documents are validated using XML Schema. A backwards compatibility mode is provided to ensure that nearly all XPath 1.0 expressions continue to deliver the same result with XPath 2.0; exceptions to this policy are noted in [I Backwards Compatibility with XPath 1.0].

References in zbMATH (referenced in 375 articles , 1 standard article )

Showing results 1 to 20 of 375.
Sorted by year (citations)

1 2 3 ... 17 18 19 next

  1. Areces, Carlos; Fervari, Raul: Axiomatizing hybrid XPath with data (2021)
  2. Björklund, Henrik; Björklund, Johanna; Martens, Wim: Learning algorithms (2021)
  3. Engelfriet, Joost; Hoogeboom, Hendrik Jan; Samwel, Bart: XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (2021)
  4. Brahmia, Zouhaier; Hamrouni, Hind; Bouaziz, Rafik: XML data manipulation in conventional and temporal XML databases: a survey (2020)
  5. Im, Hyeonseung; Genevès, Pierre; Gesbert, Nils; Layaïda, Nabil: Backward type inference for XML queries (2020)
  6. Julián-Iranzo, Pascual; Moreno, Ginés; Riaza, José Antonio: The fuzzy logic programming language FASILL: design and implementation (2020)
  7. McLean, Brett: Free Kleene algebras with domain (2020)
  8. Freydenberger, Dominik D.; Schmid, Markus L.: Deterministic regular expressions with back-references (2019)
  9. Ning, Baoling; Li, Jianzhong; Jiang, Shouxu: Balanced tree partition problems with virtual nodes (2019)
  10. Björklund, Henrik; Martens, Wim; Schwentick, Thomas: Conjunctive query containment over trees using schema information (2018)
  11. Jung, Jean Christoph; Lutz, Carsten; Martel, Mauricio; Schneider, Thomas: Querying the unary negation fragment with regular path expressions (2018)
  12. Kostylev, Egor V.; Reutter, Juan L.; Vrgoč, Domagoj: Containment of queries for graphs with data (2018)
  13. Morcillo, Pedro J.; Moreno, Ginés: Efficient unfolding of fuzzy connectives for multi-adjoint logic programs (2018)
  14. Abriola, Sergio; Descotte, María Emilia; Fervari, Raul; Figueira, Santiago: Axiomatizations for downward XPath on data trees (2017)
  15. Abriola, Sergio; Descotte, María Emilia; Figueira, Santiago: Model theory of XPath on data trees. II: Binary bisimulation and definability (2017)
  16. Boiret, Adrien; Hugot, Vincent; Niehren, Joachim; Treinen, Ralf: Automata for unordered trees (2017)
  17. Gottlob, Georg; Koch, Christoph; Pieris, Andreas: Logic, languages, and rules for web data extraction and reasoning over data (2017)
  18. Julián-Iranzo, Pascual; Moreno, Ginés; Penabad, Jaime: Thresholded semantic framework for a fully integrated fuzzy logic language (2017)
  19. Okhotin, Alexander; Salomaa, Kai: State complexity of operations on input-driven pushdown automata (2017)
  20. Reutter, Juan L.; Romero, Miguel; Vardi, Moshe Y.: Regular queries on graph databases (2017)

1 2 3 ... 17 18 19 next