Deep set operators for XQuery

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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 languageEnglish (US)
Title of host publication2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005
PublisherAssociation for Computing Machinery, Inc
StatePublished - 2005
Event2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005 - Baltimore, United States
Duration: Jun 16 2005Jun 17 2005

Other

Other2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005
CountryUnited States
CityBaltimore
Period6/16/056/17/05

Fingerprint

XQuery
XML
Semantics
Vertex of a graph
Operator
Regular Sets
Query processing
Intersect
Union
Query Processing

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Theoretical Computer Science

Cite this

Luo, B., Lee, D., Lee, W. C., & Liu, P. (2005). Deep set operators for XQuery. In 2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005 Association for Computing Machinery, Inc.
Luo, Bo ; Lee, Dongwon ; Lee, Wang Chien ; Liu, Peng. / Deep set operators for XQuery. 2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005. Association for Computing Machinery, Inc, 2005.
@inproceedings{1be66bd2cfa448f0a2f6dabfdbbc3421,
title = "Deep set operators for XQuery",
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.",
author = "Bo Luo and Dongwon Lee and Lee, {Wang Chien} and Peng Liu",
year = "2005",
language = "English (US)",
booktitle = "2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005",
publisher = "Association for Computing Machinery, Inc",

}

Luo, B, Lee, D, Lee, WC & Liu, P 2005, Deep set operators for XQuery. in 2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005. Association for Computing Machinery, Inc, 2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005, Baltimore, United States, 6/16/05.

Deep set operators for XQuery. / Luo, Bo; Lee, Dongwon; Lee, Wang Chien; Liu, Peng.

2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005. Association for Computing Machinery, Inc, 2005.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Deep set operators for XQuery

AU - Luo, Bo

AU - Lee, Dongwon

AU - Lee, Wang Chien

AU - Liu, Peng

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84926349626&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84926349626&partnerID=8YFLogxK

M3 - Conference contribution

BT - 2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005

PB - Association for Computing Machinery, Inc

ER -

Luo B, Lee D, Lee WC, Liu P. Deep set operators for XQuery. In 2nd International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2005. Association for Computing Machinery, Inc. 2005