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.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Form of publication: | Preprint |
Faculties: | Mathematics, Computer Science and Statistics > Computer Science |
Subjects: | 000 Computer science, information and general works > 004 Data processing computer science |
URN: | urn:nbn:de:bvb:19-epub-17343-5 |
Place of Publication: | Berlin u.a. |
Annotation: | The final publication is available at link.springer.com |
Language: | English |
Item ID: | 17343 |
Date Deposited: | 24. Oct 2013, 07:43 |
Last Modified: | 13. Aug 2024, 12:52 |