Abstract
There are three set operators defined in XQuery, namely union, intersect and except. They take node sequences as operands, in which each node is identified by its node-ID and treated as an atomic entity. However, according to XML semantics, each node is "a set of set (s)", which have descendants in a tree-structured hierarchy. Unfortunately, the regular set operators as described above ignored this structural feature of XML data. On the other hand, some XML applications can be benefited from set operators with different semantics considering ancestor-descendant relationships between nodes. In this extended semantics, the comparison during query processing are conducted not only on nodes of both operands, but also on their descendants, in a "deep" manner. In this paper, we identify the needs of such "deep" set operators and propose the deep-union, deep-intersect and deep-except operators. We further explore their properties as well as relationships to regular set operators, and present a preliminary experience on implementing them as user-defined functions of XQuery.
| Original language | English (US) |
|---|---|
| Title of host publication | 2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005 |
| Publisher | Association for Computing Machinery, Inc |
| State | Published - 2005 |
| Event | 2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005 - Baltimore, United States Duration: Jun 16 2005 → Jun 17 2005 |
Other
| Other | 2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005 |
|---|---|
| Country/Territory | United States |
| City | Baltimore |
| Period | 6/16/05 → 6/17/05 |
All Science Journal Classification (ASJC) codes
- Computational Theory and Mathematics
- Computer Science Applications
- Theoretical Computer Science