Finding all the occurrences of a twig pattern in an XML database is a core operation for
efficient evaluation of XML queries. A number of algorithms have been proposed to process …

We present algorithms to label the nodes of an XML tree which is subject to insertions and
deletions of nodes. The labeling is done such that (1) we label each node immediately when …

Extensible markup language (XML) is emerging as a de facto standard for information
exchange among various applications on the World Wide Web. There has been a growing …

对XML 数据建立有效的索引, 是左右XML 数据处理性能的重要因素. 深入地讨论了目前XML
索引技术的研究现状, 将XML 索引技术分为两大类: 节点记录类索引(本身还可以分为3 …

Since the boom in new proposals on techniques for efficient querying of XML data is now
over and the research world has shifted its attention toward new types of data formats, we …

The method of assigning labels to the nodes of the XML tree is called a labeling scheme.
Based on the labels only, both ordered and un-ordered queries can be processed without …

With the rapid emergence of XML as a data exchange standard over the Web, storing and
querying XML data have become critical issues. The two main approaches to storing XML …

XML query processing based on labeling schemes has been thoroughly studied in the past
several years. Recently efficient processing of updates in dynamic XML data has gained …

It is important to process the updates when nodes are inserted into or deleted from the XML
tree. All the existing labeling schemes have high update cost, thus in this paper we propose …

XML's increasing diffusion makes efficient XML query processing and indexing all the more
critical. Given the semistructured nature of XML documents, however, general query …