Abstract
Most query and transformation languages developed since the mid 90es for XML and semistructured data—e.g. XQuery [1], the precursors of XQuery [2], and XSLT [3]—build upon a path-oriented node selection: A node in a data item is specified in terms of a root-to-node path in the manner of the file selection languages of operating systems. Constructs inspired from the regular expression constructs , +, ?, and “wildcards” give rise to a flexible node retrieval from incompletely specified data items.
This paper further introduces into Xcerpt, a query and transformation language further developing an alternative approach to querying XML and semistructured data first introduced with the language UnQL [4]. A metaphor for this approach views queries as patterns, answers as data items matching the queries. Formally, an answer to a query is defined as a simulation [5] of an instance of the query in a data item.
Dokumententyp: | Konferenzbeitrag (Paper) |
---|---|
Publikationsform: | Preprint |
Fakultät: | Mathematik, Informatik und Statistik > Informatik |
Themengebiete: | 000 Informatik, Informationswissenschaft, allgemeine Werke > 004 Informatik |
URN: | urn:nbn:de:bvb:19-epub-17343-5 |
Ort: | Berlin u.a. |
Bemerkung: | The final publication is available at link.springer.com |
Sprache: | Englisch |
Dokumenten ID: | 17343 |
Datum der Veröffentlichung auf Open Access LMU: | 24. Okt. 2013, 07:43 |
Letzte Änderungen: | 13. Aug. 2024, 12:52 |